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=14
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On linear time minor tests with depth-first search
Hans L. Bodlaender
Journal of Algorithms
14
(1), 1993, pp. 1-23
Minimizing mean flow time in two-machine open shops and flow shops
Jianzhong Du
,
Joseph Y.-T. Leung
Journal of Algorithms
14
(1), 1993, pp. 24-44
Minimizing mean flow time with release time and deadline constraints
Jianzhong Du
,
Joseph Y.-T. Leung
Journal of Algorithms
14
(1), 1993, pp. 45-68
Circle shooting in a simple polygon
Pankaj Agarwal
,
Micha Sharir
Journal of Algorithms
14
(1), 1993, pp. 69-87
Self-organizing doubly-linked lists
R.S. Valiveti
,
B.J. Oommen
Journal of Algorithms
14
(1), 1993, pp. 88-114
Algorithms for degree constrained graph factors of minimum deficiency
P. Hell
,
D.G. Kirkpatrick
Journal of Algorithms
14
(1), 1993, pp. 115-138
An algorithm for determining visibility of a simple polygon from an internal line segment
Jeong-In Doh
,
Kyung-Yong Chwa
Journal of Algorithms
14
(1), 1993, pp. 139-168
Efficient sequential and parallel algorithms for maximal bipartite sets
David Pearson
,
Vijay V. Vazirani
Journal of Algorithms
14
(2), 1993, pp. 171-179
Sublinear-time parallel algorithms for matching and related problems
Andrew V. Goldberg
,
Serge A. Plotkin
,
Pravin M. Vaidya
Journal of Algorithms
14
(2), 1993, pp. 180-213
Approximation algorithms for graph augmentation
Samir Khuller
,
Ramakrishna Thurimella
Journal of Algorithms
14
(2), 1993, pp. 214-225
Computing the diameter in multiple-loop networks
Janez Z̑erovnik
,
Tomaz̑ Pisanski
Journal of Algorithms
14
(2), 1993, pp. 226-243
On efficient parallel algorithms for solving set recurrence equations
Oscar H. Ibarra
,
Hui Wang
,
Tao Jiang
Journal of Algorithms
14
(2), 1993, pp. 244-257
Edge separators of planar and outerplanar graphs with applications
Krzystof Diks
,
Hristo N. Djidjev
,
Ondrej Sykora
,
Imrich Vrto
Journal of Algorithms
14
(2), 1993, pp. 258-279
Approximating the number of zeroes of a
GF[2]
polynomial
Marek Karpinski
,
Michael Luby
Journal of Algorithms
14
(2), 1993, pp. 280-287
Optimal linear broadcast
Sara Bitan
,
Shmuel Zaks
Journal of Algorithms
14
(2), 1993, pp. 288-315
Sparser: A paradigm for running distributed algorithms
Yehuda Afek
,
Moty Ricklin
Journal of Algorithms
14
(2), 1993, pp. 316-328
Parallelism, preprocessing, and reachability: A hybrid algorithm for directed graphs
Philip N. Klein
Journal of Algorithms
14
(3), 1993, pp. 331-343
Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values
Omer Berkman
,
Baruch Schieber
,
Uzi Vishkin
Journal of Algorithms
14
(3), 1993, pp. 344-370
The parallel simplicity on compaction and chaining
Prabhakar Ragde
Journal of Algorithms
14
(3), 1993, pp. 371-380
Convex hulls for random lines
Luc Devroye
,
Godfried Toussaint
Journal of Algorithms
14
(3), 1993, pp. 381-394
Adaptive heapsort
Christos Levcopoulos
,
Ola Petersson
Journal of Algorithms
14
(3), 1993, pp. 395-413
Time- and space-efficient randomized consensus
James Aspnes
Journal of Algorithms
14
(3), 1993, pp. 414-431
Linear optimization queries
Jiȓí Matous̑ek
Journal of Algorithms
14
(3), 1993, pp. 432-448
Greedy packet scheduling on shortest paths
Yishay Mansour
,
Boaz Patt-Shamir
Journal of Algorithms
14
(3), 1993, pp. 449-465
On the set LCS and set-set LCS problems
Biing-Feng Wang
,
Gen-Huey Chen
,
Kunsoo Park
Journal of Algorithms
14
(3), 1993, pp. 466-477
Seiten 1
2
>