Остановите войну!
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 38 matches
- 1992
- Luca Aceto, Matthew Hennessy:
Termination, Deadlock, and Divergence. J. ACM 39(1): 147-187 (1992) - Eric Allender, Lane A. Hemachandra:
Lower Bounds for the Low Hierarchy. J. ACM 39(1): 234-251 (1992) - Martin Beaudry, Pierre McKenzie, Denis Thérien:
The Membership Problem in Aperiodic Transformation Monoids. J. ACM 39(3): 599-616 (1992) - Mihir Bellare, Silvio Micali:
How to Sign Given Any Trapdoor Permutation. J. ACM 39(1): 214-233 (1992) - Amir M. Ben-Amram, Zvi Galil:
On Pointers versus Addresses. J. ACM 39(3): 617-648 (1992) - Alain Billionnet, Marie-Christine Costa, Alain Sutter:
An Efficient Algorithm for a Task Allocation Problem. J. ACM 39(3): 502-518 (1992) - Allan Borodin, Nathan Linial, Michael E. Saks:
An Optimal On-Line Algorithm for Metrical Task System. J. ACM 39(4): 745-763 (1992) - Bernard Chazelle, Herbert Edelsbrunner:
An Optimal Algorithm for Intersecting Line Segments in the Plane. J. ACM 39(1): 1-54 (1992) - Oliver Collins, Sam Dolinar, Robert J. McEliece, Fabrizio Pollara:
A VLSI Decomposition of the deBruijn Graph. J. ACM 39(4): 931-948 (1992) - Saumya K. Debray:
Efficient Dataflow Analysis of Logic Programs. J. ACM 39(4): 949-984 (1992) - Robert Demolombe:
Syntactical Characterization of a Subset of Domain-Independent Formulas. J. ACM 39(1): 71-94 (1992) - Michael B. Dillencourt, Hanan Samet, Markku Tamminen:
A General Approach to Connected-Component Labelling for Arbitrary Image Representations. J. ACM 39(2): 253-280 (1992) - Michael B. Dillencourt, Hanan Samet, Markku Tamminen:
Corrigenda: 'A General Approach to Connected-Component Labelling for Arbitrary Image Representations'. J. ACM 39(4): 985-986 (1992) - Lawrence W. Dowdy, Brian M. Carlson, Alan T. Krantz, Satish K. Tripathi:
Single-Class Bounds of Multi-Class Queuing Networks. J. ACM 39(1): 188-213 (1992) - Cynthia Dwork, Larry J. Stockmeyer:
Finite State Verifiers I: The Power of Interaction. J. ACM 39(4): 800-828 (1992) - Cynthia Dwork, Larry J. Stockmeyer:
Finite State Verifiers II: Zero Knowledge. J. ACM 39(4): 829-858 (1992) - David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano:
Sparse Dynamic Programming I: Linear Cost Functions. J. ACM 39(3): 519-545 (1992) - David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano:
Sparse Dynamic Programming II: Convex and Concave Cost Functions. J. ACM 39(3): 546-567 (1992) - Ronald Fagin, Joseph Y. Halpern, Moshe Y. Vardi:
What Can Machines Know? On the Properties of Knowledge in Distributed Systems. J. ACM 39(2): 328-376 (1992) - Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel:
Nonoblivious Hashing. J. ACM 39(4): 764-782 (1992) - Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder:
Theorem Proving Using Equational Matings and Rigid E-Unification. J. ACM 39(2): 377-429 (1992) - William I. Gasarch, Carl H. Smith:
Learning via Queries. J. ACM 39(3): 649-674 (1992) - Steven M. German, A. Prasad Sistla:
Reasoning about Systems with Many Processes. J. ACM 39(3): 675-735 (1992) - Joseph A. Goguen, Rod M. Burstall:
Institutions: Abstract Model Theory for Specification and Programming. J. ACM 39(1): 95-146 (1992) - Albert G. Greenberg, Neal Madras:
How Fair is Fair Queuing? J. ACM 39(3): 568-598 (1992) - Joseph Y. Halpern, Lenore D. Zuck:
A Little Knowledge Goes a Long Way: Knowledge-Based Derivations and Correctness Proofs for a Family of Protocols. J. ACM 39(3): 449-478 (1992) - Lenwood S. Heath, Sorin Istrail:
The Pagenumber of Genus g Graphs is O(g). J. ACM 39(3): 479-501 (1992) - Maurice Herlihy, Nancy A. Lynch, Michael Merritt, William E. Weihl:
On the Correctness of Orphan Management Algorithms. J. ACM 39(4): 881-930 (1992) - Jyrki Katajainen, Timo Raita:
An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding. J. ACM 39(2): 281-294 (1992) - Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan:
Algebraic Methods for Interactive Proof Systems. J. ACM 39(4): 859-868 (1992)
skipping 8 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-08-22 16: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