Остановите войну!
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 28 matches
- 1972
- Sheldon B. Akers Jr.:
Universal Test Sets for Logic Networks. SWAT 1972: 177-184 - Brenda S. Baker, Ronald V. Book:
Reversal-Bounded Multi-Pushdown Machines: Extended Abstract. SWAT 1972: 207-211 - Jean Berstel:
On Sets of Numbers Recognized by Push-Down Automata. SWAT 1972: 200-206 - John L. Bruno, Edward G. Coffman Jr., W. H. Hosken:
Consistency of Synchronization Nets using P and V Operations. SWAT 1972: 71-77 - John C. Cherniavsky, Robert L. Constable:
Representing Program Schemes in Logic. SWAT 1972: 27-39 - Nathan Friedman:
Some Results on the Effect of Arithmetics on Comparison Problems. SWAT 1972: 139-143 - Joseph A. Goguen:
On Homomorphisms, Simulations, Correctness and Subroutines for Programs and Program Schemes. SWAT 1972: 52-60 - Ellis Horowitz:
The Efficient Calculation of Powers of Polynomials. SWAT 1972: 97-104 - R. Hossley, Charles Rackoff:
The Emptiness Problem for Automata on Infinite Trees. SWAT 1972: 121-124 - C. C. Huang, Richard Y. Kain, Larry L. Kinney:
Output Sufficient Modules for Uniform Decomposition of Synchronous Sequential Circuits. SWAT 1972: 192-199 - David S. Johnson:
Fast Allocation Algorithms. SWAT 1972: 144-154 - J. Robert Jump, P. S. Thiagarajan:
On the Equivalence of Asynchronous Control Structures. SWAT 1972: 212-223 - Robert M. Keller:
On the Decomposition of Asynchronous Systems. SWAT 1972: 78-89 - Denis J. Kfoury:
Effective Computability in Algebraic Structures (A Schematology Approach). SWAT 1972: 19-26 - C. L. Liu:
Optimal Scheduling on Multi-Processor Computing Systems. SWAT 1972: 155-160 - Luigi Logrippo:
Renamings in Program Schemas (Extended Abstract). SWAT 1972: 67-70 - T. S. E. Maibaum:
The Characterization of the Derivation Trees of Context Free Sets of Terms as Regular Sets. SWAT 1972: 224-230 - Albert R. Meyer, Robert Moll:
Honest Bounds for Complexity Classes of Recursive Functions. SWAT 1972: 61-66 - Albert R. Meyer, Larry J. Stockmeyer:
The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space. SWAT 1972: 125-129 - R. Moenck, Allan Borodin:
Fast Modular Transforms via Division. SWAT 1972: 90-96 - John Mylopoulos:
On the Relation of Graph Grammars and Graph Automata. SWAT 1972: 108-120 - Barry K. Rosen:
Program Equivalence and Context-Free Grammars. SWAT 1972: 7-18 - Sartaj Sahni:
Some Related Problems from Network Flows, Game Theory and Integer Programming. SWAT 1972: 130-138 - Kewal K. Saluja, Sudhakar M. Reddy:
Multiple Faults in Reed-Muller Canonic Networks. SWAT 1972: 185-191 - Mary Shaw, Joseph F. Traub:
On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives. SWAT 1972: 105-107 - George Tourlakis, John Mylopoulos:
Some Results in Computational Topology. SWAT 1972: 40-51 - Jeffrey D. Ullman:
A Fast Algorithm for the Elimination of Common Subexpressions. SWAT 1972: 161-176 - 13th Annual Symposium on Switching and Automata Theory, College Park, Maryland, USA, October 25-27, 1972. IEEE Computer Society 1972 [contents]
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-05-11 01:24 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