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