English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Efficient Algorithms for Abelian group isomorphism and related problems

Telikepalli, K. (2003). Efficient Algorithms for Abelian group isomorphism and related problems. In FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science: 23rd Conference (pp. 277-288). Heidelberg, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2CCD-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2CD0-9
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Telikepalli, Kavitha1, Author
Pandya, Paritosh, Editor
Radhakrishnan, Jaikumar, Editor
Affiliations:
1Max Planck Society, ou_persistent13              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2004-06-172003
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 201959
Other: Local-ID: C1256428004B93B8-63E1703F30F40FDDC1256E15003F7402-Telikepalli2003
 Degree: -

Event

show
hide
Title: FSTTCS 2003
Place of Event: IIT Mumbai, India.
Start-/End Date: 2003-12-15 - 2003-12-17

Legal Case

show

Project information

show

Source 1

show
hide
Title: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Heidelberg, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 277 - 288 Identifier: -

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2914 Sequence Number: - Start / End Page: - Identifier: -