Остановите войну!
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 19 matches
- 2016
- Guy Avni, Orna Kupferman, Tami Tamir:
Network-formation games with regular objectives. Inf. Comput. 251: 165-178 (2016) - George Barmpalias, Andrew Lewis-Pye, Jason Teutsch:
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. Inf. Comput. 251: 287-300 (2016) - Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices matter for the parameterized complexity of shift bribery. Inf. Comput. 251: 140-164 (2016) - John Case, Timo Kötzing:
Strongly non-U-shaped language learning results by general techniques. Inf. Comput. 251: 1-15 (2016) - Volker Diekert, Artur Jez, Wojciech Plandowski:
Finding all solutions of equations in free groups and monoids with involution. Inf. Comput. 251: 263-286 (2016) - Guy Feigenblat, Ely Porat, Ariel Shiftan:
Addendum to 'Exponential time improvement for min-wise based algorithms' [Information and Computation 209 (2011) 737-747]. Inf. Comput. 251: 361 (2016) - Anna Gál, Jing-Tang Jang:
A generalization of Spira's theorem and circuits with small segregators or separators. Inf. Comput. 251: 252-262 (2016) - Andreas Galanis, Leslie Ann Goldberg:
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. Inf. Comput. 251: 36-66 (2016) - Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Better abstractions for timed automata. Inf. Comput. 251: 67-90 (2016) - Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi:
Name-passing calculi: From fusions to preorders and types. Inf. Comput. 251: 335-360 (2016) - Sun-Yuan Hsieh, Chia-Wei Lee, Chien-Hsiang Huang:
Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks. Inf. Comput. 251: 314-334 (2016) - Sanjay Jain, Timo Kötzing, Frank Stephan:
Enlarging learnable classes. Inf. Comput. 251: 194-207 (2016) - Artur Jez, Markus Lohrey:
Approximation of smallest linear tree grammar. Inf. Comput. 251: 215-251 (2016) - Stefano Mazzanti:
Regressive computations characterize logarithmic space. Inf. Comput. 251: 16-35 (2016) - Kitty Meeks, Alexander Scott:
The parameterised complexity of list problems on graphs of bounded treewidth. Inf. Comput. 251: 91-103 (2016) - Yves Métivier, J. M. Robson, Akka Zemmari:
Randomised distributed MIS and colouring algorithms for rings with oriented edges in O(√(log n)) bit rounds. Inf. Comput. 251: 208-214 (2016) - Fu Song, Zhilin Wu:
On temporal logics with data variable quantifications: Decidability and complexity. Inf. Comput. 251: 104-139 (2016) - Elena Zamaraeva:
On teaching sets of k-threshold functions. Inf. Comput. 251: 301-313 (2016) - Meirav Zehavi:
Parameterized algorithms for the Module Motif problem. Inf. Comput. 251: 179-193 (2016)
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-22 17:34 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