default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th STOC 1978: San Diego, California, USA
- Richard J. Lipton, Walter A. Burkhard, Walter J. Savitch, Emily P. Friedman, Alfred V. Aho:
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA. ACM 1978 - Nimrod Megiddo:
Combinatorial Optimization with Rational Objective Functions. 1-12 - George S. Lueker:
Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract). 13-18 - Mark R. Brown, Robert Endre Tarjan:
A Representation for Linear Lists with Movable Fingers. 19-29 - James A. Storer, Thomas G. Szymanski:
The Macro Model for Data Compression (Extended Abstract). 30-39 - Andrea S. LaPaugh, Ronald L. Rivest:
The Subgraph Homeomorphism Problem. 40-50 - Gary L. Miller:
On the n^log n Isomorphism Technique: A Preliminary Report. 51-58 - Larry Carter, Robert Floyd, John Gill, George Markowsky, Mark N. Wegman:
Exact and Approximate Membership Testers. 59-65 - Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki:
Tree Transducers, L Systems and Two-Way Machines (Extended Abstract). 66-74 - Jean-Claude Raoult, Jean Vuillemin:
Operational and Semantic Equivalence between Recursive Programs. 75-85 - Howard P. Katseff:
A New Solution to the Critical Section Problem. 86-88 - Leslie M. Goldschlager:
A Unified Approach to Models of Synchronous Parallel Machines. 89-94 - Edward Sciore, A. Tang:
Computability Theory in Admissible Domains. 95-104 - Raymond E. Miller, Chee-Keng Yap:
On Formulating Simultaneity for Studying Parallelism and Synchronization. 105-113 - Steven Fortune, James Wyllie:
Parallelism in Random Access Machines. 114-118 - James W. Thatcher, Eric G. Wagner, Jesse B. Wright:
Data Type Specification: Parameterization and the Power of Specification Techniques. 119-132 - I. S. Filotti:
An Efficient Algorithm for Determining Whether a Cubic Graph is Toroidal. 133-142 - Ingo Wegener:
Switching Functions Whose Monotone Complexity Is Nearly Quadratic. 143-149 - Nancy A. Lynch:
Straight-Line Program Length as a Parameter for Complexity Measures. 150-161 - Victor Y. Pan:
Computational Complexity of Computing Polynomials over the Fields of Real and Complex Numbers. 162-172 - Joseph F. JáJá:
Optimal Evaluation of Pairs of Bilinear Forms. 173-183 - Harold N. Gabow, Oded Kariv:
Algorithms for Edge Coloring Bipartite Graphs. 184-192 - Laurent Hyafil:
On the Parallel Evaluation of Multivariate Polynomials. 193-195 - Martin Tompa:
Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of their Circuits. 196-204 - Eitan M. Gurari, Oscar H. Ibarra:
An NP-Complete Number-Theoretic Problem. 205-215 - Thomas J. Schaefer:
The Complexity of Satisfiability Problems. 216-226 - Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer:
Coping with Errors in Binary Search Procedures (Preliminary Report). 227-232 - Anni R. Bruss, Albert R. Meyer:
On Time-Space Classes and Their Relation to the Theory of Real Addition. 233-239 - David G. Kirkpatrick, Pavol Hell:
On the Completeness of a Generalized Matching Problem. 240-245 - Martin Dowd:
Propositional Representation of Arithmetic Proofs (Preliminary Version). 246-252 - Mihalis Yannakakis:
Node- and Edge-Deletion NP-Complete Problems. 253-264 - John M. Lewis:
On the Complexity of the Maximum Subgraph Problem. 265-274 - William J. Sakoda, Michael Sipser:
Nondeterminism and the Size of Two Way Finite Automata. 275-286 - Dexter Kozen:
Indexing of Subrecursive Classes. 287-295 - Gérard M. Baudet:
An Analysis of the Full Alpha-Beta Pruning Algorithm. 296-313 - John Case, Carl Smith:
Anomaly Hierarchies of Mechanized Inductive Inference. 314-319 - C. R. Reddy, Donald W. Loveland:
Presburger Arithmetic with Bounded Quantifier Alternation. 320-325 - Vaughan R. Pratt:
A Practical Decision Method for Propositional Dynamic Logic: Preliminary Report. 326-337 - Charles Rackoff:
Relativized Questions Involving Probabilistic Algorithms. 338-342
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
