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
- 1999
- Jürgen Dix, Mirco Nanni, V. S. Subrahmanian:
Probabilistic Agent Programs. CoRR cs.AI/9910016 (1999) - Jörg Flum, Martin Grohe:
Fixed-parameter tractability, definability, and model checking. CoRR cs.CC/9910001 (1999) - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
What's Up with Downward Collapse: Using the Easy-Hard Technique to Link Boolean and Polynomial Hierarchy Collapses. CoRR cs.CC/9910002 (1999) - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness. CoRR cs.CC/9910003 (1999) - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
An Introduction to Query Order. CoRR cs.CC/9910004 (1999) - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Query Order and the Polynomial Hierarchy. CoRR cs.CC/9910005 (1999) - Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung:
Self-Specifying Machines. CoRR cs.CC/9910006 (1999) - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
A Downward Collapse within the Polynomial Hierarchy. CoRR cs.CC/9910007 (1999) - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Translating Equality Downwards. CoRR cs.CC/9910008 (1999) - Harry Buhrman, Ronald de Wolf:
Communication Complexity Lower Bounds by Polynomials. CoRR cs.CC/9910010 (1999) - Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9910009 (1999) - Jeff Erickson:
Finite-resolution hidden surface removal. CoRR cs.CG/9910017 (1999) - Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
On Reconfiguring Tree Linkages: Trees can Lock. CoRR cs.CG/9910024 (1999) - Anand Venkataraman:
A statistical model for word discovery in child directed speech. CoRR cs.CL/9910011 (1999) - Atsushi Fujii, Kentaro Inui, Takenobu Tokunaga, Hozumi Tanaka:
Selective Sampling for Example-based Word Sense Disambiguation. CoRR cs.CL/9910020 (1999) - Mark-Jan Nederhof:
Practical experiments with regular approximation of context-free languages. CoRR cs.CL/9910022 (1999) - Roberto Baldoni, Francesco Quaglia, Michel Raynal:
Consistent Checkpointing in Distributed Databases: Towards a Formal Approach. CoRR cs.DB/9910019 (1999) - Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bhobe:
Efficient and Extensible Algorithms for Multi Query Optimization. CoRR cs.DB/9910021 (1999) - Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Map Graphs. CoRR cs.DM/9910013 (1999) - Naren Ramakrishnan:
PIPE: Personalizing Recommendations via Partial Evaluation. CoRR cs.IR/9910015 (1999) - Mark Reynolds:
The Complexity of Temporal Logic over the Reals. CoRR cs.LO/9910012 (1999) - Randal E. Bryant, Steven M. German, Miroslav N. Velev:
Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic. CoRR cs.LO/9910014 (1999) - Alessio Guglielmi:
A System of Interaction and Structure. CoRR cs.LO/9910023 (1999) - S. Y. Wang:
Decoupling Control from Data for TCP Congestion Control. CoRR cs.NI/9910018 (1999) - José Ignacio Farrán:
Rational points, genus and asymptotic behaviour in reduced algebraic curves over finite fields. CoRR math.AG/9910149 (1999) - José Ignacio Farrán:
Decoding Algebraic Geometry codes by a key equation. CoRR math.AG/9910151 (1999) - Antonio Campillo, José Ignacio Farrán:
Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models. CoRR math.AG/9910155 (1999) - Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
Polynomial method in coding and information theory. CoRR math.CO/9910175 (1999) - Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs. CoRR math.CO/9910185 (1999) - Ioannis Kontoyiannis:
Efficient sphere-covering and converse measure concentration via generalized coding theorems. CoRR math.PR/9910062 (1999)
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-09-29 02:26 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