Остановите войну!
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 32 matches
- 2009
- Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The complexity of satisfiability problems: Refining Schaefer's theorem. J. Comput. Syst. Sci. 75(4): 245-254 (2009) - Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne:
Pattern matching with address errors: Rearrangement distances. J. Comput. Syst. Sci. 75(6): 359-370 (2009) - Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu:
Learning a circuit by injecting values. J. Comput. Syst. Sci. 75(1): 60-77 (2009) - Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao:
On approximating four covering and packing problems. J. Comput. Syst. Sci. 75(5): 287-302 (2009) - Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano:
The power of verification for one-parameter agents. J. Comput. Syst. Sci. 75(3): 190-211 (2009) - Maria-Florina Balcan, Alina Beygelzimer, John Langford:
Agnostic active learning. J. Comput. Syst. Sci. 75(1): 78-89 (2009) - Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin:
On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8): 423-434 (2009) - Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos:
Derivation of algorithms for cutwidth and related graph layout parameters. J. Comput. Syst. Sci. 75(4): 231-244 (2009) - Felix Brandt, Felix A. Fischer, Markus Holzer:
Symmetries and the complexity of pure Nash equilibrium. J. Comput. Syst. Sci. 75(3): 163-177 (2009) - Nader H. Bshouty, Yi Li, Philip M. Long:
Using the doubling dimension to analyze the generalization of learning algorithms. J. Comput. Syst. Sci. 75(6): 323-335 (2009) - Bogdan Cautis, Serge Abiteboul, Tova Milo:
Reasoning about XML update constraints. J. Comput. Syst. Sci. 75(6): 336-358 (2009) - Ting-Yu Chen, Jih-Chang Wang:
Interval-valued fuzzy permutation method and experimental analysis on cardinal and ordinal evaluations. J. Comput. Syst. Sci. 75(7): 371-387 (2009) - Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. 75(4): 213-230 (2009) - UmaMaheswari C. Devi, James H. Anderson:
Improved conditions for bounded tardiness under EPDF Pfair multiprocessor scheduling. J. Comput. Syst. Sci. 75(7): 388-420 (2009) - Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci. 75(5): 271-286 (2009) - Leah Epstein, Asaf Levin:
Better bounds for minimizing SONET ADMs. J. Comput. Syst. Sci. 75(2): 122-136 (2009) - Vitaly Feldman:
Hardness of approximate two-level logic minimization and PAC learning with membership queries. J. Comput. Syst. Sci. 75(1): 13-26 (2009) - Lance Fortnow, Adam R. Klivans:
Efficient learning algorithms yield circuit lower bounds. J. Comput. Syst. Sci. 75(1): 27-36 (2009) - Lisa Hellerstein, Hans Ulrich Simon:
Special Issue: Learning Theory 2006. J. Comput. Syst. Sci. 75(1): 1 (2009) - Lila Kari, Shinnosuke Seki:
On pseudoknot-bordered words and their properties. J. Comput. Syst. Sci. 75(2): 113-121 (2009) - Jonathan Katz, Chiu-Yuen Koo:
On expected constant-round protocols for Byzantine agreement. J. Comput. Syst. Sci. 75(2): 91-112 (2009) - Adam R. Klivans, Alexander A. Sherstov:
Cryptographic hardness for learning intersections of halfspaces. J. Comput. Syst. Sci. 75(1): 2-12 (2009) - Tzu-Chin Lin, Chung-Chin Kuo, Yong-Hsian Hsieh, Biing-Feng Wang:
Efficient algorithms for the inverse sorting problem with bound constraints under the l∞-norm and the Hamming distance. J. Comput. Syst. Sci. 75(8): 451-464 (2009) - Chaim Linhart, Ron Shamir:
Faster pattern matching with character classes using prime number encoding. J. Comput. Syst. Sci. 75(3): 155-162 (2009) - Meena Mahajan, Venkatesh Raman, Somnath Sikdar:
Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2): 137-153 (2009) - Cristian Martín, Mikel Larrea, Ernesto Jiménez:
Implementing the Omega failure detector in the crash-recovery failure model. J. Comput. Syst. Sci. 75(3): 178-189 (2009) - Katsuhiko Nakamura:
Erratum to "Languages not recognizable in real time by one-dimensional cellular automata" [J. Comput. System Sci 74 (7) (2008) 1095-1102]. J. Comput. Syst. Sci. 75(7): 421 (2009) - Harumichi Nishimura, Tomoyuki Yamakami:
An application of quantum finite automata to interactive proof systems. J. Comput. Syst. Sci. 75(4): 255-269 (2009) - Prakash Ramanan:
Worst-case optimal algorithm for XPath evaluation over XML streams. J. Comput. Syst. Sci. 75(8): 465-485 (2009) - Igor Razgon, Barry O'Sullivan:
Almost 2-SAT is fixed-parameter tractable. J. Comput. Syst. Sci. 75(8): 435-450 (2009)
skipping 2 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-05-08 08:00 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