Остановите войну!
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 61 matches
- 1980
- Harold Abelson:
Lower Bounds on Information Transfer in Distributed Computations. J. ACM 27(2): 384-392 (1980) - Fred G. Abramson, Yuri Breitbart, Forbes D. Lewis:
Complex Properties of Grammars. J. ACM 27(3): 484-498 (1980) - Doris Altenkamp, Kurt Mehlhorn:
Codes: Unequal Probabilities, Unequal Letter Cost. J. ACM 27(3): 412-427 (1980) - Alan R. Aronson, Barry E. Jacobs, Jack Minker:
A Note on Fuzzy Deduction. J. ACM 27(4): 599-603 (1980) - Edward A. Bender:
The Number of Fanout-Free Functions with Various Gates. J. ACM 27(1): 181-190 (1980) - We-Min Chow:
The Cycle Time Distribution of Exponential Cyclic Queues. J. ACM 27(2): 281-286 (1980) - Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton:
Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem. J. ACM 27(1): 123-127 (1980) - Peter J. Downey, Ravi Sethi, Robert Endre Tarjan:
Variations on the Common Subexpression Problem. J. ACM 27(4): 758-771 (1980) - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
The Sequence Equivalence Problem is Decidable for 0S Systems. J. ACM 27(4): 656-663 (1980) - Joost Engelfriet, Grzegorz Rozenberg:
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages. J. ACM 27(3): 499-518 (1980) - Joost Engelfriet, Erik Meineche Schmidt, Jan van Leeuwen:
Stack Machines and Classes of Nonnested Macro Languages. J. ACM 27(1): 96-117 (1980) - Guy Fayolle, Isi Mitrani, R. Iasnogorodski:
Sharing a Processor Among Many Job Classes. J. ACM 27(3): 519-532 (1980) - Marshall L. Fisher, Dorit S. Hochbaum:
Database Location in Computer Networks. J. ACM 27(4): 718-735 (1980) - Carlo Ghezzi, Dino Mandrioli:
Augmenting Parsers to Support Incrementality. J. ACM 27(3): 564-579 (1980) - Teofilo F. Gonzalez, Donald B. Johnson:
A New Algorithm for Preemptive Scheduling of Trees. J. ACM 27(2): 287-312 (1980) - Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao:
Information Bounds Are Weak in the Shortest Distance Problem. J. ACM 27(3): 428-444 (1980) - Sheila A. Greibach, Emily P. Friedman:
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem. J. ACM 27(4): 675-700 (1980) - Peter B. Henderson, Yechezkel Zalcstein:
Synchronization Problems Solvable by Generalized PV Systems. J. ACM 27(1): 60-71 (1980) - Gérard P. Huet:
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems. J. ACM 27(4): 797-821 (1980) - Joseph F. JáJá:
Computations of Bilinear Forms over Finite Fields. J. ACM 27(4): 822-830 (1980) - Tiko Kameda:
Testing Deadlock-Freedom of Computer Systems. J. ACM 27(2): 270-280 (1980) - Ravindran Kannan:
A Polynomial Algorithm for the Two-Variable Integer Programming Problem. J. ACM 27(1): 118-122 (1980) - Marc A. Kaplan, Jeffrey D. Ullman:
A Scheme for the Automatic Inference of Variable Types. J. ACM 27(1): 128-145 (1980) - Ramachandran Krishnaswamy, Arthur B. Pyster:
On the Correctness of Semantic-Syntax-Directed Translations. J. ACM 27(2): 338-355 (1980) - Richard E. Ladner, Michael J. Fischer:
Parallel Prefix Computation. J. ACM 27(4): 831-838 (1980) - D. T. Lee:
Two-Dimensional Voronoi Diagrams in the Lp-Metric. J. ACM 27(4): 604-618 (1980) - David Lichtenstein, Michael Sipser:
GO Is Polynomial-Space Hard. J. ACM 27(2): 393-401 (1980) - Richard J. Lipton, Arnold L. Rosenberg, Andrew Chi-Chih Yao:
External Hashing Schemes for Collections of Data Structures. J. ACM 27(1): 81-95 (1980) - David Maier:
Minimum Covers in Relational Database Model. J. ACM 27(4): 664-674 (1980) - Haim Mendelson, Uri Yechiali:
A New Approach to the Analysis of Linear Probing Schemes. J. ACM 27(3): 474-483 (1980)
skipping 31 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-05-06 01:38 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