Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 36 matches
- 1974
- Ronald V. Book, Maurice Nivat, Mike Paterson:
Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract). STOC 1974: 290-296 - Allan Borodin, Stephen A. Cook:
On the Number of Additions to Compute Specific Polynomials (Preliminary Version). STOC 1974: 342-347 - Ashok K. Chandra:
Degrees of Translatability and Canonical Forms in Program Schemas: Part I. STOC 1974: 1-12 - Stephen A. Cook, Robert A. Reckhow:
On the Lengths of Proofs in the Propositional Calculus (Preliminary Version). STOC 1974: 135-148 - Stephen A. Cook, Ravi Sethi:
Storage Requirements for Deterministic Polynomial Time Recognizable Languages. STOC 1974: 33-39 - Bruno Courcelle, Jean Vuillemin:
Semantics and Axiomatics of a Simple Recursive Language. STOC 1974: 13-26 - David P. Dobkin, Richard J. Lipton:
On Some Generalizations of Binary Search. STOC 1974: 310-316 - Andrzej Ehrenfeucht, H. Paul Zeiger:
Complexity Measures for Regular Expressions. STOC 1974: 75-79 - M. R. Garey, David S. Johnson, Larry J. Stockmeyer:
Some Simplified NP-Complete Problems. STOC 1974: 47-63 - John T. Gill III:
Computational Complexity of Probabilistic Turing Machines. STOC 1974: 91-95 - Sheila A. Greibach:
Some Restrictions on W-Grammars. STOC 1974: 256-265 - Michael Hammer:
A New Grammatical Transformation into LL(k) Form (Extended Abstract). STOC 1974: 266-275 - John E. Hopcroft, J. K. Wong:
Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report). STOC 1974: 172-184 - Edward C. Horvath:
Efficient Stable Sorting with Minimal Extra Space. STOC 1974: 194-215 - Harry B. Hunt III, Daniel J. Rosenkrantz:
Computational Parallels between the Regular and Context-Free Languages. STOC 1974: 64-74 - Laurent Hyafil, F. Prusker, Jean Vuillemin:
An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract). STOC 1974: 216-229 - Neil D. Jones, William T. Laaser:
Complete Problems for Deterministic Polynomial Time. STOC 1974: 40-46 - Zvi M. Kedem:
Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications. STOC 1974: 334-341 - David G. Kirkpatrick:
Determining Graph Properties from Matrix Representations. STOC 1974: 84-90 - H. T. Kung:
New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions. STOC 1974: 323-333 - Richard E. Ladner, Nancy A. Lynch, Alan L. Selman:
Comparisons of Polynomial-Time Reducibilities. STOC 1974: 110-121 - Jan van Leeuwen:
A Partial Solution to the Reachability-Problem for Vector-Addition Systems. STOC 1974: 303-309 - Richard J. Lipton:
Limitations of Synchronization Primitives with Conditional Branching and Global Variables. STOC 1974: 230-241 - Kurt Mehlhorn:
Polynomial and Abstract Subrecursive Classes. STOC 1974: 96-109 - Jonathan K. Millen:
Construction with Parallel Derivatives of the Closure of a Parallel Program Schema. STOC 1974: 242-247 - Webb Miller:
Computational Complexity and Numerical Stability. STOC 1974: 317-322 - Vaughan R. Pratt:
The Power of Negative Thinking in Multiplying Boolean Matrices. STOC 1974: 80-83 - Vaughan R. Pratt, Michael O. Rabin, Larry J. Stockmeyer:
A Characterization of the Power of Vector Machines. STOC 1974: 122-134 - Charles Rackoff:
On the Complexity of the Theories of Weak Direct Products: A Preliminary Report. STOC 1974: 149-160 - Edward L. Robertson:
Structure of Complexity in the Weak Monadic Second-Order Theories of the Natural Numbers. STOC 1974: 161-171
skipping 6 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-20 21:35 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint