STOC A*

39 papers

YearTitle / Authors
1978A New Solution to the Critical Section Problem
Howard P. Katseff
1978A Practical Decision Method for Propositional Dynamic Logic: Preliminary Report
Vaughan R. Pratt
1978A Representation for Linear Lists with Movable Fingers
Mark R. Brown, Robert Endre Tarjan
1978A Unified Approach to Models of Synchronous Parallel Machines
Leslie M. Goldschlager
1978Algorithms for Edge Coloring Bipartite Graphs
Harold N. Gabow, Oded Kariv
1978An Analysis of the Full Alpha-Beta Pruning Algorithm
Gérard M. Baudet
1978An Efficient Algorithm for Determining Whether a Cubic Graph is Toroidal
I. S. Filotti
1978An NP-Complete Number-Theoretic Problem
Eitan M. Gurari, Oscar H. Ibarra
1978Anomaly Hierarchies of Mechanized Inductive Inference
John Case, Carl Smith
1978Combinatorial Optimization with Rational Objective Functions
Nimrod Megiddo
1978Computability Theory in Admissible Domains
Edward Sciore, A. Tang
1978Computational Complexity of Computing Polynomials over the Fields of Real and Complex Numbers
Victor Y. Pan
1978Coping with Errors in Binary Search Procedures (Preliminary Report)
Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
1978Data Type Specification: Parameterization and the Power of Specification Techniques
James W. Thatcher, Eric G. Wagner, Jesse B. Wright
1978Exact and Approximate Membership Testers
Larry Carter, Robert Floyd, John Gill, George Markowsky, Mark N. Wegman
1978Indexing of Subrecursive Classes
Dexter Kozen
1978Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract)
George S. Lueker
1978Node- and Edge-Deletion NP-Complete Problems
Mihalis Yannakakis
1978Nondeterminism and the Size of Two Way Finite Automata
William J. Sakoda, Michael Sipser
1978On Formulating Simultaneity for Studying Parallelism and Synchronization
Raymond E. Miller, Chee-Keng Yap
1978On Time-Space Classes and Their Relation to the Theory of Real Addition
Anni R. Bruss, Albert R. Meyer
1978On the Completeness of a Generalized Matching Problem
David G. Kirkpatrick, Pavol Hell
1978On the Complexity of the Maximum Subgraph Problem
John M. Lewis
1978On the Parallel Evaluation of Multivariate Polynomials
Laurent Hyafil
1978On the n^log n Isomorphism Technique: A Preliminary Report
Gary L. Miller
1978Operational and Semantic Equivalence between Recursive Programs
Jean-Claude Raoult, Jean Vuillemin
1978Optimal Evaluation of Pairs of Bilinear Forms
Joseph F. JáJá
1978Parallelism in Random Access Machines
Steven Fortune, James Wyllie
1978Presburger Arithmetic with Bounded Quantifier Alternation
C. R. Reddy, Donald W. Loveland
1978Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA
Richard J. Lipton, Walter A. Burkhard, Walter J. Savitch, Emily P. Friedman, Alfred V. Aho
1978Propositional Representation of Arithmetic Proofs (Preliminary Version)
Martin Dowd
1978Relativized Questions Involving Probabilistic Algorithms
Charles Rackoff
1978Straight-Line Program Length as a Parameter for Complexity Measures
Nancy A. Lynch
1978Switching Functions Whose Monotone Complexity Is Nearly Quadratic
Ingo Wegener
1978The Complexity of Satisfiability Problems
Thomas J. Schaefer
1978The Macro Model for Data Compression (Extended Abstract)
James A. Storer, Thomas G. Szymanski
1978The Subgraph Homeomorphism Problem
Andrea S. LaPaugh, Ronald L. Rivest
1978Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of their Circuits
Martin Tompa
1978Tree Transducers, L Systems and Two-Way Machines (Extended Abstract)
Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki