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 29 matches
- 2001
- S. Franz, Michele Leone, Federico Ricci-Tersenghi, Riccardo Zecchina:
Exact solutions for diluted spin glasses and optimization problems. CoRR cond-mat/0103328 (2001) - Marcus Hutter:
Fitness Uniform Selection to Preserve Genetic Diversity. CoRR cs.AI/0103015 (2001) - Nir Friedman, Joseph Y. Halpern:
Belief Revision: A Critique. CoRR cs.AI/0103020 (2001) - Ian T. Foster, Carl Kesselman, Steven Tuecke:
The Anatomy of the Grid - Enabling Scalable Virtual Organizations. CoRR cs.AR/0103025 (2001) - Chris Harrelson, Iordanis Kerenidis:
Quantum Clock Synchronization with one qubit. CoRR cs.CC/0103021 (2001) - Jeff Erickson:
Nice point sets can have nasty Delaunay triangulations. CoRR cs.CG/0103017 (2001) - Naoki Katoh, Takeshi Tokuyama:
Notes on computing peaks in k-levels and parametric spanning trees. CoRR cs.CG/0103024 (2001) - Petro M. Gopych:
Quantitative Neural Network Model of the Tip-of-the-Tongue Phenomenon Based on Synthesized Memory-Psycholinguistic-Metacognitive Approach. CoRR cs.CL/0103002 (2001) - Victor Kromer:
Two-parameter Model of Word Length "Language - Genre". CoRR cs.CL/0103007 (2001) - Masaki Murata, Kiyotaka Uchimoto, Qing Ma, Hitoshi Isahara:
Magical Number Seven Plus or Minus Two: Syntactic Structure Recognition in Japanese and English Sentences. CoRR cs.CL/0103010 (2001) - Masaki Murata, Kiyotaka Uchimoto, Qing Ma, Hitoshi Isahara:
A Machine-Learning Approach to Estimating the Referential Properties of Japanese Noun Phrases. CoRR cs.CL/0103011 (2001) - Masaki Murata, Kyoko Kanzaki, Kiyotaka Uchimoto, Qing Ma, Hitoshi Isahara:
Meaning Sort - Three examples: dictionary construction, tagged corpus construction, and information presentation system. CoRR cs.CL/0103012 (2001) - Masaki Murata, Masao Utiyama, Qing Ma, Hiromi Ozaku, Hitoshi Isahara:
CRL at Ntcir2. CoRR cs.CL/0103013 (2001) - Ted Pedersen:
A Decision Tree of Bigrams is an Accurate Predictor of Word Sense. CoRR cs.CL/0103026 (2001) - Paul M. Aoki, Ian E. Smith, James D. Thornton:
Rapid Application Evolution and Integration Through Document Metamorphosis. CoRR cs.DB/0103004 (2001) - G. Mario A. Higuera, Humberto Sarria, Diana Fonseca, John Idarraga:
Construction of an algorithm in parallel for the Fast Fourier Transform. CoRR cs.DC/0103001 (2001) - Francis C. Chu, Joseph Y. Halpern:
On the NP-completeness of Finding an Optimal Strategy in Games with Common Payoffs. CoRR cs.DC/0103019 (2001) - William E. Allcock, Joseph Bester, John Bresnahan, Ann L. Chervenak, Ian T. Foster, Carl Kesselman, Sam Meder, Veronika Nefedova, Darcy Quesnel, Steven Tuecke:
Secure, Efficient Data Transport and Replica Management for High-Performance Data-Intensive Computing. CoRR cs.DC/0103022 (2001) - Volker Diekert, Claudio Gutierrez, Christian Hagenah:
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. CoRR cs.DS/0103018 (2001) - Greg Sepesi:
A Dualheap Selection Algorithm - A Call for Analysis. CoRR cs.DS/0103023 (2001) - Leonid Peshkin, Nicolas Meuleau, Leslie Pack Kaelbling:
Learning Policies with External Memory. CoRR cs.LG/0103003 (2001) - Shilong Ma, Yuefei Sui, Ke Xu:
The Limits of Horn Logic Programs. CoRR cs.LO/0103008 (2001) - Lada A. Adamic, Rajan M. Lukose, Amit R. Puniyani, Bernardo A. Huberman:
Search in Power-Law Networks. CoRR cs.NI/0103016 (2001) - Raymond Y. Chiao, Jandir M. Hickmann, Daniel Solli:
Faster-than-light effects and negative group delays in optics and electronics, and their applications. CoRR cs.PF/0103014 (2001) - S. Bettelli, Luciano Serafini, T. Calarco:
Toward an architecture for quantum programming. CoRR cs.PL/0103009 (2001) - Ilia Bisnovatyi, Michael J. O'Donnell:
Source-Filter Decomposition of Harmonic Sounds. CoRR cs.SD/0103005 (2001) - Ilia Bisnovatyi:
Flexible Software Framework for Modal Synthesis. CoRR cs.SD/0103006 (2001) - Philippe Gaucher:
The branching nerve of HDA and the Kan condition. CoRR math.AT/0103011 (2001) - H. F. Chau, Hao Xu, K. M. Lee, L. W. Siu, K. K. Yan:
Finding The Sign Of A Function Value By Binary Cellular Automaton. CoRR nlin.CG/0103057 (2001)
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-09-26 17:10 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