Остановите войну!
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 64 matches
- 1982
- Dana Angluin:
Inference of Reversible Languages. J. ACM 29(3): 741-765 (1982) - Krzysztof R. Apt, Maarten H. van Emden:
Contributions to the Theory of Logic Programming. J. ACM 29(3): 841-862 (1982) - Michael A. Arbib, Ernest G. Manes:
The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions. J. ACM 29(2): 577-602 (1982) - Christopher Bader, Arnaldo Moura:
A Generalization of Ogden's Lemma. J. ACM 29(2): 404-407 (1982) - John C. Beatty:
On the relationship between LL(1) and LR(1) grammars. J. ACM 29(4): 1007-1022 (1982) - Ronald I. Becker, Stephen R. Schach, Yehoshua Perl:
A Shifting Algorithm for Min-Max Tree Partitioning. J. ACM 29(1): 58-67 (1982) - Ronald V. Book:
Confluent and Other Types of Thue Systems. J. ACM 29(1): 171-182 (1982) - Richard P. Brent, H. T. Kung:
Corrigendum: "The Area-Time Complexity of Binary Multiplication". J. ACM 29(3): 904 (1982) - Theodore Brown:
Determination of the conditional response for quantum allocation algorithms. J. ACM 29(2): 448-460 (1982) - Raymond M. Bryant:
Maximum Processing Rates of Memory Bound Systems. J. ACM 29(2): 461-477 (1982) - James E. Burns, Paul Jackson, Nancy A. Lynch, Michael J. Fischer, Gary L. Peterson:
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable. J. ACM 29(1): 183-205 (1982) - D. Chow, Clement T. Yu:
On the Construction of Feedback Queries. J. ACM 29(1): 127-151 (1982) - Jacques Cohen, Timothy J. Hickey, Joel Katcoff:
Upper Bounds for Speedup in Parallel Parsing. J. ACM 29(2): 408-428 (1982) - Hans-Dieter Ehrich:
On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types. J. ACM 29(1): 206-227 (1982) - George W. Ernst, Michael M. Goldstein:
Mechanical Discovery of Classes of Problem-Solving Strategies. J. ACM 29(1): 1-23 (1982) - Ronald Fagin:
Horn clauses and database dependencies. J. ACM 29(4): 952-985 (1982) - Robert W. Floyd, Jeffrey D. Ullman:
The Compilation of Regular Expressions into Integrated Circuits. J. ACM 29(3): 603-622 (1982) - Michael L. Fredman:
The Complexity of Maintaining an Array and Computing Its Partial Sums. J. ACM 29(1): 250-260 (1982) - Eugene C. Freuder:
A Sufficient Condition for Backtrack-Free Search. J. ACM 29(1): 24-32 (1982) - Harold N. Gabow:
An Almost-Linear Algorithm for Two-Processor Scheduling. J. ACM 29(3): 766-780 (1982) - Zvi Galil:
An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database. J. ACM 29(1): 96-102 (1982) - Seymour Ginsburg, Sami Mohammed Zaiddan:
Properties of functional-dependency families. J. ACM 29(3): 678-698 (1982) - Leslie M. Goldschlager:
A universal interconnection pattern for parallel computers. J. ACM 29(4): 1073-1086 (1982) - John Grant, Barry E. Jacobs:
On the family of generalized dependency constraints. J. ACM 29(4): 986-997 (1982) - Eitan M. Gurari, Oscar H. Ibarra:
Two-Way Counter Machines and Diophantine Equations. J. ACM 29(3): 863-873 (1982) - Christoph M. Hoffmann, Michael J. O'Donnell:
Pattern Matching in Trees. J. ACM 29(1): 68-95 (1982) - Peter Honeyman:
Testing satisfaction of functional dependencies. J. ACM 29(3): 668-677 (1982) - Harry B. Hunt III:
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages. J. ACM 29(1): 228-249 (1982) - Harry B. Hunt III:
On the Decidability of Grammar Problems. J. ACM 29(2): 429-447 (1982) - Barry E. Jacobs:
On Database Logic. J. ACM 29(2): 310-332 (1982)
skipping 34 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-04-25 09:22 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