![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Algorithms, Volume 1
Volume 1, Number 1, March 1980
- Bengt Aspvall, Richard E. Stone:
Khachiyan's Linear Programming Algorithm. 1-13 - Andrew Chi-Chih Yao:
An Analysis of (h, k, 1)-Shellsort. 14-50 - Jon Louis Bentley:
A Parallel Algorithm for Constructing Minimum Spanning Trees. 51-59 - Louis Monier:
Combinatorial Solutions of Multidimensional Divide-and-Conquer Recurrences. 60-74 - Ellis L. Johnson:
Subadditive Lifting Methods for Partitioning and Knapsack Problems. 75-96 - Bengt Aspvall:
Recognizing Disguised NR(1) Instances of the Satisfiability Problem. 97-103 - Paul Klingsberg:
A Combinatorial Family of Labeled Trees. 104-106 - Leonidas J. Guibas:
Problems. 107-110
Volume 1, Number 2, June 1980
- Philippe Flajolet, Jean Françon, Jean Vuillemin:
Sequence of Operations Analysis for Dynamic Data Structures. 111-141 - J. C. Lagarias:
Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms. 142-186 - Persi Diaconis:
Average Running Time of the Fast Fourier Transform. 187-208 - Leonidas J. Guibas:
Problems. 209-212
Volume 1, Number 3, September 1980
- Bruce E. Sagan:
On Selecting a Random Shifted Young Tableau. 213-234 - Witold Lipski Jr., Franco P. Preparata:
Finding the Contour of a Union of Iso-Oriented Rectangles. 235-246 - Christine A. Morgan, Peter J. Slater:
A Linear Algorithm for a Core of a Tree. 247-258 - Richard P. Brent
, Fred G. Gustavson, David Y. Y. Yun:
Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants. 259-295
Volume 1, Number 4, December 1980
- Victor Y. Pan:
Convolution of Vectors over the Real Field of Constants by Evaluation - Interpolation Algorithms. 297-300 - Jon Louis Bentley, James B. Saxe:
Decomposable Searching Problems I: Static-to-Dynamic Transformation. 301-358 - Peter H. Sellers:
The Theory and Computation of Evolutionary Distances: Pattern Recognition. 359-373 - Richard M. Karp, Robert Endre Tarjan:
Linear Expected-Time Algorithms for Connectivity Problems. 374-393 - Leonidas J. Guibas:
Problems. 394-395
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.