default search action
Theory of Computing Systems, Volume 63
Volume 63, Number 1, January 2019
- A Message from the Springer Editorial Team. 1
- Martin Gairing, Rahul Savani
:
Preface to the Special Issue on Algorithmic Game Theory. 2-3 - George Christodoulou
Designing Cost-Sharing Methods for Bayesian Games. 4-25 - Paul W. Goldberg
Logarithmic Query Complexity for Approximate Nash Computation in Large Games. 26-53 - Pieter Kleer
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games. 54-89 - Riccardo Colini-Baldeschi
Price of Anarchy for Highly Congested Routing Games in Parallel Networks. 90-113 - Ioannis Caragiannis
An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling. 114-127 - Ágnes Cseh
The Stable Roommates Problem with Short Lists. 128-149 - Yuval Filmus
Analyzing Power in Weighted Voting Games with Super-Increasing Weights. 150-174
Volume 63, Number 2, February 2019
- Editor's Note: Special Issue on Stabilization, Safety, and Security of Distributed Systems. 175-176
- Robert Gmyr
Self-Stabilizing Metric Graphs. 177-199 - Thibaut Balabonski, Amélie Delga, Lionel Rieg, Sébastien Tixeuil
Synchronous Gathering without Multiplicity Detection: a Certified Algorithm. 200-218 - Nayuta Yanagisawa:
Wait-free Solvability of Colorless Tasks in Anonymous Shared-memory Model. 219-236 - Quentin Bramas
Packet Efficient Implementation of the Omega Failure Detector. 237-260 - Pankaj Khanchandani, Christoph Lenzen:
Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision. 261-305 - Guy Even, Moti Medina
On-Line Path Computation and Function Placement in SDNs. 306-325 - Emmanuel Godard
Snap-Stabilizing Tasks in Anonymous Networks. 326-343 - Armando Castañeda, Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum
Making Local Algorithms Wait-Free: the Case of Ring Coloring. 344-365
Volume 63, Number 3, April 2019
- Eric Allender
Better Complexity Bounds for Cost Register Automata. 367-385 - John M. Hitchcock
Nondeterminisic Sublinear Time Has Measure 0 in P. 386-393 - Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
Computing Parameters of Sequence-Based Dynamic Graphs. 394-417 - Roei Tell:
Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees. 418-449 - Dariusz Dereniowski
On Tradeoffs Between Width- and Fill-like Graph Parameters. 450-465 - Susanne Albers, Dennis Kraft
Motivating Time-Inconsistent Agents: A Computational Approach. 466-487 - Jan A. Bergstra, Cornelis A. Middelburg
Process Algebra with Strategic Interleaving. 488-505 - Tomasz Kociumaka
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. 506-542 - Carlos Alegría-Galicia, David Orden
Capturing Points with a Rotating Polygon (and a 3D Extension). 543-566 - Johanna N. Y. Franklin, Timothy H. McNicholl
Algorithmic Randomness and Fourier Analysis. 567-586 - Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
On the Parameterized Complexity of Contraction to Generalization of Trees. 587-614 - Peter Kostolányi
A Unifying Approach to Algebraic Systems Over Semirings. 615-633
Volume 63, Number 4, May 2019
- Pascal Weil:
Foreword. 635-636 - Maxim A. Babenko, Ignat I. Kolesnichenko
Cascade Heap: Towards Time-Optimal Extractions. 637-646 - Thierry Coquand, Simon Huber:
An Adequacy Theorem for Dependent Type Theory. 647-665 - Lukas Fleischer, Manfred Kufleitner:
Green's Relations in Deterministic Finite Automata. 666-687 - Viliam Geffert:
Unary Coded PSPACE-Complete Languages in ASPACE(loglog n). 688-714 - Alexandru Gheorghiu
Verification of Quantum Computation: An Overview of Existing Approaches. 715-808 - Alexei Miasnikov
The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC 0. 809-832 - Alexey Milovanov
On Algorithmic Statistics for Space-bounded Algorithms. 833-848 - Thomas Place, Marc Zeitoun
Generic Results for Concatenation Hierarchies. 849-901 - Oleg Verbitsky
The Descriptive Complexity of Subgraph Isomorphism Without Numerics. 902-921
Volume 63, Number 5, July 2019
- Heribert Vollmer, Brigitte Vallée:
Guest Editorial: Special Issue on Theoretical Aspects of Computer Science. 923-925 - Arnaud Carayol, Stefan Göller:
On Long Words Avoiding Zimin Patterns. 926-955 - Alexander S. Kulikov
Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates. 956-986 - Radu Curticapean, Holger Dell, Marc Roth
Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes. 987-1026 - Nathanaël Fijalkow
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. 1027-1048 - Piotr Sankowski, Karol Wegrzycki
Improved Distance Queries and Cycle Counting by Frobenius Normal Form. 1049-1067 - Shahrzad Haddadan
Mixing of Permutations by Biased Transpositions. 1068-1088 - Marianne Akian, Stéphane Gaubert
The Operator Approach to Entropy Games. 1089-1130
Volume 63, Number 6, August 2019
- Mike Behrisch
Minimal Distance of Propositional Models. 1131-1184 - Yasushi Kawase
Unit Cost Buyback Problem. 1185-1206 - Warut Suksompong:
On Black-Box Transformations in Downward-Closed Environments. 1207-1227 - Vittorio Bilò
On Stackelberg Strategies in Affine Congestion Games. 1228-1249 - Beate Bollig, Matthias Buttkus:
On the Relative Succinctness of Sentential Decision Diagrams. 1250-1277 - Juling Zhang, Guowu Yang
A Group Algebraic Approach to NPN Classification of Boolean Functions. 1278-1297 - Mike Behrisch
The Number of Clones Determined by Disjunctions of Unary Relations. 1298-1313 - Elliot Anshelevich
Strategic Network Formation Through an Intermediary. 1314-1335 - Dibyayan Chakraborty
Bounds on the Bend Number of Split and Cocomparability Graphs. 1336-1357 - Frank Gurski
Comparing Linear Width Parameters for Directed Graphs. 1358-1387 - Klaus Ambos-Spies, Timur Bakibayev
Weak Completeness Notions for Exponential Time. 1388-1412 - Spyros Angelopoulos
Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems. 1413-1447
Volume 63, Number 7, October 2019
- Vittorio Bilò
Guest Editorial: Special Issue on Algorithmic Game Theory. 1449-1450 - Georgios Birmpas, Evangelos Markakis, Orestis Telelis
Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction. 1451-1469 - Alon Eden, Michal Feldman, Adi Vardi:
Online Random Sampling for Budgeted Settings. 1470-1498 - Elliot Anshelevich
Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching. 1499-1530 - Markos Epitropou, Dimitris Fotakis
Opinion Formation Games with Aggregation and Negative Influence. 1531-1553 - Kristoffer Arnsfelt Hansen
The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. 1554-1571 - Michael Benedikt:
Guest Editorial: Special Issue on Database Theory. 1572 - Simone Bova, Hubie Chen:
How Many Variables are Needed to Express an Existential Positive Query? 1573-1594 - Andrew McGregor, Hoa T. Vu
Better Streaming Algorithms for the Maximum Coverage Problem. 1595-1619 - Antoine Amarilli, Pierre Bourhis, Mikaël Monet
Evaluating Datalog via Tree Automata and Cycluits. 1620-1678 - Dominik D. Freydenberger
A Logic for Document Spanners. 1679-1754
Volume 63, Number 8, November 2019
- Roberto Solis-Oba, Rudolf Fleischer:
Guest Editorial: Special Issue on Approximation and Online Algorithms. 1755-1756 - János Balogh, József Békési
Lower Bounds for Several Online Variants of Bin Packing. 1757-1780 - Allan Borodin, Denis Pankratov
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching. 1781-1818 - Dariusz Dereniowski
On-line Search in Two-Dimensional Environment. 1819-1848 - Itay Laish, Shay Mozes
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs. 1849-1874
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-11-15 19:21 CET 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: