Остановите войну!
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 31 matches
- 1998
- Serge Abiteboul, Paris C. Kanellakis:
Object Identity as a Query Language Primitive. J. ACM 45(5): 798-842 (1998) - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
A New General Derandomization Method. J. ACM 45(1): 179-213 (1998) - Sanjeev Arora:
Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems. J. ACM 45(5): 753-782 (1998) - Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy:
Proof Verification and the Hardness of Approximation Problems. J. ACM 45(3): 501-555 (1998) - Sanjeev Arora, Shmuel Safra:
Probabilistic Checking of Proofs: A New Characterization of NP. J. ACM 45(1): 70-122 (1998) - Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu:
An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. J. ACM 45(6): 891-923 (1998) - James Aspnes:
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus. J. ACM 45(3): 415-450 (1998) - Leo Bachmair, Harald Ganzinger:
Ordered Chaining Calculi for First-Order Theories of Transitive Relations. J. ACM 45(6): 1007-1049 (1998) - Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong:
Relational Expressive Power of Constraint Query Languages. J. ACM 45(1): 1-34 (1998) - Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki:
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. J. ACM 45(5): 863-890 (1998) - Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan:
Private Information Retrieval. J. ACM 45(6): 965-981 (1998) - Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou:
How to Learn an Unknown Environment I: The Rectilinear Case. J. ACM 45(2): 215-245 (1998) - Tamal K. Dey, Sumanta Guha:
Computing Homology Groups of Simplicial Complexes in R3. J. ACM 45(2): 266-287 (1998) - Uriel Feige:
A Threshold of ln n for Approximating Set Cover. J. ACM 45(4): 634-652 (1998) - Alan D. Fekete, M. Frans Kaashoek, Nancy A. Lynch:
Implementing Sequentially Consistent Shared Objects using Broadcast and Point-to-Point Communication. J. ACM 45(1): 35-69 (1998) - Paulo Fernandes, Brigitte Plateau, William J. Stewart:
Efficient Descriptor-Vector Multiplications in Stochastic Automata Networks. J. ACM 45(3): 381-414 (1998) - Faith E. Fich, Maurice Herlihy, Nir Shavit:
On the Space Complexity of Randomized Synchronization. J. ACM 45(5): 843-862 (1998) - Andrew V. Goldberg, Satish Rao:
Beyond the Flow Decomposition Barrier. J. ACM 45(5): 783-797 (1998) - Oded Goldreich, Shafi Goldwasser, Dana Ron:
Property Testing and its Connection to Learning and Approximation. J. ACM 45(4): 653-750 (1998) - Joseph Y. Halpern:
Time to Publication: A Progress Report. J. ACM 45(3): 379-380 (1998) - Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg:
Fault-Tolerant Wait-Free Shared Objects. J. ACM 45(3): 451-500 (1998) - David R. Karger, Rajeev Motwani, Madhu Sudan:
Approximate Graph Coloring by Semidefinite Programming. J. ACM 45(2): 246-265 (1998) - Richard M. Karp, Yanjun Zhang:
On Parallel Evaluation of Game Trees. J. ACM 45(6): 1050-1075 (1998) - Michael J. Kearns:
Efficient Noise-Tolerant Learning from Statistical Queries. J. ACM 45(6): 983-1006 (1998) - Michael Kifer:
On the Decidability and Axiomatization of Query Finiteness in Deductive Databases. J. ACM 45(4): 588-633 (1998) - Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman:
On Contention Resolution Protocols and Associated Probabilistic Phenomena. J. ACM 45(2): 324-378 (1998) - Conrado Martínez, Salvador Roura:
Randomized Binary Search Trees. J. ACM 45(2): 288-323 (1998) - Marco Pellegrini:
Electrostatic Fields Without Singularities: Theory, Algorithms and Error Analysis. J. ACM 45(6): 924-964 (1998) - Fong Pong, Michel Dubois:
Formal Verification of Complex Coherence Protocols Using Symbolic State Models. J. ACM 45(4): 557-587 (1998) - Michael E. Saks, Aravind Srinivasan, Shiyu Zhou:
Explicit OR-Dispersers with Polylogarithmic Degree. J. ACM 45(1): 123-154 (1998)
skipping 1 more match
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-18 20:35 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