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
[2]
Hilfe
Suche: Author="Ukkonen, E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On-line construction of suffix trees
E. Ukkonen
Algorithmica
14
, 1995, pp. 249-260
Voronoi diagrams of moving points in higher dimensional spaces
Gerhard Albers
,
Thomas Roos
Lecture Notes in Computer Science
621
, 1992, pp. 399-409
Low-diameter graph decomposition is in NC
Baruch Awerbuch
,
Bonnie Berger
,
Lenore Cowen
,
David Peleg
Lecture Notes in Computer Science
621
, 1992, pp. 83-93
How to draw a series-parallel digraph
P. Bertolazzi
,
R.F. Cohen
,
G. Di Battista
,
R. Tamassia
,
I.G. Tollis
Lecture Notes in Computer Science
621
, 1992, pp. 272-283
Efficient rebalancing of chromatic search trees
Joan Boyar
,
Kim S. Larsen
Lecture Notes in Computer Science
621
, 1992, pp. 151-164
Decomposing the boundary of a nonconvex polyhedron
Bernard Chazelle
,
Leonidas Palios
Lecture Notes in Computer Science
621
, 1992, pp. 364-375
Improvements on geometric pattern matching problems
L. Paul Chew
,
Klara Kedem
Lecture Notes in Computer Science
621
, 1992, pp. 318-325
G
K
D-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
Walter Cunto
,
Vicente Yriarte
Lecture Notes in Computer Science
621
, 1992, pp. 192-211
An optimal parallel algorithm for computing a near-optimal order of matrix multiplications
Artur Czumaj
Lecture Notes in Computer Science
621
, 1992, pp. 62-72
Heap construction in the parallel comparison tree model
Paul F. Dietz
Lecture Notes in Computer Science
621
, 1992, pp. 140-150
Parametric problems on graphs of bounded tree-width
David Fernández-Baca
,
Giora Slutzki
Lecture Notes in Computer Science
621
, 1992, pp. 304-316
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
Faith Fich
,
Miroslaw Kowaluk
,
Krzysztof Loryś
,
Miroslaw Kutyƚowski
,
Prabhakar Ragde
Lecture Notes in Computer Science
621
, 1992, pp. 30-41
Memory limited inductive inference machines
Rūsiņs̆ Freivalds
,
Carl H. Smith
Lecture Notes in Computer Science
621
, 1992, pp. 19-29
Coloring random graphs
Martin Fürer
,
C.R. Subramanian
Lecture Notes in Computer Science
621
, 1992, pp. 284-291
Direct bulk-synchronous parallel algorithms
Alexandros V. Gerbessiotis
,
Leslie G. Valiant
Lecture Notes in Computer Science
621
, 1992, pp. 1-18
Parallel algorithms for all minimum link paths and link center problems
Subir Kumar Ghosh
,
Anil Maheshwari
Lecture Notes in Computer Science
621
, 1992, pp. 106-117
Dynamic 2- and 3-connectivity on planar graphs
Dora Giammarresi
,
Giuseppe F. Italiano
Lecture Notes in Computer Science
621
, 1992, pp. 221-232
Dynamic closest pairs - A probabilistic approach
Mordecai J. Golin
Lecture Notes in Computer Science
621
, 1992, pp. 340-351
Efficient two-dimensional searching
Gaston H. Gonnet
Lecture Notes in Computer Science
621
, 1992, pp. 317
Parallel algorithm for cograph recognition with applications
Xin He
Lecture Notes in Computer Science
621
, 1992, pp. 94-105
Fully dynamic 2-edge-connectivity in planar graphs
John Hershberger
,
Monika Rauch
,
Subhash Suri
Lecture Notes in Computer Science
621
, 1992, pp. 233-244
Convex polygons made from few lines and convex decompositions of polyhedra
John Hershberger
,
Jack Snoeyink
Lecture Notes in Computer Science
621
, 1992, pp. 376-387
The complexity of scheduling problems with communication delays for trees
Andreas Jakoby
,
Rüdiger Reischuk
Lecture Notes in Computer Science
621
, 1992, pp. 165-177
Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
Deborah Joseph
,
Joao Meidanis
,
Prasoon Tiwari
Lecture Notes in Computer Science
621
, 1992, pp. 326-337
Triangulating planar graphs while minimizing the maximum degree
Goos Kant
,
Hans L. Bodlaender
Lecture Notes in Computer Science
621
, 1992, pp. 258-271
Seiten 1
2
3
>