default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 55
Volume 55, Number 1, July 2014
- Meghdad Ghari
:
Distributed Knowledge Justification Logics. 1-40 - Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind:
String Indexing for Patterns with Wildcards. 41-60 - Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller:
Constant Thresholds Can Make Target Set Selection Tractable. 61-83 - Florin Manea, Bianca Truthe:
Accepting Networks of Evolutionary Processors with Subregular Filters. 84-109 - Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig:
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. 110-135 - Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. 136-169 - Tomoyuki Yamakami:
Constant Unary Constraints and Symmetric Real-Weighted Counting Constraint Satisfaction Problems. 170-201 - Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng:
Improved Randomized Online Scheduling of Intervals and Jobs. 202-228 - Telikepalli Kavitha:
Dynamic Matrix Rank with Partial Lookahead. 229-249 - Makoto Kanazawa, Gregory M. Kobele, Jens Michaelis, Sylvain Salvati, Ryo Yoshinaka:
The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages. 250-278
Volume 55, Number 2, August 2014
- Nikolay K. Vereshchagin:
Editorial. 279-280 - Scott Aaronson:
The Equivalence of Sampling and Searching. 281-298 - Daniil Musatov:
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization. 299-312 - Andrei E. Romashchenko:
Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error. 313-329 - Klaus Meer:
An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents. 330-346 - Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios:
Join-Reachability Problems in Directed Graphs. 347-379 - Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen:
The Complexity of Solving Reachability Games Using Value and Strategy Iteration. 380-403 - Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien:
Learning Read-Constant Polynomials of Constant Degree Modulo Composites. 404-420 - Christos A. Kapoutsis:
Two-Way Automata Versus Logarithmic Space. 421-447
Volume 55, Number 3, October 2014
- Geppino Pucci, Victor Luchangco, Rajmohan Rajaraman:
Foreword: Parallelism in Algorithms and Architectures. 449-450 - James Aspnes, Faith Ellen:
Tight Bounds for Adopt-Commit Objects. 451-474 - Panagiota Fatourou, Nikolaos D. Kallimanis:
Highly-Efficient Wait-Free Synchronization. 475-520 - Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan:
Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. 521-554 - Victor Pankratius, Ali-Reza Adl-Tabatabai:
Software Engineering with Transactional Memory Versus Locks in Practice. 555-590 - Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler:
Re-Chord: A Self-stabilizing Chord Overlay Network. 591-612 - Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat:
On a Local Protocol for Concurrent File Transfers. 613-636
Volume 55, Number 4, November 2014
- Christoph Dürr, Thomas Wilke:
Preface of STACS 2012 Special Issue. 637-639 - Marcin Mucha:
13/9 -Approximation for Graphic TSP. 640-657 - Benjamin Doerr, Carola Winzen:
Playing Mastermind with Constant-Size Memory. 658-684 - Artur Jez:
The Complexity of Compressed Membership Problems for Finite Automata. 685-718 - Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Mode Query in Arrays. 719-741 - Jürn Laun:
Efficient Algorithms for Highly Compressed Data: The Word Problem in Generalized Higman Groups Is in P. 742-770 - Christopher H. Broadbent:
On First-Order Logic and CPDA Graphs. 771-832 - André Arnold, Henryk Michalewski, Damian Niwinski:
On the Separation Question for Tree Languages. 833-855 - Faried Abu Zaid, Erich Grädel, Lukasz Kaiser, Wied Pakusa:
Model-Theoretic Properties of ω-Automatic Structures. 856-880
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-06 00:11 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:
