Journal: Theory Comput. Syst.

Volume 57, Issue 4

805 -- 0. Editor's Note: Special Issue on Database Theory
806 -- 842Serge Abiteboul, Yael Amsterdamer, Daniel Deutch, Tova Milo, Pierre Senellart. Optimal Probabilistic Generation of XML Documents
843 -- 891Balder ten Cate, Gaëlle Fontaine, Phokion G. Kolaitis. On the Data Complexity of Consistent Query Answering
892 -- 926Amélie Gheerbrant, Leonid Libkin. Certain Answers over Incomplete XML Documents: Extending Tractability Boundary
927 -- 966Serge Abiteboul, Pierre Bourhis, Victor Vianu. Highly Expressive Query Languages for Unordered Data Trees
967 -- 1007Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven. Deciding Twig-definability of Node Selecting Tree Automata
1008 -- 1037Foto N. Afrati, Paraschos Koutris, Dan Suciu, Jeffrey D. Ullman. Parallel Skyline Queries
1038 -- 1111Tom J. Ameloot, Jan Van den Bussche. Deciding Confluence for a Simple Class of Relational Transducer Networks
1112 -- 1113Balder ten Cate, Wang Chiew Tan. Foreword: Special Issue on Database Theory
1114 -- 1158Dominik D. Freydenberger, Timo Kötzing. Fast Learning of Restricted Regular Expressions and DTDs
1159 -- 1201Chao Li, Gerome Miklau. Lower Bounds on the Error of Query Sets Under the Differentially-Private Matrix Mechanism
1202 -- 1249Arnaud Durand 0001, Stefan Mengel. Structural Tractability of Counting of Solutions to Conjunctive Queries
1250 -- 1321Pierre Bourhis, Gabriele Puppis, Cristian Riveros. Which XML Schemas are Streaming Bounded Repairable?
1322 -- 1371Mireille Bousquet-Mélou, Markus Lohrey, Sebastian Maneth, Eric Nöth. XML Compression via Directed Acyclic Graphs

Volume 57, Issue 3

521 -- 522Carme Àlvarez, Maria J. Serna. Preface
523 -- 548Vincenzo Auletta, George Christodoulou 0001, Paolo Penna. Mechanisms for Scheduling with Single-Bit Private Values
549 -- 575Evangelos Markakis, Orestis Telelis. Uniform Price Auctions: Equilibria and Efficiency
576 -- 597Michal Feldman, Tom Ron. Capacitated Network Design Games
598 -- 616Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Nguyen Kim Thang. Congestion Games with Capacitated Resources
617 -- 654Marios Mavronicolas, Burkhard Monien. Minimizing Expectation Plus Variance
655 -- 672Jochen Könemann, Kate Larson, David Steiner 0002. Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances
673 -- 680Dimitris Fotakis, Tobias Harks. Preface to Special Issue on Algorithmic Game Theory - Dedicated to the Memory of Berthold Vöcking
681 -- 710Diodato Ferraioli, Paolo Penna. Imperfect Best-Response Mechanisms
711 -- 752Elliot Anshelevich, Onkar Bhardwaj, Michael Usher. Friend of My Friend: Network Formation with Two-Hop Benefit
753 -- 781Xujin Chen, Donglei Du, Luis Fernando Zuluaga. Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines
782 -- 804Aris Anagnostopoulos, Luca Becchetti, Bart de Keijzer, Guido Schäfer. Inefficiency of Games with Social Context

Volume 57, Issue 2

287 -- 318Diego Figueira, Leonid Libkin. Synchronizing Relations on Words
319 -- 336Pedro García, Manuel Vazquez de Parga, Jairo A. Velasco, Damián López. A Split-Based Incremental Deterministic Automata Minimization Algorithm
337 -- 376Iovka Boneva, Radu Ciucanu, Slawek Staworko. Schemas for Unordered XML on a DIME
377 -- 396Bart de Keijzer, Guido Schäfer, Orestis Telelis. The Strong Price of Anarchy of Linear Bottleneck Congestion Games
397 -- 425Zohra Abdelhafidi, Mohamed Djoudi, Nasreddine Lagraa, Mohamed Bachir Yagoubi. FNB: Fast Non-Blocking Coordinated Checkpointing Protocol for Distributed Systems
426 -- 443Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki. Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
444 -- 477Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano. Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios
478 -- 520Daniel S. Graça, Ning Zhong. An analytic System with a Computable Hyperbolic Sink Whose Basin of Attraction is Non-Computable

Volume 57, Issue 1

1 -- 35René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý. On the Parameterized Complexity of Computing Balanced Partitions in Graphs
36 -- 80H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz. The Complexity of Debate Checking
81 -- 96Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk. Minimizing Rosenthal Potential in Multicast Games
97 -- 139Ping Lu, Joachim Bremer, Haiming Chen. Deciding Determinism of Regular Languages
140 -- 159Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei. Finding Disjoint Paths in Split Graphs
160 -- 194Stasys Jukna. Lower Bounds for Tropical Circuits and Dynamic Programs
195 -- 225Norbert Hundeshagen, Friedrich Otto. Restarting Transducers, Regular Languages, and Rational Relations
226 -- 237Kazuki Okamura. Random Sequences with Respect to a Measure Defined by Two Linear Fractional Transformations
238 -- 260Georgios Piliouras, Tomás Valla, László A. Végh. LP-Based Covering Games with Low Price of Anarchy
261 -- 285Idit Keidar, Dmitri Perelman. On Avoiding Spare Aborts in Transactional Memory