Остановите войну!
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 39 matches
- 1986
- Serge Abiteboul, Seymour Ginsburg:
Tuple sequences and lexicographic indexes. J. ACM 33(3): 409-422 (1986) - Krzysztof R. Apt, Gordon D. Plotkin:
Countable nondeterminism and random assignment. J. ACM 33(4): 724-767 (1986) - Takao Asano, Tetsuo Asano, Hiroshi Imai:
Partitioning a polygonal region into trapezoids. J. ACM 33(2): 290-312 (1986) - José L. Balcázar, Ronald V. Book, Uwe Schöning:
The polynomial-time hierarchy and sparse oracles. J. ACM 33(3): 603-617 (1986) - Catriel Beeri, Michael Kifer:
Elimination of intersection anomalies from database schemes. J. ACM 33(3): 423-450 (1986) - Dennis de Champeaux:
Subproblem finder and instance checker, two cooperating modules for theorem provers. J. ACM 33(4): 633-657 (1986) - Ranjan Chaudhuri, A. N. V. Rao:
Approximating grammar probabilities: solution of a conjecture. J. ACM 33(4): 702-705 (1986) - Francis Y. L. Chin:
Security problems on inference control for SUM, MAX, and MIN queries. J. ACM 33(3): 451-464 (1986) - Benny Chor, Charles E. Leiserson, Ronald L. Rivest, James B. Shearer:
An application of number theory to the organization of raster-graphics memory. J. ACM 33(1): 86-104 (1986) - Thomas F. Coleman, Anders Edenbrandt, John R. Gilbert:
Predicting fill for sparse orthogonal factorization. J. ACM 33(3): 517-532 (1986) - Bruce Jay Collings, G. Barry Hembree:
Initializing generalized feedback shift register pseudorandom number generators. J. ACM 33(4): 706-711 (1986) - Adrian E. Conway, Nicolas D. Georganas:
RECAL - a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks. J. ACM 33(4): 768-791 (1986) - Michel Cosnard, Yves Robert:
Complexity of parallel QR factorization. J. ACM 33(4): 712-723 (1986) - Luc Devroye:
A note on the height of binary search trees. J. ACM 33(3): 489-498 (1986) - Vincent J. Digricoli, Malcolm C. Harrison:
Equality-based binary resolution. J. ACM 33(2): 253-289 (1986) - Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, William E. Weihl:
Reaching approximate agreement in the presence of faults. J. ACM 33(3): 499-516 (1986) - Derek L. Eager, Kenneth C. Sevcik:
Bound hierarchies for multiple-class queuing networks. J. ACM 33(1): 179-206 (1986) - E. Allen Emerson, Joseph Y. Halpern:
"Sometimes" and "Not Never" revisited: on branching versus linear time temporal logic. J. ACM 33(1): 151-178 (1986) - Philippe Flajolet, Claude Puech:
Partial match retrieval of multidimensional data. J. ACM 33(2): 371-407 (1986) - Seymour Ginsburg, Richard Hull:
Sort sets in the relational model. J. ACM 33(3): 465-488 (1986) - Oded Goldreich, Shafi Goldwasser, Silvio Micali:
How to construct random functions. J. ACM 33(4): 792-807 (1986) - Marc H. Graham, Alberto O. Mendelzon, Moshe Y. Vardi:
Notions of dependency satisfaction. J. ACM 33(1): 105-129 (1986) - W. Eric L. Grimson:
The combinatorics of local constraints in model-based recognition and localization from sparse data. J. ACM 33(4): 658-686 (1986) - David Harel:
Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. J. ACM 33(1): 224-248 (1986) - Dorit S. Hochbaum, David B. Shmoys:
A unified approach to approximation algorithms for bottleneck problems. J. ACM 33(3): 533-550 (1986) - Ravindran Kannan, Richard J. Lipton:
Polynomial-time algorithm for the orbit problem. J. ACM 33(4): 808-821 (1986) - Leslie Lamport:
The mutual exclusion problem: part I - a theory of interprocess communication. J. ACM 33(2): 313-326 (1986) - Leslie Lamport:
The mutual exclusion problem: partII - statement and solutions. J. ACM 33(2): 327-348 (1986) - Appie van de Liefvoort, Lester Lipsky:
A matrix-algebraic solution to two Km servers in a loop. J. ACM 33(1): 207-223 (1986) - Timothy J. Long, Alan L. Selman:
Relativizing complexity classes with sparse oracles. J. ACM 33(3): 618-627 (1986)
skipping 9 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-23 17:27 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