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: Series=LNCS AND Volume=979
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On mixed connectivity certificates
Shimon Even
,
Gene Itkis
,
Sergio Rajsbaum
Lecture Notes in Computer Science
979
, 1995, pp. 1-16
Truly efficient parallel algorithms:
c
-optimal multisearch for an extension of the BSP model
Armin Bäumker
,
Wolfgang Dittrich
,
Friedhelm Meyer auf der Heide
Lecture Notes in Computer Science
979
, 1995, pp. 17-30
Optimal parallel shortest paths in small treewidth digraphs
Shiva Chaudhuri
,
Christos D. Zaroliagis
Lecture Notes in Computer Science
979
, 1995, pp. 31-45
Shared memory simulations with triple-logarithmic delay
Artur Czumaj
,
Friedhelm Meyer auf der Heide
,
Volker Stemann
Lecture Notes in Computer Science
979
, 1995, pp. 46-59
Implementing shared memory on multi-dimensional meshes and on the fat-tree
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
Lecture Notes in Computer Science
979
, 1995, pp. 60-74
Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
Michael Kaufmann
,
Jop F. Sibeyn
,
Torsten Suel
Lecture Notes in Computer Science
979
, 1995, pp. 75-88
Fast deterministic simulation of computations on faulty parallel machines
Bogdan S. Chlebus
,
Leszek Ga̧ieniec
,
Andrzej Pelc
Lecture Notes in Computer Science
979
, 1995, pp. 89-101
Average circuit depth and average communication complexity
Bruno Codenotti
,
Peter Gemmell
,
Janos Simon
Lecture Notes in Computer Science
979
, 1995, pp. 102-112
Packing trees
Joseph Gil
,
Alon Itai
Lecture Notes in Computer Science
979
, 1995, pp. 113-127
Sometimes travelling is easy: The master tour problem
Vladimir G. Deĭneko
,
Rüdiger Rudolf
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
979
, 1995, pp. 128-141
Interval graphs with side (and size) constraints
Itsik Pe'er
,
Ron Shamir
Lecture Notes in Computer Science
979
, 1995, pp. 142-154
Maximum skew-symmetric flows
Andrew V. Goldberg
,
Alexander V. Karzanov
Lecture Notes in Computer Science
979
, 1995, pp. 155-170
Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
Monica Rauch Henzinger
,
Han La Poutré
Lecture Notes in Computer Science
979
, 1995, pp. 171-184
On the all-pairs shortest path algorithm of Moffat and Takaoka
Kurt Mehlhorn
,
Volker Priebe
Lecture Notes in Computer Science
979
, 1995, pp. 185-198
Fully dynamic transitive closure in plane dags with one source and one sink
Thore Husfeldt
Lecture Notes in Computer Science
979
, 1995, pp. 199-212
Planarity for clustered graphs
Qing-Wen Feng
,
Robert F. Cohen
,
Peter Eades
Lecture Notes in Computer Science
979
, 1995, pp. 213-226
A geometric approach to betweenness
Benny Chor
,
Madhu Sudan
Lecture Notes in Computer Science
979
, 1995, pp. 227-237
Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
Evanthia Papadopoulou
,
D.T. Lee
Lecture Notes in Computer Science
979
, 1995, pp. 238-251
Linear size binary space partitions for fat objects
Mark de Berg
Lecture Notes in Computer Science
979
, 1995, pp. 252-263
Geometric pattern matching in
d
-dimensional space
L. Paul Chew
,
Dorit Dor
,
Alon Efrat
,
Klara Kedem
Lecture Notes in Computer Science
979
, 1995, pp. 264-279
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
Cao An Wang
,
Francis Chin
Lecture Notes in Computer Science
979
, 1995, pp. 280-294
External-memory algorithms for processing line segments in geographic information systems
Lars Arge
,
Darren Erik Vengroff
,
Jeffrey Scott Vitter
Lecture Notes in Computer Science
979
, 1995, pp. 295-310
Optimized binary search and text retrieval
Eduardo Fernandes Barbosa
,
Gonzalo Navarro
,
Ricardo Baeza-Yates
,
Chris Perleberg
,
Nivio Ziviani
Lecture Notes in Computer Science
979
, 1995, pp. 311-326
On using
q
-gram locations in approximate string matching
Erkki Sutinen
,
Jorma Tarhio
Lecture Notes in Computer Science
979
, 1995, pp. 327-340
Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
Friedhelm Meyer auf der Heide
,
Christian Scheideler
Lecture Notes in Computer Science
979
, 1995, pp. 341-354
Seiten 1
2
>