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=24
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A lower bound on wait-free counting
Shlomo Moran
,
Gadi Taubenfeld
Journal of Algorithms
24
(1), 1997, pp. 1-19
An ``All pairs shortest paths'' distributed algorithm using
2n^2
messages
S. Haldar
Journal of Algorithms
24
(1), 1997, pp. 20-36
A data structure for dynamically maintaining rooted trees
Greg N. Frederickson
Journal of Algorithms
24
(1), 1997, pp. 37-65
Edge weight reduction problems in directed acyclic graphs
Susanne E. Hambrusch
,
Hung-Yi Tu
Journal of Algorithms
24
(1), 1997, pp. 66-93
Domino treewidth
Hans L. Bodlaender
,
Joost Engelfriet
Journal of Algorithms
24
(1), 1997, pp. 94-123
Page migration algorithms using work functions
Marek Chrobak
,
Lawrence L. Larmore
,
Nick Reingold
,
Jeffery Westbrook
Journal of Algorithms
24
(1), 1997, pp. 124-157
Computing with snakes in directed networks of automata
Shimon Even
,
Ami Litman
,
Peter Winkler
Journal of Algorithms
24
(1), 1997, pp. 158-170
Counting minimum weight spanning trees
Andrei Z. Broder
,
Ernst W. Mayr
Journal of Algorithms
24
(1), 1997, pp. 171-176
Choosing subsets with maximum weighted average
David Eppstein
,
Daniel S. Hirschberg
Journal of Algorithms
24
(1), 1997, pp. 177-193
A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity
Monika Rauch Henzinger
Journal of Algorithms
24
(1), 1997, pp. 194-220
Multi-dimensional pattern matching with dimensional wildcards: Data structures and optimal on-line search algorithms
Raffaele Giancarlo
,
Roberto Grossi
Journal of Algorithms
24
(2), 1997, pp. 223-265
Approximation algorithms for min-max tree partition
Nili Guttmann-Beck
,
Refael Hassin
Journal of Algorithms
24
(2), 1997, pp. 266-286
Designing least-cost nonblocking broadband networks
J. Andrew Fingerhut
,
Subhash Suri
,
Jonathan S. Turner
Journal of Algorithms
24
(2), 1997, pp. 287-309
A network-flow technique for finding low-weight bounded-degree spanning trees
Sándor P. Fekete
,
Samir Khuller
,
Monika Klemmstein
,
Balaji Raghavachari
,
Neal Young
Journal of Algorithms
24
(2), 1997, pp. 310-324
Inverse pattern matching
Amihood Amir
,
Alberto Apostolico
,
Moshe Lewenstein
Journal of Algorithms
24
(2), 1997, pp. 325-339
Rotations of periodic strings and short superstrings
Dany Breslauer
,
Tao Jiang
,
Zhigen Jiang
Journal of Algorithms
24
(2), 1997, pp. 340-353
Optimal two-dimensional compressed matching
Amihood Amir
,
Gary Benson
,
Martin Farach
Journal of Algorithms
24
(2), 1997, pp. 354-379
Finding scores in tournaments
R. Balasubramanian
,
Venkatesh Raman
,
G. Srinivasaragavan
Journal of Algorithms
24
(2), 1997, pp. 380-394
A general upper bound for the satisfiability threshold of random
r
-SAT formulae
O. Dubois
,
Y. Boufkhad
Journal of Algorithms
24
(2), 1997, pp. 395-420