Остановите войну!
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 25 matches
- 1998
- Manindra Agrawal, Eric Allender, Steven Rudich:
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem. J. Comput. Syst. Sci. 57(2): 127-143 (1998) - Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman:
Sorting in Linear Time? J. Comput. Syst. Sci. 57(1): 74-93 (1998) - Eugene Asarin, Oded Maler:
Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy. J. Comput. Syst. Sci. 57(3): 389-398 (1998) - Peter Auer, Philip M. Long, Aravind Srinivasan:
Approximating Hyper-Rectangles: Learning and Pseudorandom Sets. J. Comput. Syst. Sci. 57(3): 376-388 (1998) - Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay:
DNA Models and Algorithms for NP-Complete Problems. J. Comput. Syst. Sci. 57(2): 172-186 (1998) - Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur:
Integer Programming as a Framework for Optimization and Approximability. J. Comput. Syst. Sci. 57(2): 144-161 (1998) - Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi:
The Relative Complexity of NP Search Problems. J. Comput. Syst. Sci. 57(1): 3-19 (1998) - Anthony J. Bonner, Giansalvatore Mecca:
Sequences, Datalog, and Transducers. J. Comput. Syst. Sci. 57(3): 234-259 (1998) - Samuel R. Buss, Toniann Pitassi:
Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle. J. Comput. Syst. Sci. 57(2): 162-171 (1998) - Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer:
Nondeterministic NC1 Computation. J. Comput. Syst. Sci. 57(2): 200-212 (1998) - Vinay K. Chaudhri, Vassos Hadzilacos:
Safe Locking Policies for Dynamic Databases. J. Comput. Syst. Sci. 57(3): 260-271 (1998) - Mariano P. Consens, Tova Milo:
Algebras for Querying Text Regions: Expressive Power and Optimization. J. Comput. Syst. Sci. 57(3): 272-288 (1998) - Persi Diaconis, Laurent Saloff-Coste:
What Do We Know about the Metropolis Algorithm? J. Comput. Syst. Sci. 57(1): 20-36 (1998) - Guozhu Dong, Jianwen Su:
Arity Bounds in First-Order Incremental Evaluation and Definition of Polynomial Time Database Queries. J. Comput. Syst. Sci. 57(3): 289-308 (1998) - Uriel Feige, Joe Kilian:
Zero Knowledge and the Chromatic Number. J. Comput. Syst. Sci. 57(2): 187-199 (1998) - Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde:
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. J. Comput. Syst. Sci. 57(3): 366-375 (1998) - Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, Pravin Varaiya:
What's Decidable about Hybrid Automata? J. Comput. Syst. Sci. 57(1): 94-124 (1998) - Sanjay Jain:
Learning with Refutation. J. Comput. Syst. Sci. 57(3): 356-365 (1998) - Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan:
Randomized Query Processing in Robot Path Planning. J. Comput. Syst. Sci. 57(1): 50-66 (1998) - Idit Keidar, Danny Dolev:
Increasing the Resilience of Distributed and Replicated Database Systems. J. Comput. Syst. Sci. 57(3): 309-324 (1998) - Jon M. Kleinberg, Éva Tardos:
Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks. J. Comput. Syst. Sci. 57(1): 61-73 (1998) - Dieter van Melkebeek:
Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets. J. Comput. Syst. Sci. 57(2): 213-232 (1998) - Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson:
On Data Structures and Asymmetric Communication Complexity. J. Comput. Syst. Sci. 57(1): 37-49 (1998) - Philippe Picouet, Victor Vianu:
Semantics and Expressiveness Issues in Active Databases. J. Comput. Syst. Sci. 57(3): 325-355 (1998) - Leonard J. Schulman:
A Three-Party Communication Problem. J. Comput. Syst. Sci. 57(3): 399-401 (1998)
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-05-08 19:53 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