Остановите войну!
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 40 matches
- 2011
- Elliot Anshelevich, Bugra Çaskurlu:
Price of Stability in Survivable Network Design. Theory Comput. Syst. 49(1): 98-138 (2011) - Marcelo Arenas, Pablo Barceló, Leonid Libkin:
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization. Theory Comput. Syst. 49(3): 639-670 (2011) - Marcelo Arenas, Pablo Barceló, Juan L. Reutter:
Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries. Theory Comput. Syst. 49(2): 489-564 (2011) - Albert Atserias, Mikolaj Bojanczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, Kenneth A. Ross:
Foreword. Theory Comput. Syst. 49(2): 365-366 (2011) - Hagit Attiya, Eshcar Hillel, Alessia Milani:
Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory. Theory Comput. Syst. 49(4): 698-719 (2011) - Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra:
Buffer Management for Colored Packets with Deadlines. Theory Comput. Syst. 49(4): 738-756 (2011) - MohammadHossein Bateni, Lukasz Golab, MohammadTaghi Hajiaghayi, Howard J. Karloff:
Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses. Theory Comput. Syst. 49(4): 757-780 (2011) - Michael A. Bender, Seth Gilbert:
Guest Editorial: Parallelism in Algorithms and Architectures. Theory Comput. Syst. 49(4): 671 (2011) - Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Performance of One-Round Walks in Linear Congestion Games. Theory Comput. Syst. 49(1): 24-45 (2011) - Davide Bilò, Luca Forlizzi, Guido Proietti:
Approximating the Metric TSP in Linear Time. Theory Comput. Syst. 49(3): 615-631 (2011) - Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann:
The Computational Complexity of Weak Saddles. Theory Comput. Syst. 49(1): 139-161 (2011) - Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
On the Complexity of Iterated Weak Dominance in Constant-Sum Games. Theory Comput. Syst. 49(1): 162-181 (2011) - Bogdan Cautis, Alin Deutsch, Nicola Onose:
Querying Data Sources that Export Infinite Sets of Views. Theory Comput. Syst. 49(2): 367-428 (2011) - Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs:
Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor. Theory Comput. Syst. 49(4): 817-833 (2011) - Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith:
A Property Tester for Tree-Likeness of Quartet Topologies. Theory Comput. Syst. 49(3): 576-587 (2011) - Christian Choffrut, Juhani Karhumäki:
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. Theory Comput. Syst. 49(2): 355-364 (2011) - Johanne Cohen, Christoph Dürr, Kim Thang Nguyen:
Non-clairvoyant Scheduling Games. Theory Comput. Syst. 49(1): 3-23 (2011) - Patrik Floréen, Marja Hassinen, Joel Kaasinen, Petteri Kaski, Topi Musto, Jukka Suomela:
Local Approximability of Max-Min and Min-Max Linear Programs. Theory Comput. Syst. 49(4): 672-697 (2011) - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings. Theory Comput. Syst. 49(3): 565-575 (2011) - Todd J. Green:
Containment of Conjunctive Queries on Annotated Relations. Theory Comput. Syst. 49(2): 429-459 (2011) - Todd J. Green, Zachary G. Ives, Val Tannen:
Reconcilable Differences. Theory Comput. Syst. 49(2): 460-488 (2011) - Ryan C. Harkins, John M. Hitchcock:
Dimension, Halfspaces, and the Density of Hard Sets. Theory Comput. Syst. 49(3): 601-614 (2011) - Tobias Harks, Max Klimm, Rolf H. Möhring:
Characterizing the Existence of Potential Functions in Weighted Congestion Games. Theory Comput. Syst. 49(1): 46-70 (2011) - Niko Haubold, Markus Lohrey:
Compressed Word Problems in HNN-extensions and Amalgamated Products. Theory Comput. Syst. 49(2): 283-305 (2011) - Maurice J. Jansen:
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials. Theory Comput. Syst. 49(2): 343-354 (2011) - Artur Jez, Alexander Okhotin:
One-Nonterminal Conjunctive Grammars over a Unary Alphabet. Theory Comput. Syst. 49(2): 319-342 (2011) - Galina Jirásková:
Concatenation of Regular Languages and Descriptional Complexity. Theory Comput. Syst. 49(2): 306-318 (2011) - Hyunwoo Jung, Kyung-Yong Chwa:
The Balloon Popping Problem Revisited: Lower and Upper Bounds. Theory Comput. Syst. 49(1): 182-195 (2011) - Akitoshi Kawamura:
Generalized Semimagic Squares for Digital Halftoning. Theory Comput. Syst. 49(3): 632-638 (2011) - Ronald Koch, Martin Skutella:
Nash Equilibria and the Price of Anarchy for Flows over Time. Theory Comput. Syst. 49(1): 71-97 (2011)
skipping 10 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-29 21:41 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