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
[1]
Hilfe
Suche: Editor="Dehne, F."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Probabilistic leader election on rings of known size
Karl Abrahamson
,
Andrew Adler
,
Lisa Higham
,
David Kirkpatrick
Lecture Notes in Computer Science
519
, 1991, pp. 481-495
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
Pankaj K. Agarwal
,
Jiȓí Matous̑ek
,
Subhash Suri
Lecture Notes in Computer Science
519
, 1991, pp. 105-116
Applications of a new space partitioning technique
Pankaj K. Agarwal
,
Micha Sharir
Lecture Notes in Computer Science
519
, 1991, pp. 379-391
Sharing memory in asynchronous message passing systems
Oscar R. Aguilar
,
Ajoy Kumar Datta
,
Sukumar Ghosh
Lecture Notes in Computer Science
519
, 1991, pp. 129-140
Memory access in models of parallel computation: From folklore to synergy and beyond
Selim G. Akl
Lecture Notes in Computer Science
519
, 1991, pp. 92-104
Geometric knapsack problems
Esther M. Arkin
,
Samir Khuller
,
Joseph S.B. Mitchell
Lecture Notes in Computer Science
519
, 1991, pp. 165-176
On the zone of a surface in a hyperplane arrangement
Boris Aronov
,
Micha Sharir
Lecture Notes in Computer Science
519
, 1991, pp. 13-19
Approximation algorithms for selecting network centers
Judit Bar-Ilan
,
David Peleg
Lecture Notes in Computer Science
519
, 1991, pp. 343-354
A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible
Binary K. Bhattacharya
,
Asish Mukhopadhyay
,
Godfried T. Toussaint
Lecture Notes in Computer Science
519
, 1991, pp. 412-424
Optimum guard covers and
m
-watchmen routes for restricted polygons
Svante Carlsson
,
Bengt J. Nilsson
,
Simeon Ntafos
Lecture Notes in Computer Science
519
, 1991, pp. 367-378
A case study in comparison based complexity: Finding the nearest value(s)
Walter Cunto
,
J. Ian Munro
,
Patricio V. Poblete
Lecture Notes in Computer Science
519
, 1991, pp. 1-12
Immobilizing a polytope
Jurek Czyzowicz
,
Ivan Stojmenovic
,
Jorge Urrutia
Lecture Notes in Computer Science
519
, 1991, pp. 214-227
Some fast parallel algorithms for parentheses matching
Sajal K. Das
,
Calvin C.-Y. Chen
,
Gene Lewis
,
Sushil Prasad
Lecture Notes in Computer Science
497
, 1991, pp. 443-454
Geometric searching and link distance
Gautam Das
,
Giri Narasimhan
Lecture Notes in Computer Science
519
, 1991, pp. 261-272
Fully dynamic Delaunay triangulation in logarithmic expected time per operation
Olivier Devillers
,
Stefan Meiser
,
Monique Teillaud
Lecture Notes in Computer Science
519
, 1991, pp. 42-53
The MINSUMCUT problem
J. Díaz
,
A.M. Gibbons
,
M.S. Paterson
,
J. Torán
Lecture Notes in Computer Science
519
, 1991, pp. 65-79
Finding level-ancestors in dynamic trees
Paul F. Dietz
Lecture Notes in Computer Science
519
, 1991, pp. 32-40
On computing the Voronoi diagram for restricted planar figures
Hristo Djidjev
,
Andrzej Lingas
Lecture Notes in Computer Science
519
, 1991, pp. 54-64
Offline algorithms for dynamic minimum spanning tree problems
David Eppstein
Lecture Notes in Computer Science
519
, 1991, pp. 392-399
Parametric search and locating supply centers in trees
Greg N. Frederickson
Lecture Notes in Computer Science
519
, 1991, pp. 299-319
A fast derandomization scheme and its applications
Yijie Han
Lecture Notes in Computer Science
519
, 1991, pp. 177-188
The interval skip list: A data structure for finding all intervals that overlap a point
Eric N. Hanson
Lecture Notes in Computer Science
519
, 1991, pp. 153-164
An optimal algorithm for computing visibility in the plane
Paul J. Heffernan
,
Joseph S.B. Mitchell
Lecture Notes in Computer Science
519
, 1991, pp. 437-448
Computing minimum length paths of a given homotopy class
John Hershberger
,
Jack Snoeyink
Lecture Notes in Computer Science
519
, 1991, pp. 331-342
Fully persistent data structures for disjoint set union problems
Giuseppe F. Italiano
,
Neil Sarnak
Lecture Notes in Computer Science
519
, 1991, pp. 449-460
Seiten 1
2
3
4
>