Остановите войну!
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 29 matches
- 2021
- Markus Holzer, Christian Rauch:
On the Computational Complexity of Reaction Systems, Revisited. CSR 2021: 170-185 - Manon Blanc, Kristoffer Arnsfelt Hansen:
Computational Complexity of Multi-player Evolutionarily Stable Strategies. CSR 2021: 1-17 - Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith:
Injective Colouring for H-Free Graphs. CSR 2021: 18-30 - Prasad Chaugule, Nutan Limaye, Shourya Pandey:
Variants of the Determinant Polynomial and the VP-Completeness. CSR 2021: 31-55 - Samir Datta, Anuj Tawari, Yadu Vasudev:
Dynamic Complexity of Expansion. CSR 2021: 56-77 - Pranjal Dutta:
Real τ-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization. CSR 2021: 78-101 - Austen Z. Fan, Jin-Yi Cai:
Dichotomy Result on 3-Regular Bipartite Non-negative Functions. CSR 2021: 102-115 - Anna Gál, Ridwan Syed:
Upper Bounds on Communication in Terms of Approximate Rank. CSR 2021: 116-130 - Zuguang Gao, John R. Birge, Varun Gupta:
Approximation Schemes for Multiperiod Binary Knapsack Problems. CSR 2021: 131-146 - Purnata Ghosal, B. V. Raghavendra Rao:
Limitations of Sums of Bounded Read Formulas and ABPs. CSR 2021: 147-169 - Xuangui Huang, Emanuele Viola:
Average-Case Rigidity Lower Bounds. CSR 2021: 186-205 - Florent Koechlin, Pablo Rotondo:
Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection. CSR 2021: 206-222 - Ivan Koswara, Gleb Pogudin, Svetlana Selivanova, Martin Ziegler:
Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential Equations. CSR 2021: 223-241 - Hiroto Koyama, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone:
A Secure Three-Input AND Protocol with a Standard Deck of Minimal Cards. CSR 2021: 242-256 - Vaibhav Krishan:
Upper Bound for Torus Polynomials. CSR 2021: 257-263 - Klaus Meer:
A PCP of Proximity for Real Algebraic Polynomials. CSR 2021: 264-282 - Alexey Milovanov:
Predictions and Algorithmic Statistics for Infinite Sequences. CSR 2021: 283-295 - Augusto Modanese:
Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata. CSR 2021: 296-320 - Zeev Nutov:
Approximation Algorithms for Connectivity Augmentation Problems. CSR 2021: 321-338 - Zeev Nutov:
On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs. CSR 2021: 339-348 - Alexander Okhotin, Victor L. Selivanov:
Input-Driven Pushdown Automata on Well-Nested Infinite Strings. CSR 2021: 349-360 - Shuo Pang:
Large Clique is Hard on Average for Resolution. CSR 2021: 361-380 - Olga G. Parshina, Svetlana Puzynina:
On Closed-Rich Words. CSR 2021: 381-394 - Pawel Parys:
Shelah-Stupp's and Muchnik's Iterations Revisited. CSR 2021: 395-405 - Nikolay V. Proskurin:
On Separation Between the Degree of a Boolean Function and the Block Sensitivity. CSR 2021: 406-421 - Johan M. M. van Rooij:
A Generic Convolution Algorithm for Join Operations on Tree Decompositions. CSR 2021: 435-459 - Vladimir Shenmaier:
Approximation and Complexity of the Capacitated Geometric Median Problem. CSR 2021: 422-434 - Ning Xie, Shuai Xu, Yekun Xu:
A Generalization of a Theorem of Rothschild and van Lint. CSR 2021: 460-483 - Rahul Santhanam, Daniil Musatov:
Computer Science - Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28 - July 2, 2021, Proceedings. Lecture Notes in Computer Science 12730, Springer 2021, ISBN 978-3-030-79415-6 [contents]
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-07-02 05:37 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