Остановите войну!
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 34 matches
- 2009
- Arnon Avron, Agata Ciabattoni, Anna Zamansky:
Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism. CSR 2009: 26-37 - Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko:
Integrality Property in Preemptive Parallel Machine Scheduling. CSR 2009: 38-46 - Olaf Beyersdorff, Zenon Sadowski:
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes. CSR 2009: 47-58 - Pedro Cabalar, Sergei P. Odintsov, David Pearce:
Well-Founded and Partial Stable Semantics Logical Aspects. CSR 2009: 1-11 - Chris Calabro, Ramamohan Paturi:
k-SAT Is No Harder Than Decision-Unique-k-SAT. CSR 2009: 59-70 - Christian Choffrut, Juhani Karhumäki:
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. CSR 2009: 71-79 - Yi Deng, Giovanni Di Crescenzo, Dongdai Lin, Dengguo Feng:
Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model. CSR 2009: 80-91 - Tommy Färnqvist, Peter Jonsson, Johan Thapper:
Approximability Distance in the Space of H-Colourability Problems. CSR 2009: 92-104 - Andreas Goerdt:
On Random Ordering Constraints. CSR 2009: 105-116 - Kristoffer Arnsfelt Hansen:
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. CSR 2009: 117-128 - Niko Haubold, Markus Lohrey:
Compressed Word Problems in HNN-Extensions and Amalgamated Products. CSR 2009: 237-249 - Mark A. Hillebrand, Sergey Tverdyshev:
Formal Verification of Gate-Level Computer Systems. CSR 2009: 322-333 - Edward A. Hirsch, Sergey I. Nikolenko:
A Feebly Secure Trapdoor Function. CSR 2009: 129-142 - Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger:
Partitioning Graphs into Connected Parts. CSR 2009: 143-154 - Dmitry Itsykson:
Structural Complexity of AvgBPP. CSR 2009: 155-166 - Maurice J. Jansen:
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials. CSR 2009: 167-178 - Maurice J. Jansen, B. V. Raghavendra Rao:
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity. CSR 2009: 179-190 - Artur Jez, Alexander Okhotin:
One-Nonterminal Conjunctive Grammars over a Unary Alphabet. CSR 2009: 191-202 - Galina Jirásková:
Concatenation of Regular Languages and Descriptional Complexity. CSR 2009: 203-214 - Peter Jonsson, Johan Thapper:
Approximability of the Maximum Solution Problem for Certain Families of Algebras. CSR 2009: 215-226 - Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Breaking Anonymity by Learning a Unique Minimum Hitting Set. CSR 2009: 299-309 - Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko:
Complete Complexity Classification of Short Shop Scheduling. CSR 2009: 227-236 - Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
The Budgeted Unique Coverage Problem and Color-Coding. CSR 2009: 310-321 - Daniil Musatov, Andrei E. Romashchenko, Alexander Shen:
Variations on Muchnik's Conditional Complexity Theorem. CSR 2009: 250-262 - Ely Porat:
An Optimal Bloom Filter Replacement Based on Matrix Solving. CSR 2009: 263-273 - Yuri Pritykin, Julya Ulyashkina:
Aperiodicity Measure for Infinite Sequences. CSR 2009: 274-285 - B. V. Raghavendra Rao, Jayalal Sarma:
On the Complexity of Matroid Isomorphism Problems. CSR 2009: 286-298 - Wolfgang Thomas:
The Reachability Problem over Infinite Graphs. CSR 2009: 12-18 - Nikolay K. Vereshchagin:
Kolmogorov Complexity and Model Selection. CSR 2009: 19-24 - Mikhail N. Vyalyi:
On Models of a Nondeterministic Computation. CSR 2009: 334-345
skipping 4 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-03-28 14:11 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