Home News About Us Contact Contributors Disclaimer Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents


Institute:
Collection:
Print in Citation style Print version     Display:
Sort by: Display records with Fulltext only
Entries: 1-10  
 Basket 
Space Efficient Hash Tables with Worst Case Constant Access Time
Editors: Alt, Helmut; Habib, Michel
Authors: Fotakis, Dimitris; Pagh, Rasmus; Sanders, Peter; Spirakis, Paul G.
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2003
Title of Proceedings: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003)
Start Page: 271
End Page: 282
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 201857.0
Scheduling at Twilight the Easy Way
Editors: Ferreira, Afonso; Alt, Helmut
Authors: Bast, Hannah
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2002
Title of Proceedings: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science
Start Page: 166
End Page: 178
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 202054.0
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
Authors: Alt, Helmut; Guibas, L.; Mehlhorn, Kurt; Karp, Richard M.; Wigderson, A.
Date of Publication (YYYY-MM-DD): 1996
Title of Journal: Algorithmica
Volume: 16
Start Page: 543
End Page: 547
Document Type: Article
ID: 344404.0
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
Authors: Alt, Helmut; Fleischer, Rudolf; Kaufmann, Michael; Mehlhorn, Kurt; Näher, Stefan; Schirra, Stefan; Uhrig, Christian
Date of Publication (YYYY-MM-DD): 1992
Title of Journal: Algorithmica
Volume: 8
Start Page: 391
End Page: 408
Document Type: Article
ID: 344524.0
A lower bound for the nondeterministic space complexity of context-free recognition
Authors: Alt, Helmut; Geffert, Viliam; Mehlhorn, Kurt
Date of Publication (YYYY-MM-DD): 1992
Title of Journal: Information Processing Letters
Volume: 42
Start Page: 25
End Page: 27
Document Type: Article
ID: 344533.0
Computing a maximum cardinality matching in a bipartite graph in time $O(n^{1.5 \sqrt{m/\log n})$}
Authors: Alt, Helmut; Blum, Norbert; Mehlhorn, Kurt; Paul, Markus
Date of Publication (YYYY-MM-DD): 1991
Title of Journal: Information Processing Letters
Volume: 37
Start Page: 237
End Page: 240
Document Type: Article
ID: 344536.0
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
Authors: Alt, Helmut; Guibas, L.; Mehlhorn, Kurt; Karp, Richard M.; Wigderson, A.
Place of Publication: Berkeley, CA, USA
Date of Publication (YYYY-MM-DD): 1991
Document Type: Other
ID: 344614.0
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
Authors: Alt, Helmut; Fleischer, Rudolf; Kaufmann, Michael; Mehlhorn, Kurt; Näher, Stefan; Schirra, Stefan; Uhrig, Christian
Place of Publication: New York, USA
Publisher: ACM
Date of Publication (YYYY-MM-DD): 1990
Title of Proceedings: Computational geometry (SCG-90) : 6th annual symposium
Start Page: 281
End Page: 289
Document Type: Conference-Paper
ID: 344546.0
A Lower Bound on the Complexity of the Union-Split-Find Problem
Authors: Mehlhorn, Kurt; Näher, Stefan; Alt, Helmut
Date of Publication (YYYY-MM-DD): 1988
Title of Journal: SIAM Journal on Computing
Volume: 17
Start Page: 1093
End Page: 1102
Document Type: Article
ID: 344568.0
Congruence, Similarity, and Symmetries of Geometric Objects
Authors: Alt, Helmut; Mehlhorn, Kurt; Wagener, Hubert; Welzl, Emo
Date of Publication (YYYY-MM-DD): 1988
Title of Journal: Discrete and Computational Geometry
Volume: 3
Start Page: 237
End Page: 256
Document Type: Article
ID: 344576.0
Entries: 1-10  
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.