Journal: Theory Comput. Syst.

Volume 63, Issue 8

1755 -- 1756Roberto Solis-Oba, Rudolf Fleischer. Guest Editorial: Special Issue on Approximation and Online Algorithms
1757 -- 1780János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin. Lower Bounds for Several Online Variants of Bin Packing
1781 -- 1818Allan Borodin, Denis Pankratov, Amirali Salehi-Abari. On Conceptually Simple Algorithms for Variants of Online Bipartite Matching
1819 -- 1848Dariusz Dereniowski, Dorota Osula. On-line Search in Two-Dimensional Environment
1849 -- 1874Itay Laish, Shay Mozes. Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs

Volume 63, Issue 7

1449 -- 1450Vittorio Bilò, Michele Flammini. Guest Editorial: Special Issue on Algorithmic Game Theory
1451 -- 1469Georgios Birmpas, Evangelos Markakis, Orestis Telelis, Artem Tsikiridis. Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction
1470 -- 1498Alon Eden, Michal Feldman, Adi Vardi. Online Random Sampling for Budgeted Settings
1499 -- 1530Elliot Anshelevich, Wennan Zhu. Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching
1531 -- 1553Markos Epitropou, Dimitris Fotakis, Martin Hoefer, Stratis Skoulakis. Opinion Formation Games with Aggregation and Negative Influence
1554 -- 1571Kristoffer Arnsfelt Hansen. The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games
1572 -- 0Michael Benedikt. Guest Editorial: Special Issue on Database Theory
1573 -- 1594Simone Bova, Hubie Chen. How Many Variables are Needed to Express an Existential Positive Query?
1595 -- 1619Andrew McGregor 0001, Hoa T. Vu. Better Streaming Algorithms for the Maximum Coverage Problem
1620 -- 1678Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart. Evaluating Datalog via Tree Automata and Cycluits
1679 -- 1754Dominik D. Freydenberger. A Logic for Document Spanners

Volume 63, Issue 6

1131 -- 1184Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer. Minimal Distance of Propositional Models
1185 -- 1206Yasushi Kawase, Xin Han, Kazuhisa Makino. Unit Cost Buyback Problem
1207 -- 1227Warut Suksompong. On Black-Box Transformations in Downward-Closed Environments
1228 -- 1249Vittorio Bilò, Cosimo Vinci. On Stackelberg Strategies in Affine Congestion Games
1250 -- 1277Beate Bollig, Matthias Buttkus. On the Relative Succinctness of Sentential Decision Diagrams
1278 -- 1297Juling Zhang, Guowu Yang, William N. N. Hung, Tian Liu, Xiaoyu Song, Marek A. Perkowski. A Group Algebraic Approach to NPN Classification of Boolean Functions
1298 -- 1313Mike Behrisch, Edith Vargas-García, Dmitriy Zhuk. The Number of Clones Determined by Disjunctions of Unary Relations
1314 -- 1335Elliot Anshelevich, Onkar Bhardwaj, Koushik Kar. Strategic Network Formation Through an Intermediary
1336 -- 1357Dibyayan Chakraborty, Sandip Das 0001, Joydeep Mukherjee, Uma Kant Sahoo. Bounds on the Bend Number of Split and Cocomparability Graphs
1358 -- 1387Frank Gurski, Carolin Rehs. Comparing Linear Width Parameters for Directed Graphs
1388 -- 1412Klaus Ambos-Spies, Timur Bakibayev. Weak Completeness Notions for Exponential Time
1413 -- 1447Spyros Angelopoulos 0001. Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems

Volume 63, Issue 5

923 -- 925Heribert Vollmer, Brigitte Vallée. Guest Editorial: Special Issue on Theoretical Aspects of Computer Science
926 -- 955Arnaud Carayol, Stefan Göller. On Long Words Avoiding Zimin Patterns
956 -- 986Alexander S. Kulikov, Vladimir V. Podolskii. Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates
987 -- 1026Radu Curticapean, Holger Dell, Marc Roth. Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes
1027 -- 1048Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell 0001. Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
1049 -- 1067Piotr Sankowski, Karol Wegrzycki. Improved Distance Queries and Cycle Counting by Frobenius Normal Form
1068 -- 1088Shahrzad Haddadan, Peter Winkler 0001. Mixing of Permutations by Biased Transpositions
1089 -- 1130Marianne Akian, Stéphane Gaubert, Julien Grand-Clément, Jérémie Guillaud. The Operator Approach to Entropy Games

Volume 63, Issue 4

635 -- 636Pascal Weil. Foreword
637 -- 646Maxim A. Babenko, Ignat I. Kolesnichenko, Ivan Smirnov. Cascade Heap: Towards Time-Optimal Extractions
647 -- 665Thierry Coquand, Simon Huber. An Adequacy Theorem for Dependent Type Theory
666 -- 687Lukas Fleischer, Manfred Kufleitner. Green's Relations in Deterministic Finite Automata
688 -- 714Viliam Geffert. Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)
715 -- 808Alexandru Gheorghiu, Theodoros Kapourniotis, Elham Kashefi. Verification of Quantum Computation: An Overview of Existing Approaches
809 -- 832Alexei Miasnikov, Svetla Vassileva, Armin Weiß. The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC 0
833 -- 848Alexey Milovanov. On Algorithmic Statistics for Space-bounded Algorithms
849 -- 901Thomas Place, Marc Zeitoun. Generic Results for Concatenation Hierarchies
902 -- 921Oleg Verbitsky, Maksim Zhukovskii. The Descriptive Complexity of Subgraph Isomorphism Without Numerics

Volume 63, Issue 3

367 -- 385Eric Allender, Andreas Krebs, Pierre McKenzie. Better Complexity Bounds for Cost Register Automata
386 -- 393John M. Hitchcock, Adewale Sekoni. Nondeterminisic Sublinear Time Has Measure 0 in P
394 -- 417Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters. Computing Parameters of Sequence-Based Dynamic Graphs
418 -- 449Roei Tell. Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees
450 -- 465Dariusz Dereniowski, Adam Stanski. On Tradeoffs Between Width- and Fill-like Graph Parameters
466 -- 487Susanne Albers, Dennis Kraft. Motivating Time-Inconsistent Agents: A Computational Approach
488 -- 505Jan A. Bergstra, C. A. Middelburg. Process Algebra with Strategic Interleaving
506 -- 542Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski. Pattern Matching and Consensus Problems on Weighted Sequences and Profiles
543 -- 566Carlos Alegría-Galicia, David Orden, Leonidas Palios, Carlos Seara, Jorge Urrutia. Capturing Points with a Rotating Polygon (and a 3D Extension)
567 -- 586Johanna N. Y. Franklin, Timothy H. McNicholl, Jason Rute. Algorithmic Randomness and Fourier Analysis
587 -- 614Akanksha Agarwal, Saket Saurabh 0001, Prafullkumar Tale. On the Parameterized Complexity of Contraction to Generalization of Trees
615 -- 633Peter Kostolányi. A Unifying Approach to Algebraic Systems Over Semirings

Volume 63, Issue 2

175 -- 176. Editor's Note: Special Issue on Stabilization, Safety, and Security of Distributed Systems
177 -- 199Robert Gmyr, Jonas Lefèvre, Christian Scheideler. Self-Stabilizing Metric Graphs
200 -- 218Thibaut Balabonski, Amélie Delga, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain. Synchronous Gathering without Multiplicity Detection: a Certified Algorithm
219 -- 236Nayuta Yanagisawa. Wait-free Solvability of Colorless Tasks in Anonymous Shared-memory Model
237 -- 260Quentin Bramas, Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil. Packet Efficient Implementation of the Omega Failure Detector
261 -- 305Pankaj Khanchandani, Christoph Lenzen. Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision
306 -- 325Guy Even, Moti Medina, Boaz Patt-Shamir. On-Line Path Computation and Function Placement in SDNs
326 -- 343Emmanuel Godard. Snap-Stabilizing Tasks in Anonymous Networks
344 -- 365Armando Castañeda, Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal. Making Local Algorithms Wait-Free: the Case of Ring Coloring

Volume 63, Issue 1

1 -- 0. A Message from the Springer Editorial Team
2 -- 3Martin Gairing, Rahul Savani. Preface to the Special Issue on Algorithmic Game Theory
4 -- 25George Christodoulou 0001, Stefano Leonardi, Alkmini Sgouritsa. Designing Cost-Sharing Methods for Bayesian Games
26 -- 53Paul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu. Logarithmic Query Complexity for Approximate Nash Computation in Large Games
54 -- 89Pieter Kleer, Guido Schäfer. The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games
90 -- 113Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini. Price of Anarchy for Highly Congested Routing Games in Parallel Networks
114 -- 127Ioannis Caragiannis, Angelo Fanelli 0001. An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling
128 -- 149Ágnes Cseh, Robert W. Irving, David F. Manlove. The Stable Roommates Problem with Short Lists
150 -- 174Yuval Filmus, Joel Oren, Yair Zick, Yoram Bachrach. Analyzing Power in Weighted Voting Games with Super-Increasing Weights