Остановите войну!
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 33 matches
- 2013
- Eric Allender, Vikraman Arvind, Meena Mahajan:
Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series. Theory Comput. Syst. 53(3): 503-506 (2013) - Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Partition Equilibrium Always Exists in Resource Selection Games. Theory Comput. Syst. 53(1): 73-85 (2013) - Nathalie Aubrun, Marie-Pierre Béal:
Sofic Tree-Shifts. Theory Comput. Syst. 53(4): 621-644 (2013) - Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Giuseppe Persiano:
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics. Theory Comput. Syst. 53(1): 3-40 (2013) - Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe:
The Complexity of Computing Minimal Unidirectional Covering Sets. Theory Comput. Syst. 53(3): 467-502 (2013) - Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien:
Static Strategies for Worksharing with Unrecoverable Interruptions. Theory Comput. Syst. 53(3): 386-423 (2013) - Jan A. Bergstra, Cornelis A. Middelburg:
A Process Calculus with Finitary Comprehended Terms. Theory Comput. Syst. 53(4): 645-668 (2013) - Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Compact DSOP and Partial DSOP Forms. Theory Comput. Syst. 53(4): 583-608 (2013) - Mikolaj Bojanczyk:
Nominal Monoids. Theory Comput. Syst. 53(2): 194-222 (2013) - Felix Brandt, Felix A. Fischer, Paul Harrenstein:
On the Rate of Convergence of Fictitious Play. Theory Comput. Syst. 53(1): 41-52 (2013) - Bireswar Das, Samir Datta, Prajakta Nimbhorkar:
Log-Space Algorithms for Paths and Matchings in k-Trees. Theory Comput. Syst. 53(4): 669-689 (2013) - Christoph Dürr, Thomas Schwentick:
Preface of Special Issue on Theoretical Aspects of Computer Science. Theory Comput. Syst. 53(2): 123-125 (2013) - Christian Eggermont, Gerhard J. Woeginger:
Motion Planning with Pulley, Rope, and Baskets. Theory Comput. Syst. 53(4): 569-582 (2013) - Alex Fabrikant, Aaron D. Jaggard, Michael Schapira:
On the Structure of Weakly Acyclic Games. Theory Comput. Syst. 53(1): 107-122 (2013) - Nazim Fatès:
Stochastic Cellular Automata Solutions to the Density Classification Problem - When Randomness Helps Computing. Theory Comput. Syst. 53(2): 223-242 (2013) - Dominik D. Freydenberger:
Extended Regular Expressions: Succinctness and Decidability. Theory Comput. Syst. 53(2): 159-193 (2013) - Stefan Gulan:
Series Parallel Digraphs with Loops - Graphs Encoded by Regular Expression. Theory Comput. Syst. 53(2): 126-158 (2013) - Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 53(4): 690-691 (2013) - Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz:
Online Scheduling with Interval Conflicts. Theory Comput. Syst. 53(2): 300-317 (2013) - Martin Hoefer, Alexander Skopalik:
On the Complexity of Pareto-Optimal Nash and Strong Equilibria. Theory Comput. Syst. 53(3): 441-453 (2013) - Bart M. P. Jansen, Hans L. Bodlaender:
Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter. Theory Comput. Syst. 53(2): 263-299 (2013) - Jonathan A. Kelner, Alex Levin:
Spectral Sparsification in the Semi-streaming Setting. Theory Comput. Syst. 53(2): 243-262 (2013) - Konstantinos Kollias:
Nonpreemptive Coordination Mechanisms for Identical Machines. Theory Comput. Syst. 53(3): 424-440 (2013) - Petr Kolman, Christian Scheideler:
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. Theory Comput. Syst. 53(2): 341-363 (2013) - Spyros C. Kontogiannis, Elias Koutsoupias, Pavlos G. Spirakis:
Preface to Special Issue on Algorithmic Game Theory. Theory Comput. Syst. 53(1): 1-2 (2013) - Liah Kor, Amos Korman, David Peleg:
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. Theory Comput. Syst. 53(2): 318-340 (2013) - Angsheng Li, Peng Zhang:
Unbalanced Graph Partitioning. Theory Comput. Syst. 53(3): 454-466 (2013) - Chien-Hung Lin, Jia Jie Liu, Yue-Li Wang:
Global Strong Defensive Alliances of Sierpiński-Like Graphs. Theory Comput. Syst. 53(3): 365-385 (2013) - Martin Macko, Kate Larson, L'ubos Steskal:
Braess's Paradox for Flows over Time. Theory Comput. Syst. 53(1): 86-106 (2013) - Curtis Menton:
Normalized Range Voting Broadly Resists Control. Theory Comput. Syst. 53(4): 507-531 (2013)
skipping 3 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-31 01:50 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