Остановите войну!
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
- 2013
- Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips:
(Approximate) Uncertain Skylines. Theory Comput. Syst. 52(3): 342-366 (2013) - Klaus Ambos-Spies, Decheng Ding, Yun Fan, Wolfgang Merkle:
Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees. Theory Comput. Syst. 52(1): 2-27 (2013) - Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Strategic Multiway Cut and Multicut Games. Theory Comput. Syst. 52(2): 200-220 (2013) - Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven:
Generating, Sampling and Counting Subclasses of Regular Tree Languages. Theory Comput. Syst. 52(3): 542-585 (2013) - Luis Filipe Coelho Antunes, Armando Matos, Alexandre Pinto, Andre Souto, Andreia Teixeira:
One-Way Functions Using Algorithmic and Classical Information Theories. Theory Comput. Syst. 52(1): 162-178 (2013) - Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Energy-Efficient Communication in Multi-interface Wireless Networks. Theory Comput. Syst. 52(2): 285-296 (2013) - Hagit Attiya, Eshcar Hillel:
Built-in Coloring for Highly-Concurrent Doubly-Linked Lists. Theory Comput. Syst. 52(4): 729-762 (2013) - Martijn Baartse, George Barmpalias:
On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity. Theory Comput. Syst. 52(1): 28-47 (2013) - Bruno Bauwens, Alexander Shen:
An Additivity Theorem for Plain Kolmogorov Complexity. Theory Comput. Syst. 52(2): 297-302 (2013) - Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. Lakshmanan:
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions. Theory Comput. Syst. 52(3): 441-482 (2013) - Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Gianpiero Monaco:
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. Theory Comput. Syst. 52(4): 668-686 (2013) - Douglas Cenzer, Rebecca Weber:
Effective Randomness of Unions and Intersections. Theory Comput. Syst. 52(1): 48-64 (2013) - Ching-Lueh Chang, Chao-Hong Wang:
On Reversible Cascades in Scale-Free and Erdős-Rényi Random Graphs. Theory Comput. Syst. 52(2): 303-318 (2013) - Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin:
Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. Theory Comput. Syst. 52(4): 645-667 (2013) - Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$. Theory Comput. Syst. 52(4): 719-728 (2013) - Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. Theory Comput. Syst. 52(2): 179-199 (2013) - Daniel Deutch:
Querying Probabilistic Business Processes for Sub-Flows. Theory Comput. Syst. 52(3): 367-402 (2013) - Rod Downey:
Computability, Complexity and Randomness. Theory Comput. Syst. 52(1): 1 (2013) - Willem L. Fouché:
Martin-Löf Randomness, Invariant Measures and Countable Homogeneous Structures. Theory Comput. Syst. 52(1): 65-79 (2013) - Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle:
Time-Bounded Kolmogorov Complexity and Solovay Functions. Theory Comput. Syst. 52(1): 80-94 (2013) - Chien-Chung Huang:
Collusion in Atomic Splittable Routing Games. Theory Comput. Syst. 52(4): 763-801 (2013) - Abhay Kumar Jha, Dan Suciu:
Knowledge Compilation Meets Database Theory: Compiling Queries to Decision Diagrams. Theory Comput. Syst. 52(3): 403-440 (2013) - Mamadou Moustapha Kanté, Michaël Rao:
The Rank-Width of Edge-Coloured Graphs. Theory Comput. Syst. 52(4): 599-644 (2013) - María López-Valdés, Elvira Mayordomo:
Dimension Is Compression. Theory Comput. Syst. 52(1): 95-112 (2013) - Tova Milo:
Preface. Theory Comput. Syst. 52(3): 341 (2013) - Kenshi Miyabe:
Characterization of Kurtz Randomness by a Differentiation Theorem. Theory Comput. Syst. 52(1): 113-132 (2013) - Juan Andrés Montoya, Moritz Müller:
Parameterized Random Complexity. Theory Comput. Syst. 52(2): 221-270 (2013) - Alexei G. Myasnikov, Vitalii Roman'kov:
On Rationality of Verbal Subsets in a Group. Theory Comput. Syst. 52(4): 587-598 (2013) - Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci:
On the Expansion and Diameter of Bluetooth-Like Topologies. Theory Comput. Syst. 52(2): 319-339 (2013) - Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Relaxed Notions of Schema Mapping Equivalence Revisited. Theory Comput. Syst. 52(3): 483-541 (2013)
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-04-25 03:03 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