Остановите войну!
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 42 matches
- 2000
- Federico Ricci-Tersenghi, Martin Weigt, Riccardo Zecchina:
Simplest random K-satisfiability problem. CoRR cond-mat/0011181 (2000) - Joseph Y. Halpern, Judea Pearl:
Causes and Explanations: A Structural-Model Approach, Part I: Causes. CoRR cs.AI/0011012 (2000) - Nikolay Pelov, Emmanuel De Mot, Marc Denecker:
Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison. CoRR cs.AI/0011030 (2000) - Christian Glaßer, Lane A. Hemaspaandra:
A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions. CoRR cs.CC/0011019 (2000) - George Yong Liu, Ray F. Zhang, Kelvin Hsu, Lawrence Camilletti:
Chip-level CMP Modeling and Smart Dummy for HDP and Conformal CVD Films. CoRR cs.CE/0011014 (2000) - Ming-Yang Kao, Stephen R. Tate:
Designing Proxies for Stock Market Indices is Computationally Hard. CoRR cs.CE/0011016 (2000) - Gen-Huey Chen, Ming-Yang Kao, Yuh-Dauh Lyuu, Hsing-Kuo Wong:
Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns. CoRR cs.CE/0011018 (2000) - Ming-Yang Kao, Junfeng Qi, Lei Tan:
Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions. CoRR cs.CE/0011023 (2000) - Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena:
When Can You Fold a Map? CoRR cs.CG/0011026 (2000) - Atsushi Fujii, Tetsuya Ishikawa:
Utilizing the World Wide Web as an Encyclopedia: Extracting Term Descriptions from Semi-Structured Texts. CoRR cs.CL/0011001 (2000) - Atsushi Fujii, Tetsuya Ishikawa:
A Novelty-based Evaluation Method for Information Retrieval. CoRR cs.CL/0011002 (2000) - Atsushi Fujii, Tetsuya Ishikawa:
Applying Machine Translation to Two-Stage Cross-Language Information Retrieval. CoRR cs.CL/0011003 (2000) - Khalil Sima'an:
Tree-gram Parsing: Lexical Dependencies and Structural Relations. CoRR cs.CL/0011007 (2000) - Norbert Bröker:
The Use of Instrumentation in Grammar Engineering. CoRR cs.CL/0011020 (2000) - David Elworthy:
Retrieval from Captioned Image Databases Using Natural Language Processing. CoRR cs.CL/0011028 (2000) - Sven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde:
Semantic interpretation of temporal information by abductive inference. CoRR cs.CL/0011034 (2000) - Sven Verdoolaege, Marc Denecker, Frank Van Eynde:
Abductive reasoning with temporal information. CoRR cs.CL/0011035 (2000) - Rens Bod:
Do All Fragments Count? CoRR cs.CL/0011040 (2000) - Jörn Müller-Quade, Hideki Imai:
Anonymous Oblivious Transfer. CoRR cs.CR/0011004 (2000) - Sara Cohen, Werner Nutt, Alexander Serebrenik:
Algorithms for Rewriting Aggregate Queries Using Views. CoRR cs.DB/0011024 (2000) - Sara Cohen, Yaron Kanza, Yakov A. Kogan, Werner Nutt, Yehoshua Sagiv, Alexander Serebrenik:
EquiX - A Search and Query Language for XML. CoRR cs.DB/0011041 (2000) - Ted Herman, Toshimitsu Masuzawa:
Available Stabilizing Heaps. CoRR cs.DC/0011046 (2000) - Jean Berstel, Luc Boasson:
Formal Properties of XML Grammars and Languages. CoRR cs.DM/0011011 (2000) - N. Giglioli, Andrea Saltelli:
SimLab 1.1, Software for Sensitivity and Uncertainty Analysis, tool for sound modelling. CoRR cs.DM/0011031 (2000) - David Eppstein:
Small Maximal Independent Sets and Faster Exact Graph Coloring. CoRR cs.DS/0011009 (2000) - Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
A Decomposition Theorem for Maximum Weight Bipartite Matchings. CoRR cs.DS/0011015 (2000) - Miklós Csürös, Ming-Yang Kao:
Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets. CoRR cs.DS/0011038 (2000) - Tanya Y. Berger-Wolf, Edward M. Reingold:
Index Assignment for Multichannel Communication under Failure. CoRR cs.DS/0011045 (2000) - Hendrik Blockeel, Luc De Raedt, Jan Ramon:
Top-down induction of clustering trees. CoRR cs.LG/0011032 (2000) - Raymond Kosala, Hendrik Blockeel:
Web Mining Research: A Survey. CoRR cs.LG/0011033 (2000)
skipping 12 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-25 08:24 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