Остановите войну!
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 37 matches
- 1994
- Miklós Ajtai, Yuri Gurevich:
Datalog vs First-Order Logic. J. Comput. Syst. Sci. 49(3): 562-588 (1994) - Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park:
Dynamic Dictionary Matching. J. Comput. Syst. Sci. 49(2): 208-222 (1994) - Bonnie Berger, John Rompel, Peter W. Shor:
Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry. J. Comput. Syst. Sci. 49(3): 454-477 (1994) - Joan Boyar, Kim S. Larsen:
Efficient Rebalancing of Chromatic Search Trees. J. Comput. Syst. Sci. 49(3): 667-682 (1994) - Jin-yi Cai, Juris Hartmanis:
On Hausdorff and Topological Dimensions of the Kolmogorov Complexity of the Real Line. J. Comput. Syst. Sci. 49(3): 605-619 (1994) - John Case, Sanjay Jain, Arun Sharma:
Vacillatory Learning of Nearly Minimal Size Grammars. J. Comput. Syst. Sci. 49(2): 189-207 (1994) - Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi:
The Random Oracle Hypothesis Is False. J. Comput. Syst. Sci. 49(1): 24-39 (1994) - Bruno Durand:
The Surjectivity Problem for 2D Cellular Automata. J. Comput. Syst. Sci. 49(3): 718-725 (1994) - Joost Engelfriet, Heiko Vogler:
The Translation Power of Top-Down Tree-to-Graph Transducers. J. Comput. Syst. Sci. 49(2): 258-305 (1994) - Emanuela Fachini, Angelo Monti:
A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata. J. Comput. Syst. Sci. 49(1): 133-147 (1994) - Michael R. Fellows, Michael A. Langston:
On Search, Decision, and the Efficiency of Polynomial-Time Algorithms. J. Comput. Syst. Sci. 49(3): 769-779 (1994) - Mark A. Fulk, Sanjay Jain, Daniel N. Osherson:
Open Problems in "Systems That Learn". J. Comput. Syst. Sci. 49(3): 589-604 (1994) - Leslie Ann Goldberg:
Listing Graphs That Satisfy First-Order Sentences. J. Comput. Syst. Sci. 49(2): 408-424 (1994) - Takashi Hattori:
Time-Extraction for Temporal Logic-Logic Programming and Local Process Time. J. Comput. Syst. Sci. 49(1): 40-56 (1994) - Minoru Ito, Grant E. Weddell:
Implication Problems for Functional Constraints on Databases Supporting Complex Objects. J. Comput. Syst. Sci. 49(3): 726-768 (1994) - Sanjay Jain, Arun Sharma:
Characterizing Language Identification by Standardizing Operations. J. Comput. Syst. Sci. 49(1): 96-107 (1994) - Michael Kaminski:
A Branching Time Logic with Past Operators. J. Comput. Syst. Sci. 49(2): 223-246 (1994) - Vitit Kantabutra:
A Linear-Time Near-Optimum-Length Triangulation Algorithm for Convex Polygons. J. Comput. Syst. Sci. 49(2): 325-333 (1994) - Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson:
Non-Deterministic Communication Complexity with Few Witnesses. J. Comput. Syst. Sci. 49(2): 247-257 (1994) - Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach:
Efficient Inference of Partial Types. J. Comput. Syst. Sci. 49(2): 306-324 (1994) - Narayanan Krishnakumar:
On Computing Serial Dependency Relations. J. Comput. Syst. Sci. 49(2): 175-188 (1994) - Mark Levene, George Loizou:
The Nested Universal Relation Data Model. J. Comput. Syst. Sci. 49(3): 683-717 (1994) - Rajeev Motwani, Joseph Naor, Moni Naor:
The Probabilistic Method Yields Deterministic Parallel Algorithms. J. Comput. Syst. Sci. 49(3): 478-516 (1994) - Ketan Mulmuley:
An Efficient Algorithm for Hidden Surface Removal, II. J. Comput. Syst. Sci. 49(3): 427-453 (1994) - Noam Nisan, Avi Wigderson:
Hardness vs Randomness. J. Comput. Syst. Sci. 49(2): 149-167 (1994) - Taishin Y. Nishida, Youichi Kobuchi:
Invariant Sets for Substitution. J. Comput. Syst. Sci. 49(2): 168-174 (1994) - Zoran Obradovic, Ian Parberry:
Learning with Discrete Multi-valued Neurons. J. Comput. Syst. Sci. 49(2): 375-390 (1994) - Nicholas Pippenger:
Symmetry in Self-Correcting Cellular Automata. J. Comput. Syst. Sci. 49(1): 83-95 (1994) - Zhenyu Qian:
Another Look at Parameterization for Order-Sorted Algebraic Specifications. J. Comput. Syst. Sci. 49(3): 620-666 (1994) - Vijay Raghavan:
Bounded Degree Graph Inference from Walks. J. Comput. Syst. Sci. 49(1): 108-132 (1994)
skipping 7 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-06-07 04:32 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