default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 54
Volume 54, Number 1, January 2014
- Ali Ahmad
, Martin Baca, Muhammad Kamran Siddiqui:
On Edge Irregular Total Labeling of Categorical Product of Two Cycles. 1-12 - Hongyu Liang:
Optimal Collapsing Protocol for Multiparty Pointer Jumping. 13-23 - Gero Greiner, Tim Nonner, Alexander Souza:
The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling. 24-44 - Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. 45-72 - Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
On the Hardness of Losing Width. 73-82 - Joaquim Gabarró, Alina García, Maria J. Serna:
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games. 83-110 - Julien Ferté, Nathalie Marin, Géraud Sénizergues:
Word-Mappings of Level 2. 111-148
Volume 54, Number 2, February 2014
- Editor's Note. 149
- Thomas Brihaye, Véronique Bruyère, Julie De Pril:
On Equilibria in Quantitative Games with Reachability/Safety Objectives. 150-189 - Junhua Yu:
Prehistoric Graph in Modal Derivations and Self-Referentiality. 190-210 - Mikhail V. Berlinkov:
Approximating the Minimum Length of Synchronizing Words Is Hard. 211-223 - Arseny M. Shur:
Growth of Power-Free Languages over Large Alphabets. 224-243 - Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck:
Obtaining Online Ecological Colourings by Generalizing First-Fit. 244-260 - Dmitry Itsykson:
Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms. 261-276 - Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou:
Quotient Complexity of Closed Languages. 277-292 - Pavel Martyugin:
Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata. 293-304 - Nikolay K. Vereshchagin:
Encoding Invariance in Average Case Complexity. 305-317 - Maurice J. Jansen, Jayalal Sarma:
Balancing Bounded Treewidth Circuits. 318-336 - Pawel Gawrychowski, Artur Jez, Lukasz Jez:
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. 337-372
Volume 54, Number 3, April 2014
- Giuseppe Persiano:
Special Issue on Algorithmic Game Theory. 373-374 - Elias Koutsoupias:
Scheduling Without Payments. 375-387 - Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. 388-406 - Elliot Anshelevich, Ameya Hate, Koushik Kar:
Strategic Pricing in Next-Hop Routing with Elastic Demands. 407-430 - Roee Engelberg, Michael Schapira:
Weakly-Acyclic (Internet) Routing Games. 431-452 - Asaph Arnon, Yishay Mansour:
Repeated Budgeted Second Price Ad Auction. 453-478 - Panagiota N. Panagopoulou, Paul G. Spirakis:
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). 479-490 - Vittorio Bilò, Marios Mavronicolas:
Complexity of Rational and Irrational Nash Equilibria. 491-527
Volume 54, Number 4, May 2014
- Evangelos Kranakis, Danny Krizanc, Flaminia L. Luccio:
Editorial: Fun with Algorithms. 529-530 - Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu:
Picture-Hanging Puzzles. 531-550 - Brett Stevens, Aaron Williams:
The Coolest Way to Generate Binary Strings. 551-577 - Ferdinando Cicalese:
Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions. 578-594 - Giovanni Viglietta:
Gaming Is a Hard Job, but Someone Has to Do It! 595-621 - Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny:
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors. 622-639 - Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger:
Computational Aspects of M.C. Escher's Ribbon Patterns. 640-658 - Kevin J. Lang:
Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set. 659-688 - Helmut Alt, Esther M. Arkin, Alon Efrat, George Hart, Ferran Hurtado, Irina Kostitsyna, Alexander Kröller, Joseph S. B. Mitchell, Valentin Polishchuk:
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing. 689-714 - Michael A. Bender, Ritwik Bose, Rezaul Alam Chowdhury, Samuel McCauley:
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye. 715-730 - Kitty Meeks, Alexander Scott:
Spanning Trees and the Complexity of Flood-Filling Games. 731-753
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-02 21:05 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:
