default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 57
Volume 57, Number 1, July 2015
- René van Bevern, Andreas Emil Feldmann
, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. 1-35 - H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz:
The Complexity of Debate Checking. 36-80 - Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk:
Minimizing Rosenthal Potential in Multicast Games. 81-96 - Ping Lu, Joachim Bremer, Haiming Chen:
Deciding Determinism of Regular Languages. 97-139 - Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei:
Finding Disjoint Paths in Split Graphs. 140-159 - Stasys Jukna:
Lower Bounds for Tropical Circuits and Dynamic Programs. 160-194 - Norbert Hundeshagen, Friedrich Otto:
Restarting Transducers, Regular Languages, and Rational Relations. 195-225 - Kazuki Okamura:
Random Sequences with Respect to a Measure Defined by Two Linear Fractional Transformations. 226-237 - Georgios Piliouras, Tomás Valla, László A. Végh:
LP-Based Covering Games with Low Price of Anarchy. 238-260 - Idit Keidar, Dmitri Perelman:
On Avoiding Spare Aborts in Transactional Memory. 261-285
Volume 57, Number 2, August 2015
- Diego Figueira, Leonid Libkin:
Synchronizing Relations on Words. 287-318 - Pedro García, Manuel Vazquez de Parga, Jairo Andrés Velasco, Damián López:
A Split-Based Incremental Deterministic Automata Minimization Algorithm. 319-336 - Iovka Boneva, Radu Ciucanu, Slawek Staworko:
Schemas for Unordered XML on a DIME. 337-376 - Bart de Keijzer, Guido Schäfer, Orestis Telelis:
The Strong Price of Anarchy of Linear Bottleneck Congestion Games. 377-396 - Zohra Abdelhafidi, Mohamed Djoudi, Nasreddine Lagraa, Mohamed Bachir Yagoubi:
FNB: Fast Non-Blocking Coordinated Checkpointing Protocol for Distributed Systems. 397-425 - Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki:
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. 426-443 - Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano:
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios. 444-477 - Daniel Silva Graça, Ning Zhong:
An analytic System with a Computable Hyperbolic Sink Whose Basin of Attraction is Non-Computable. 478-520
Volume 57, Number 3, October 2015
- Carme Àlvarez, Maria J. Serna:
Preface. 521-522 - Vincenzo Auletta, George Christodoulou, Paolo Penna:
Mechanisms for Scheduling with Single-Bit Private Values. 523-548 - Evangelos Markakis, Orestis Telelis:
Uniform Price Auctions: Equilibria and Efficiency. 549-575 - Michal Feldman, Tom Ron:
Capacitated Network Design Games. 576-597 - Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen:
Congestion Games with Capacitated Resources. 598-616 - Marios Mavronicolas, Burkhard Monien:
Minimizing Expectation Plus Variance. 617-654 - Jochen Könemann, Kate Larson, David Steiner:
Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances. 655-672 - Dimitris Fotakis, Tobias Harks:
Preface to Special Issue on Algorithmic Game Theory - Dedicated to the Memory of Berthold Vöcking. 673-680 - Diodato Ferraioli, Paolo Penna:
Imperfect Best-Response Mechanisms. 681-710 - Elliot Anshelevich, Onkar Bhardwaj, Michael Usher:
Friend of My Friend: Network Formation with Two-Hop Benefit. 711-752 - Xujin Chen, Donglei Du, Luis Fernando Zuluaga:
Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines. 753-781 - Aris Anagnostopoulos, Luca Becchetti, Bart de Keijzer, Guido Schäfer:
Inefficiency of Games with Social Context. 782-804
Volume 57, Number 4, November 2015
- Editor's Note: Special Issue on Database Theory. 805
- Serge Abiteboul, Yael Amsterdamer, Daniel Deutch, Tova Milo, Pierre Senellart:
Optimal Probabilistic Generation of XML Documents. 806-842 - Balder ten Cate, Gaëlle Fontaine, Phokion G. Kolaitis:
On the Data Complexity of Consistent Query Answering. 843-891 - Amélie Gheerbrant, Leonid Libkin:
Certain Answers over Incomplete XML Documents: Extending Tractability Boundary. 892-926 - Serge Abiteboul, Pierre Bourhis, Victor Vianu:
Highly Expressive Query Languages for Unordered Data Trees. 927-966 - Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven:
Deciding Twig-definability of Node Selecting Tree Automata. 967-1007 - Foto N. Afrati, Paraschos Koutris, Dan Suciu, Jeffrey D. Ullman:
Parallel Skyline Queries. 1008-1037 - Tom J. Ameloot, Jan Van den Bussche:
Deciding Confluence for a Simple Class of Relational Transducer Networks. 1038-1111 - Balder ten Cate, Wang-Chiew Tan:
Foreword: Special Issue on Database Theory. 1112-1113 - Dominik D. Freydenberger, Timo Kötzing:
Fast Learning of Restricted Regular Expressions and DTDs. 1114-1158 - Chao Li, Gerome Miklau:
Lower Bounds on the Error of Query Sets Under the Differentially-Private Matrix Mechanism. 1159-1201 - Arnaud Durand, Stefan Mengel:
Structural Tractability of Counting of Solutions to Conjunctive Queries. 1202-1249 - Pierre Bourhis, Gabriele Puppis, Cristian Riveros:
Which XML Schemas are Streaming Bounded Repairable? 1250-1321 - Mireille Bousquet-Mélou, Markus Lohrey, Sebastian Maneth, Eric Nöth:
XML Compression via Directed Acyclic Graphs. 1322-1371
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 2025-10-22 02:19 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:
