Journal of Algorithms
, Volume 1
Volume 1, Number 1, March 1980
Bengt Aspvall
,
Richard E. Stone
: Khachiyan's Linear Programming Algorithm. 1-13
BibTeX
Andrew Chi-Chih Yao
: An Analysis of (h, k, 1)-Shellsort. 14-50
BibTeX
Jon Louis Bentley
: A Parallel Algorithm for Constructing Minimum Spanning Trees. 51-59
BibTeX
Louis Monier
: Combinatorial Solutions of Multidimensional Divide-and-Conquer Recurrences. 60-74
BibTeX
Ellis L. Johnson
: Subadditive Lifting Methods for Partitioning and Knapsack Problems. 75-96
BibTeX
Bengt Aspvall
: Recognizing Disguised NR(1) Instances of the Satisfiability Problem. 97-103
BibTeX
Paul Klingsberg
: A Combinatorial Family of Labeled Trees. 104-106
BibTeX
Leonidas J. Guibas
: Problems. 107-110
BibTeX
Volume 1, Number 2, June 1980
Philippe Flajolet
,
Jean Françon
,
Jean Vuillemin
: Sequence of Operations Analysis for Dynamic Data Structures. 111-141
BibTeX
J. C. Lagarias
: Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms. 142-186
BibTeX
Persi Diaconis
: Average Running Time of the Fast Fourier Transform. 187-208
BibTeX
Leonidas J. Guibas
: Problems. 209-212
BibTeX
Volume 1, Number 3, September 1980
Bruce E. Sagan
: On Selecting a Random Shifted Young Tableau. 213-234
BibTeX
Witold Lipski Jr.
,
Franco P. Preparata
: Finding the Contour of a Union of Iso-Oriented Rectangles. 235-246
BibTeX
, Erratum:
J. Algorithms 2(1)
: 105(1981)
BibTeX
, Corrigendum:
J. Algorithms 3(3)
: 301-302(1982)
BibTeX
Christine A. Morgan
,
Peter J. Slater
: A Linear Algorithm for a Core of a Tree. 247-258
BibTeX
Richard P. Brent
,
Fred G. Gustavson
,
David Y. Y. Yun
: Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants. 259-295
BibTeX
Volume 1, Number 4, December 1980
Victor Y. Pan
: Convolution of Vectors over the Real Field of Constants by Evaluation - Interpolation Algorithms. 297-300
BibTeX
Jon Louis Bentley
,
James B. Saxe
: Decomposable Searching Problems I: Static-to-Dynamic Transformation. 301-358
BibTeX
Peter H. Sellers
: The Theory and Computation of Evolutionary Distances: Pattern Recognition. 359-373
BibTeX
Richard M. Karp
,
Robert Endre Tarjan
: Linear Expected-Time Algorithms for Connectivity Problems. 374-393
BibTeX
Leonidas J. Guibas
: Problems. 394-395
BibTeX
Copyright ©
Sun May 17 00:06:04 2009 by
Michael Ley
(
ley@uni-trier.de
)