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 25 matches
- 1999
- Eric Allender, Klaus Reinhardt, Shiyu Zhou:
Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds. J. Comput. Syst. Sci. 59(2): 164-181 (1999) - Roberto Barbuti, Nicoletta De Francesco, Antonella Santone, Gigliola Vaglini:
Selective Mu-Calculus and Formula-Based Equivalence of Transition Systems. J. Comput. Syst. Sci. 59(3): 537-556 (1999) - Marianne Baudinet, Jan Chomicki, Pierre Wolper:
Constraint-Generating Dependencies. J. Comput. Syst. Sci. 59(1): 94-115 (1999) - Amos Beimel, Anna Gál:
On Arithmetic Branching Programs. J. Comput. Syst. Sci. 59(2): 195-220 (1999) - Yuri Breitbart, Henry F. Korth:
Replication and Consistency in a Distributed Environment. J. Comput. Syst. Sci. 59(1): 29-69 (1999) - Harry Buhrman, Lance Fortnow:
Two Queries. J. Comput. Syst. Sci. 59(2): 182-194 (1999) - Harry Buhrman, Dieter van Melkebeek:
Hard Sets Are Hard to Find. J. Comput. Syst. Sci. 59(2): 327-345 (1999) - Jin-yi Cai, Ajay Nerurkar:
Approximating the SVP to within a Factor (1+1/dimxi) Is NP-Hard under Randomized Reductions. J. Comput. Syst. Sci. 59(2): 221-239 (1999) - Nicolò Cesa-Bianchi:
Analysis of Two Gradient-Based Algorithms for On-Line Regression. J. Comput. Syst. Sci. 59(3): 392-411 (1999) - Pranay Chaudhuri:
A Self-Stabilizing Algorithm for Detecting Fundamental Cycles in a Graph. J. Comput. Syst. Sci. 59(1): 84-93 (1999) - Lin Chen:
Graph Isomorphism and Identification Matrices: Sequential Algorithms. J. Comput. Syst. Sci. 59(3): 450-475 (1999) - Zhixiang Chen, Foued Ameur:
The Learnability of Unions of Two Rectangles in the Two-Dimensional Discretized Space. J. Comput. Syst. Sci. 59(1): 70-83 (1999) - Flavio Corradini, Rocco De Nicola, Anna Labella:
Models of Nondeterministic Regular Expressions. J. Comput. Syst. Sci. 59(3): 412-449 (1999) - Freddy Dumortier, Marc Gyssens, Luc Vandeurzen, Dirk Van Gucht:
On the Decidability of Semilinearity for Semialgebraic Sets and Its Implications for Spatial Databases - CORRIGENDUM. J. Comput. Syst. Sci. 59(3): 557-562 (1999) - Lance Fortnow, John D. Rogers:
Complexity Limitations on Quantum Computation. J. Comput. Syst. Sci. 59(2): 240-252 (1999) - Stephane Gaubert, Alessandro Giua:
Petri Net Languages and Infinite Subsets of m. J. Comput. Syst. Sci. 59(3): 373-391 (1999) - Oded Goldreich, Madhu Sudan:
Computational Indistinguishability: A Sample Hierarchy. J. Comput. Syst. Sci. 59(2): 253-269 (1999) - Gösta Grahne, Matti Nykänen, Esko Ukkonen:
Reasoning about Strings in Databases. J. Comput. Syst. Sci. 59(1): 116-162 (1999) - Oscar H. Ibarra, Jianwen Su:
A Technique for Proving Decidability of Containment and Equivalence of Linear Constraint Queries. J. Comput. Syst. Sci. 59(1): 1-28 (1999) - Petr Jancar, Javier Esparza, Faron Moller:
Petri Nets and Regular Processes. J. Comput. Syst. Sci. 59(3): 476-503 (1999) - Leo Liberti:
Structure of the Invertible CA Transformations Group. J. Comput. Syst. Sci. 59(3): 521-536 (1999) - Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin:
Arthur-Merlin Games in Boolean Decision Trees. J. Comput. Syst. Sci. 59(2): 346-372 (1999) - D. Sivakumar:
On Membership Comparable Sets. J. Comput. Syst. Sci. 59(2): 270-280 (1999) - John Watrous:
Space-Bounded Quantum Complexity. J. Comput. Syst. Sci. 59(2): 281-326 (1999) - Bob P. Weems:
Bistable Versions of the Marriages and Roommates Problems. J. Comput. Syst. Sci. 59(3): 504-520 (1999)
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 2025-01-18 15:08 CET 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