%A J. Hartmanis
%A T.P. Baker
%T On simple Goedel numberings and translations
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 1
%D March 1975
%P 1-11

%A Dennis P. Geller
%T Realization with feedback encoding, I:
analogues of the classical theory
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 1
%D March 1975
%P 12-33

%A Dennis P. Geller
%T Realization with feedback encoding, II:
applications to distinguishing sequences
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 1
%D March 1975
%P 34-48

%A Robert Mandl
%A Thomas Vari
%T Computational complexity of inner products of vectors
(and that of other bilinear forms) over a noncommutative ring
(auxiliary functions allowed)
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 1
%D March 1975
%P 49-55

%A Kapili P. Eswaran
%T Faithful representation of a family of sets by a set of intervals
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 1
%D March 1975
%P 56-68

%A Jeanne Ferrante
%A Charles Rackoff
%T A decision procedure for the first order theory of real addition with order
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 1
%D March 1975
%P 69-76

%A Donald B. Johnson
%T Finding all the elementary circuits of a directed graph
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 1
%D March 1975
%P 77-84

%A Eugene S. Santos
%T State-splitting for stochastic machines
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 1
%D March 1975
%P 85-96

%A Webb Miller
%T Computational complexity and numerical stability
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 2
%D June 1975
%P 97-107

%A S.S. Lavenberg
%A G.S. Shedler
%T Derivation of confidence intervals for work rate estimators
in a closed queuing network
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 2
%D June 1975
%P 108-124

%A Edward Ashcroft
%A Zohar Manna
%T Translating program schemas to while-schemas
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 2
%D June 1975
%P 125-146

%A D.J. Kuck
%A K. Maruyama
%T Time bounds on the parallel evaluation of arithmetic expressions
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 2
%D June 1975
%P 147-162

%A Andrew D. Hall,\ Jr.
%T Solving a problem in eigenvalue approximation with a symbolic algebra system
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 2
%D June 1975
%P 163-174

%A Abraham Lempel
%T Matrix factorization over GF(2) and trace-orthogonal bases of GF(2)
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 2
%D June 1975
%P 175-186

%A M.R. Garey
%A R.L. Graham
%T Bounds for multiprocessor scheduling with resource constraints
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 2
%D June 1975
%P 187-200

%A Ellis Horowitz
%A Sartaj Sahni
%T The computation of powers of symbolic polynomials
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 2
%D June 1975
%P 201-208

%A D.E. White
%A S.G. Williamson
%T Computational algorithms for the enumeration of group invariant partitions
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 209-213

%A Vaughan R. Pratt
%T Every prime has a succinct certificate
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 214-220

%A F. Hadlock
%T Finding a maximum cut of a planar graph in polynomial time
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 221-225

%A Ravi Sethi
%T Complete register allocation problems
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 226-248

%A Ashok K. Chandra
%A C.K. Wong
%T Worst-case analysis of a placement algorithm related to storage allocation
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 249-263

%A R.L. Drysdale,\ III
%A Frank H. Young
%T Improved divide/sort/merge sorting networks
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 264-270

%A R.M. Karp
%A A.C. McKellar
%A C.K. Wong
%T Near-optimal solutions to a 2-dimensional placement problem
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 271-286

%A Arnold L. Rosenberg
%T Managing storage for extendible arrays
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 287-306

%A H.R. Strong,\ Jr.
%A Maggiolo Schettini
%A B.K. Rosen
%T Recursion structure simplification
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 307-320

%A R. Bumby
%A E. Cooper
%A D. Latch
%T Interactive computation of homology of finite partially ordered sets
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 321-325

%A Vaughan R. Pratt
%T The power of negative thinking in multiplying boolean matrices
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 326-330

%A S. Rao Kosaraju
%T Speed of recognition of context-free languages by array automata
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 331-340

%A W.H. Hosken
%T Optimum partitions of tree addressing structures
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 341-347

%A Leslie G. Valiant
%T Parallelism in comparison problems
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 348-355

%A H. Opderbeck
%A W.W. Chu
%T The renewal model for problem behavior
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 356-374

%A P.M. Spira
%A A. Pan
%T On finding and updating spanning trees and shortest paths
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 375-380

%A L. Revah
%T On the number of multiplications/divisions
evaluating a polynomial with auxiliary functions
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 381-392

%A Shimon Even
%T An algorithm for determining
whether the connectivity of a graph is at least k
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 3
%D September 1975
%P 393-396

%A M.R. Garey
%A D.S. Johnson
%T Complexity results for multiprocessor scheduling under resource constraints
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 4
%D December 1975
%P 397-411

%A D. Brand
%T Proving theorems with the modification method
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 4
%D December 1975
%P 412-430

%A Theodore Baker
%A John Gill
%A Robert Solovay
%T Relativizations of the P =? NP question
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 4
%D December 1975
%P 431-442

%A Arnold L. Rosenberg
%T Preserving proximity in arrays
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 4
%D December 1975
%P 443-460

%A Erol Gelenbe
%A Jacques Lenfant
%A Dominique Potier
%T Response time of a fixed-head disk to transfers of variable length
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 4
%D December 1975
%P 461-473

%A D.M. Jackson
%A G.H.J. van\ Rees
%T The enumeration of
generalized double stochastic nonnegative integer square matrices
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 4
%D December 1975
%P 474-477

%A John Bruno
%A Micha Hofri
%T On scheduling chains of jobs on one processor with limited preemption
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 4
%D December 1975
%P 478-490

%A M.D. Alder
%T A convergence theorem for hierarchies of model neurons
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 4
%D December 1975
%P 491-506

%A Shimon Even
%A R. Endre Tarjan
%T Network flow and testing graph connectivity
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 4
%D December 1975
%P 507-518

%A Matthew S. Hecht
%A Jeffrey D. Ullman
%T A simple algorithm for global data flow analysis problems
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 4
%D December 1975
%P 519-532

%A A.V. Aho
%A K. Steiglitz
%A J.D. Ullman
%T Evaluating polynomials at fixed sets of points
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 4
%D December 1975
%P 533-539

%A Alan G. Konheim
%T An elementary solution of the queuing system G/G/1
%J SIAM Journal on Computing
%K siam_jc
%V 4
%N 4
%D December 1975
%P 540-545

%A Ian Munro
%A Philip M. Spira
%T Sorting a searching in multisets
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 1-8

%A Alon Itai
%T Optimal alphabetic trees
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 9-18

%A Ronald L. Rivest
%T Partial-match retrieval algorithm
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 19-50

%A Lawrence J. Mazlack
%T Machine selection of elements in crossword puzzles:
an application of computational linguistics
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 51-72

%A Ravi Sethi
%T Scheduling graphs on two processors
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 73-82

%A Michael L. Fredman
%T New bounds on the complexity of the shortest path problem
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 83-89

%A Prabhaker Mateti
%A Narsingh Deo
%T On algorithms for enumerating all circuits of a graph
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 90-99

%A Andrew Chi-Chih Yao
%T On the evaluation of powers
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 100-103

%A S. Goodman
%A S. Hedetniemi
%A R.E. Tarjan
%T b-matchings in trees
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 104-108

%A Laurent Hyafil
%T Bounds for selection
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 109-114

%A A.V. Aho
%A J.E. Hopcroft
%A J.D. Ullman
%T On finding lowest common ancestors in trees
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 115-132

%A Tatsuo Ohtsuki
%T A fast algorithm for finding an optimal ordering
for vertex elimination on a graph
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 133-145

%A Allan Borodin
%A Stephen Cook
%T On the number of additions to compute specific polynomials
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 146-157

%A Ken Kennedy
%T A comparison of two algorithms for global data flow analysis
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 1
%D March 1976
%P 158-180

%A David Dobkin
%A Richard J. Lipton
%T Multidimensional searching problems
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 2
%D June 1976
%P 181-186

%A Robert L. Probert
%T On the additive complexity of matrix multiplication
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 2
%D June 1976
%P 187-203

%A Webb Miller
%T Graph transformations for roundoff analysis
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 2
%D June 1976
%P 204-216

%A I.H. Sudborough
%A A. Zalcberg
%T On families of languages defined by time-bounded random access machines
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 2
%D June 1976
%P 217-230

%A Thomas G. Szymanski
%A John H. Williams
%T Noncanonical extensions of bottom-up parsing techniques
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 2
%D June 1976
%P 231-250

%A Y. Edmund Lien
%T Termination properties of generalized Petri nets
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 2
%D June 1976
%P 251-265

%A Donald J. Rose
%A R. Endre Tarjan
%A George S. Lueker
%T Algorithmic aspects of vertex elimination of graphs
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 2
%D June 1976
%P 266-283

%A Sven Skyum
%T Decomposition theorems for various kinds of languages parallel in nature
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 2
%D June 1976
%P 284-296

%A Jay P. Fillmore
%A S.G. Williamson
%T Ranking algorithms: the symmetries and colorations of the n-cube
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 2
%D June 1976
%P 297-304

%A Leon S. Levy
%T Local adjunct languages and regular sets
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 2
%D June 1976
%P 305-308

%A Arthur Bernstein
%T Synthesizing a response function with a feedback scheduling algorithm
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 2
%D June 1976
%P 309-317

%A D. Bollman
%T On preserving proximity in extendible arrays
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 2
%D June 1976
%P 318-323

%A Volker Strassen
%T Computational complexity over finite fields
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 2
%D June 1976
%P 324-331

%A E.A. Ashcroft
%A W.W. Wadge
%T Lucid - a formal system for writing and proving programs
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 3
%D September 1976
%P 336-354

%A Susan L. Gerhart
%T Proof theory of partial correctness verification systems
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 3
%D September 1976
%P 355-377

%A Peter J. Downey
%A Ravi Sethi
%T Correct computation rules for recursive languages
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 3
%D September 1976
%P 378-401

%A Ashok K. Chandra
%T Generalized program schemas
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 3
%D September 1976
%P 402-413

%A Zohar Manna
%A Adi Shamir
%T The theoretical aspects of the optimal fixedpoint
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 3
%D September 1976
%P 414-426

%A Steven S. Muchnick
%T Computational complexity of multiple recursive schemata
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 3
%D September 1976
%P 427-451

%A G.D. Plotkin
%T A powerdomain construction
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 3
%D September 1976
%P 452-487

%A Christopher P. Wadsworth
%T The relation between computational and denotational properties
for Scott's Domega-models of the lambda-calculus
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 3
%D September 1976
%P 488-521

%A Dana Scott
%T Data types as lattices
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 3
%D September 1976
%P 522-587

%A Bharat Kinariwala
%A Kabekode V.S. Bhat
%T Theory of output set assignments and degree switching operations
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 589-601

%A S.G. Williamson
%T Ranking algorithms for lists of partitions
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 602-617

%A L. Csanky
%T Fast parallel matrix inversion algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 618-623

%A Roger W. Brockett
%A David Dobkin
%T On the number of multiplications required for matrix multiplication
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 624-628

%A Takao Asano
%A Michiro Shibui
%A Itsuo Takanami
%T General results on tour lengths in machines and digraphs
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 629-645

%A Robert M. Solovay
%T On sets Cook-reducible to sparse sets
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 646-652

%A Kapali P. Eswaran
%A R. Endre Tarjan
%T Augmentation problems
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 653-665

%A John C. Cherniavsky
%T Simple programs realize exactly Presburger formulas
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 666-677

%A Amnon Barak
%A Eliahu Shamir
%T On the parallel evaluation of boolean expressions
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 678-681

%A Frances Y. Chin
%T A generalized asymptotic upper bound
on fast polynomial evaluation and interpolation
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 682-690

%A S. Even
%A A. Itai
%A A. Shamir
%T On the complexity of timetable and multicommodity flow problems
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 691-703

%A M.R. Garey
%A D.S. Johnson
%A R. Endre Tarjan
%T The planar Hamiltonian circuit problem is NP-complete
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 704-714

%A W.J. Hendricks
%T An account of self-organizing systems
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 715-723

%A David Cheriton
%A Robert Endre Tarjan
%T Finding minimum spanning trees
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 724-742

%A Alan Jay Smith
%T Analysis of the optimal look-ahead demand paging algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 5
%N 4
%D December 1976
%P 743-757

%A Derek A. Zave
%T Optimal polyphase sorting
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 1-39

%A Donald L. Adolphson
%T Single machine job sequencing with precedence constraints
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 40-54

%A Arnie Rosenthal
%A Anita Goldner
%T Smallest augmentations to biconnect a graph
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 55-66

%A Lawrence T. Kou
%T Polynomial complete consecutive information retrieval problems
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 67-75

%A Christos H. papadimitriou
%A Kenneth Steiglitz
%T On the complexity of local search for the traveling salesman problem
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 76-83

%A R. Solovay
%A V. Strassen
%T A fast Monte-Carlo test for primality
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 84-85

%A K. Aoshima
%A M. Iri
%T Comments on F. Hadlock's paper:
"Finding a maximum cut of a planar graph in polynomial time
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 86-87

%A Peter B. Henderson
%A Yechezkel Zalcstein
%T A graph-theoretic characterization
of the PVchunk class of synchronizing primitives
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 88-108

%A T.G. Szymanski
%A J.D. Ullman
%T Evaluating relational expressions with dense and sparse arguments
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 109-122

%A Seymour Ginsburg
%A Nancy Lynch
%T Derivation complexity in context-free grammar forms
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 123-138

%A Harold N. Gabow
%T Two algorithms for generating weighted spanning trees in order
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 139-150

%A Sukhamay Kundu
%A Jayadev Misra
%T A linear tree partitioning algorithm
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 151-154

%A Teofilo Gonzalez
%A Oscar H. Ibarra
%A Sartaj Sahni
%T Bounds for LPT schedules on uniform processors
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 155-166

%A D.G. Kafura
%A V.Y. Shen
%T Task scheduling on a multiprocessor system with independent memories
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 167-187

%A David G. Kirkpatrick
%A Zvi M. Kedem
%T Addition requirements for rational functions
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 1
%D March 1977
%P 188-199

%A masahiro Miyakawa
%A Toshitsugu Yura
%A Yoshio Sugito
%A Mamoru Hoshi
%T Optimum sequence trees
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 2
%D June 1977
%P 201-234

%A Kurt Mehlhorn
%T A best possible bound for the weighted path length of binary search trees
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 2
%D June 1977
%P 235-239

%A Robert Sedgewick
%T Quicksort with equal keys
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 2
%D June 1977
%P 240-267

%A Janet Fabri
%T Some remarks on p-way merging
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 2
%D June 1977
%P 268-271

%A Aravind K. Joshi
%A Leon S. Levy
%T Constraints on structural descriptions: local transformations
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 2
%D June 1977
%P 272-284

%A T. Hikita
%A A. Nozaki
%T A completeness criterion for spectra
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 2
%D June 1977
%P 285-297

%A Nicholas Pippenger
%T Superconcentrators
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 2
%D June 1977
%P 298-304

%A L. Berman
%A J. Hartmanis
%T On isomorphisms and density of NP and other complete sets
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 2
%D June 1977
%P 305-322

%A Donald E. Knuth
%A James H. Morris,\ Jr.
%A Vaughan R. Pratt
%T Fast pattern matching in strings
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 2
%D June 1977
%P 323-350

%A Luis Trabb Pardo
%T Stable sorting and merging with optimal space and time bounds
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 2
%D June 1977
%P 351-372

%A W.F. McColl
%A M.S. Patterson
%T The depth of all boolean functions
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 2
%D June 1977
%P 373-380

%A David B. Benson
%T Some preservation properties of normal form grammars
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 2
%D June 1977
%P 381-402

%A Bruce D. Russell
%T Implementation correctness involving a language with goto statements
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 403-415

%A M.R. Garey
%A D.S. Johnson
%T Two-processor scheduling with start-times and deadlines
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 416-426

%A Wolfgang J. Paul
%T A 2.5n-lower bound on the combinational complexity of boolean functions
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 427-443

%A Zvi Galil
%T On resolution with clauses of bounded size
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 444-459

%A Y. Igarashi
%T The tape complexity of some classes of Szilard languages
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 460-466

%A Richard E. Ladner
%T The computational complexity of provability
in systems of modal propositional logic
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 467-480

%A D.L. Adolphson
%A G.N. Thomas
%T A linear time algorithm for a 2*n transportation problem
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 481-486

%A Joel I. Seiferas
%T Linear-time computation by nondeterministic multidimensional iterative arrays
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 487-504

%A Shuji Tsukiyama
%A Mikio Ide
%A Hiromu Ariyoshi
%A Isao Shirakawa
%T A new algorithm for generating all the maximal independent sets
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 505-517

%A Shui Lam
%A Ravi Sethi
%T Worst case analysis if two scheduling algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 518-536

%A Robert Endre Tarjan
%A Anthony E. Trojanowski
%T Finding a maximum independent set
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 537-546

%A Erik Meineche Schmidt
%A Thomas G. Szymanski
%T Succinctness of descriptions of unambiguous context-free languages
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 547-553

%A Franci Y. Chen
%T The partial fraction expansion problem and its inverse
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 554-562

%A Daniel J. Rosenkrtantz
%A Richard E. Stearns
%A Philip M. Lewis,\ II
%T An analysis of several heuristics for the traveling salesman problem
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 563-581

%A H.T. Kung
%A D.M. Tong
%T Fast algorithms for partial fraction decomposition
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 582-593

%A D.T. Lee
%A F.P. Preparata
%T Location of a point in a planar subdivision and its applications
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 3
%D September 1977
%P 594-606

%A David L. Russell
%T Internal fragmentation in a class of buddy systems
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 4
%D December 1977
%P 607-621

%A Adriano M. Garsia
%A Michelle L. Wachs
%T A new algorithm for minimum cost binary trees
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 4
%D December 1977
%P 622-642

%A V. Chvatal
%T Determining the stability number of a graph
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 4
%D December 1977
%P 643-662

%A Richard G. Larson
%T Minimizing garbage collection as a function of region size
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 4
%D December 1977
%P 663-668

%A Ronald L. Rivest
%T On the worst-case behavior of string-searching algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 4
%D December 1977
%P 669-674

%A John Gill
%T Computational complexity of probabilistic Turing machines
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 4
%D December 1977
%P 675-695

%A John S. Carson
%A Averill M. Law
%T A note on Spira's algorithm for the all-pairs shortest-path problem
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 4
%D December 1977
%P 696-699

%A Bernard J. Fino
%A V. Ralph Algazi
%T A unified treatment of discrete fast unitary transforms
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 4
%D December 1977
%P 700-717

%A Jayadev Misra
%T Prospects and limitations of automatic assertion generation for loop programs
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 4
%D December 1977
%P 718-729

%A Steven W. Reyner
%T An analysis of a good algorithm for the subtree problem
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 4
%D December 1977
%P 730-732

%A Allan Borodin
%T On relating time and space to size and depth
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 4
%D December 1977
%P 733-744

%A F. Ruskey
%A T.C. Hu
%T Generating binary trees lexicographically
%J SIAM Journal on Computing
%K siam_jc
%V 6
%N 4
%D December 1977
%P 745-758

%A E.G. Coffman,\ Jr.
%A M.R. Garey
%A D.S. Johnson
%T An application of bin-packing to multiprocessor scheduling
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 1
%D February 1978
%P 1-17

%A R. Michael Tanner
%T Minimean merging and sorting: an algorithm
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 1
%D February 1978
%P 18-38

%A Michael Machtey
%A Karl Winklmann
%A Paul Young
%T Simple Godel numberings, isomorphisms, and programming properties
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 1
%D February 1978
%P 39-60

%A Richard J. Lipton
%T Polynomials with 0-1 coefficients that are hard to evaluate
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 1
%D February 1978
%P 61-69

%A Stephen A. Cook
%T Soundness and completeness of an axiom system for program verification
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 1
%D February 1978
%P 70-90

%A Robert L. Probert
%T An extension of computational duality to sequences of bilinear computations
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 1
%D February 1978
%P 91-98

%A H.B. Hunt,\ III
%A D.J. Rosenkrantz
%T Computational parallels between the regular and context-free languages
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 1
%D February 1978
%P 99-114

%A Joachim Biskup
%T The time measure of one-tape Turing machines
does not have the parallel computation property
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 1
%D February 1978
%P 115-117

%A Nancy Lynch
%A Richard J. Lipton
%T On structure preserving reductions
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 2
%D May 1978
%P 119-126

%A C.P. Schnorr
%T An algorithm for transitive closure with linear expected time
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 2
%D May 1978
%P 127-133

%A Michael L. Fredman
%T Observations on the complexity of generating quasi-Gray codes
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 2
%D May 1978
%P 134-146

%A Donald B. Johnson
%A Tetsuo Mizoguchi
%T Selecting the kth element in X+Y and X1 + X2 + ... + Xm
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 2
%D May 1978
%P 147-153

%A Nimrod Megiddo
%A Arie Tamir
%T An O(N log N) algorithm for a class of matching problems
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 2
%D May 1978
%P 154-157

%A H.A. Maurer
%A A. Salomaa
%A D. Wood
%T On good EOL forms
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 2
%D May 1978
%P 158-166

%A Ronald V. Book
%A Maurice Nivat
%T Linear languages and the intersection closures of classes of languages
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 2
%D May 1978
%P 167-177

%A Greg N. Frederickson
%A Matthew S. Hecht
%A Chul E. Kim
%T Approximation algorithms for some routing problems
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 2
%D May 1978
%P 178-193

%A Celia Wrathall
%T Rudimentary predicates and relative computation
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 2
%D May 1978
%P 194-209

%A A.G. Konheim
%A M. Reiser
%T Finite capacity queueing systems with applications in computer modeling
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 2
%D May 1978
%P 210-229

%A Eshrat Reghbati
%A D.G. Corneil
%T Parallel computations in graph theory
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 2
%D May 1978
%P 230-237

%A Robert Sedgewick
%T Data movement in odd-even merging
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 3
%D August 1978
%P 239-272

%A Kellogg S. Booth
%T Isomorphism testing for graphs, semigroups, and finite automata
are polynomially equivalent problems
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 3
%D August 1978
%P 273-279

%A Harold N. Gabow
%A Eugene W. Myers
%T Finding all spanning trees of directed and undirected graphs
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 3
%D August 1978
%P 280-287

%A Ronald Fagin
%A Thomas G. Price
%T Efficient calculation of expected miss ratios
in the independent reference model
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 3
%D August 1978
%P 288-297

%A Mark R. Brown
%T Implementation and analysis of binomial queue algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 3
%D August 1978
%P 298-319

%A E. Mark Gold
%T Deadlock prediction: easy and difficult cases
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 3
%D August 1978
%P 320-336

%A Christopher P. Wadsworth
%T Approximate reduction and lambda calculus models
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 3
%D August 1978
%P 337-356

%A Robert A. Wagner
%A Joel I. Seiferas
%T Correcting counter-automaton-recognizable languages
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 3
%D August 1978
%P 357-375

%A Brenda S. Baker
%T Generalized syntax directed translation, tree transducers, and linear space
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 3
%D August 1978
%P 376-391

%A John Bruno
%A Peter Downey
%T Complexity of task sequencing
with deadlines, set-up times and changeover costs
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 4
%D November 1978
%P 393-404

%A Daniel J. Rosenkrantz
%A Harry B. Hunt,\ III
%T Polynomial algorithms for deterministic pushdown automata
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 4
%D November 1978
%P 405-412

%A Alon Itai
%A Michael Rodeh
%T Finding a minimum circuit in a graph
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 4
%D November 1978
%P 413-423

%A Frank Ruskey
%T Generating t-ary trees lexicographically
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 4
%D November 1978
%P 424-439

%A Alan L. Selman
%T Polynomial time enumeration reducibility
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 4
%D November 1978
%P 440-457

%A David Plaisted
%T Some polynomial and integer divisibility problems are NP-hard
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 4
%D November 1978
%P 458-464

%A Arnold L. Rosenberg
%A Lawrence Snyder
%T Minimal-comparison 2,3-trees
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 4
%D November 1978
%P 465-480

%A Paul W. Purdom
%T Tree size by partial backtracking
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 4
%D November 1978
%P 481-491

%A Anthony E. Trojanowski
%T Ranking and listing algorithms for k-ary trees
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 4
%D November 1978
%P 492-509

%A Nicholas Pippenger
%T Generalized connectors
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 4
%D November 1978
%P 510-514

%A Andrew Chi-Chih Yao
%T On the loop switching addressing problem
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 4
%D November 1978
%P 515-523

%A Oscar H. Ibarra
%T The unsolvability of the equivalence problem for epsilon-free NGSM's
with unary input (output) alphabet and applications
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 4
%D November 1978
%P 524-532

%A Theodore P. Baker
%T A technique for extending rapid exact-match string matching
to arrays of more than one dimension
%J SIAM Journal on Computing
%K siam_jc
%V 7
%N 4
%D November 1978
%P 533-541

%A Colin McDiarmid
%T Determining the chromatic number of a graph
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 1
%D February 1979
%P 1-14

%A Yossi Shiloach
%T A minimum linear arrangement algorithm for undirected trees
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 1
%D February 1979
%P 15-32

%A Mark R. Brown
%T A partial analysis of random height-balanced trees
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 1
%D February 1979
%P 33-41

%A Raymond E. Miller
%A Nicholas Pippenger
%A Arnold L. Rosenberg
%A Lawrence Snyder
%T Optimal 2,3-trees
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 1
%D February 1979
%P 42-59

%A Vijay A. Aggarwal
%A James W. Burgmeier
%T A round-off error model with applications to arithmetic expressions
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 1
%D February 1979
%P 60-72

%A S. Zaks
%A D. Richards
%T Generating trees and other combinatorial objects lexicographically
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 1
%D February 1979
%P 73-81

%A James R. Bitner
%T Heuristics that dynamically organize data structures
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 1
%D February 1979
%P 82-110

%A J. Opatrny
%T Total ordering problem
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 1
%D February 1979
%P 111-114

%A L.H. Harper
%A J.E. Savage
%T Lower bounds on synchronous combinational complexity
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 2
%D May 1979
%P 115-119

%A Laurent Hyafil
%T On the parallel evaluation of multivariate polynomials
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 2
%D May 1979
%P 120-123

%A E.C.R. Hehner
%A R.N.S. Horspool
%T A new representation of the rational numbers for fast easy arithmetic
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 2
%D May 1979
%P 124-134

%A Alon Itai
%A Yossi Shiloach
%T Maximum flow in planar networks
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 2
%D May 1979
%P 135-150

%A Larry J. Stockmeyer
%A Ashok K. Chandra
%T Provably difficult combinatorial games
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 2
%D May 1979
%P 151-174

%A Kurt Mehlhorn
%T Dynamic binary search
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 2
%D May 1979
%P 175-198

%A Carl R. Carlson
%T A counterexample to Reingold's pushdown permuter characterization problem
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 2
%D May 1979
%P 199-201

%A E.G. Coffman,\ Jr.
%A Joseph Y-T. Leung
%T Combinatorial analysis of an efficient algorithm
for processor and storage allocation
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 2
%D May 1979
%P 202-217

%A A.V. Aho
%A Y. Sagiv
%A J.D. Ullman
%T Equivalences among relational expressions
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 2
%D May 1979
%P 218-246

%A Kenichi Hagihara
%A Minoru Ito
%A Kenichi Taniguchi
%A Tadao Kasami
%T Decision problems for multivalued dependencies in relational databases
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 2
%D May 1979
%P 247-264

%A C.P. Schnorr
%T Bottlenecks and edge connectivity in unsymmetrical networks
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 2
%D May 1979
%P 265-272

%A Sartaj Sahni
%A Yookun Cho
%T Nearly on line scheduling of a uniform processor system with release times
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 2
%D May 1979
%P 273-285

%A David R. Stoutmyer
%T Automatic asymptotic and big-O calculations via computer algebra
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 287-299

%A Paul S. Wang
%A Barry M. Trager
%T New algorithms for polynomial square-free decomposition over the integers
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 300-305

%A Michael C. Wirth
%T Symbolic vector and dyadic analysis
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 306-319

%A H.I. Epstein
%T A natural structure theorem for complex fields
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 320-325

%A Dorothea A. Klip
%T New algorithms for polynomial multiplication
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 326-343

%A J. McKay
%T Some remarks on computing Galois groups
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 344-347

%A David Y.Y. Yun
%T Uniform bounds for a class of algebraic mappings
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 348-356

%A Michael Rothstein
%A B.F. Caviness
%T A structure theorem for exponential and primitive functions
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 357-367

%A Andrew Chi-Chih Yao
%T The complexity of pattern matching for a random string
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 368-387

%A L.J. Stockmeyer
%A C.K. Wong
%T On the number of comparisons to find the intersection of two relations
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 388-404

%A C.H. Papadimitriou
%A M. Yannakakis
%T Scheduling interval-ordered tasks
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 405-409

%A Leslie G. Valiant
%T The complexity of enumeration and relation problems
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 410-421

%A Yossi Shiloach
%T Multi-terminal 0-1 flow
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 422-430

%A Steven Fortune
%T A note on sparse complete sets
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 431-433

%A Ronald V. Book
%T Polynomial space and transitive closure
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 434-439

%A David W. Walkup
%T On the expected value of a random assignment problem
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 440-442

%A Joseph Ja'Ja'
%T Optimal evaluation of pairs of bilinear forms
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 3
%D August 1979
%P 443-462

%A Gaston H. Gonnet
%A J. Ian Munro
%T Efficient ordering of hash tables
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 463-478

%A J.R. Bitner
%A C.K. Wong
%T Optimal and near-optimal scheduling algorithms
for batched processing in linear storage
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 479-498

%A Ravindran Kannan
%A Achim Rachem
%T Polynomial algorithms for computing
the Smith and Hermite forms of an integer matrix
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 499-507

%A Lutz Priese
%T Towards a precise characterization
of the complexity of universal and nonuniversal Turing machines
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 508-523

%A A. Bagchi
%A J.K. Roy
%T On V-optimal trees
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 524-541

%A F.P. Preparata
%T A note on locating a set of points in a planar subdivision
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 542-545

%A James Donahue
%T On the semantics of "data types"
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 546-560

%A Richard M. Karp
%T A patching algorithm for the nonsymmetric traveling-salesman problem
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 561-573

%A Takumi Kasai
%A Akeo Adachi
%A Shigeki Iwata
%T Classes of pebble games and complete problems
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 574-586

%A Elaine J. Weyuker
%T Translatability and decidability questions
for restricted classes of program schemas
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 587-598

%A David Maier
%T An efficient method for storing ancestor information in trees
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 599-618

%A M.S. Krishnammorthy
%A Narsingh Deo
%T Node-deletion NP-complete problems
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 619-625

%A David K. Probst
%A Vangalur S. Alagar
%T A family of algorithms for powering sparse polynomials
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 626-644

%A Adi Shamir
%T A linear time algorithm for finding minimum cutsets in reducible graphs
%J SIAM Journal on Computing
%K siam_jc
%V 8
%N 4
%D November 1979
%P 645-656

%A Alan Tucker
%T An efficient test for circular-arc graphs
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 1-24

%A Stephen L. Bloom
%A Calvin C. Elgot
%A Jesse B. Wright
%T Solutions of the iteration equation
and extensions of the scalar iteration operation
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 25-45

%A Chandra M.R. Kintala
%A Patrick C. Fischer
%T Refining nondeterminism in relativized polynomial-time bounded computations
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 46-53

%A R.P. Brent
%A J.F. Traub
%T On the complexity of composition and generalized composition of power series
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 54-66

%A M.C.B. Hennessy
%T The semantics of call-by-value and call-by-name
in a nondeterministic environment
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 67-84

%A Paul K. Stockmeyer
%A F. Frances Yao
%T On the optimality of linear merge
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 85-90

%A Yookun Cho
%A Sartaj Sahni
%T Bounds for list schedules on uniform processors
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 91-103

%A R. Statman
%T Worst case exponential lower bounds for input resolution with paramodulation
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 104-110

%A C.K. Wong
%A M.C. Easton
%T An efficient method for weighted sampling without replacement
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 111-113

%A J. Hartmanis
%T On the succinctness of different representations of languages
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 114-120

%A David Dobkin
%A Richard J. Lipton
%T Addition chain methods for the evaluation of specific polynomials
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 121-125

%A D.S. Hirschberg
%T On the complexity of searching a set of vectors
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 126-129

%A J.T. Joichi
%A Dennis E. White
%A S.G. Williamson
%T Combinatorial Gray codes
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 130-141

%A P. Flajolet
%A Lyle Ramshaw
%T A note on Gray code and odd-even merge
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 142-158

%A Barry K. Rosen
%T Monoids for rapid data flow analysis
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 159-196

%A Zvi Galil
%T Finding the vertex connectivity of graphs
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 197-199

%A D.T. Lee
%A C.K. Wong
%T Voronoi diagrams in L1 (Linf) metrics with 2-dimensional storage applications
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 200-211

%A Laszlo Babai
%T On the complexity of canonical labeling of strongly regular graphs
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 1
%D February 1980
%P 212-216

%A Yossi Shiloach
%T A multi-terminal minimum cut algorithm for planar graphs
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 2
%D May 1980
%P 219-224

%A S. Winograd
%T On multiplication of polynomials modulo a polynomial
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 2
%D May 1980
%P 225-229

%A Nicholas Pippenger
%T On the evaluation of powers and monomials
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 2
%D May 1980
%P 230-250

%A Salvatore D. Morgera
%T Efficient synthesis and implementation
of large discrete Fourier transformations
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 2
%D May 1980
%P 251-272

%A Michael O. Rabin
%T Probabilistic algorithms in finite fields
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 2
%D May 1980
%P 273-280

%A D.G. Corneil
%A D.G. Kirkpatrick
%T A theoretical analysis of various heuristics
for the graph isomorphism problem
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 2
%D May 1980
%P 281-297

%A F.K. Hwang
%T Optimal merging of 3 elements with n elements
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 2
%D May 1980
%P 298-320

%A V.Ya. Pan
%T New fast algorithms for matrix operations
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 2
%D May 1980
%P 321-342

%A Andrew C. Yao
%A Ronald L. Rivest
%T On the polyhedral decision problem
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 2
%D May 1980
%P 343-347

%A Eitan M. Gurari
%A Oscar H. Ibarra
%T Path systems: constructions, solutions and applications
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 2
%D May 1980
%P 348-374

%A John H. Reif
%T Code motion
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 2
%D May 1980
%P 375-395

%A H.B. Huint,\ III
%A R.L. Constable
%A S. Sahni
%T On the computational complexity of program scheme equivalence
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 2
%D May 1980
%P 396-416

%A Zvi Galil
%A Joel Seiferas
%T Saving space in fast string-matching
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 2
%D May 1980
%P 417-438

%A Hartmut Ehrig
%A Barry K. Rosen
%T The mathematics of record handling
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 441-469

%A D. Stott Parker
%T Conditions for optimality of the Huffman algorithm
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 470-489

%A A. Schonhage
%T Storage modification machines
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 490-508

%A Wojciech Rytter
%T A correct preprocessing algorithm for Boyer-Moore string-searching
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 509-512

%A John R. Gilbert
%A Thomas Lengauer
%A Robert Endre Tarjan
%T The pebbling problem is complete in polynomial space
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 513-524

%A Stephen L. Bloom
%A Calvin C. Elgot
%A Jesse B. Wright
%T Vector iteration in pointed iterative theories
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 525-540

%A Jeffrey M. Jaffe
%T Bounds on the scheduling of typed task systems
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 541-551

%A Bruce W. Weide
%T Random graphs and graph optimization problems
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 552-557

%A E.L. Lawler
%A J.K. Lenstra
%A A.H.G. Rinnooy Kan
%T Generating all maximal independent sets;
NP-hardness and polynomial-time algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 558-565

%A Andrew Chi-Chih Yao
%T Bounds on selection networks
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 566-582

%A Alan George
%A Joseph W.H. Liu
%T An optimal algorithm for symbolic factorization of symmetric matrices
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 583-593

%A Mark R. Brown
%A Robert E. Tarjan
%T Design and analysis of a data structure for representing sorted lists
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 594-614

%A Richard J. Lipton
%A Robert Endre Tarjan
%T Applications of a planar separator theorem
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 615-627

%A Laszlo Babai
%A Paul Erdos
%A Stanley M. Selkow
%T Random graph isomorphism
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 628-635

%A Stephen A. Cook
%A Charles W. Rackoff
%T Space lower bounds for maze threadability on restricted machines
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 636-652

%A Kuo-Chung Taio
%T Predictors of context-free grammars
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 3
%D August 1980
%P 653-664

%A Krzysztof R. Apt
%A Lambert G.L.T. Meertens
%T Completeness with finite systems of intermediate assertions
for recursive program schemes
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 665-671

%A Leo J. Guibas
%A Andrew M. Odlyzko
%T A new proof of the linearity of the Boyer-Moore string searching algorithm
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 672-682

%A Stephen L. Bloom
%A Ralph Tindell
%T Compatible orderings on the metric theory of trees
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 683-691

%A Dario Bini
%A Grazia Lotti
%A Francesco Romani
%T Approximate solutions for the bilinear form computational problem
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 692-697

%A David A. Plaisted
%T The application of multivariate polynomials
to inference rules and partial tests for unsatisfiability
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 698-705

%A Terry Beyer
%A Sandra Mitchell Hedetniemi
%T Constant time generation of rooted trees
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 706-712

%A Joseph Ja'Ja'
%T On the complexity of bilinear forms with commutativity
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 713-728

%A Ronald V. Book
%A Franz-Josef Brandenburg
%T Equality sets and complexity classes
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 729-743

%A David Nassimi
%A Sartaj Sahni
%T Finding connected components and connected ones
on a mesh-connected parallel computer
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 744-757

%A Gadiel Seroussi
%A Abraham Lempel
%T Factorization of symmetric matrices
and trace-orthogonal bases in finite fields
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 758-767

%A Jerome A. Feldman
%A Anil Nigam
%T A model and roof technique for message-based systems
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 768-784

%A Mila E. Majster
%A Angelika Reiser
%T Efficient on-line construction and correction of position trees
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 785-807

%A E.G. Coffman,\ Jr.
%A M.R. Garey
%A D.S. Johnson
%A R.E. Tarjan
%T Performance bounds for level-oriented two-dimensional packing algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 808-826

%A Bengt Aspvall
%A Yossi Shiloach
%T A polynomial time algorithm for solving systems of linear inequalities
with two variables per inequality
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 827-845

%A Brenda S. Baker
%A E.G. Coffman,\ Jr.
%A Ronald L. Rivest
%T Orthogonal packings in two dimensions
%J SIAM Journal on Computing
%K siam_jc
%V 9
%N 4
%D November 1980
%P 846-855

%A Michael L. Fredman
%T Lower bounds on the complexity of some optimal data structures
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 1-10

%A Anna Lubiw
%T Some NP-complete problems similar to graph isomorphism
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 11-21

%A Oscar H. Ibarra
%A Brian S. Leininger
%T Characterizations of Presburger functions
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 22-39

%A A. Ehrenfeucht
%A G. Rozenberg
%A D. Mermeir
%T On ETOL systems with finite tree-rank
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 40-58

%A John H. Rowland
%A Phili J. Davis
%T On the selection of test data for recursive mathematical subroutines
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 59-72

%A D.T. Lee
%A R.L. Drysdale,\ III
%T Generalization of Voronoi diagrams in the plane
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 73-87

%A Martin H. Ellis
%A J. Michael Steele
%T Fast sorting of Weyl sequences using comparisons
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 88-95

%A Charles H. Bennett
%A John Gill
%T Relative to a random oracle A, P^A /= NP^A /= co-NP^A with probability 1
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 96-113

%A Neil D. Jones
%A Sven Skyum
%T A note on the complexity of general D0L membership
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 114-117

%A Ken-Chih Liu
%T On string pattern matching: a new model with a polynomial time algorithm
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 118-140

%A Frank Ruskey
%T Listing and counting subtrees of a tree
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 141-150

%A Manfred Kunde
%T Nonpreemptive LP-scheduling on homogeneous multiprocessor systems
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 151-173

%A Stefano Crespi-Reghizzi
%A Giovanni Guida
%A Dino Mandrioli
%T Operator precedence grammars and the noncounting property
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 174-191

%A M.I. Dessouky
%A J.S. Deogun
%T Sequencing jobs with unequal ready times to minimize mean flow time
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 192-202

%A Charles J. Colbourn
%A Kellogg S. Booth
%T Linear time automorphism algorithms
for trees, interval graphs, and planar graphs
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 1
%D February 1981
%P 203-225

%A Lawrence Flon
%A Norihisa Suzuki
%T The total correctness of parallel programs
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 227-246

%A N. Katoh
%A T. Ibaraki
%A H. Mine
%T An algorithm for finding k minimum spanning trees
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 247-255

%A M.R. Garey
%A D.S. Johnson
%A B.B. Simons
%A R.E. Tarjan
%T Scheduling unit-time tasks with arbitrary release times and deadlines
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 256-269

%A Greg N. Frederickson
%A Joseph Ja'Ja'
%T Approximation algorithms for several graph augmentation problems
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 270-283

%A Luc Boasson
%A Bruno Courcelle
%A Maurice Nivat
%T The rational index: a complexity measure for languages
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 284-296

%A Mihalis Yannakakis
%T Edge-deletion problems
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 297-309

%A M. Yannakakis
%T Node-deletion problems on bipartite graphs
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 310-327

%A N. Medgiddo
%A A. Tamir
%A E. Zemel
%A R. Chandrasekaran
%T An O(n log^2 n) algorithm for the kth longest path in a tree
with applications to location problems
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 328-337

%A George S. Lueker
%T Optimization problems on graphs with independent random edge weights
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 338-351

%A Catriel Beeri
%A Alberto O. Mendelzon
%A Yehoshua Sagiv
%A Jeffrey D. Ullman
%T Equivalence of relational database schemes
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 352-370

%A C.P. Schnorr
%T An extension of Strassen's degree bound
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 371-382

%A J. Hartmanis
%A S. Mahaney
%T Languages simultaneously complete for one-way and two-way log-tape automata
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 383-390

%A Andrzej Proskurowski
%T Recursive graphs, recursive labelings and shortest paths
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 391-397

%A Andrew C. Yao
%T An analysis of a memory allocation scheme for implementing stacks
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 2
%D May 1981
%P 398-403

%A A.V. Aho
%A Y. Sagiv
%A T.G. Szymanski
%A J.D. Ullman
%T Inferring a tree from lowest common ancestors
with an application to the optimization of relational expressions
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 405-421

%A L. Gotlieb
%T Optimal multi-way search trees
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 422-433

%A A. Schonhage
%T Partial and total matrix multiplication
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 434-455

%A Richard Schroeppel Adi Shamir
%T A T = O(2^n/2), S = O(2^n/4) algorithm for certain NP-complete problems
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 456-464

%A Roland Haggkvist
%A Pavol Hell
%T Parallel sorting with constant time for comparisons
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 465-472

%A Franco P. Preparata
%T A new approach to planar point location
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 473-482

%A H.A. Maurer
%A A. Salomaa
%A D. Woods
%T Uniform interpretations of grammar forms
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 483-502

%A Brian H. Mayoh
%T Attribute grammars and mathematical semantics
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 503-518

%A Amir Pnueli
%A Giora Slutzki
%T Automatic programming of finite state linear programs
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 519-535

%A A. Ehrenfeucht
%A R. Parikh
%A G. Rozenberg
%T Pumping lemmas for regular sets
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 536-542

%A Christos H. Papadimitriou
%T Worst-case and probabilistic analysis of a geometric location problem
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 543-557

%A James R. Bitner
%A Shou-Hsuan Huang
%T Key comparison optimal 2-3 trees with maximum utilization
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 558-570

%A Igal Golan
%T Performance bounds for orthogonal oriented two-dimensional packing algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 571-582

%A Cynthia A. Brown
%A Paul Walton Purdom,\ Jr.
%T An average time analysis of backtracking
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 583-593

%A Sam Toueg
%A Jeffrey D. Ullman
%T Deadlock-free packet switching networks
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 594-611

%A Gaston H. Gonnet
%A J. Ian Munro
%A Hendra Suwanda
%T Exegesis of self-organizing linear search
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 613-637

%A Peter Downey
%A Benton Leong
%A Ravi Sethi
%T Computing sequences with addition chains
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 638-646

%A C. Beeri
%A P. Honeyman
%T Preserving functional dependencies
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 3
%D August 1981
%P 647-656

%A Eliezer Dekel
%A David Nassimi
%A Sartaj Sahni
%T Parallel matrix and graph algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 657-675

%A Edward M. Reingold
%A Robert E. Tarjan
%T On a greedy heuristic for complete matching
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 676-681

%A Carla Savage
%A Joseph Ja'Ja'
%T Fast, efficient parallel algorithms for some graph problems
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 682-691

%A P.J. Slater
%A E.J. Cockayne
%A S.T. Hedetniemi
%T Information dissemination in trees
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 692-701

%A Sam Toueg
%A Kenneth Steiglitz
%T Some complexity results
in the design of deadlock-free packet switching networks
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 702-712

%A Ian Holyer
%T The NP-completeness of some edge-partition problems
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 713-717

%A Ian Holyer
%T The NP-completeness of edge-coloring
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 718-720

%A Azad Bolour
%T Optimal retrieval algorithms for small region queries
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 721-741

%A Charles W. Rackoff
%A Joel I. Seiferas
%T Limitations on separating nondeterministic complexity classes
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 742-745

%A Alon Itai
%A Richard J. Lipton
%A Christos H. Papadimitriou
%A M. Rodeh
%T Covering graphs by simple circuits
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 746-750

%A Philip A. Bernstein
%A Nathan Goodman
%T Power of natural semijoins
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 751-771

%A Kari-Jouko Raiha
%A Esko Ukkonen
%T Minimizing the number of evaluation passes for attribute grammars
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 772-786

%A Ker-I Ko
%A Daniel Moore
%T Completeness, approximation and density
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 787-796

%A Maciej M. Syslo
%T An efficient cycle vector space algorithm
for listing all cycles of a planar graph
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 797-808

%A Amnon B. Barak
%A Peter J. Downey
%T Distributed processor scheduling and user countermeasures
%J SIAM Journal on Computing
%K siam_jc
%V 10
%N 4
%D November 1981
%P 809-819

%A Oscar H. Ibarra
%A Brian S. Leininger
%T Straight-line programs with one input variable
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 1-14

%A Oscar H. Ibarra
%A Brian S. Leininger
%T The complexity of the equivalence problem for simple loop-free programs
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 15-27

%A J.H. Halton
%A R. Terada
%T A fast algorithm for the Euclidean traveling salesman problem,
optimal with probability one
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 28-46

%A Arnon Rosenthal
%T Dynamic programming is optimal for nonserial optimization problems
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 47-59

%A E.G. Coffman,\ Jr.
%A Micha Hofri
%T On the expected performance of scanning disks
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 60-70

%A Robert P. Burton
%A David R. Smith
%T A hidden-line algorithm for hyperspace
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 71-80

%A John H. Reif
%A Robert E. Tarjan
%T Symbolic program analysis in almost-linear time
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 81-93

%A D. Coppersmith
%A D.S. Parker
%A C.K. Wong
%T Analysis of a general mass storage system
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 94-116

%A Harold N. Gabow
%A Oded Kariv
%T Algorithms for edge coloring bipartite graphs and multigraphs
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 117-129

%A Martin Tompa
%T Two familiar transitive closure algorithms
which admit no polynomial time, sublinear space implementations
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 130-137

%A Lawrence T. Kou
%T Minimum variance Huffman codes
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 138-148

%A Dan E. Willard
%T Polygon retrieval
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 149-165

%A E.P. Friedman
%A S.A. Greibach
%T A polynomial time algorithm for deciding the equivalence problem
for 2-tape deterministic finite state acceptors
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 166-183

%A Per M. Jensen
%A Bernhard Korte
%T Complexity of matroid property algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 184-190

%A Kellogg S. Booth
%A J. Howard Johnson
%T Dominating sets in chordal graphs
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 1
%D February 1982
%P 191-199

%A M.R. Levy
%A T.S.E. Maibaum
%T Continuous data types
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 201-216

%A Douglas Comer
%A Michael J. O'Donnell
%T Geometric problems with application to hashing
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 217-226

%A Jia-Wei Hong
%A Arnold L. Rosenberg
%T Graphs that are almost binary trees
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 227-242

%A James R. Bitner
%T An asymptotically optimal algorithm for the Dutch national flag problem
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 243-262

%A Francesco Romani
%T Some properties of disjoint sums of tensors related to matrix multiplication
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 263-267

%A John Keohane
%A John C. Cherniavsky
%A Peter B. Henderson
%T On transforming control structures
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 268-286

%A A. Borodin
%A S. Cook
%T A time-space tradeoff for sorting
on a general sequential model of computation
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 287-297

%A Jacobo Valdes
%A Robert E. Tarjan
%A Eugene L. Lawler
%T The recognition of series parallel digraphs
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 298-313

%A Joseph Ja'Ja'
%A Janos Simon
%T Parallel algorithms in graph theory: planarity testing
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 314-328

%A David Lichenstein
%T Planar formulae and their uses
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 329-343

%A Shlomo Moran
%T On the accepting density hierarchy in NP
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 344-349

%A L.G. Valiant
%T A scheme for fast parallel communication
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 350-361

%A T.C. Hu
%A M.T. Shing
%T Computation of matrix chain products, part I
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 362-373

%A Daniel J. Lehmann
%T On primality tests
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 374-375

%A Robert Sedgewick
%A Thomas A. Szymanski
%A Andrew C. Yao
%T The complexity of finding cycles in periodic functions
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 376-390

%A Mihalis Yannakakis
%T Freedom from deadlock of safe locking policies
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 2
%D May 1982
%P 391-408

%A Nathan Linial
%A Michael Tarsi
%T The counterfeit coin problem revisited
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 409-415

%A Michael J. Fischer
%A Albert R. Meyer
%A Michael S. Paterson
%T SIGMA(n log n) lower bounds on length of boolean formulas
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 416-427

%A Andrew C. Yao
%A F. Frances Yao
%T On the average-case complexity of selecting the kth best
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 428-447

%A Eitan M. Gurari
%T The equivalence problem for the deterministic two-way sequential transducers
is decidable
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 448-452

%A M. Hofri
%A P. Tzelnic
%T The working set size distribution
for the Markov chain model of program behavior
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 453-466

%A D. Coppersmith
%T Rapid multiplication of rectangular matrices
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 467-471

%A D. Coppersmith
%A S. Winograd
%T On the asymptotic complexity of matrix multiplication
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 472-492

%A Barry K. Rosen
%T A lubricant for data flow analysis
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 493-511

%A K. nakajima
%A S.L. Hakimi
%A J.K. Lenstra
%T Complexity results for scheduling tasks
in fixed intervals on two types of machines
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 512-520

%A Bernhard Banaschewski
%A Evelyn Nelson
%T Completions of partially ordered sets
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 521-528

%A D. Gouyou-Beauchamps
%T The Hamiltonian circuit problem is polynomial for 4-connected planar graphs
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 529-539

%A Richard Cole
%A John Hopcroft
%T On edge coloring bipartite graphs
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 540-546

%A Henry W. Davis
%A Leon E. Winslow
%T Computational power in query languages
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 547-554

%A Dorit S. Hochbaum
%T Approximation algorithms for the set covering and vertex cover problems
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 555-556

%A Aaron M. Tenenbaum
%A Richard M. Nemes
%T Two spectra of self-organizing sequential search algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 557-566

%A Mikhail J. Atallah
%T Finding the cyclic index of an irreducible, nonnegative matrix
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 567-570

%A Ronald V. Book
%A Christopher B. Wilson
%A Xu Mei-Rui
%T Relativizing time, space, and time-space
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 571-581

%A Udai Gupta
%A D.T. Lee
%A C.K. Wong
%T Ranking and unranking of 2-3 trees
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 582-590

%A Jia-Wei Hong
%T On some deterministic space complexity problems
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 591-601

%A Virgil Gligor
%A David Maier
%T Finding augmented-set bases
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 3
%D August 1982
%P 602-609

%A Kohei Noshita
%T Predicting the number of distinct elements in a multiset
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 4
%D November 1982
%P 611-619

%A Richard M. Karp
%A Christos H. Papadimitriou
%T On linear characterizations of combinatorial optimization problems
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 4
%D November 1982
%P 620-632

%A Teofilo Gonzalez
%A Joseph Ja'Ja'
%T Evaluation of arithmetic expressions with algebraic identities
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 4
%D November 1982
%P 633-662

%A Norishige Chiba
%A Takao Nishizeki
%A Nobuji Saito
%T An approximation algorithm
for the maximum independent set problem on planar graphs
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 4
%D November 1982
%P 663-675

%A Alon Itai
%A Christos H. Papadimitriou
%A Jayme Luiz Szwarcfiter
%T Hamilton paths in grid graphs
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 4
%D November 1982
%P 676-686

%A Tsu-Wu J. Chou
%A George E. Collins
%T Algorithms for the solution of systems linear Diophantine equations
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 4
%D November 1982
%P 687-708

%A James O. Achugbue
%A Francis Y. Chin
%T Scheduling the open shop to minimize mean flow time
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 4
%D November 1982
%P 709-720

%A Andrew Chi-Chih Yao
%T On constructing minimum spanning trees in k-dimensional space
and related problems
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 4
%D November 1982
%P 721-736

%A Richard P. Brent
%A Leslie M. Goldschlager
%T Some area-time tradeoffs for VLSI
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 4
%D November 1982
%P 737-747

%A Kurt Mehlhorn
%T A partial analysis of height-balanced trees
under random insertions and deletions
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 4
%D November 1982
%P 748-760

%A M.B. Smyth
%A G.D. Plotkin
%T The category-theoretic solution of recursive domain equations
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 4
%D November 1982
%P 761-783

%A C. Ronse
%T Optimization of cost and delay in cellular permutation networks
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 4
%D November 1982
%P 784-788

%A A.O.L. Atkin
%A R.G. Larson
%T On a primality test of Solovay and Strassen
%J SIAM Journal on Computing
%K siam_jc
%V 11
%N 4
%D November 1982
%P 789-791

%A V. Strassen
%T The computational complexity of continued fractions
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 1
%D February 1983
%P 1-27

%A David Kirkpatrick
%T Optimal search in planar subdivisions
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 1
%D February 1983
%P 28-35

%A Ronald Fagin
%A David Maier
%A Jeffrey D. Ullman
%A Mihalis Yannakakis
%T Tools for template dependencies
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 1
%D February 1983
%P 36-59

%A D.K. Friesen
%A M.A. Langston
%T Bounds for multifit scheduling on uniform processors
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 1
%D February 1983
%P 60-70

%A John H. Reif
%T Minimum s-t cut of a planar undirected network in O(n log^2 n) time
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 1
%D February 1983
%P 71-81

%A Gerald E. Peterson
%T A technique for establishing completeness results
in theorem proving with equality
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 1
%D February 1983
%P 82-100

%A Hans F. de\ Groote
%T Characterization of division algebras of minimal rank
and the structure of their algorithm varieties
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 1
%D February 1983
%P 101-117

%A Kenneth J. Supowit
%A Edward M. Reingold
%T Divide and conquer heuristics for minimum weighted Euclidean matching
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 1
%D February 1983
%P 118-143

%A Kenneth J. Supowit
%A Edward M. Reingold
%A David A. Plaisted
%T The traveling salesman problem and minimum matching in the unit square
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 1
%D February 1983
%P 144-156

%A Dan Gusfield
%T Simple constructions for multi-terminal network flow synthesis
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 1
%D February 1983
%P 157-165

%A A.C. Fleck
%A R.S. Limaye
%T Formal semantics and abstract properties of string pattern operations
and extended formal language description mechanisms
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 1
%D February 1983
%P 166-188

%A I.V. Guttag
%A D. Kapur
%A D.R. Musser
%T On proving uniform termination and restricted termination
of rewriting systems
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 1
%D February 1983
%P 189-214

%A Christos H. Papadimitriou
%T Concurrency control by locking
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 215-226

%A E.G. Coffman,\ Jr.
%A M.R. Garey
%A D.S. Johnson
%T Dynamic bin packing
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 227-258

%A Patrick C. Fischer
%A Don-Min Tsou
%T Whether a set of multivalued dependencies implies a join dependency
is NP-hard
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 259-266

%A Avra Cohn
%T The equivalence of two semantic definitions, a case study in LCF
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 267-285

%A Rudiger Loos
%T Computing rational zeros of integral polynomials by p-adic expansion
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 286-293

%A Barbara Simons
%T Multiprocessor scheduling of unit-time jobs
with arbitrary release times and deadlines
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 294-299

%A Christian Choffrut
%A Karel Culik,\ II
%T Properties of finite and pushdown transducers
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 300-315

%A Yehoshua Sagiv
%T Quadratic algorithms for minimizing joins
in restricted relational expressions
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 316-328

%A V. Lifschitz
%A B. Pittel
%T The worst and most probable performance of a class of set-covering algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 329-346

%A Nimrod Megiddo
%T Towards a genuinely polynomial algorithm for linear programming
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 347-353

%A Susanne E. Hambrusch
%T VLSI algorithms for the connected component problem
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 354-365

%A J.A. Bergstra
%A J.V. Tucker
%T Initial and final algebra semantics for data type specifications:
two characterization theorems
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 366-387

%A Oscar H. Ibarra
%A Shlomo Moran
%T Some time-space tradeoff results concerning single-tape and offline TM's
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 388-394

%A Markus Lauer
%T Generalized p-adic constructions
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 2
%D May 1983
%P 395-410

%A Yaacov Yesha
%T On certain polynomial-time truth-table reducibilities
of complete sets to sparse sets
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 411-425

%A David M. Choy
%A C.K. Wong
%T Construction of optimal alpha-beta leaf trees
with applications to prefix code and information retrieval
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 426-446

%A Chalres E. Leiserson
%A Ron Y. Pinter
%T Optimal placement for river routing
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 447-462

%A Michael C. Loui
%T Optimal dynamic embedding of trees into arrays
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 463-472

%A Erich Kaltofen
%A David R. Musser
%A B. David Saunders
%T A generalized class of polynomials that are hard to factor
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 473-483

%A Jacob E. Goodman
%A Richard Pollack
%T Multidimensional sorting
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 484-507

%A Brenda S. Baker
%A Jerald S. Schwarz
%T Shelf algorithms for two-dimensional packing problems
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 508-525

%A John H. Rowland
%A L+eslie E. Shader
%T On the selection of test data for vector-valued recursive subroutines
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 526-538

%A Hisao Yamada
%A Masatosi Imori
%T One step transformation of periodic sequences by cellular automata
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 539-550

%A Trevor I. Fenner
%A Georghios Loizou
%T Tree traversal related algorithms for generating integer partitions
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 551-564

%A Alan L. Selman
%A Xu Mei-Rui
%A Ronald V. Book
%T Positive relativizations of complexity classes
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 565-579

%A Esko Ukkonen
%T Two results on polynomial time truth-table reductions to sparse sets
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 580-587

%A Peter A. Bloniarz
%T A shortest-path algorithm with expected time O(n^2 log n log* n)
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 588-600

%A D.G. Kirkpatrick
%A P. Hell
%T On the complexity of general graph factor problems
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 3
%D August 1983
%P 601-609

%A M.D. Atkinson
%A S. Lloyd
%T The ranks of m*n*(mn-2) tensors
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 611-615

%A D.S. Johnson
%A A. Klug
%T Optimizing conjunctive queries that contain untyped variables
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 616-640

%A L.G. Valiant
%A S. Skyum
%A S. Berkowitz
%A C. Rackoff
%T Fast parallel computation of polynomials using few processors
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 641-644

%A Timothy Hickey
%A Jacques Cohen
%T Uniform random generation of strings in a context-free language
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 645-655

%A D. Dolev
%A H.R. Strong
%T Authenticated algorithms for Byzantine agreement
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 656-666

%A Wen-Chin Chen
%A Jeffrey Scott Vitter
%T Analysis of early-insertion standard coalesced hashing
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 667-676

%A Stephen L. Bloom
%A Ralph Tindell
%T Varieties of "if-then-else"
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 677-707

%A Tat-Hung Chan
%A Oscar H. Ibarra
%T On the space and time complexity of functions computable by simple programs
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 708-716

%A Paul Walton Purdom,\ Jr.
%A Cynthia A. Brown
%T An analysis of backtracking with search rearrangement
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 717-733

%A John L. Pfaltz
%T Convex clusters in a discrete m-dimensional space
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 734-750

%A Nimrod Megiddo
%A Arie Tamir
%T New results on the complexity of p-center problems
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 751-758

%A Nimrod Megiddo
%T Linear-time algorithms for linear programming in R^3 and related problems
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 759-776

%A J. Scott Provan
%A Michael O. Ball
%T The complexity of counting cuts
and of computing the probability that a graph is connected
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 777-788

%A Debasis Mitra
%A J.A. Morrison
%T Asymptotic expansions of moments of the waiting time
in a shared-processor of an interactive system
%J SIAM Journal on Computing
%K siam_jc
%V 12
%N 4
%D November 1983
%P 789-802

%A Arie de\ Bruin
%T On the existence of Cook semantics
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 1-13

%A Greg N. Frederickson
%A Donald B. Johnson
%T Generalized selection and ranking: sorted matrices
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 14-30

%A M.E. Dyer
%T Linear time algorithms for two- and three-variable linear programs
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 31-45

%A John H. Reif
%T On synchronous parallel computations with independent probabilistic choice
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 46-56

%A Norman J. Pullman
%T Clique covering of graphs IV. algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 57-75

%A C. Beeri
%A M.Y. Vardi
%T Formal systems for tuple and equality generating dependencies
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 76-98

%A Stavros S. Cosmadakis
%A Christos H. Papadimitriou
%T The traveling salesman problem with many visits to few cities
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 99-108

%A Udi Manber
%A Martin Tompa
%T The effect of number of Hamiltonian paths
on the complexity of a vertex-coloring problem
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 109-115

%A Dah-Ming Chiu
%A Pihilip A. Bernstein
%A Yu-Chi Ho
%T Optimizing chain queries in a distributed database system
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 116-134

%A Richard E. Ladner
%A Richard J. Lipton
%A Larry J. Stockmeyer
%T Alternating pushdown and stack automata
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 135-155

%A Maria Klawe
%T Limitations on explicit constructions of expanding graphs
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 156-166

%A Prakash V. Ramanan
%T Pushdown permuter characterization theorem
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 167-169

%A Donald K. Friesen
%T Tighter bounds for the multifit processor scheduling algorithm
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 170-181

%A Nimrod Megiddo
%A Kenneth J. Supowitz
%T On the complexity of some common geometric location problems
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 182-196

%A Thomas Ottman
%A D. Stott Parker
%A Arnold L. Rosenberg
%A Hans W. Six
%A Derick Wood
%T Minimal-cost brother trees
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 1
%D February 1984
%P 197-217

%A Pavol Duris
%A Zvi Galil
%T Two tapes are better than one for nondeterministic machines
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 2
%D May 1984
%P 219-227

%A T.C. Hu
%A M.T. Shing
%T Computation of matrix chain products. Part II
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 2
%D May 1984
%P 228-251

%A J.M. Robson
%T N by N checkers in EXPTIME complete
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 2
%D May 1984
%P 252-267

%A Dario Bini
%T Parallel solution of certain Toeplitz linear systems
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 2
%D May 1984
%P 268-276

%A Greg N. Frederickson
%T Self-organizing heuristics for implicit data structures
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 2
%D May 1984
%P 277-291

%A Micha Sharir
%A Amir Pnueli
%A Sergiu Hart
%T Verification of probabilistic programs
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 2
%D May 1984
%P 292-314

%A Sunita Agarwal
%A A.K. Mittal
%A P. Sharma
%T Constrained optimum communication trees and sensitivity analysis
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 2
%D May 1984
%P 315-328

%A Uwe Schoning
%A Ronald V. Book
%T Immunity, relativizations, and nondeterminism
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 2
%D May 1984
%P 329-337

%A Dov Harel
%A Robert Endre Tarjan
%T Fast algorithms for finding nearest common ancestors
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 2
%D May 1984
%P 338-355

%A Etienne Grandjean
%T The spectra of first-order sentences and computational complexity
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 2
%D May 1984
%P 356-373

%A Robert Cartwright
%T Recursive programs as definitions in first order logic
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 2
%D May 1984
%P 374-408

%A Larry Stockmeyer
%A Uzi Vishkin
%T Simulation of parallel random access machines by circuits
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 2
%D May 1984
%P 409-422

%A Ashok K. Chandra
%A Larry Stockmeyer
%A Uzi Vishkin
%T Constant depth reducibility
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 2
%D May 1984
%P 423-439

%A Ernst W. Mayr
%T An algorithm for the general Petri net reachability problem
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 3
%D August 1984
%P 441-460

%A Ronald V. Book
%A Timothy J. Long
%A Alan L. Selman
%T Quantitative relativizations of complexity classes
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 3
%D August 1984
%P 461-487

%A Bernard Chazelle
%T Convex partitions of polyhedra:
a lower bound and worst-case optimal algorithm
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 3
%D August 1984
%P 488-507

%A D.J. Rosenkrantz
%A R.E. Stearns
%A P.M. Lewis,\ II
%T Consistency and serializability in concurrent database systems
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 3
%D August 1984
%P 508-530

%A M. Keane
%A A.G. Konheim
%A I. Meilijson
%T The organ pipe permutation
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 3
%D August 1984
%P 531-540

%A Rami G. Melhem
%A Werner C. Rheinboldt
%T A mathematical model for the verification of systolic networks
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 3
%D August 1984
%P 541-565

%A Robert E. Tarjan
%A Mihalis Yannakakis
%T Some linear-time algorithms to test chordality of graphs,
test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 3
%D August 1984
%P 566-579

%A Yung H. Tsin
%A Francis Y. Chin
%T Efficient parallel algorithms for a class of graph theoretic problems
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 3
%D August 1984
%P 580-599

%A B.S. Baker
%A E.G. Coffman,\ Jr.
%T Insertion and compaction algorithms in sequentially allocated storage
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 3
%D August 1984
%P 600-609

%A John Hopcroft
%A Deborah Joseph
%A Sue Whitesides
%T Movement problems for 2-dimensional linkages
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 3
%D August 1984
%P 610-629

%A Sam Toueg
%A Ozalp Babaoglu
%T On the optimum checkpoint selection problem
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 3
%D August 1984
%P 630-649

%A Joseph Y-T. Leung
%A Oliver Vornberger
%A James D. Witthoff
%T On some variants of the bandwidth minimization problem
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 3
%D August 1984
%P 650-667

%A D.P. Heyman
%A S. Tsur
%T Disk performance in a transaction-oriented system
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 669-681

%A Andreas Blass
%A Yuri Gurevich
%T Equivalence relations, invariants, and normal forms
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 682-689

%A Ten-Hwang Lai
%A Sartaj Sahni
%T Preemptive scheduling of a multiprocessor system with memories
to minimize maximum lateness
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 690-704

%A Gregory Dobson
%T Scheduling independent tasks on uniform processors
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 705-716

%A Hans Heller
%T On relativized polynomial and exponential computations
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 717-725

%A H.W. Barz
%T The power of synchronization mechanisms
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 726-749

%A Jean H. Gallier
%T n-rational algebras I. basic properties and free algebras
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 750-775

%A Jean H. Gallier
%T n-rational algebras II. varieties and logic of inequalities
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 776-794

%A Nathan Linial
%T The information-theoretic bound is good for merging
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 795-801

%A Joachim von\ zur\ Gathen
%T Parallel algorithms for algebraic problems
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 802-824

%A R. Sherman
%A A. Pnueli
%A D. Harel
%T Is the interesting part of process logic uninteresting ?:
a translation from PL to PDL
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 825-839

%A J. Ja'Ja'
%A V.K. Prasanna Kumar
%A J. Simon
%T Information transfer under different sets of protocols
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 840-849

%A Manuel Blum
%A Silvio Micali
%T How to generate cryptographically string sequences of pseudo-random bits
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 850-864

%A Dennis S. Arnon
%A George E. Collins
%A Scott McCallum
%T Cylindrical algebraic decomposition I: the basic algorithm
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 865-877

%A Dennis S. Arnon
%A George E. Collins
%A Scott McCallum
%T Cylindrical algebraic decomposition II: and adjacency algorithm for the plane
%J SIAM Journal on Computing
%K siam_jc
%V 13
%N 4
%D November 1984
%P 878-889

%A Paul M.B. Vitanyi
%T An optimal simulation of counter machines
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 1-33

%A Paul M.B. Vitanyi
%T An optimal simulation of counter machines: the ACM case
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 34-40

%A Ker-i Ko
%A Uwe Schoning
%T On circuit-size complexity and the low hierarchy in NP
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 41-51

%A Paris C. Kanellakis
%A Christos H. Papadimitriou
%T The complexity of distributed concurrency control
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 52-74

%A John H. Reif
%A Paul G. Spirakis
%T Unbounded speed variability in distributed communications systems
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 75-92

%A Hiroshi Imai
%A Masao Iri
%A Kazuo Murota
%T Voronoi diagram in the Laguerre geometry and its applications
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 93-105

%A Charles M. Fiduccia
%T An efficient formula for linear recurrences
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 106-112

%A Stuart A. Kurtz
%T Sparse sets in NP-P relativizations
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 113-119

%A Andrew C. Yao
%A F. Frances Yao
%T On fault-tolerant networks for sorting
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 120-128

%A Anrew C. Yao
%T On the expected performance of path compression algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 129-133

%A James E. Boyce
%A David P. Dobkins
%A Robert L. (Scot) Drysdale,\ III
%A Leo Guibas
%T Finding extremal polygons
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 134-147

%A Jose L. Balcazar
%T Simplicity, relativizations and nondeterminism
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 148-157

%A Moon-Jung Chung
%A Fillia Makedon
%A Ivan Hal Sudborough
%A Jonathan Turner
%T Polynomial time algorithms for the min cut problem
on degree restricted trees
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 158-177

%A J.J. Risler
%T Additive complexity and zeros of real polynomials
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 178-183

%A Susan Landau
%T Factoring polynomials over algebraic number fields
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 184-195

%A J.C. Lagarias
%T The computational complexity
of simultaneous Diophantine approximation problems
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 196-209

%A Norishige Chiba
%A Takao Nishizeki
%T Arbocity and subgraph listing algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 210-223

%A Wen-Lian Hsu
%T Maximum weight clique algorithms
for circular-arc graphs and circle graphs
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 224-231

%A Dan E. Willard
%T New data structures for orthogonal range queries
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 1
%D February 1985
%P 232-253

%A Edward M. McCreight
%T Priority search trees
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 257-276

%A Andrew C. Yao
%T On the complexity of maintaining partial sums
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 277-288

%A Kazuhiko Matsumoto
%A Takao Nishizeki
%A Nobuji Saito
%T An efficient algorithm
for finding multicommodity flows in planar networks
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 289-302

%A Uzi Vishkin
%A Avi Wigderson
%T Trade-offs between depth and width in parallel computation
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 303-314

%A John Hopcroft
%A Deborah Joseph
%A Sue Whitesides
%T On the movement of robot arms in 2-dimensional bounded regions
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 315-333

%A Minoru Ito
%A Motoaki Iwasaki
%A Tadao Kasami
%T Some results on the representative instance in relational databased
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 334-354

%A Gopalakrishnan Vijayan
%A Avi Wigderson
%T Rectilinear graphs and their embeddings
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 355-372

%A Gyorgy Revesz
%T Axioms for the theory of lambda-conversion
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 373-382

%A W. Hartmann
%T On the multiplicative complexity of modules over associative algebras
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 383-395

%A Rudiger Reischuk
%T Probabilistic parallel algorithms for sorting and selection
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 396-409

%A William Goden
%A Rockford J. Ross
%A Karl Winklmann
%T An "interchange lemma" for context-free languages
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 410-415

%A E.G. Coffman,\ Jr.
%A T.T. Kadota
%A L.A. Shepp
%T A stochastic model of fragmentation in dynamic storage allocation
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 416-425

%A Oscar H. Ibarra
%A Sam M. Kim
%A Shlomo Moran
%T Sequential machine characterizations
of trellis and cellular automata and applications
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 426-447

%A Micha Sharir
%T Intersection and closest-pair problems for a set of planar discs
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 448-468

%A Erich Kaltofen
%T Polynomial-time reductions from multivariate to bi- and univariate
integral polynomial factorization
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 469-489

%A Jeffrey Scott Vitter
%A Wen-Chin Chen
%T Optimum algorithms for a model of direct chaining
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 490-499

%A M.R. Garey
%A D.S. Johnson
%T Composing functions to minimize image size
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 2
%D May 1985
%P 500-503

%A J.A. Reeds
%A N.J.A. Sloane
%T Shift-register synthesis (modulo m)
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 505-513

%A David G. Kirkpatrick
%A Maria M. Klawe
%T Alphabetic minimax trees
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 514-526

%A Susanne E. Hambrusch
%A Janos Simon
%T Solving undirected graph problems on VLSI
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 527-544

%A Samuel W. Bent
%A Daniel D. Sleator
%A Robert E. Tarjan
%T Biased search trees
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 545-568

%A Mohame G. Gouda
%A Louis E. Rosier
%T Priority networks of communicating finite state machines
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 569-584

%A Timothy J. Long
%T On restricting the size of oracles
compared with restricting access to oracles
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 585-597

%A R.E. Stearns
%A H.B. Hunt,\ III
%T On the equivalence and containment problems for
unambiguous regular expressions, regular grammars and finite automata
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 598-611

%A Refael Hassin
%A Donald B. Johnson
%T An O(n log^2 n) algorithm
for maximum flow in undirected planar networks
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 612-624

%A Eugene W. Myers
%T An O(E log E + I) expected time algorithm
for the planar segment intersection problem
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 625-637

%A Danny Dolev
%A Manfred Warmuth
%T Scheduling flat graphs
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 638-657

%A Jeremy Spinrad
%T On comparability and permutation graphs
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 658-670

%A Ashok K. Chandra
%A Moshe Y. Vardi
%T The implication problem for functional and inclusion dependencies
is undecidable
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 671-677

%A K.A. Kalorkoti
%T A lower bound for the formula size of rational functions
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 678-687

%A Marc Snir
%T On parallel searching
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 688-708

%A Marinus Veldhorst
%T Approximation of the consecutive ones matrix augmentation problem
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 709-729

%A Zvi M. Kedem
%T Optimal allocation of area for single-chip computations
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 730-743

%A E.G. Coffman,\ Jr.
%A M.R. Garey
%A D.S. Johnson
%A A.S. Lapaugh
%T Scheduling file transfers
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 3
%D August 1985
%P 744-780

%A Greg N. Frederickson
%T Data structures for on-line updating of minimum spanning trees,
with applications
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 781-798

%A J. Mark Keil
%T Decomposing a polygon into simpler components
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 799-817

%A A. Satyanarayana
%A R. Kevin Wood
%T A linear-time algorithm for computing k-terminal reliability
in series-parallel networks
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 818-832

%A Stephen A. Cook
%A H. James Hoover
%T A depth-universal circuit
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 833-839

%A Helmut Alt
%A Kurt Mehlhorn
%T Searching semisorted tables
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 840-848

%A Larry Stockmeyer
%T On approximation algorithms for #P
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 849-861

%A Robert E. Tarjan
%A Uzi Vishkin
%T An efficient parallel biconnectivity algorithm
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 862-874

%A Jeffrey M. Jaffe
%T Distributed multi-destination routing:
the constraint of local information
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 875-888

%A Henk Alblas
%T Finding minimal pass sequences for attribute grammars
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 889-914

%A Ehab S. El-Mallah
%A Charles J. Colbourn
%T Optimum communication spanning trees in series-parallel networks
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 915-925

%A D.G. Corneil
%A Y. Perl
%A L.K. Stewart
%T A linear recognition algorithm for cographs
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 926-934

%A Rohit Parikh
%A Ashok Chandra
%A Joe Halpern
%A Albert Meyer
%T Equations between regular terms and an application to process logic
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 935-942

%A Paul Walton Purdom,\ Jr.
%A Cynthia A. Brown
%T The pure literal rule and polynomial average time
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 943-953

%A Ulrich Faigle
%A Gerhard Gierz
%A Rainer Schader
%T Algorithmic approaches to setup minimization
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 954-965

%A M.F. Singer
%A B.D. Saunders
%A B.F. Caviness
%T An extension of Liouville's theorem on integration in finite terms
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 966-990

%A Sergiu Hart
%A Micha Sharir
%T Concurrent probabilistic programs, or: how to schedule if you must
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 991-1012

%A Dan E. Willard
%T Searching unindexed and nonuniformly generated files
in log log N time
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 1013-1029

%A Debasis Mitra
%T Probabilistic models and asymptotic results for concurrent processing
with exclusive and non-exclusive locks
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 1030-1051

%A Deepak Kapur
%A Paliath Narendran
%T The Knuth-Bendix completion procedure and Thue systems
%J SIAM Journal on Computing
%K siam_jc
%V 14
%N 4
%D November 1985
%P 1052-1072

%A G.W. Cherry
%T Integration in finite terms with special functions:
the logarithmic integral
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 1-21

%A Kurt Melhorn
%A Athanasios Tsakalidis
%T An amortized analysis of insertions into AVL-trees
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 22-33

%A Joseph O'Rourke
%T The signature of a plane curve
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 34-51

%A Daniel Dominic Selator
%A Robert Endre Tarjan
%T Self-adjusting heaps
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 52-69

%A Joost Engelfriet
%T The complexity of languages generated by attribute grammars
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 70-86

%A Stephen Cook
%A Cynthia Dwork
%A Rudiger Reischuk
%T Upper and lower time bounds
for parallel random access machines without simultaneous writes
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 87-97

%A Alberto Apostolico
%A Raffaele Giancarlo
%T The Boyer-Moore-Galil string searching strategies revisited
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 98-105

%A Freidhelm Meyer\ auf\ der\ Heide
%T Efficient simulations among several models of parallel computers
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 106-119

%A Zvi Galil
%A Silvio Micali
%A Harold Gabow
%T An O(EV log V) algorithm for finding a maximal weighted matching
in general graphs
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 120-130

%A Francis Chin
%A K.V.S. Ramarao
%T Optimal termination protocols for network partitioning
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 131-144

%A M. Shub
%A S. Smale
%T Computational complexity:
on the geometry of polynomials and a theory of cost: II
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 145-161

%A Brenda S. Baker
%T A provably good algorithm for the two module routing problem
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 162-188

%A D. Coppersmith
%A M.M. Klave
%A N.J. Pippenger
%T Alphabetic minimax trees of degree at most t
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 189-192

%A Micha Sharir
%A Amir Schorr
%T On shortest paths in polyhedral spaces
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 193-215

%A T. Erzion
%A A. Lempel
%T An efficient algorithm for generating linear transformations
in a shuffle-exchange network
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 216-221

%A D.K. Freisen
%A M.A. Langston
%T Variable sized bin packing
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 222-230

%A John H. Reif
%T Logarithmic depth circuits for algebraic functions
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 231-242

%A Stanley Cabay
%A Dong-Koo Choi
%T Constructing belts in two-dimensional arrangements with applications
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 243-270

%A Leonid A. Levin
%T Average case complete problems
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 285-286

%A David G. Kirkpatrick
%A Raimund Seidel
%T The ultimate planar convex hull algorithm ?
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 287-299

%A B. Chazelle
%A R.L. Drysdale
%A D.T. Lee
%T Computing the largest empty rectangle
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 1
%D February 1986
%P 300-315

%A Herbert Edlesbrunner
%A Leonidas J. Guibas
%A Jorge Stolfi
%T Optimal point location in a monotone subdivision
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 317-340

%A H. Edelsbrunner
%A J. O'Rourke
%A R. Seidel
%T Constructing arrangements of lines and hyperplanes with applications
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 341-363

%A L. Blum
%A M. Blum
%A M. Shub
%T A simple unpredictable pseudo-random number generator
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 364-383

%A Lenore Blum
%A Michael Shub
%T Evaluating rational functions:
infinite precision is finite cost and tractable on average
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 384-398

%A Pekka Orponen
%A David A. Russo
%A Uwe Schoning
%T Optimal approximations and polynomially levelable sets
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 399-408

%A John L. Bruno
%A Peter J. Downey
%T Probabilistic bounds on the performance of list scheduling
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 409-417

%A G. Ausiello
%A A. D'Atri
%A D. Sacca
%T Minimal representation of directed hypergraphs
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 418-431

%A Joachim von\ zur\ Gathen
%T Representations and parallel computations for rational functions
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 432-452

%A Wolfgang Maass
%T On the complexity of nonconvex covering
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 453-467

%A Dan E. Willard
%T Log-logarithmic selection resolution protocols in a multiple access channel
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 468-477

%A Hiroshi Imai
%A Takao Asano
%T Efficient algorithms for geometric graph search problems
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 478-494

%A Kazuhiko Matsumoto
%A Takao Nishizeki
%A Nobuji Saito
%T Planar multicommodity flows, maximum matchings and negative cycles
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 495-510

%A John Geske
%A Joachim Grollmann
%T Relativizations of unambiguous and random polynomial time classes
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 511-519

%A Carl E. Langenhop
%A William E. Wright
%T Probabilities related to father-son distances in binary search trees
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 520-530

%A L.G. Valiant
%T Negation is powerless for boolean slice functions
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 531-535

%A A.M. Frieze
%T On the Lagarias-Odlyzko algorithm for the subset sum problem
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 536-539

%A Robert Alan Wright
%A Bruce Richmond
%A Andrew Odlyzko
%A Brendan D. McKay
%T Constant time generation of free trees
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 540-548

%A Allan Borodin
%A Danny Dolev
%A Faith E. Fich
%A Wolfgang Paul
%T Bounds for width two branching programs
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 549-560

%A Jonathan S. Turner
%T On the probable performance of heuristics for bandwidth minimization
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 561-580

%A Dung T. Huynh
%T The complexity of the membership problem
for two subclasses of polynomial ideals
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 581-594

%A Rodney W. Johnson
%A Aileen M. McLoughlin
%T Noncommutative bilinear algorithms for 3*3 matrix multiplication
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 595-603

%A Francine Berman
%A Mary Elles Bock
%A Eric Dittert
%A Michael J. O'Donnell
%A Darrell Plank
%T Collections of functions for perfect hashing
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 604-618

%A Joan Feigenbaum
%A Alejandro A. Schaffer
%T Recognizing composite graphs is equivalent to testing graph isomorphism
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 2
%D May 1986
%P 619-627

%A P. Flajolet
%A H. Prodinger
%T Register allocation for unary-binary trees
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 629-640

%A Joel Friedman
%T Constructing O(n log n) size monotone formulae
for the kth threshold function of n boolean variables
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 641-654

%A Robert W. Irving
%A Paul Leather
%T The complexity of counting stable marriages
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 655-667

%A Claudio Citrini
%A Stefano Crespi-Reghizzi
%A Dino Mandrioli
%T On deterministic multi-pass analysis
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 668-693

%A J. Scott Provan
%T The complexity of reliability computations in planar and acyclic graphs
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 694-702

%A Bernard Chazelle
%T Filtering search: a new approach to query-answering
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 703-724

%A M.E. Dyer
%T On a multidimensional search technique
and its application to the Euclidean one-centre problem
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 725-738

%A Jose L. Balcazar
%A Ronald V. Book
%A Uwe Schoning
%T Sparse sets, lowness and highness
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 739-747

%A Philippe Flajolet
%A Robert Sedgewick
%T Digital search trees revisited
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 748-767

%A J.E. Hopcroft
%A G.T. Wilfong
%T Reducing multiple object motion planning to graph searching
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 768-785

%A Friedrich Otto
%T Church-Rosser Thue systems that present free monoids
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 786-792

%A Frank Thomson Leighton
%A Arnold L. Rosenberg
%T Three-dimensional circuit layouts
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 793-813

%A Justin R. Smith
%T Parallel algorithms for depth-first searches I. planar graphs
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 814-830

%A H.B. Hunt,\ III
%A D.J. Rosenkrantz
%T Recursion schemes and recursive programs are exponentially hard to analyze
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 831-850

%A Benjamin Arazi
%T A binary search with a parallel recovery of the bits
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 851-855

%A Richard Hull
%T Relative information capacity of simple relational database schemata
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 856-886

%A Jeffrey H. Kingston
%T Analysis of Henriksen's algorithm for the simulation event set
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 3
%D August 1986
%P 887-902

%A J.H. Davenport
%T The Risch differential equation problem
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 903-918

%A Martin David Katz
%A Dennis J. Volper
%T Data structures for retrieval on square grids
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 919-931

%A King F. Pang
%A Abbas El\ Gamal
%T Communication complexity of computing the Hamming distance
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 932-947

%A William H. Cunningham
%T Improved bounds for matroid partition and intersection algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 948-957

%A Klaus Ambos-Spies
%T An inhomogeneity in the structure of Karp degrees
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 958-963

%A Gaston H. Gonnet
%A J. Ian Munro
%T Heaps on heaps
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 964-971

%A David Prill
%T On approximations and incidence in cylindrical algebraic decompositions
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 972-993

%A Paul W. Beam
%A Stephen A. Cook
%A H. James Hoover
%T Log depth circuits for division and related problems
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 994-1003

%A Joseph Ja'Ja'
%A Jean Takche
%T On the validity of the direct sum conjecture
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1004-1020

%A Norbert Blum
%T On the single-operation worst-case time complexity
of the disjoint set union problem
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1021-1024

%A Liwu Li
%T Ranking and unranking of AVL-trees
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1025-1035

%A Michael Luby
%T A simple parallel algorithm for the maximal independent set problem
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1036-1053

%A Egon Balas
%A Chang Sung Yu
%T Finding a maximum clique in an arbitrary graph
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1054-1068

%A D.S. Hirschberg
%A L.L. Larmore
%T Average case analysis of marking algorithms
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1069-1074

%A U. Faigle
%A L. Lovasz
%A R. Schrader
%A Gy. Turan
%T Searching in trees, series-parallel and interval orders
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1075-1084

%A Donald P. Gaver
%A Patricia A. Jacobs
%T Processor-shared time-sharing models in heavy traffic
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1085-1100

%A Dung T. Huynh
%T Some observations about the randomness of hard problems
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1101-1105

%A Ming-Te Chao
%A John Franco
%T Probabilistic analysis of two heuristics for the 3-satisfiability problem
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1106-1118

%A Tsuyoshi Kawaguchi
%A Seiki Kyan
%T Worst case bound of an LRF schedule for the mean weighted flow-time problem
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1119-1129

%A Udi Manber
%T On maintaining dynamic information in an concurrent environment
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1130-1142

%A Eric Bach
%A Gary Miller
%A Jeffrey Shallit
%T Sums of divisors, perfect numbers and factoring
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1143-1154

%A Jean-Pierre Jouannaud
%A Helene Kirschner
%T Completion of a set of rules modulo a set of equations
%J SIAM Journal on Computing
%K siam_jc
%V 15
%N 4
%D November 1986
%P 1155-1194

%A Christos H. Papadimitriou
%A John N. Tsitsiklis
%T On stochastic scheduling with in-tree precedence constraints
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 1-6

%A Ravindran Kannan
%A Gary Miller
%A Larry Rudolph
%T Sublinear parallel algorithm for computing
the greatest common divisor of two integers
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 7-16

%A Oded Shmueli
%A Alon Itai
%T Complexity of views: tree and cyclic schemas
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 17-37

%A Russ Miller
%A Quentin F. Stout
%T Data movement techniques for the pyramid computer
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 38-60

%A Richard Cole
%A Micha Sharir
%A Chee K. Yap
%T On k-hulls and related problems
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 61-77

%A F. Aurenhammer
%T Power diagrams: properties, algorithms and applications
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 78-96

%A A. Borodin
%A F. Fich
%A F. Meyer\ auf\ der Heide
%A E. Upfal
%A A. Wigderson
%T A time-space tradeoff for element distinctness
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 97-99

%A Friedrich Meyer\ auf\ der Heide
%A Avi Wigderson
%T The complexity of parallel sorting
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 100-107

%A Douglas W. Jones
%T A note on bottom-up skew heaps
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 108-110

%A Dan Gusfield
%T Three fast algorithms for four problems in stable marriage
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 111-128

%A H.B. Hunt,\ III
%A D.J. Rosenkrantz
%A P.A. Bloniarz
%T On the computational complexity of algebra on lattices
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 129-148

%A Frank D. Murgolo
%T An efficient approximation scheme for variable-sized bin-packing
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 149-161

%A Hyeong-Ah Choi
%A S. Louis Hakimi
%T Scheduling file transfers for trees and odd cycles
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 162-168

%A Peter D. Mosses
%A Gordon D. Plotkin
%T On proving limiting completeness
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 169-178

%A Wolfgang Maass
%A Amir Schorr
%T Speed-up of Turing machines with one work tape and a two-way input tape
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 179-194

%A Francoise Fogelman Soulie
%A Gerard Weisbuch
%T Random iterations of threshold networks and associative memory
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 1
%D February 1987
%P 203-220

%A Karel Culik,\ II
%A Juhani Karhumaki
%T The equivalence problem for single-valued two-way transducers
(on NPDTOL languages) is decidable
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 2
%D April 1987
%P 221-230

%A E. Korach
%A S. Moran
%A S. Zaks
%T The optimality of distributive constructions of minimum weight
and degree restricted spanning trees in a complete network of processors
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 2
%D April 1987
%P 231-236

%A Dan Gusfield
%A Charles Martel
%A David Fernandez-Baca
%T Fast algorithms for bipartite network flow
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 2
%D April 1987
%P 237-251

%A D. Bini
%A M. Capovani
%T Tensor rank and border rank of band Toeplitz matrices
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 2
%D April 1987
%P 252-258

%A Jin-Yi Cai
%A Gabriele E. Meyer
%T Graph minimal uncolorability id D^P-complete
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 2
%D April 1987
%P 259-277

%A Thomas Lickteig
%T The computational complexity of division in quadratic extension fields
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 2
%D April 1987
%P 278-311

%A Takaso Asano
%T An application of duality to edge-deletion problems
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 2
%D April 1987
%P 312-331

%A Irene Guessarian
%A Jose Meseguer
%T On the axiomatization of "if-then-else"
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 2
%D April 1987
%P 332-357

%A J.D. Horton
%T A polynomial-time algorithm to find the shortest cycle basis of a graph
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 2
%D April 1987
%P 358-366

%A Oscar H. Ibarra
%A Michael A. Palis
%T On efficient simulations for a closed multiple access system
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 2
%D April 1987
%P 367-377

%A C. Knessl
%A B.J. Matkowsky
%A Z. Schuss
%A C. Tier
%T Asymptotic expansions for a closed multiple access system
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 2
%D April 1987
%P 378-398

%A Micha Hofri
%A Keith W. Ross
%T On the optimal control of two queries with server setup times
and its analysis
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 2
%D April 1987
%P 399-420

%A Roberto Tamassia
%T On embedding a graph in the grid with the minimum number of bends
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 3
%D June 1987
%P 421-444

%A Sam Toueg
%A Kenneth J. Perry
%A T.K. Srikanth
%T Fast distributed agreement
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 3
%D June 1987
%P 445-457

%A Yassi Azar
%A Uzi Vishkin
%T Tigh comparison bounds on the complexity of parallel sorting
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 3
%D June 1987
%P 458-464

%A Alan H. Mekler
%A Evelyn M. Nelson
%T Equational bases for if-then-else
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 3
%D June 1987
%P 465-485

%A Yuri Gurevich
%A Saharon Shelah
%T Expected computation time for Hamiltonian path problem
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 3
%D June 1987
%P 486-502

%A Vijay K. Vaishnavi
%T Weighted leaf AVL-trees
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 3
%D June 1987
%P 503-537

%A Christos H. Papadimitriou
%A Mihalis Yannakakis
%T The complexity of reliable concurrency control
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 3
%D June 1987
%P 538-553

%A Donald K. Friesen
%T Tighter bounds for LPT scheduling on uniform processors
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 3
%D June 1987
%P 554-560

%A Micha Sharir
%T On shortest paths amidst convex polyhedra
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 3
%D June 1987
%P 561-572

%A T.C. Hu
%A Michelle L. Wachs
%T Binary search on a tape
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 3
%D June 1987
%P 573-590

%A Arjen K. Lenstra
%T Factoring multivariate polynomials over algebraic number fields
%J SIAM Journal on Computing
%K siam_jc
%V 16
%N 3
%D June 1987
%P 591-598