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=1
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Khachiyan's linear programming algorithm
Bengt Aspvall
,
Richard E. Stone
Journal of Algorithms
1
, 1980, pp. 1-13
An analysis of
(h, k, 1)
-shellsort
Andrew Chi-Chih Yao
Journal of Algorithms
1
, 1980, pp. 14-50
A parallel algorithm for constructing minimum spanning trees
J.L. Bentley
Journal of Algorithms
1
, 1980, pp. 51-59
Combinatorial solutions of multidimensional divide-and-conquer recurrences
Louis Monier
Journal of Algorithms
1
, 1980, pp. 60-74
Subadditive lifting methods for partitioning and knapsack problems
Ellis Johnson
Journal of Algorithms
1
, 1980, pp. 75-96
Recognizing disguised
NR(1)
instances of the satisfiability problem
Bengt Aspvall
Journal of Algorithms
1
, 1980, pp. 97-103
A combinatorial family of labeled trees
Paul Klingsberg
Journal of Algorithms
1
, 1980, pp. 104-106
Problems
Leo J. Guibas
Journal of Algorithms
1
, 1980, pp. 107-110
Sequence of operations analysis for dynamic data structures
P. Flajolet
,
J. Françon
,
J. Vuillemin
Journal of Algorithms
1
, 1980, pp. 111-141
Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
J.C. Lagarias
Journal of Algorithms
1
, 1980, pp. 142-186
Average running time of the fast Fourier transform
Persi Diaconis
Journal of Algorithms
1
, 1980, pp. 187-208
Problems
Leo J. Guibas
Journal of Algorithms
1
, 1980, pp. 209-212
On selecting a random shifted young tableau
Bruce Sagan
Journal of Algorithms
1
, 1980, pp. 213-234
Finding the contour of a union of iso-oriented rectangles
Witold, Jr. Lipski
,
Franco P. Preparata
Journal of Algorithms
1
, 1980, pp. 235-246
A linear algorithm for a core of a tree
Christine A. Morgan
,
Peter J. Slater
Journal of Algorithms
1
, 1980, pp. 247-258
Fast solution of Toeplitz systems of equations and computation of Padé approximants
Richard P. Brent
,
Fred G. Gustavson
,
David Y.Y. Yun
Journal of Algorithms
1
, 1980, pp. 259-295
Convolution of vectors over the real field of constants by evaluation-interpolation algorithms
V.Ya. Pan
Journal of Algorithms
1
, 1980, pp. 297-300
Decomposable searching problems I. Static-to-dynamic transformation
Jon Louis Bentley
,
James B. Saxe
Journal of Algorithms
1
, 1980, pp. 301-358
The theory and computation of evolutionary distances: Pattern recognition
Peter H. Sellers
Journal of Algorithms
1
, 1980, pp. 359-373
Linear expected-time algorithms for connectivity problems
Richard M. Karp
Journal of Algorithms
1
, 1980, pp. 374-393
Problems
Leo J. Guibas
Journal of Algorithms
1
, 1980, pp. 394-395