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=J. Algorithms AND Volume=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Parallel algorithms for reducible flow graphs
Vijaya Ramachandran
Journal of Algorithms
23
(1), 1997, pp. 1-31
Distributed computing on anonymous hypercube networks
Evangelos Kranakis
,
Danny Krizanc
Journal of Algorithms
23
(1), 1997, pp. 32-50
Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations
Michael T. Goodrich
,
Roberto Tamassia
Journal of Algorithms
23
(1), 1997, pp. 51-73
Sequential and parallel approximation of shortest superstrings
Artur Czumaj
,
Leszek Ga̧sieniec
,
Marek Piotrów
,
Wojciech Rytter
Journal of Algorithms
23
(1), 1997, pp. 74-100
Randomized single-target hot-potato routing
Ishai Ben Aroya
,
Ilan Newman
,
Assaf Schuster
Journal of Algorithms
23
(1), 1997, pp. 101-120
Edge-disjoint
(s,t)
-paths in undirected planar graphs in linear time
Karsten Weihe
Journal of Algorithms
23
(1), 1997, pp. 121-138
Parallel shortcutting of rooted trees
Mikkel Thorup
Journal of Algorithms
23
(1), 1997, pp. 139-159
Sub-linear distributed algorithms for sparse certificates and biconnected components
Ramakrishna Thurimella
Journal of Algorithms
23
(1), 1997, pp. 160-179
Efficient on-line call control algorithms
Juan A. Garay
,
Inder S. Gopal
,
Shay Kutten
,
Yishay Mansour
,
Moti Yung
Journal of Algorithms
23
(1), 1997, pp. 180-194
On-line coloring of sparse random graphs and random trees
Boris Pittel
,
Robert S. Weishaar
Journal of Algorithms
23
(1), 1997, pp. 195-205
Linearity and unprovability of set union problem strategies - I. Linearity of strong postorder
Martin Loebl
,
Jaroslav Nes̆etr̆il
Journal of Algorithms
23
(2), 1997, pp. 207-220
Lower bounds for Shellsort
C. Greg Plaxton
,
Torsten Suel
Journal of Algorithms
23
(2), 1997, pp. 221-240
The distributed
k
-server problem - A competitive distributed translator for
k
-server algorithms
Yair Bartal
,
Adi Rosén
Journal of Algorithms
23
(2), 1997, pp. 241-264
Parallel and on-line graph coloring
Magnús M. Halldórsson
Journal of Algorithms
23
(2), 1997, pp. 265-280
A linear time algorithm for finding a
k
-tree core
Akiyoshi Shioura
,
Takeaki Uno
Journal of Algorithms
23
(2), 1997, pp. 281-290
Optimal algorithms for probabilistic solitude detection on anonymous rings
Lisa Higham
,
David Kirkpatrick
,
Karl Abrahamson
,
Andrew Adler
Journal of Algorithms
23
(2), 1997, pp. 291-328
Tighter bounds on the solution of a divide-and-conquer maximin recurrence
Biing-Feng Wang
Journal of Algorithms
23
(2), 1997, pp. 329-344
A constructive enumeration of fullerenes
Gunnar Brinkmann
,
Andreas W.M. Dress
Journal of Algorithms
23
(2), 1997, pp. 345-358
An
NC
parallel algorithm for edge-coloring series -- Parallel multigraphs
Xiao Zhou
,
Hitoshi Suzuki
,
Takao Nishizeki
Journal of Algorithms
23
(2), 1997, pp. 359-374
Minimum range balanced cuts via dynamic subset sums
David Eppstein
Journal of Algorithms
23
(2), 1997, pp. 375-385
More efficient parallel totally monotone matrix searching
Phillip G. Bradford
,
Rudolf Fleischer
,
Michiel Smid
Journal of Algorithms
23
(2), 1997, pp. 386-400