![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 44 matches
- 1981
- Akeo Adachi, Shigeki Iwata, Takumi Kasai:
Low Level Complexity for Combinatorial Games. STOC 1981: 228-237 - Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch:
A Difference in Efficiency between Synchronous and Asynchronous Systems. STOC 1981: 128-132 - Catriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, Mihalis Yannakakis:
Properties of Acyclic Database Schemes. STOC 1981: 355-362 - Alberto Bertoni, Giancarlo Mauri
, Nicoletta Sabadini:
A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines. STOC 1981: 168-176 - Tat-hung Chan:
Reversal Complexity of Counter Machines. STOC 1981: 146-157 - Ashok K. Chandra, Joseph Y. Halpern, Albert R. Meyer, Rohit Parikh:
Equations between Regular Terms and an Application to Process Logic. STOC 1981: 384-390 - Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky:
Embedded Implicational Dependencies and their Inference Problem. STOC 1981: 342-354 - Bernard Chazelle:
Convex Decompositions of Polyhedra. STOC 1981: 70-79 - Bernard Chazelle, Louis Monier:
A Model of Computation for VLSI with Related Complexity Results. STOC 1981: 318-325 - Paul Chew:
Unique Normal Forms in Term Rewriting Systems with Repeated Variables. STOC 1981: 7-18 - Karel Culík II, Tero Harju
:
The omega-Sequence Equivalence Problem for DOL Systems Is Decidable. STOC 1981: 1-6 - Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman:
Optimal Wiring between Rectangles. STOC 1981: 312-317 - Pavol Duris, Zvi Galil:
Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version). STOC 1981: 177-188 - Faith E. Fich:
Lower Bounds for the Cycle Detection Problem. STOC 1981: 96-105 - Zvi Galil, Wolfgang J. Paul:
An Efficient General Purpose Parallel Computer. STOC 1981: 247-262 - Zvi Galil, Joel I. Seiferas:
Time-Space-Optimal String Matching. STOC 1981: 106-113 - Gaston H. Gonnet, J. Ian Munro:
A Linear Probing Sort and its Analysis (Preliminary Draft). STOC 1981: 90-95 - Frank M. Hawrusik, K. N. Venkataraman, Ann Yasuhara:
Classes of Functions for Computing on Binary Trees (Extended Abstract). STOC 1981: 19-27 - Jia-Wei Hong, H. T. Kung:
I/O Complexity: The Red-Blue Pebble Game. STOC 1981: 326-333 - Jia-Wei Hong, Arnold L. Rosenberg:
Graphs that Are Almost Binary Trees (Preliminary Version). STOC 1981: 334-341 - Deborah Joseph, Paul Young:
Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract). STOC 1981: 55-61 - Chul E. Kim, Azriel Rosenfeld:
Digital Straightness and Convexity (Extended Abstract). STOC 1981: 80-89 - K. N. King:
Measures of Parallelism in Alternating Computation Trees (Extended Abstract). STOC 1981: 189-201 - Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller:
New Layouts for the Shuffle-Exchange Graph (Extended Abstract). STOC 1981: 278-292 - S. Rao Kosaraju:
Localized Search in Sorted Lists. STOC 1981: 62-69 - Balakrishnan Krishnamurthy, Robert N. Moll:
Examples of Hard Tautologies in the Propositional Calculus. STOC 1981: 28-37 - Daniel Leivant:
The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories). STOC 1981: 38-45 - Richard J. Lipton, Robert Sedgewick:
Lower Bounds for VLSI. STOC 1981: 300-307 - Ernst W. Mayr:
An Algorithm for the General Petri Net Reachability Problem. STOC 1981: 238-246 - Burkhard Monien, Ivan Hal Sudborough:
Bandwidth Constrained NP-Complete Problems. STOC 1981: 207-217
skipping 14 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-31 01:51 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