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=20
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Time-randomness trade-offs in parallel computation
Danny Krizanc
Journal of Algorithms
20
(1), 1996, pp. 1-19
Efficient parallel algorithms for graphs of bounded tree-width
Jens Lagergren
Journal of Algorithms
20
(1), 1996, pp. 20-44
Parallel algorithms with processor failures and delays
Jonathan F. Buss
,
Paris C. Kanellakis
,
Prabhakar L. Ragde
,
Alex Allister Shvartsman
Journal of Algorithms
20
(1), 1996, pp. 45-86
Weighted binary trees for concurrent searching
David Cohen
,
Michael L. Fredman
Journal of Algorithms
20
(1), 1996, pp. 87-112
On the asymptotic worst case behavior of harmonic fit
André van Vliet
Journal of Algorithms
20
(1), 1996, pp. 113-136
Recognizing greedy structures
Yair Caro
,
András Sebö
,
Michael Tarsi
Journal of Algorithms
20
(1), 1996, pp. 137-156
The complexity of scheduling trees with communication delays
Jan Karel Lenstra
,
Marinus Veldhorst
,
Bart Veltman
Journal of Algorithms
20
(1), 1996, pp. 157-173
A linear algorithm for edge-coloring series--parallel multigraphs
Xiao Zhou
,
Hitoshi Suzuki
,
Takao Nishizeki
Journal of Algorithms
20
(1), 1996, pp. 174-201
On the best case of Heapsort
B. Bollobás
,
T.I. Fenner
,
A.M. Frieze
Journal of Algorithms
20
(2), 1996, pp. 205-217
Adaptive source routing in high-speed networks
Alon Itai
,
Hadas Shachnai
Journal of Algorithms
20
(2), 1996, pp. 218-243
An optimal algorithm for the intersection radius of a set of convex polygons
Shreesh Jadhav
,
Asish Mukhopadhyay
,
Binay Bhattacharya
Journal of Algorithms
20
(2), 1996, pp. 244-267
Two algorithms for unranking arborescences
Charles J. Colbourn
,
Wendy J. Myrvold
,
Eugene Neufeld
Journal of Algorithms
20
(2), 1996, pp. 268-281
Multiobjective heuristic search in AND/OR graphs
Pallab Dasgupta
,
P.P. Chakrabarti
,
S.C. DeSarkar
Journal of Algorithms
20
(2), 1996, pp. 282-311
Analysis of two simple heuristics on a random instance of
k
-SAT
Alan Frieze
,
Stephen Suen
Journal of Algorithms
20
(2), 1996, pp. 312-355
On the complexity of distributed network decomposition
Alessandro Panconesi
,
Aravind Srinivasan
Journal of Algorithms
20
(2), 1996, pp. 356-374
A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube
Volker Heun
,
Ernst W. Mayr
Journal of Algorithms
20
(2), 1996, pp. 375-399
A better algorithm for an ancient scheduling problem
David R. Karger
,
Steven J. Phillips
,
Eric Torng
Journal of Algorithms
20
(2), 1996, pp. 400-430
An exact analysis of stable allocation
Donald E. Knuth
Journal of Algorithms
20
(2), 1996, pp. 431-442
Efficient algorithms for finding a core of a tree with a specified length
Shietung Peng
,
Win-tsung Lo
Journal of Algorithms
20
(3), 1996, pp. 445-458
Optimally computing the shortest weakly visible subedge of a simple polygon
Danny Z. Chen
Journal of Algorithms
20
(3), 1996, pp. 459-478
Traversing layered graphs using the work function algorithm
William R. Burley
Journal of Algorithms
20
(3), 1996, pp. 479-511
An explanation of splaying
Ashok Subramanian
Journal of Algorithms
20
(3), 1996, pp. 512-525
\alpha
-connectivity: A gradually nonparallel graph problem
Kazuo Iwama
,
Chuzo Iwamoto
Journal of Algorithms
20
(3), 1996, pp. 526-544
Derandomization in computational geometry
Jiȓí Matous̑ek
Journal of Algorithms
20
(3), 1996, pp. 545-580
Selection in monotone matrices and computing
k
th nearest neighbors
Pankaj K. Agarwal
,
Sandeep Sen
Journal of Algorithms
20
(3), 1996, pp. 581-601
Seiten 1
2
>