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=3
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounds for algebraic decision trees
J. Michael Steele
,
Andrew C. Yao
Journal of Algorithms
3
, 1982, pp. 1-8
On the average-case complexity of ``bucketing'' algorithms
Selim G. Akl
,
Henk Meijer
Journal of Algorithms
3
, 1982, pp. 9-13
The byzantine generals strike again
Danny Dolev
Journal of Algorithms
3
, 1982, pp. 14-30
A nonquadratic minimal algorithm for a system of quadratic forms
R. Tolimieri
Journal of Algorithms
3
, 1982, pp. 31-40
A Gray code for compositions
Paul Klingsberg
Journal of Algorithms
3
, 1982, pp. 41-44
A generalization of the fast LUP matrix decomposition algorithm and applications
Oscar H. Ibarra
,
Shlomo Moran
,
Roger Hui
Journal of Algorithms
3
, 1982, pp. 45-56
An
O(\log n)
parallel connectivity algorithm
Y. Shiloach
,
U. Vishkin
Journal of Algorithms
3
(1), 1982, pp. 57-67
The complexity of partial match retrieval in a dynamic setting
Micheal L. Fredman
,
Dennis J. Volper
Journal of Algorithms
3
, 1982, pp. 68-78
Parallel complexity of sorting problems
Martin Aigner
Journal of Algorithms
3
, 1982, pp. 79-88
The NP-completeness column: An ongoing guide
David S. Johnson
Journal of Algorithms
3
, 1982, pp. 89-99
Refined analysis and improvements on some factoring algorithms
C.P. Schnorr
Journal of Algorithms
3
, 1982, pp. 101-127
An
O(n^2\log n)
parallel max-flow algorithm
Y. Shiloach
,
U. Vishkin
Journal of Algorithms
3
(2), 1982, pp. 128-146
Minimal string difference encodings
Robert N. Goldberg
Journal of Algorithms
3
, 1982, pp. 147-156
Analysis of an algorithm for composition of binary quadratic forms
Costas S. Iliopoulos
Journal of Algorithms
3
, 1982, pp. 157-159
Rectilinear line segment intersection, layered segment trees, and dynamization
V.K. Vaishnavi
,
D. Wood
Journal of Algorithms
3
, 1982, pp. 160-176
The NP-completeness column: An ongoing guide
David S. Johnson
Journal of Algorithms
3
, 1982, pp. 182-195
Identification of algebraic numbers
M. Mignotte
Journal of Algorithms
3
(3), 1982, September, pp. 197-204
Robust linear algorithms for cutsets
B.K. Rosen
Journal of Algorithms
3
(3), 1982, September, pp. 205-217
An improved algorithm for the rectangle enclosure problem
D.T. Lee
,
F.P. Preparata
Journal of Algorithms
3
(3), 1982, September, pp. 218-224
Algorithmic extremal problems in combinatorial optimization
K.J. Lieberherr
Journal of Algorithms
3
(3), 1982, September, pp. 225-244
An
O(n\log n)
unidirectional distributed algorithm for extrema finding in a circle
D. Dolev
,
M. Klawe
,
M. Rodeh
Journal of Algorithms
3
(3), 1982, September, pp. 245-260
Deletion algorithms for hashing that preserve randomness
J.S. Vitter
Journal of Algorithms
3
(3), 1982, September, pp. 261-275
Fixed-bucket binary storage trees
G.D. Knott
Journal of Algorithms
3
(3), 1982, September, pp. 276-287
The NP-completeness column: An ongoing guide
David S. Johnson
Journal of Algorithms
3
, 1982, pp. 288-300
A two-dimensional bin-packing model of preemptive, FIFO storage allocation
B.S. Baker
,
E.G., Jr. Coffman
Journal of Algorithms
3
(4), 1982, December, pp. 303-316
Seiten 1
2
>