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 YEAR=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Covering polygons is hard
Joseph C. Culberson
,
Robert A. Reckhow
Journal of Algorithms
17
(1), 1994, pp. 2-44
Three stacks
Michael Fredman
,
Deborah L. Goldsmith
Journal of Algorithms
17
(1), 1994, pp. 45-70
Graphs with
E
edges have pagenumber
O(\sqrt{E})
Seth M. Malitz
Journal of Algorithms
17
(1), 1994, pp. 71-84
Genus
g
graphs have pagenumber
O(\sqrt{g})
Seth M. Malitz
Journal of Algorithms
17
(1), 1994, pp. 85-109
Coordinated traversal:
(t + 1)
-round Byzantine agreement in polynomial time
Yoram Moses
,
Orli Waarts
Journal of Algorithms
17
(1), 1994, pp. 110-156
Randomized routing and sorting on fixed-connection networks
F.T. Leighton
,
Bruce M. Maggs
,
Abhiram G. Ranade
,
Satish B. Rao
Journal of Algorithms
17
(1), 1994, pp. 157-205
Chordless paths, odd holes, and kernels in graphs without
m
-obstructions
F. Gavril
,
V. Toledano Laredo
,
D. de Werra
Journal of Algorithms
17
(2), 1994, pp. 207-221
Generating sparse 2-spanners
Guy Kortsarz
,
David Peleg
Journal of Algorithms
17
(2), 1994, pp. 222-236
Offline algorithms for dynamic minimum spanning tree problems
David Eppstein
Journal of Algorithms
17
(2), 1994, pp. 237-250
On the 2-chain subgraph cover and related problems
Tze-Heng Ma
,
Jeremy P. Spinrad
Journal of Algorithms
17
(2), 1994, pp. 251-268
Algorithmic modifications to the theory of evidential reasoning
E.T. Kofler
,
C.T. Leondes
Journal of Algorithms
17
(2), 1994, pp. 269-279
A primal-dual parallel approximation technique applied to weighted set and vertex covers
Samir Khuller
,
Uzi Vishkin
,
Neal Young
Journal of Algorithms
17
(2), 1994, pp. 280-289
Applications of parametric searching in geometric optimization
Pankaj K. Agarwal
,
Micha Sharir
,
Sivan Toledo
Journal of Algorithms
17
(3), 1994, pp. 292-318
Online navigation in a room
Eldad Bar-Eli
,
Piotr Berman
,
Amos Fiat
,
Peiyuan Yan
Journal of Algorithms
17
(3), 1994, pp. 319-341
Dynamic point location in general subdivisions
Hanna Baumgarten
,
Hermann Jung
,
Kurt Mehlhorn
Journal of Algorithms
17
(3), 1994, pp. 342-380
Improved approximations for the Steiner tree problem
Piotr Berman
,
Viswanathan Ramaiyer
Journal of Algorithms
17
(3), 1994, pp. 381-408
Approximating the minimum-degree Steiner tree to within one of optimal
Martin Fürer
,
Balaji Raghavachari
Journal of Algorithms
17
(3), 1994, pp. 409-423
A faster Algorithm for finding the minimum cut in a directed graph
Jianxiu Hao
,
James B. Orlin
Journal of Algorithms
17
(3), 1994, pp. 424-446
A faster deterministic maximum flow algorithm
V. King
,
S. Rao
,
R. Tarjan
Journal of Algorithms
17
(3), 1994, pp. 447-474
On the approximation of maximum satisfiability
Mihalis Yannakakis
Journal of Algorithms
17
(3), 1994, pp. 475-502
Improving greedy algorithms by lookahead-search
U.K. Sarkar
,
P.P. Chakrabarti
,
S. Ghose
,
S.C. DeSarkar
Journal of Algorithms
16
(1), 1994, pp. 1-23
A deterministic method for computing splitting elements in simple algebras over
Q
Lajos Rónyai
Journal of Algorithms
16
(1), 1994, pp. 24-32
Approximate tree matching in the presence of variable length don't cares
Kaizhong Zhang
,
Dennis Shasha
,
Jason T.L. Wang
Journal of Algorithms
16
(1), 1994, pp. 33-66
A general method and a master theorem for divide-and-conquer recurrences with applications
Rakesh M. Verma
Journal of Algorithms
16
(1), 1994, pp. 67-79
The algorithmic aspects of the regularity lemma
N. Alon
,
R.A. Duke
,
H. Lefmann
,
V. Rödl
,
R. Yuster
Journal of Algorithms
16
(1), 1994, pp. 80-109
Seiten 1
2
>