Journal: J. Algorithms

Volume 12, Issue 4

533 -- 555Micha Hofri, Hadas Shachnai. Self-Organizing Lists and Independent References: A Statistical Synergy
556 -- 572Brigitte Vallée. Gauss Algorithm Revisited
573 -- 606Yossi Matias, Uzi Vishkin. On Parallel Hashing and Integer Sorting
607 -- 614Marek Chrobak, Lawrence L. Larmore. On Fast Algorithms for Two Servers
615 -- 638Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni. Incremental Algorithms for Minimal Length Paths
639 -- 656James R. Bergen, Haim Schweitzer. A Probabilistic Algorithm for Computing Hough Transforms
657 -- 662Binghuan Zhu, Wayne Goddard. An Algorithm for Outerplanar Graphs with Parameter
663 -- 673Xiaolin Wu. Optimal Quantization by Matrix Searching
674 -- 684Ludek Kucera. The Greedy Coloring Is a Bad Probabilistic Algorithm
685 -- 699Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young. Competitive Paging Algorithms
700 -- 703Peter van Emde Boas. Problems

Volume 12, Issue 3

359 -- 374Steven Skiena. Probing Convex Polygons with Half-Planes
375 -- 392Lin Chen, Yaacov Yesha. Parallel Recognition of the Consecutive Ones Property with Applications
393 -- 408Mike Paterson, Alexander A. Razborov. The Set of Minimal Braids is co-NP-Complete
409 -- 430Xin He. Efficient Parallel Algorithms for Series Parallel Graphs
431 -- 463John Hershberger, Subhash Suri. Finding Tailored Partitions
464 -- 481Ming-Deh A. Huang. Generalized Riemann Hypothesis and Factoring Polynomials over Finite Fields
482 -- 489Ming-Deh A. Huang. Factorization of Polynomials over Finite Fields and Decomposition of Primes in Algebraic Number Fields
490 -- 515Lawrence L. Larmore, Baruch Schieber. On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure
516 -- 529Jehoshua Bruck, Vwani P. Roychowdhury. How to Play Bowling in Parallel on the Grid

Volume 12, Issue 2

189 -- 203János Csirik, J. B. G. Frenk, Gábor Galambos, A. H. G. Rinnooy Kan. Probabilistic Analysis of Algorithms for Dual Bin Packing Problems
204 -- 238Hagit Attiya, Marc Snir. Better Computing on the Anonymous Ring
239 -- 245Daniel Bienstock, Paul D. Seymour. Monotonicity in Graph Searching
246 -- 280Young Man Kim, Ten-Hwang Lai. The Complexity of Congestion-1 Embedding in a Hypercube
281 -- 307Hans Zantema. Minimizing Sums of Addition Chains
308 -- 340Stefan Arnborg, Jens Lagergren, Detlef Seese. Easy Problems for Tree-Decomposable Graphs
341 -- 356Vasilis Capoyleas, Günter Rote, Gerhard J. Woeginger. Geometric Clusterings

Volume 12, Issue 1

1 -- 22Jirí Matousek, Robin Thomas. Algorithms Finding Tree-Decompositions of Graphs
23 -- 37Xin He. An Improved Algorithm for the Planar 3-Cut Problem
38 -- 56Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri. Finding k Points with Minimum Diameter and Related Problems
57 -- 74Siu-Wing Cheng, Ravi Janardan. Efficient Maintenance of the Union of Intervals on a Line, with Applications
75 -- 95Subir Kumar Ghosh. Computing the Visibility Polygon from a Convex Set and Related Problems
96 -- 109Teresa M. Przytycka, Derek G. Corneil. Parallel Algorithms for Parity Graphs
110 -- 125Phillip B. Gibbons, Richard M. Karp, Vijaya Ramachandran, Danny Soroker, Robert Endre Tarjan. Transitive Compaction in Parallel via Branchings
126 -- 153Ryan Hayward, Colin McDiarmid. Average Case Analysis of Heap Building by Repeated Insertion
154 -- 178Jimmy J. M. Tan. A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching
179 -- 182Herbert S. Wilf. Two Algorithms for the Sieve Method
183 -- 185Peter van Emde Boas. Problems