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="Nievergelt, J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Metric graphs elastically embeddable in the plane
J. Nievergelt
,
Narsingh Deo
Information Processing Letters
55
, 1995, pp. 309-315
A sweep algorithm and its implementation
K. Hinrichs
,
J. Nievergelt
,
P. Schorn
Lecture Notes in Computer Science
344
, 1989, pp. 442-457
Plane-sweep solves the closest pair problem elegantly
K. Hinrichs
,
J. Nievergelt
,
P. Schorn
Information Processing Letters
26
(5), 1988, January, pp. 255-261
Space sweep solves intersection of convex polyhedra
S. Hertel
,
M. Mantyla
,
K. Mehlhorn
,
J. Nievergelt
Acta Informatica
21
(5), 1984, pp. 501-519
The grid file: A data structure designed to support proximity queries on spatial objects
K. Hinrichs
,
J. Nievergelt
Applied Computer Science
, 1983, pp. 100-113
Binary search trees of bounded balance
J. Nievergelt
,
E.M. Reingold
SIAM Journal on Computing
2
, 1973, pp. 33-43
Binary search trees of bounded balance
J. Nievergelt
,
E.M. Reingold
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, STOC'72 (Denver, CO, May 1-3, 1972)
, 1972, pp. 137-142
Bounds on the weighted path length of binary trees
J. Nievergelt
,
J. Pradels
,
C.K. Wong
,
P.C. Yue
Information Processing Letters
1
, 1971, pp. 220-225
Parallel methods for integrating ordinary differential equations
J. Nievergelt
Communications of the ACM
7
(12), 1964, December, pp. 731-733