Остановите войну!
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 53 matches
- 2003
- Manindra Agrawal, Somenath Biswas:
Primality and identity testing via Chinese remaindering. J. ACM 50(4): 429-443 (2003) - Franz L. Alt:
Journal of the ACM - the beginnings. J. ACM 50(1): 10-11 (2003) - Hagit Attiya, Arie Fouren:
Algorithms adapting to point contention. J. ACM 50(4): 444-468 (2003) - Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe:
The geometric maximum traveling salesman problem. J. ACM 50(5): 641-664 (2003) - Marie-Pierre Béal, Dominique Perrin:
On the generating sequences of regular languages on k symbols. J. ACM 50(6): 955-980 (2003) - Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee:
Time-space trade-off lower bounds for randomized computation of decision problems. J. ACM 50(2): 154-195 (2003) - Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
Definable relations and first-order query languages over strings. J. ACM 50(5): 694-751 (2003) - Gianfranco Bilardi, Keshav Pingali:
Algorithms for computing the static single assignment form. J. ACM 50(3): 375-425 (2003) - Avrim Blum, Adam Kalai, Hal Wasserman:
Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM 50(4): 506-519 (2003) - Frederick P. Brooks Jr.:
Three great challenges for half-century-old computer science. J. ACM 50(1): 25-26 (2003) - Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo:
Improving table compression with combinatorial optimization. J. ACM 50(6): 825-851 (2003) - Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, Helmut Veith:
Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5): 752-794 (2003) - Edward G. Coffman Jr.:
JACM 1976-1979. J. ACM 50(1): 16 (2003) - Stephen A. Cook:
The importance of the P versus NP question. J. ACM 50(1): 27-29 (2003) - Fernando J. Corbató:
On computer system challenges. J. ACM 50(1): 30-31 (2003) - Adnan Darwiche:
A differential approach to inference in Bayesian networks. J. ACM 50(3): 280-305 (2003) - Rina Dechter, Irina Rish:
Mini-buckets: A general scheme for bounded inference. J. ACM 50(2): 107-153 (2003) - Michael Drmota:
An analytic approach to the height of binary search trees II. J. ACM 50(3): 333-374 (2003) - Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer:
Magic Functions. J. ACM 50(6): 852-921 (2003) - Edward A. Feigenbaum:
Some challenges and grand challenges for computational intelligence. J. ACM 50(1): 32-40 (2003) - Michael J. Fischer:
JACM 1983-1986. J. ACM 50(1): 17 (2003) - C. C. Gotlieb:
A Golden Age for JACM. J. ACM 50(1): 14 (2003) - Jim Gray:
What next?: A dozen information-technology research goals. J. ACM 50(1): 41-57 (2003) - Joseph Y. Halpern:
JACM's 50th anniversary. J. ACM 50(1): 3-7 (2003) - Juris Hartmanis:
Separation of complexity classes. J. ACM 50(1): 58-62 (2003) - C. A. R. Hoare:
The verifying compiler: A grand challenge for computing research. J. ACM 50(1): 63-69 (2003) - Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani:
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6): 795-824 (2003) - Doddaballapur Narasimha-Murthy Jayasimha, Loren Schwiebert, D. Manivannan, Jeff A. May:
A foundation for designing deadlock-free routing algorithms in wormhole networks. J. ACM 50(2): 250-275 (2003) - Mario L. Juncosa:
Transitions 1959-1964. J. ACM 50(1): 12-13 (2003) - Bala Kalyanasundaram, Kirk Pruhs:
Minimizing flow time nonclairvoyantly. J. ACM 50(4): 551-567 (2003)
skipping 23 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-07-21 19:59 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