default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 59
Volume 59, Number 1, July 2016
- Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Evangelos Markakis, Maria J. Serna
:
On the Stability of Generalized Second Price Auctions with Budgets. 1-23 - Henning Fernau, Markus L. Schmid, Yngve Villanger:
On the Parameterised Complexity of String Morphism Problems. 24-51 - Arno Pauly:
The Computational Complexity of Iterated Elimination of Dominated Strategies. 52-75 - Venkatesan Guruswami, Euiwoong Lee:
Complexity of Approximating CSP with Balance / Hard Constraints. 76-98 - Sheela Devadas, Ronitt Rubinfeld:
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness. 99-111 - Manoj Gupta, Yogish Sabharwal, Sandeep Sen:
The Update Complexity of Selection and Related Problems. 112-132 - Michael Kowalczyk, Jin-Yi Cai:
Holant Problems for 3-Regular Graphs with Complex Edge Functions. 133-158
Volume 59, Number 2, August 2016
- Andrei Bulatov, Stephan Kreutzer:
Preface. 159-160 - Sergey V. Avgustinovich, Svetlana Puzynina:
Weak Abelian Periodicity of Infinite Words. 161-179 - Amaldev Manuel, Anca Muscholl, Gabriele Puppis:
Walking on Data Words. 180-208 - Volker Diekert, Armin Weiß:
QuickHeapsort: Modifications and Improved Analysis. 209-230 - Manfred Droste, Vitaly Perevoshchikov:
Multi-weighted Automata and MSO Logic. 231-261 - Klaus Jansen, Stefan Erich Julius Kraft:
An Improved Approximation Scheme for Variable-Sized Bin Packing. 262-322 - Gergely Kovásznai, Andreas Fröhlich, Armin Biere:
Complexity of Fixed-Size Bit-Vector Logics. 323-376 - Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein:
Information Lower Bounds via Self-Reducibility. 377-396
Volume 59, Number 3, October 2016
- Carme Àlvarez, Maria J. Serna, Aleix Fernàndez:
Network Formation for Asymmetric Players and Bilateral Contracting. 397-415 - Simon Straub, Thomas Thierauf, Fabian Wagner:
Counting the Number of Perfect Matchings in K 5-Free Graphs. 416-439 - Elliot Anshelevich, John Postl, Tom Wexler:
Assignment Games with Conflicts: Robust Price of Anarchy and Convergence Results via Semi-Smoothness. 440-475 - Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz:
On the Advice Complexity of the k-server Problem Under Sparse Metrics. 476-499 - Víctor Lavín Puente:
Learning Sets of Antecedent-restricted Functional and Multivalued Dependencies with Queries. 500-516 - Luis Filipe Coelho Antunes, Harry Buhrman, Armando Matos, André Souto, Andreia Teixeira:
Distinguishing Two Probability Ensembles with One Sample from each Ensemble. 517-531 - Beate Bollig:
On the Minimization of (Complete) Ordered Binary Decision Diagrams. 532-559
Volume 59, Number 4, November 2016
- Martin Hoefer, Ron Lavi:
Preface to Special Issue on Algorithmic Game Theory. 561-562 - Elliot Anshelevich, John Postl:
Profit Sharing with Thresholds and Non-monotone Player Utilities. 563-580 - Ioannis Caragiannis, Alexandros A. Voudouris:
Welfare Guarantees for Proportional Allocations. 581-599 - George Christodoulou, Alkmini Sgouritsa, Bo Tang:
On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources. 600-618 - Dimitris Fotakis, Dimitris Tsipras, Christos Tzamos, Emmanouil Zampetakis:
Efficient Money Burning in General Domains. 619-640 - Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani:
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design. 641-663 - Mukund Sundararajan, Inbal Talgam-Cohen:
Prediction and Welfare in Ad Auctions. 664-682 - Linda Farczadi, Konstantinos Georgiou, Jochen Könemann:
Stable Marriage with General Preferences. 683-699 - Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari:
Pareto Optimal Matchings in Many-to-Many Markets with Ties. 700-721 - Pavel Hubácek, Moni Naor, Jonathan R. Ullman:
When Can Limited Randomness Be Used in Repeated Games? 722-746 - Xujin Chen, Zhuo Diao, Xiaodong Hu:
Network Characterizations for Excluding Braess's Paradox. 747-780
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-11-04 00:43 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:
