Journal of Algorithms, Volume 12
Volume 12, Number 1, March 1991
- Xin He: An Improved Algorithm for the Planar 3-Cut Problem. 23-37
- Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri: Finding k Points with Minimum Diameter and Related Problems. 38-56
- Siu-Wing Cheng, Ravi Janardan: Efficient Maintenance of the Union of Intervals on a Line, with Applications. 57-74
- Subir Kumar Ghosh: Computing the Visibility Polygon from a Convex Set and Related Problems. 75-95
- Phillip B. Gibbons, Richard M. Karp, Vijaya Ramachandran, Danny Soroker, Robert Endre Tarjan: Transitive Compaction in Parallel via Branchings. 110-125
- Ryan Hayward, Colin McDiarmid: Average Case Analysis of Heap Building by Repeated Insertion. 126-153
- Jimmy J. M. Tan: A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching. 154-178
- Herbert S. Wilf: Two Algorithms for the Sieve Method. 179-182
- Peter van Emde Boas: Problems. 183-185
Volume 12, Number 2, June 1991
- János Csirik, J. B. G. Frenk, Gábor Galambos, A. H. G. Rinnooy Kan: Probabilistic Analysis of Algorithms for Dual Bin Packing Problems. 189-203
- Hans Zantema: Minimizing Sums of Addition Chains. 281-307
Volume 12, Number 3, September 1991
- Steven Skiena: Probing Convex Polygons with Half-Planes. 359-374
- Lin Chen, Yaacov Yesha: Parallel Recognition of the Consecutive Ones Property with Applications. 375-392
- Xin He: Efficient Parallel Algorithms for Series Parallel Graphs. 409-430
- Ming-Deh A. Huang: Generalized Riemann Hypothesis and Factoring Polynomials over Finite Fields. 464-481
- Ming-Deh A. Huang: Factorization of Polynomials over Finite Fields and Decomposition of Primes in Algebraic Number Fields. 482-489
- Lawrence L. Larmore, Baruch Schieber: On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. 490-515
Volume 12, Number 4, December 1991
- Micha Hofri, Hadas Shachnai: Self-Organizing Lists and Independent References: A Statistical Synergy. 533-555
- Brigitte Vallée: Gauss' Algorithm Revisited. 556-572
- Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: Incremental Algorithms for Minimal Length Paths. 615-638
- Xiaolin Wu: Optimal Quantization by Matrix Searching. 663-673
- Ludek Kucera: The Greedy Coloring Is a Bad Probabilistic Algorithm. 674-684
- Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young: Competitive Paging Algorithms. 685-699
- Peter van Emde Boas: Problems. 700-703
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-12-06T204626 by the dblp team