Kurt Mehlhorn
Kurt Mehlhorn
Professor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics Campus
Підтверджена електронна адреса в mpi-inf.mpg.de
НазваПосиланняРік
Data structures and algorithms: 1. Searching and sorting
K Mehlhorn
Springer 84, 90, 1984
2023*1984
LEDA: a platform for combinatorial and geometric computing
K Mehlhorn, S Naher, S Näher
Cambridge University Press, 1999
13501999
Faster algorithms for the shortest path problem
RK Ahuja, K Mehlhorn, J Orlin, RE Tarjan
Journal of the ACM (JACM) 37 (2), 213-223, 1990
7711990
LEDA: a platform for combinatorial and geometric computing
K Mehlhorn, S Naher
Communications of the ACM 38 (1), 96-103, 1995
5611995
Weisfeiler-lehman graph kernels
N Shervashidze, P Schweitzer, EJ Leeuwen, K Mehlhorn, KM Borgwardt
Journal of Machine Learning Research 12 (Sep), 2539-2561, 2011
5592011
Dynamic perfect hashing: Upper and lower bounds
M Dietzfelbinger, A Karlin, K Mehlhorn, F Meyer auF der Heide, H Rohnert, ...
SIAM Journal on Computing 23 (4), 738-761, 1994
5061994
Efficient graphlet kernels for large graph comparison
N Shervashidze, SVN Vishwanathan, T Petri, K Mehlhorn, K Borgwardt
Artificial Intelligence and Statistics, 488-495, 2009
4472009
A faster approximation algorithm for the Steiner problem in graphs
K Mehlhorn
Information Processing Letters 27 (3), 125-128, 1988
3601988
Algorithms and data structures: The basic toolbox
K Mehlhorn, P Sanders
Springer Science & Business Media, 2008
3502008
Congruence, similarity, and symmetries of geometric objects
H Alt, K Mehlhorn, H Wagener, E Welzl
Discrete & Computational Geometry 3 (3), 237-256, 1988
3431988
Las Vegas is better than determinism in VLSI and distributed computing
K Mehlhorn, EM Schmidt
Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982
2821982
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
K Mehlhorn, U Vishkin
Acta Informatica 21 (4), 339-374, 1984
2811984
Four results on randomized incremental constructions
KL Clarkson, K Mehlhorn, R Seidel
Computational Geometry 3 (4), 185-212, 1993
2601993
A new data structure for representing sorted lists
S Huddleston, K Mehlhorn
Acta informatica 17 (2), 157-184, 1982
2571982
Computing a maximum cardinality matching in a bipartite graph in time o (n1. 5mlog n)
H Alt, N Blum, K Mehlhorn, M Paul
Information Processing Letters 37 (4), 237-240, 1991
2181991
Fast triangulation of the plane with respect to simple polygons
S Hertel, K Mehlhorn
Information and Control 64 (1-3), 52-76, 1985
213*1985
Classroom examples of robustness problems in geometric computations
L Kettner, K Mehlhorn, S Pion, S Schirra, C Yap
Computational Geometry 40 (1), 61-78, 2008
190*2008
Dynamic fractional cascading
K Mehlhorn, S Näher
Algorithmica 5 (1-4), 215-241, 1990
1851990
A parallelization of Dijkstra's shortest path algorithm
A Crauser, K Mehlhorn, U Meyer, P Sanders
International Symposium on Mathematical Foundations of Computer Science, 722-731, 1998
1751998
Randomized incremental construction of abstract Voronoi diagrams
R Klein, K Mehlhorn, S Meiser
Computational Geometry 3 (3), 157-184, 1993
1661993
У даний момент система не може виконати операцію. Спробуйте пізніше.
Статті 1–20