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: Journal=Theor.~Comput.~Sci. AND Volume=203
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
More general parallel tree contraction: Register allocation and broadcasting in a tree
Krzysztof Diks
,
Torben Hagerup
Theoretical Computer Science
203
(1), 1998, pp. 3-29
Switchbox routing in VLSI design: Closing the complexity gap
Stephan Hartmann
,
Markus W. Schäffler
,
Andreas S. Schulz
Theoretical Computer Science
203
(1), 1998, pp. 31-49
Strictly-upward drawings of ordered search trees
P. Crescenzi
,
P. Penna
Theoretical Computer Science
203
(1), 1998, pp. 51-67
A uniform approach to semi-dynamic problems on digraphs
Serafino Cicerone
,
Daniele Frigioni
,
Umberto Nanni
,
Francesco Pugliese
Theoretical Computer Science
203
(1), 1998, pp. 69-90
Modifying edges of a network to obtain short subgraphs
Kay U. Drangmeister
,
Sven O. Krumke
,
Madhav V. Marathe
,
Hartmut Noltemeier
,
S.S. Ravi
Theoretical Computer Science
203
(1), 1998, pp. 91-121
Efficient Union-Find for planar graphs and other sparse graph classes
Jens Gustedt
Theoretical Computer Science
203
(1), 1998, pp. 123-141
Shortest path algorithms for nearly acyclic directed graphs
Tadao Takaoka
Theoretical Computer Science
203
(1), 1998, pp. 143-150
Approximate maxima finding of continous functions under restricted budget
Evangelos Kranakis
,
Danny Krizanc
,
Andrzej Pelc
,
David Peleg
Theoretical Computer Science
203
(1), 1998, pp. 151-162
System diagnosis with smallest risk of error
Krzysztof Diks
,
Andrzej Pelc
Theoretical Computer Science
203
(1), 1998, pp. 163-173
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
Armin Bäumker
,
Wolfgang Dittrich
,
Friedhelm Meyer auf der Heide
Theoretical Computer Science
203
(2), 1998, pp. 175-203
Shortest paths in digraphs of small treewidth - Part II: Optimal parallel algorithms
Shiva Chaudhuri
,
Christos D. Zaroliagis
Theoretical Computer Science
203
(2), 1998, pp. 205-223
Near-optimal, distributed edge colouring via the nibble method
Devdatt Dubhashi
,
David A. Grable
,
Alessandro Panconesi
Theoretical Computer Science
203
(2), 1998, pp. 225-251
On mixed connectivity certificates
Shimon Even
,
Gene Itkis
,
Sergio Rajsbaum
Theoretical Computer Science
203
(2), 1998, pp. 253-269