default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th STOC 1976: Hershey, Pennsylvania, USA
- Ashok K. Chandra, Detlef Wotschke, Emily P. Friedman, Michael A. Harrison:
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, USA. ACM 1976 - Christos H. Papadimitriou, Kenneth Steiglitz:
Some Complexity Results for the Traveling Salesman Problem. 1-9 - M. R. Garey, Ronald L. Graham, David S. Johnson:
Some NP-Complete Geometric Problems. 10-22 - Kenneth L. Manders, Leonard M. Adleman:
NP-Complete Decision Problems for Quadratic Polynomials. 23-29 - Juris Hartmanis, Leonard Berman:
On Isomorphisms and Density of NP and Other Complete Sets. 30-40 - Thomas J. Schaefer:
Complexity of Decision Problems Based on Finite Two-Person Perfect-Information Games. 41-49 - E. Cardoza, Richard J. Lipton, Albert R. Meyer:
Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report. 50-54 - Daniel S. Hirschberg:
Parallel Algorithms for the Transitive Closure and the Connected Component Problems. 55-57 - Clark D. Thompson, H. T. Kung:
Sorting on a Mesh-Connected Parallel Computer. 58-64 - Thomas W. Doeppner Jr.:
On Abstractions of Parallel Programs. 65-72 - Susan S. Owicki:
A Consistent and Complete Deductive System for the Verification of Parallel Programs. 73-86 - Mitchell Wand:
A New Incompleteness Result for Hoare's System. 87-91 - Takayuki Kimura:
An Algebraic System for Process Structuring and Interprocess Communication. 92-100 - S. Rao Kosaraju:
On Structuring Flowcharts (Preliminary Version). 101-111 - Susan L. Graham, Michael A. Harrison, Walter L. Ruzzo
:
On Line Context Free Language Recognition in Less than Cubic Time (Extended Abstract). 112-120 - Amelia C. Fong, Jeffrey D. Ullman:
Finding the Depth of a Flow Graph. 121-125 - Harry B. Hunt III, Thomas G. Szymanski:
Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract). 126-134 - Oscar H. Ibarra, Chul E. Kim:
A Useful Device for Showing the Solvability of Some Decision Problems. 135-140 - Ivan Hal Sudborough:
On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store. 141-148 - Wolfgang J. Paul, Robert Endre Tarjan, James R. Celoni:
Space Bounds for a Game of Graphs. 149-160 - Zvi Galil:
Real-Time Algorithms for String-Matching and Palindrome Recognition. 161-173 - Richard J. Lipton, Larry J. Stockmeyer:
Evaluation of Polynomials with Super-Preconditioning. 174-180 - Mike Paterson, Mark N. Wegman:
Linear Unification. 181-186 - Leonidas J. Guibas, Endre Szemerédi:
The Analysis of Double Hashing (Extended Abstract). 187-191 - Andrew Chi-Chih Yao:
On the Average Behavior of Set Merging Algorithms (Extended Abstract). 192-195 - Leslie G. Valiant:
Universal Circuits (Preliminary Report). 196-203 - Nicholas Pippenger:
The Realization of Monotone Boolean Functions (Preliminary Version). 204-210 - Walter A. Burkhard:
Associative Retrieval Trie Hash-Coding. 211-219 - Jon Louis Bentley, Michael Ian Shamos:
Divide-and-Conquer in Multidimensional Space. 220-230 - D. T. Lee, Franco P. Preparata:
Location of a Point in a Planar Subdivision and its Applications. 231-235 - Michael Machtey, Paul Young:
Simple Gödel Numberings, Translations, and the P-Hierarchy. 236-243
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-02-05 20:38 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:
