%A Bengt Aspvall
%A Richard E. Stone
%T Khachiyan's linear programming algorithm
%J Journal of Algorithms
%K jalg
%V 1
%N 1
%D March 1980
%P 1-13

%A Andrew Chi-Chih Yao
%T An analysis of (h, k, 1)-shellsort
%J Journal of Algorithms
%K jalg
%V 1
%N 1
%D March 1980
%P 14-50

%A Jon Louis Bentley
%T A parallel algorithm for constructing mninimum spanning trees
%J Journal of Algorithms
%K jalg
%V 1
%N 1
%D March 1980
%P 51-59

%A Louis Monier
%T Combinatorial solutions of multidimensional divide-and-conquer recurrences
%J Journal of Algorithms
%K jalg
%V 1
%N 1
%D March 1980
%P 60-74

%A Ellis L. Johnson
%T Subadditive lifting methods for partitioning and knapsack problems
%J Journal of Algorithms
%K jalg
%V 1
%N 1
%D March 1980
%P 75-96

%A Bengt Aspvall
%T Recognizing disguised NR(1) instances of the satisfiability problem
%J Journal of Algorithms
%K jalg
%V 1
%N 1
%D March 1980
%P 97-103

%A Paul Klinsberg
%T A combinatorial family of labeled trees
%J Journal of Algorithms
%K jalg
%V 1
%N 1
%D March 1980
%P 104-106

%A P. Flajolet
%A J. Francon
%A J. Vuillemin
%T Sequence of operations analysis for dynamic data structures
%J Journal of Algorithms
%K jalg
%V 1
%N 2
%D June 1980
%P 111-141

%A J.C. Lagarias
%T Worst-case complexity bounds for algorithms
in the theory of integral quadratic forms
%J Journal of Algorithms
%K jalg
%V 1
%N 2
%D June 1980
%P 142-186

%A Persi Diaconis
%T Average running time of the Fast Fourier transform
%J Journal of Algorithms
%K jalg
%V 1
%N 2
%D June 1980
%P 187-208

%A Bruce Sagan
%T On selecting a random shifted Young tableau
%J Journal of Algorithms
%K jalg
%V 1
%N 3
%D September 1980
%P 213-234

%A Witold Lipski,\ Jr.
%A Franco P. Preparata
%T Finding the contour of a union of iso-oriented rectangles
%J Journal of Algorithms
%K jalg
%V 1
%N 3
%D September 1980
%P 235-246

%A Christine A. Morgan
%A Peter J. Slater
%T A linear algorithm for a core of a tree
%J Journal of Algorithms
%K jalg
%V 1
%N 3
%D September 1980
%P 247-258

%A Richard P. Brent
%A Fred G. Gustavson
%A David Y.Y. Yun
%T Fast solution of Toeplitz systems of equations
and computation of Pade approximants
%J Journal of Algorithms
%K jalg
%V 1
%N 3
%D September 1980
%P 259-295

%A V.Ya. Pan
%T Convolution of vectors over the real field of constants by evaluations
- interpolation algorithms
%J Journal of Algorithms
%K jalg
%V 1
%N 4
%D December 1980
%P 297-300

%A Jon Louis Bentley
%A James B. Saxe
%T Decomposable searching problems. I. Static-to-dynamic transformation
%J Journal of Algorithms
%K jalg
%V 1
%N 4
%D December 1980
%P 301-358

%A Peter H. Sellers
%T The theory and computation of evolutionary distances: pattern recognition
%J Journal of Algorithms
%K jalg
%V 1
%N 4
%D December 1980
%P 359-373

%A Richard M. Karp
%A Robert Endre Tarjan
%T Linear expected-time algorithms for connectivity problems
%J Journal of Algorithms
%K jalg
%V 1
%N 4
%D December 1980
%P 374-393

%A Gideon Ehrlich
%T Searching and sorting real numbers
%J Journal of Algorithms
%K jalg
%V 2
%N 1
%D March 1981
%P 1-12

%A Jorge Olivos
%T On vectorial addition chains
%J Journal of Algorithms
%K jalg
%V 2
%N 1
%D March 1981
%P 13-21

%A Shlomo Moran
%A Yehoshua Perl
%T The complexity of identifying redundant and essential elements
%J Journal of Algorithms
%K jalg
%V 2
%N 1
%D March 1981
%P 22-30

%A David A. Klarner
%T An algorithm to determine when certain sets have 0-density
%J Journal of Algorithms
%K jalg
%V 2
%N 1
%D March 1981
%P 31-43

%A Irvin Roy Hentzel
%A Leslie Hogben
%T Exhaustive checking of sparse algebras
%J Journal of Algorithms
%K jalg
%V 2
%N 1
%D March 1981
%P 44-49

%A A. Ralston
%T A new memoryless algorithm for De Bruijn sequences
%J Journal of Algorithms
%K jalg
%V 2
%N 1
%D March 1981
%P 50-62

%A Witold Lipski,\ Jr.
%A Franco P. Preparata
%T Segments, rectangles, contours
%J Journal of Algorithms
%K jalg
%V 2
%N 1
%D March 1981
%P 63-76

%A M.L. fredman
%T The spanning bound as a measure of range query complexity
%J Journal of Algorithms
%K jalg
%V 2
%N 1
%D March 1981
%P 77-87

%A Yossi Shiloach
%A Uzi Vishkin
%T Finding the maximu, merging, and sorting in a parallel computation model
%J Journal of Algorithms
%K jalg
%V 2
%N 1
%D March 1981
%P 88-102

%A Yossi Shiloach
%T Fast canonization of circular strings
%J Journal of Algorithms
%K jalg
%V 2
%N 2
%D June 1981
%P 107-121

%A T.C. Hu
%A M.T. Shing
%T An O(n) algorithm to find a near-optimum partition of a convex polygon
%J Journal of Algorithms
%K jalg
%V 2
%N 2
%D June 1981
%P 122-138

%A R. Melville
%T A time/space tradeoff for in-place array permutation
%J Journal of Algorithms
%K jalg
%V 2
%N 2
%D June 1981
%P 139-142

%A V. Pan
%T The bit-complexity of arithmetic algorithms
%J Journal of Algorithms
%K jalg
%V 2
%N 2
%D June 1981
%P 143-163

%A Judea Pearl
%T A space-efficient on-line method of computing quantile estimates
%J Journal of Algorithms
%K jalg
%V 2
%N 2
%D June 1981
%P 164-177

%A William H. Burge
%T Stacks in a two-level store
%J Journal of Algorithms
%K jalg
%V 2
%N 2
%D June 1981
%P 178-185

%A H.El. Gindy
%A D. Avis
%T A linear algorithm for computing the visibility polygon from a point
%J Journal of Algorithms
%K jalg
%V 2
%N 2
%D June 1981
%P 186-197

%A R. Bar-Yehuda
%A S. Even
%T A linear-time approximation algorithm for the weighted vertex cover problem
%J Journal of Algorithms
%K jalg
%V 2
%N 2
%D June 1981
%P 198-203

%A Herbert S. Wilf
%T The uniform selection of free trees
%J Journal of Algorithms
%K jalg
%V 2
%N 2
%D June 1981
%P 204-207

%A Witold Lipski,\ Jr.
%A Christos H. Papadimitriou
%T A fast algorithm for testing for safety and detecting deadlocks
in locked transaction
%J Journal of Algorithms
%K jalg
%V 2
%N 3
%D September 1981
%P 211-226

%A Lloyd Allison
%T Generating coset representatives for permutation groups
%J Journal of Algorithms
%K jalg
%V 2
%N 3
%D September 1981
%P 227-244

%A Mark H. Overmars
%T Dynamization of order decomposable set problems
%J Journal of Algorithms
%K jalg
%V 2
%N 3
%D September 1981
%P 245-260

%A Ephraim Feig
%T On systems of bilinear forms
whose minimal division-free algorithms are all bilinear
%J Journal of Algorithms
%K jalg
%V 2
%N 3
%D September 1981
%P 261-281

%A Jan Van\ Leeuwen
%A Derick Wood
%T The measure problem for rectangular ranges in d-space
%J Journal of Algorithms
%K jalg
%V 2
%N 3
%D September 1981
%P 282-300

%A V. Pan
%T A unified approach to the analysis of bilinear algorithms
%J Journal of Algorithms
%K jalg
%V 2
%N 3
%D September 1981
%P 301-310

%A S. Even
%A O. Goldreich
%T The minimum-length generator sequence problem is NP-hard
%J Journal of Algorithms
%K jalg
%V 2
%N 3
%D September 1981
%P 311-313

%A Norishige Chiba
%A Takao Nishizeki
%A Nobuji Saito
%T A linear 5-coloring algorithm of planar graphs
%J Journal of Algorithms
%K jalg
%V 2
%N 4
%D December 1981
%P 317-327

%A Andras Frank
%T A weighted matroid intersection algorithm
%J Journal of Algorithms
%K jalg
%V 2
%N 4
%D December 1981
%P 328-336

%A D.T. Lee
%A C.K. Wong
%T Finding intersection of rectangles by range search
%J Journal of Algorithms
%K jalg
%V 2
%N 4
%D December 1981
%P 337-347

%A Brenda S. Baker
%A Donna J. Brown
%A Howard P. Katseff
%T A 5/4 algorithm for two-dimensional packing
%J Journal of Algorithms
%K jalg
%V 2
%N 4
%D December 1981
%P 348-368

%A Peter Eades
%A John Staples
%T On optimal trees
%J Journal of Algorithms
%K jalg
%V 2
%N 4
%D December 1981
%P 369-384

%A David G. Cantor
%T Irreducible polynomials with internal coefficients have succinct certificates
%J Journal of Algorithms
%K jalg
%V 2
%N 4
%D December 1981
%P 385-392

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 2
%N 4
%D December 1981
%P 393-405

%A J. Michael Steele
%A Andrew C. Yao
%T Lower bounds for algebraic decision trees
%J Journal of Algorithms
%K jalg
%V 3
%N 1
%D March 1982
%P 1-8

%A Selim G. Akl
%A Henk Meijer
%T On the average case complexity of "bucketing" algorithms
%J Journal of Algorithms
%K jalg
%V 3
%N 1
%D March 1982
%P 9-13

%A Danny Dolev
%T The Byzantine generals strike again
%J Journal of Algorithms
%K jalg
%V 3
%N 1
%D March 1982
%P 14-30

%A R. Tolimieri
%T A nonquadratic monimal algorithm for a system of quadratic forms
%J Journal of Algorithms
%K jalg
%V 3
%N 1
%D March 1982
%P 31-40

%A Paul Klingsberg
%T A Gray code for compositions
%J Journal of Algorithms
%K jalg
%V 3
%N 1
%D March 1982
%P 41-44

%A Oscar H. Ibarra
%A Shlomo Moran
%A Roger Hul
%T A generalization of the fast LUP matrix decomposition algorithm
and applications
%J Journal of Algorithms
%K jalg
%V 3
%N 1
%D March 1982
%P 45-56

%A Yossi Shiloach
%A Uzi Vishkin
%T An O(log n) parallel connectivity algorithm
%J Journal of Algorithms
%K jalg
%V 3
%N 1
%D March 1982
%P 57-67

%A Michael L. Fredmna
%A Dennis J. Volper
%T The complexity of partial match retrieval in a dynamic setting
%J Journal of Algorithms
%K jalg
%V 3
%N 1
%D March 1982
%P 68-78

%A Martin Aigner
%T Parallel complexity of sorting problems
%J Journal of Algorithms
%K jalg
%V 3
%N 1
%D March 1982
%P 79-88

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 3
%N 1
%D March 1982
%P 89-99

%A C.P. Schnorr
%T Refined analysis and improvements on some factoring algorithms
%J Journal of Algorithms
%K jalg
%V 3
%N 2
%D June 1982
%P 101-127

%A Yossi Shiloach
%A Uzi Vishkin
%T An O(n^2 log n) parallel MAX-FLOW algorithm
%J Journal of Algorithms
%K jalg
%V 3
%N 2
%D June 1982
%P 128-146

%A Robert Goldberg
%T Minimal string difference encodings
%J Journal of Algorithms
%K jalg
%V 3
%N 2
%D June 1982
%P 147-156

%A Costas S. Iliopoulos
%T Analysis of an algorithm for composition of binary quadratic forms
%J Journal of Algorithms
%K jalg
%V 3
%N 2
%D June 1982
%P 157-159

%A V.K. Vaishnavi
%A D. Wood
%T Rectilinear line segment intersection, layered segment trees,
and dynamization
%J Journal of Algorithms
%K jalg
%V 3
%N 2
%D June 1982
%P 160-176

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 3
%N 2
%D June 1982
%P 182-195

%A Maurice Mignotte
%T Identification of algebraic numbers
%J Journal of Algorithms
%K jalg
%V 3
%N 3
%D September 1982
%P 197-204

%A Barry K. Rosen
%T Robust linear algorithms for cutsets
%J Journal of Algorithms
%K jalg
%V 3
%N 3
%D September 1982
%P 205-217

%A D.T. Lee
%A F.P. Preparata
%T An improved algorithm for the rectangle enclosure problem
%J Journal of Algorithms
%K jalg
%V 3
%N 3
%D September 1982
%P 218-224

%A Karl J. Leiberherr
%T Algorithmic extremal problems in combinatorial optimization
%J Journal of Algorithms
%K jalg
%V 3
%N 3
%D September 1982
%P 225-244

%A Danny Dolev
%A Maria Klawe
%A Michael Rodeh
%T An O(n log n) unidirectional distributed algorithm
for extrema finding in a circle
%J Journal of Algorithms
%K jalg
%V 3
%N 3
%D September 1982
%P 245-260

%A Jeffrey Scott Vitter
%T Deletion algorithms for hashing that preserve randomness
%J Journal of Algorithms
%K jalg
%V 3
%N 3
%D September 1982
%P 261-275

%A Gary D. Knott
%T Fixed-bucket binary storage trees
%J Journal of Algorithms
%K jalg
%V 3
%N 3
%D September 1982
%P 276-287

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 3
%N 3
%D September 1982
%P 288-300

%A B.S. Baker
%A E.G. Coffman,\ Jr.
%T A two-dimensional bin-packing model of preemptive, FIFO storage allocation
%J Journal of Algorithms
%K jalg
%V 3
%N 4
%D December 1982
%P 303-316

%A D.S. Franzblau
%A Doron Zeilberger
%T A bijective proof of the hook-length formula
%J Journal of Algorithms
%K jalg
%V 3
%N 4
%D December 1982
%P 317-343

%A Kazuo Nakajima
%A S. Louis Hakimi
%T Complexity results for scheduling tasks with discrete starting times
%J Journal of Algorithms
%K jalg
%V 3
%N 4
%D December 1982
%P 344-361

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 3
%N 4
%D December 1982
%P 381-395

%A V.Ya. Pan
%T The additive and logical complexities
of linear and bilinear arithmetic algorithms
%J Journal of Algorithms
%K jalg
%V 4
%N 1
%D March 1983
%P 1-34

%A Daniel Leven
%A Zvi Galil
%T NP completeness of finding the chromatic index of regular graphs
%J Journal of Algorithms
%K jalg
%V 4
%N 1
%D March 1983
%P 35-44

%A Uzi Vishkin
%T Implementation of simultaneous memory address access in models that forbid it
%J Journal of Algorithms
%K jalg
%V 4
%N 1
%D March 1983
%P 45-50

%A U.I. Gupta
%A D.T. Lee
%A C.K. Wong
%T Ranking and unranking of B-trees
%J Journal of Algorithms
%K jalg
%V 4
%N 1
%D March 1983
%P 51-60

%A Greg N. Frederickson
%A Donald R. Johnson
%T Finding kth paths and p-centers
by generating and searching good data structures
%J Journal of Algorithms
%K jalg
%V 4
%N 1
%D March 1983
%P 61-80

%A Ephraim Feig
%T Minimal algorithms for bilinear forms may have divisions
%J Journal of Algorithms
%K jalg
%V 4
%N 1
%D March 1983
%P 81-84

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 4
%N 1
%D March 1983
%P 87-100

%A Ronald I. Becker
%A Yehoshua Perl
%T Shifting algorithms for tree partitioning with general weighting functions
%J Journal of Algorithms
%K jalg
%V 4
%N 2
%D June 1983
%P 101-120

%A Binay K. Bhattacharya
%A Godfried T. Toussaint
%T Efficient algorithms for computing the maximum distance
between two finite planar sets
%J Journal of Algorithms
%K jalg
%V 4
%N 2
%D June 1983
%P 121-136

%A Ephraim Feig
%T Certain systems of bilinear forms whose minimal algorithms are all quadratic
%J Journal of Algorithms
%K jalg
%V 4
%N 2
%D June 1983
%P 137-149

%A Alan D. Kalvin
%A Yaakov L. Varol
%T On the generation of all topological sortings
%J Journal of Algorithms
%K jalg
%V 4
%N 2
%D June 1983
%P 150-162

%A Gregory Butler
%T Computing normalizers in permutation groups
%J Journal of Algorithms
%K jalg
%V 4
%N 2
%D June 1983
%P 163-175

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 4
%N 2
%D June 1983
%P 189-203

%A John D. Dixon
%A Herbert S. Wilf
%T The random selection of unlabeled graphs
%J Journal of Algorithms
%K jalg
%V 4
%N 3
%D September 1983
%P 205-213

%A A. Guenochie
%T Random spanning tree
%J Journal of Algorithms
%K jalg
%V 4
%N 3
%D September 1983
%P 214-220

%A W.M. Beynon
%T A formal account of some elementary continued fraction algorithms
%J Journal of Algorithms
%K jalg
%V 4
%N 3
%D September 1983
%P 221-240

%A T.C. Hu
%A M.T. Shing
%T Multiterminal flows in outerplanar networks
%J Journal of Algorithms
%K jalg
%V 4
%N 3
%D September 1983
%P 241-261

%A Errol L. Lloyd
%T An O(n log n) algorithm for the Josephus problem
%J Journal of Algorithms
%K jalg
%V 4
%N 3
%D September 1983
%P 262-270

%A Eliezer L. Lozinskii
%T An algorithm for parallel evaluation of functions
%J Journal of Algorithms
%K jalg
%V 4
%N 3
%D September 1983
%P 271-281

%A C. Pandu Rangan
%T On the minimum number of additions required to compute a quadratic form
%J Journal of Algorithms
%K jalg
%V 4
%N 3
%D September 1983
%P 282-285

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 4
%N 3
%D September 1983
%P 286-300

%A Pavol Hell
%A Moshe Rosenfeld
%T The complexity of finding generalized paths in tournaments
%J Journal of Algorithms
%K jalg
%V 4
%N 4
%D December 1983
%P 303-309

%A Hiroshi Imai
%A Takao Asano
%T Finding the connected components and a maximum clique
of an intersection graph of rectangles in the plane
%J Journal of Algorithms
%K jalg
%V 4
%N 4
%D December 1983
%P 310-323

%A Ronald L. Graham
%A F. Frances Yao
%T Finding the convex hull of a simple polygon
%J Journal of Algorithms
%K jalg
%V 4
%N 4
%D December 1983
%P 324-331

%A Paul Pritchard
%T Fast compact prime number sieves (among others)
%J Journal of Algorithms
%K jalg
%V 4
%N 4
%D December 1983
%P 332-344

%A Edward Minieka
%A Niranjani H. Patel
%T On finding the core of a tree with a specified length
%J Journal of Algorithms
%K jalg
%V 4
%N 4
%D December 1983
%P 345-352

%A Ten-Hwang Lai
%A Sartaj Sahni
%T Nearly on-line scheduling of multiprocessor systems with memories
%J Journal of Algorithms
%K jalg
%V 4
%N 4
%D December 1983
%P 353-362

%A Jean Pierre Duval
%T Factorizing words over an ordered alphabet
%J Journal of Algorithms
%K jalg
%V 4
%N 4
%D December 1983
%P 363-381

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 4
%N 4
%D December 1983
%P 397-411

%A Dan Gusfield
%T Bounds for naive multiple machine scheduling with release times and deadlines
%J Journal of Algorithms
%K jalg
%V 5
%N 1
%D March 1984
%P 1-6

%A Gary D. Knott
%T Direct-chaining with coalescing lists
%J Journal of Algorithms
%K jalg
%V 5
%N 1
%D March 1984
%P 7-21

%A Joseph Y.-T. Leung
%T Fast algorithms for generating all maximal independent sets
of interval, circular-arc and chordal graphs
%J Journal of Algorithms
%K jalg
%V 5
%N 1
%D March 1984
%P 22-35

%A Per-Ake Larson
%T Analysis of hashing with chaining in the prime area
%J Journal of Algorithms
%K jalg
%V 5
%N 1
%D March 1984
%P 36-47

%A Danny Dolev
%A Manfred K. Warmuth
%T Scheduling precedence graphs of bounded height
%J Journal of Algorithms
%K jalg
%V 5
%N 1
%D March 1984
%P 48-59

%A Alan Tucker
%A Donna Wilson
%T An O(N^2) algorithm for colouring perfect planar graphs
%J Journal of Algorithms
%K jalg
%V 5
%N 1
%D March 1984
%P 60-68

%A Shou-Hsuan Stephen Huang
%A C.K. Wong
%T Optimal binary split trees
%J Journal of Algorithms
%K jalg
%V 5
%N 1
%D March 1984
%P 69-79

%A Harold N. Gabow
%A Robert E. Tarjan
%T Efficient algorithms for a family of matroid intersection problems
%J Journal of Algorithms
%K jalg
%V 5
%N 1
%D March 1984
%P 80-131

%A P. Ramajan
%A J.S. Deogun
%A C.L. Liu
%T A personnel assignment problem
%J Journal of Algorithms
%K jalg
%V 5
%N 1
%D March 1984
%P 132-144

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 5
%N 1
%D March 1984
%P 147-160

%A David A. Plaisted
%T Heuristic matching for graph satisfying the triangle equality
%J Journal of Algorithms
%K jalg
%V 5
%N 2
%D June 1984
%P 163-179

%A P.J. Weinberger
%T Finding the number of factors of a polynomial
%J Journal of Algorithms
%K jalg
%V 5
%N 2
%D June 1984
%P 180-186

%A M. Boshernitzan
%A A.S. Fraenkel
%T A linear algorithm for nonhomopgeneous spectra of numbers
%J Journal of Algorithms
%K jalg
%V 5
%N 2
%D June 1984
%P 187-198

%A Eljas Soisalon-Soininen
%A Derick Wood
%T Optimal algorithms to compute the closure of a set of iso-rectangles
%J Journal of Algorithms
%K jalg
%V 5
%N 2
%D June 1984
%P 199-214

%A R.P. Anstee
%A Martin Farber
%T Characterizations of totally balanced matrices
%J Journal of Algorithms
%K jalg
%V 5
%N 2
%D June 1984
%P 215-230

%A Christos H. Papadimitriou
%A Umesh V. Vazirani
%T On two geometric problems related to trhe traveling salesman problem
%J Journal of Algorithms
%K jalg
%V 5
%N 2
%D June 1984
%P 231-246

%A Nicholas C. Wormald
%T Generating random regular graphs
%J Journal of Algorithms
%K jalg
%V 5
%N 2
%D June 1984
%P 247-280

%A Ichiro Semba
%T An efficient algorithm for generating all k-subsets (1 <= k <= m <= n)
of the set {1, 2, ..., n} in lexicographical order
%J Journal of Algorithms
%K jalg
%V 5
%N 2
%D June 1984
%P 281-283

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 5
%N 2
%D June 1984
%P 284-299

%A Ralf Hartmut Guting
%T An optimal contour algorithm for iso-oriented rectangles
%J Journal of Algorithms
%K jalg
%V 5
%N 3
%D September 1984
%P 303-326

%A G. Seroussi
%A A. Lempel
%T On symmetric algorithms for bilinear forms over finite fields
%J Journal of Algorithms
%K jalg
%V 5
%N 3
%D September 1984
%P 327-344

%A Derek Corneil
%A Mark Goldberg
%T A non-factorial algorithm for canonical numbering of a graph
%J Journal of Algorithms
%K jalg
%V 5
%N 3
%D September 1984
%P 345-362

%A L.G. Valiant
%T Short monotone formulae for the majority function
%J Journal of Algorithms
%K jalg
%V 5
%N 3
%D September 1984
%P 363-366

%A Yehoshua Perl
%T Optimum split trees
%J Journal of Algorithms
%K jalg
%V 5
%N 3
%D September 1984
%P 367-374

%A Pierre Rosenstiehl
%A Robert E. Tarjan
%T Gauss codes, planar Hamiltonian graphs, and stack-sortable permutations
%J Journal of Algorithms
%K jalg
%V 5
%N 3
%D September 1984
%P 375-390

%A John R. Gilbert
%A Joan P. Hutchinson
%A Robert Endre Tarjan
%T A separator theorem for graphs of bounded genus
%J Journal of Algorithms
%K jalg
%V 5
%N 3
%D September 1984
%P 391-407

%A T. Lengauer
%T On the solution of inequality systems relevant to IC-layout
%J Journal of Algorithms
%K jalg
%V 5
%N 3
%D September 1984
%P 408-421

%A Michael G. Main
%A Richard J. Lorentz
%T An O(n log n) algorithm for finding all repetitions in a string
%J Journal of Algorithms
%K jalg
%V 5
%N 3
%D September 1984
%P 422-432

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 5
%N 3
%D September 1984
%P 433-447

%A Gsoton H. Gonnet
%A J. Ian Munro
%T The analysis of linear probing sort
by the use of a new mathematical transform
%J Journal of Algorithms
%K jalg
%V 5
%N 4
%D December 1984
%P 451-470

%A J.B. Remmel
%A R. Whitney
%T Multiplying Schur functions
%J Journal of Algorithms
%K jalg
%V 5
%N 4
%D December 1984
%P 471-487

%A Eli Shamir
%A Eli Upfal
%T Sequential and distributed graph coloring algorithms
with performance analysis in random graph spaces
%J Journal of Algorithms
%K jalg
%V 5
%N 4
%D December 1984
%P 488-501

%A S.F. Assmann
%A D.S. Johnson
%A D.J. Kleitman
%A J.Y.-T. Leung
%T On a dual version of the one-dimensional bin packing problem
%J Journal of Algorithms
%K jalg
%V 5
%N 4
%D December 1984
%P 502-525

%A S. Louis Hakimi
%A Edward F. Schmeichel
%T An adaptive algorithm for system level diagnosis
%J Journal of Algorithms
%K jalg
%V 5
%N 4
%D December 1984
%P 526-530

%A Eitan M. Gurari
%A Ivan Hal Sudborough
%T Improved dynamic programming algorithms for bandwidth minimization
and the MinCut linear arrangement problem
%J Journal of Algorithms
%K jalg
%V 5
%N 4
%D December 1984
%P 531-546

%A Micha Hofri
%T A probabilistic analysis of the next-fit bin packing algorithm
%J Journal of Algorithms
%K jalg
%V 5
%N 4
%D December 1984
%P 547-556

%A Prakash V. Ramanan
%A Laurent Hyafil
%T New algorithms for selection
%J Journal of Algorithms
%K jalg
%V 5
%N 4
%D December 1984
%P 557-578

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 5
%N 4
%D December 1984
%P 595-609

%A Luc Devroye
%T The expected length of the longest probe sequence for bucket searching
when then distributed is not uniform
%J Journal of Algorithms
%K jalg
%V 6
%N 1
%D March 1985
%P 1-9

%A Z. Miller
%A J.B. Orlin
%T NP-completeness for minimizing maximum edge length in grid embeddings
%J Journal of Algorithms
%K jalg
%V 6
%N 1
%D March 1985
%P 10-16

%A Garret Swart
%T Finding the convex hull facet by facet
%J Journal of Algorithms
%K jalg
%V 6
%N 1
%D March 1985
%P 17-48

%A Brenda S. Baker
%T A new proof for the first-fit decreasing bin-packing algorithm
%J Journal of Algorithms
%K jalg
%V 6
%N 1
%D March 1985
%P 49-70

%A Valery B. Alekseyev
%T On the complexity of some algorithms of matrix multiplication
%J Journal of Algorithms
%K jalg
%V 6
%N 1
%D March 1985
%P 71-85

%A N. Linial
%A M. Saks
%T Searching ordered structures
%J Journal of Algorithms
%K jalg
%V 6
%N 1
%D March 1985
%P 86-103

%A Colm O'Dunlaing
%A Chee K. Yap
%T A "retraction" method for planning th emotion of a disc
%J Journal of Algorithms
%K jalg
%V 6
%N 1
%D March 1985
%P 104-111

%A R.P. Anstee
%T An algorithmic proof of Tutte's f-factor theorem
%J Journal of Algorithms
%K jalg
%V 6
%N 1
%D March 1985
%P 112-131

%A Esko Ukkonen
%T Finding approximate patterns in strings
%J Journal of Algorithms
%K jalg
%V 6
%N 1
%D March 1985
%P 132-137

%A Markku Tamminen
%T Two levels are as good as any
%J Journal of Algorithms
%K jalg
%V 6
%N 1
%D March 1985
%P 138-144

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 6
%N 1
%D March 1985
%P 145-159

%A Donald E. Knuth
%T Dynamic Huffman coding
%J Journal of Algorithms
%K jalg
%V 6
%N 2
%D June 1985
%P 163-180

%A Donald E. Knuth
%T An analysis of optimum caching
%J Journal of Algorithms
%K jalg
%V 6
%N 2
%D June 1985
%P 181-199

%A Quentin F. Stout
%T Pyramid computer solutions of the closest pair problem
%J Journal of Algorithms
%K jalg
%V 6
%N 2
%D June 1985
%P 200-212

%A H. Edlesbrunner
%T Computing the extreme distances between two convex polygons
%J Journal of Algorithms
%K jalg
%V 6
%N 2
%D June 1985
%P 213-224

%A Andrzej Proskurowski
%A Frank Ruskey
%T Binary tree Gray codes
%J Journal of Algorithms
%K jalg
%V 6
%N 2
%D June 1985
%P 225-238

%A Fanica Gavril
%A Johanan Schonheim
%T Constructing trees with prescribed cardinalities
for the components of their vertex deleted subgraphs
%J Journal of Algorithms
%K jalg
%V 6
%N 2
%D June 1985
%P 239-252

%A Andrew C. Yao
%T On optimal arrangements of keys with double hashing
%J Journal of Algorithms
%K jalg
%V 6
%N 2
%D June 1985
%P 253-264

%A Refael Hassin
%A Nimrod Megiddo
%T An optimal algorithm for finding all the humps of a monotone step-function
%J Journal of Algorithms
%K jalg
%V 6
%N 2
%D June 1985
%P 265-274

%A Edward A. bender
%A Herbert S. Wilf
%T A theoretical analysis of backtracking in the graph coloring problem
%J Journal of Algorithms
%K jalg
%V 6
%N 2
%D June 1985
%P 275-282

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 6
%N 2
%D June 1985
%P 291-305

%A Martin Farber
%A J. Mark Keil
%T Domination in permutation graphs
%J Journal of Algorithms
%K jalg
%V 6
%N 3
%D September 1985
%P 309-321

%A Thomas G. Szymanski
%T Hash table reorganization
%J Journal of Algorithms
%K jalg
%V 6
%N 3
%D September 1985
%P 322-335

%A Patricio V. Poblete
%A J. Ian Munro
%T The analysis of a fringe heuristic for binary search trees
%J Journal of Algorithms
%K jalg
%V 6
%N 3
%D September 1985
%P 336-350

%A M.C. Er
%T The complexity of the generalised cyclic towers of Hanoi problem
%J Journal of Algorithms
%K jalg
%V 6
%N 3
%D September 1985
%P 351-358

%A Peter B. Borwein
%T On the complexity of calculating factorials
%J Journal of Algorithms
%K jalg
%V 6
%N 3
%D September 1985
%P 359-375

%A David P. Dobkin
%A David G. Kirkpatrick
%T A linear algorithm for determining the separation of convex polyhedra
%J Journal of Algorithms
%K jalg
%V 6
%N 3
%D September 1985
%P 376-392

%A Hiroyuki Nakayama
%A Takao Nishizeki
%A Nobuji Saito
%T Lower bounds for combinatorial problems on graphs
%J Journal of Algorithms
%K jalg
%V 6
%N 3
%D September 1985
%P 393-399

%A KJohei Noshita
%T A theorem on the expected complexity of Dijkstra's shortest path algorithm
%J Journal of Algorithms
%K jalg
%V 6
%N 3
%D September 1985
%P 400-408

%A Alon Itai
%A Michael Roder
%T Scheduling transmissions in a network
%J Journal of Algorithms
%K jalg
%V 6
%N 3
%D September 1985
%P 409-429

%A Nimrod Megiddo
%T Partitioning with two lines in the plane
%J Journal of Algorithms
%K jalg
%V 6
%N 3
%D September 1985
%P 430-433

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 6
%N 3
%D September 1985
%P 434-451

%A David P. Dobkin
%A J. Ian Munro
%T Efficient uses of the past
%J Journal of Algorithms
%K jalg
%V 6
%N 4
%D December 1985
%P 455-465

%A Bela Bollobas
%A Istvan Simon
%T Repeated random insertion into a priority queue
%J Journal of Algorithms
%K jalg
%V 6
%N 4
%D December 1985
%P 466-477

%A William M. Kantor
%T Polynomial-time algorithms for finding elements of prime order
and Sylow subgroups
%J Journal of Algorithms
%K jalg
%V 6
%N 4
%D December 1985
%P 478-514

%A Herbert Edelsbrunner
%A Mark H. Overmars
%T Batched dynamic solutions to decomposable searching problems
%J Journal of Algorithms
%K jalg
%V 6
%N 4
%D December 1985
%P 515-542

%A B. Domanski
%A M. Anshel
%T The complexity of Dehn's algorithm for word problems in groups
%J Journal of Algorithms
%K jalg
%V 6
%N 4
%D December 1985
%P 543-549

%A A. Bagchi
%A P.K. Srimani
%T Weighted heuristic search in networks
%J Journal of Algorithms
%K jalg
%V 6
%N 4
%D December 1985
%P 550-576

%A Robert W. Irving
%T An efficient algorithm for the "stable roommates" problem
%J Journal of Algorithms
%K jalg
%V 6
%N 4
%D December 1985
%P 577-595

%A Marinus Veldhorst
%T The optimal representation of disjoint iso-oriented rectrangles
in two-dimensional trees
%J Journal of Algorithms
%K jalg
%V 7
%N 1
%D March 1986
%P 1-34

%A D.K. Friesen
%A M.A. Langston
%T Evaluation of a MULTIFIT-based scheduling algorithm
%J Journal of Algorithms
%K jalg
%V 7
%N 1
%D March 1986
%P 35-59

%A Mark Jerrum
%T A compact representation for permutation groups
%J Journal of Algorithms
%K jalg
%V 7
%N 1
%D March 1986
%P 60-78

%A Prasoon Tiwari
%T An efficient parallel algorithm for shifting
the root of a depth first spanning tree
%J Journal of Algorithms
%K jalg
%V 7
%N 1
%D March 1986
%P 79-104

%A Miroslawa Skowronska
%A Majiej M. Syslo
%A Cristina Zamfirescu
%T An algorithmic characterization of total digraphs
%J Journal of Algorithms
%K jalg
%V 7
%N 1
%D March 1986
%P 120-133

%A Esther M. Arkin
%A Christos H. Papadimitriou
%T On the complexity of circulations
%J Journal of Algorithms
%K jalg
%V 7
%N 1
%D March 1986
%P 134-145

%A Ouri Wolfson
%T An algorithm for early unlocking of entities in database transactions
%J Journal of Algorithms
%K jalg
%V 7
%N 1
%D March 1986
%P 146-156

%A Robert Sedgewick
%T A new upper bound for shellsort
%J Journal of Algorithms
%K jalg
%V 7
%N 2
%D June 1986
%P 159-173

%A M.E. Dyer
%A A.M. Frieze
%T Planar 3DM is NP-complete
%J Journal of Algorithms
%K jalg
%V 7
%N 2
%D June 1986
%P 174-184

%A Marc Snir
%T Depth-size trade-offs for parallel prefix computation
%J Journal of Algorithms
%K jalg
%V 7
%N 2
%D June 1986
%P 185-201

%A Richard Cole
%T Searching and storing similar lists
%J Journal of Algorithms
%K jalg
%V 7
%N 2
%D June 1986
%P 202-220

%A Tako Asano
%A Tetsuo Asano
%A Ron Y. Pinter
%T Polygon triangulation: efficiency and minimality
%J Journal of Algorithms
%K jalg
%V 7
%N 2
%D June 1986
%P 221-231

%A Raghunath Raghavan
%A James Cohoon
%A Sartaj Sahni
%T Single bend wiring
%J Journal of Algorithms
%K jalg
%V 7
%N 2
%D June 1986
%P 232-257

%A Joseph O'Rourke
%A Alok Aggarwal
%A Sanjeev Maddila
%A Michael Baldwin
%T An optimal algorithm for finding minimal enclosing triangles
%J Journal of Algorithms
%K jalg
%V 7
%N 2
%D June 1986
%P 258-269

%A Max L. Warshauer
%T Conway's parallel sorting algorithm
%J Journal of Algorithms
%K jalg
%V 7
%N 2
%D June 1986
%P 270-276

%A Michael Werman
%A Shmuel Peleg
%A Robert Melter
%A T.Y. Kong
%T Bipartite graph matching for points on a line or a cicrle
%J Journal of Algorithms
%K jalg
%V 7
%N 2
%D June 1986
%P 277-284

%A Mikhail J. Atallah
%T Computing the convex hull of line intersections
%J Journal of Algorithms
%K jalg
%V 7
%N 2
%D June 1986
%P 285-288

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 7
%N 2
%D June 1986
%P 289-305

%A Neil Robertson
%A P.D. Seymour
%T Graph minors II: algorithmic aspects of tree-widths
%J Journal of Algorithms
%K jalg
%V 7
%N 3
%D September 1986
%P 309-322

%A J.L. Lewandowski
%A C.L. Liu
%A J.W.S. Liu
%T An algorithmic proof
of a generalization of the Birkhoff-von Neumann theorem
%J Journal of Algorithms
%K jalg
%V 7
%N 3
%D September 1986
%P 323-330

%A Tuvi Etzion
%T An algorithm for constructing m-ary de Bruijn sequences
%J Journal of Algorithms
%K jalg
%V 7
%N 3
%D September 1986
%P 331-340

%A Mai Thanh
%A V.S. Alagar
%A T.D. Bui
%T Optimal expected-time algorithms for merging
%J Journal of Algorithms
%K jalg
%V 7
%N 3
%D September 1986
%P 341-357

%A Nimrod Megiddo
%A Eitan Zemel
%T An O(n log n) randomizing algorithm
for the weighted Euclidean 1-center problem
%J Journal of Algorithms
%K jalg
%V 7
%N 3
%D September 1986
%P 358-368

%A Alok Aggarwal
%A Robert C. Melville
%T Fast computation of the modality of polygons
%J Journal of Algorithms
%K jalg
%V 7
%N 3
%D September 1986
%P 369-381

%A Dana Richards
%T Finding short cycles in planar graphs using separators
%J Journal of Algorithms
%K jalg
%V 7
%N 3
%D September 1986
%P 382-394

%A Keith Brinck
%T On deletion in threaded binary trees
%J Journal of Algorithms
%K jalg
%V 7
%N 3
%D September 1986
%P 395-411

%A J.H. Hester
%A D.S. Hirschberg
%A S.-H.S. Huang
%A C.K. Wong
%T Faster construction of optimal split trees
%J Journal of Algorithms
%K jalg
%V 7
%N 3
%D September 1986
%P 412-424

%A J.M. Robson
%T Algorithms for maximum independent sets
%J Journal of Algorithms
%K jalg
%V 7
%N 3
%D September 1986
%P 425-440

%A Michael S. Paterson
%A F. Frances Yao
%T Point retrieval for polygons
%J Journal of Algorithms
%K jalg
%V 7
%N 3
%D September 1986
%P 41-447

%A Ker-I Ko
%A Shia-Chung Teng
%T On the number of queries necessary to identify a permutation
%J Journal of Algorithms
%K jalg
%V 7
%N 4
%D December 1986
%P 449-462

%A Phillippe Flajolet
%A Nasser Saheb
%T The complexity of generating an exponentially distributed variable
%J Journal of Algorithms
%K jalg
%V 7
%N 4
%D December 1986
%P 463-488

%A Micha Hofri
%A Sami Kahmi
%T A stochastic analysis of the NFD bin-packing algorithm
%J Journal of Algorithms
%K jalg
%V 7
%N 4
%D December 1986
%P 489-509

%A Michael Kaufmann
%A Kurt Mehlhorn
%T Routing through a generalized switchbox
%J Journal of Algorithms
%K jalg
%V 7
%N 4
%D December 1986
%P 510-531

%A B.S. Baker
%A S.J. Fortune
%A S.R. Mahaney
%T Polygon containment under translation
%J Journal of Algorithms
%K jalg
%V 7
%N 4
%D December 1986
%P 532-548

%A Pawel Winter
%T Generalized Steiner problem in series-parallel networks
%J Journal of Algorithms
%K jalg
%V 7
%N 4
%D December 1986
%P 549-566

%A Noga Alon
%A Laszlo Babai
%A Alon Itai
%T A fast and simple randomized parallel algorithm
for the maximal independent set problem
%J Journal of Algorithms
%K jalg
%V 7
%N 4
%D December 1986
%P 567-583

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 7
%N 4
%D December 1986
%P 584-601

%A Hiroshi Imai
%A Takao Asano
%T Dynamic orthogonal segment intersection search
%J Journal of Algorithms
%K jalg
%V 8
%N 1
%D March 1987
%P 1-18

%A Richard Cole
%A Chee K. Yap
%T Shape from probing
%J Journal of Algorithms
%K jalg
%V 8
%N 1
%D March 1987
%P 19-38

%A Howard J. Karloff
%A David B. Shmoys
%T Efficient parallel algorithms for edge coloring problems
%J Journal of Algorithms
%K jalg
%V 8
%N 1
%D March 1987
%P 39-52

%A Jan K. Pachl
%T A lower bound for probabilistic distributed algorithms
%J Journal of Algorithms
%K jalg
%V 8
%N 1
%D March 1987
%P 53-65

%A Alejandro A. Schaffer
%A Christopher J. van\ Wyk
%T Convex hulls of piecewise-smooth Jordan curves
%J Journal of Algorithms
%K jalg
%V 8
%N 1
%D March 1987
%P 66-94

%A George Steiner
%T Searching in 2-dimensional partial orders
%J Journal of Algorithms
%K jalg
%V 8
%N 1
%D March 1987
%P 95-105

%A Moon Jung Chung
%T O(n^2.5) time algorithms for the subgraph homeomorphism problem on trees
%J Journal of Algorithms
%K jalg
%V 8
%N 1
%D March 1987
%P 106-112

%A John L. Mohammed
%A Carlos S. Subi
%T An improved block-interchange algorithm
%J Journal of Algorithms
%K jalg
%V 8
%N 1
%D March 1987
%P 113-121

%A George Georgakopoulos
%A Christos H. Papadimitriou
%T The 1-Steiner tree problem
%J Journal of Algorithms
%K jalg
%V 8
%N 1
%D March 1987
%P 122-130

%A Helaman R.P. Ferguson
%T A non-inductive GL(n,Z) algorithm that constructs integral linear relations
for n Z-linearly dependent real numbers
%J Journal of Algorithms
%K jalg
%V 8
%N 1
%D March 1987
%P 131-145

%A Shou-Hsuan Stephen Huang
%T Optimal multiway split trees
%J Journal of Algorithms
%K jalg
%V 8
%N 1
%D March 1987
%P 146-156

%A M.D. Atkinson
%T An optimal algorithm for geometrical congruence
%J Journal of Algorithms
%K jalg
%V 8
%N 2
%D June 1987
%P 159-172

%A J.C. Lagarias
%A A.M. Odlyzko
%T Computing pi(x): an analytic method
%J Journal of Algorithms
%K jalg
%V 8
%N 2
%D June 1987
%P 173-191

%A Daniel Leven
%A Micha Sharir
%T An efficient and simple motion planning algorithm
for a ladder amidst polygonal barriers
%J Journal of Algorithms
%K jalg
%V 8
%N 2
%D June 1987
%P 192-215

%A M.W. Bern
%A E.L. Lawler
%A A.L. Wong
%T Linear-time computation of optimal subgraphs of decomposable graphs
%J Journal of Algorithms
%K jalg
%V 8
%N 2
%D June 1987
%P 216-235

%A B. Pittel
%T Linear probing: the probable largest search time
grows logarithmically with the number of records
%J Journal of Algorithms
%K jalg
%V 8
%N 2
%D June 1987
%P 236-249

%A V. Rodl
%A C. Tovey
%T Multiple optima in local search
%J Journal of Algorithms
%K jalg
%V 8
%N 2
%D June 1987
%P 250-259

%A T. Lengauer
%T Efficient algorithms for finding maximum spanning forests
of hierarchically defined graphs
%J Journal of Algorithms
%K jalg
%V 8
%N 2
%D June 1987
%P 260-284

%A David S. Johnson
%T The NP-completeness column: an ongoing guide
%J Journal of Algorithms
%K jalg
%V 8
%N 2
%D June 1987
%P 285-303