Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Mehlhorn, K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A strong and easily computable separation bound for arithmetic expressions involving radicals
C. Burnikel
,
R. Fleischer
,
K. Mehlhorn
,
S. Schirra
Algorithmica
27
(1), 2000, pp. 87-99
A parallelization of Dijkstra's shortest path algorithm
A. Crauser
,
K. Mehlhorn
,
U. Meyer
,
P. Sanders
Lecture Notes in Computer Science
1450
, 1998, pp. 722-731
A strong and easily computable separation bound for arithmetic expressions involving square roots
C. Burnikel
,
R. Fleischer
,
K. Mehlhorn
,
S. Schirra
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 702-709
Maintaining dynamic sequences under equality tests in polylogarithmic time
K. Mehlhorn
,
R. Sundar
,
C. Uhrig
Algorithmica
17
, 1997, pp. 183-198
A branch-and-cut algorithm for multiple sequence alignment
K. Reinert
,
H-P. Lenhof
,
P. Mutzel
,
K. Mehlhorn
,
J.D. Kececioglu
Proceedings of the 1st Annual International Conference on Computational Molecular Biology, RECOMB'97 (Santa Fe, New Mexico, January 20-23, 1997)
, 1997, pp. 241-250
A method for obtaining randomized algorithms with small tail probablities
H. Alt
,
L. Guibas
,
K. Mehlhorn
,
R. Karp
,
A. Wigderson
Algorithmica
16
, 1996, pp. 543-547
Algorithms for dense graphs and networks on the random access computer
J. Cheriyan
,
K. Mehlhorn
Algorithmica
15
, 1996, pp. 521-549
On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
K. Mehlhorn
,
P. Mutzel
Algorithmica
16
, 1996, pp. 233-242
Lower bounds for set intersection queries
P. Dietz
,
K. Mehlhorn
,
R. Raman
,
C. Uhrig
Algorithmica
14
, 1995, pp. 154-168
A lower bound for area-universal graphs
Gianfranco Bilardi
,
Shiva Chaudhuri
,
Devdatt Dubhashi
,
K. Mehlhorn
Information Processing Letters
51
, 1994, pp. 101-105
Maintaining dynamic sequences under equality-tests in polylogarithmic time
K. Mehlhorn
,
R. Sundar
,
C. Uhrig
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 213-222
Exact algorithms for a geometric packing problem (extended abstract)
L. Kuc̑era
,
K. Mehlhorn
,
B. Preis
,
E. Schwarzenecker
Lecture Notes in Computer Science
665
, 1993, pp. 317-322
A method for obtaining randomized algorithms with small tail probabilities
H. Alt
,
L. Guibas
,
K. Mehlhorn
,
R. Karp
,
Avi Wigderson
Technical Report (1992-29), 1992
k
versus
k+1
index registers and modifiable versus non-modifiable programs
K. Mehlhorn
,
W.J. Paul
,
C. Uhrig
Information and Computation
101
(1), 1992, November, pp. 123-129
Computing a maximum cardinality matching in a bipartite graph in time
O(n\sqrt{1.5}{m/\log n})
H. Alt
,
N. Blum
,
K. Mehlhorn
,
M. Paul
Information Processing Letters
37
, 1991, pp. 237-240
Faster algorithms for the shortest path problem
R.K. Ahuja
,
K. Mehlhorn
,
J.B. Orlin
,
R.E. Tarjan
Journal of the ACM
37
(2), 1990, April, pp. 213-223
On the construction of abstract Voronoi diagrams, II
R. Klein
,
K. Mehlhorn
,
S. Meiser
Lecture Notes in Computer Science
450
, 1990, pp. 138-154
On the construction of abstract Voronoi diagrams
K. Mehlhorn
,
St. Meiser
,
C. O'Dúnlaing
Lecture Notes in Computer Science
415
, 1990, pp. 227-239
On the complexity of a game related to the dictionary problem
K. Mehlhorn
,
St. Näher
,
M. Rauch
SIAM Journal on Computing
19
, 1990, pp. 902-906
Hidden line elimination for isooriented rectangles
K. Mehlhorn
,
S. Näher
,
C. Uhrig
Information Processing Letters
35
, 1990, pp. 137-143
AT^2
-optimal Galois field multiplier for VLSI
M. Fürer
,
K. Mehlhorn
IEEE Transactions on Computers
38
(9), 1989, September, pp. 1333-1336
On the complexity of a game related to the dictionary problem
K. Mehlhorn
,
S. Näher
,
M. Rauch
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 546-548
A library of efficient data types and algorithms
K. Mehlhorn
,
S. Näher
Lecture Notes in Computer Science
379
, 1989, pp. 886-106
Two versus one index register and modifiable versus non-modifiable programs
K. Mehlhorn
,
W.J. Paul
Lecture Notes in Computer Science
372
, 1989, pp. 603-609
Dynamic perfect hashing: Upper and lower bounds
M. Dietzfelbinger
,
A. Karlin
,
K. Mehlhorn
,
F. Meyer auf der Heide
,
H. Rohnert
,
R.E. Tarjan
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 524-531
Seiten 1
2
3
4
5
6
>