Abstract is missing.
- Four Subareas of the Theory of Constraints, and Their LinksAlbert Atserias. 1 [doi]
- Synchronization of Regular AutomataDidier Caucal. 2-23 [doi]
- Stochastic Process CreationJavier Esparza. 24-33 [doi]
- Stochastic Games with Finitary ObjectivesKrishnendu Chatterjee, Thomas A. Henzinger, Florian Horn. 34-54 [doi]
- Stochastic Data StreamsS. Muthukrishnan. 55 [doi]
- Recent Advances in Population ProtocolsIoannis Chatzigiannakis, Othon Michail, Paul G. Spirakis. 56-76 [doi]
- How to Sort a TrainPeter Widmayer. 77 [doi]
- Arithmetic Circuits, Monomial Algebras and Finite AutomataVikraman Arvind, Pushkar S. Joglekar. 78-89 [doi]
- An Improved Approximation Bound for Spanning Star Forest and Color SavingStavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou. 90-101 [doi]
- Energy-Efficient Communication in Multi-interface Wireless NetworksStavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou. 102-111 [doi]
- Private Capacities in Mechanism DesignVincenzo Auletta, Paolo Penna, Giuseppe Persiano. 112-123 [doi]
- Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring RulesNadja Betzler, Britta Dorn. 124-136 [doi]
- Sampling Edge Covers in 3-Regular GraphsIvona Bezáková, William A. Rummler. 137-148 [doi]
- Balanced Paths in Colored GraphsAlessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano. 149-161 [doi]
- Few Product Gates But Many ZerosBernd Borchert, Pierre McKenzie, Klaus Reinhardt. 162-174 [doi]
- Branching Programs for Tree EvaluationMark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr. 175-186 [doi]
- A Dichotomy Theorem for Polynomial EvaluationIrénée Briquel, Pascal Koiran. 187-198 [doi]
- DP-Complete Problems Derived from Extremal NP-Complete PropertiesYi Cao, Joseph C. Culberson, Lorna Stewart. 199-210 [doi]
- The Synchronization Problem for Locally Strongly Transitive AutomataArturo Carpi, Flavio D Alessandro. 211-222 [doi]
- Constructing BramblesMathieu Chapelle, Frédéric Mazoit, Ioan Todinca. 223-234 [doi]
- Self-indexed Text Compression Using Straight-Line ProgramsFrancisco Claude, Gonzalo Navarro. 235-246 [doi]
- Security and Tradeoffs of the Akl-Taylor Scheme and Its VariantsPaolo D Arco, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci. 247-257 [doi]
- Parameterized Complexity Classes under Logical ReductionsAnuj Dawar, Yuguo He. 258-269 [doi]
- The Communication Complexity of Non-signaling DistributionsJulien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland. 270-281 [doi]
- How to Use Spanning Trees to Navigate in GraphsFeodor F. Dragan, Yang Xiang. 282-294 [doi]
- Representing Groups on GraphsSagarmoy Dutta, Piyush P. Kurur. 295-306 [doi]
- Admissible Strategies in Infinite Games over GraphsMarco Faella. 307-318 [doi]
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion ProblemsMichael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier. 319-330 [doi]
- Future-Looking Logics on Data Words and TreesDiego Figueira, Luc Segoufin. 331-343 [doi]
- A By-Level Analysis of Multiplicative Exponential Linear LogicMarco Gaboardi, Luca Roversi, Luca Vercelli. 344-355 [doi]
- Hyper-minimisation Made EfficientPawel Gawrychowski, Artur Jez. 356-368 [doi]
- Regular Expressions with Counting: Weak versus Strong DeterminismWouter Gelade, Marc Gyssens, Wim Martens. 369-381 [doi]
- Choosability of P5-Free GraphsPetr A. Golovach, Pinar Heggernes. 382-391 [doi]
- Time-Bounded Kolmogorov Complexity and Solovay FunctionsRupert Hölzl, Thorsten Kräling, Wolfgang Merkle. 392-402 [doi]
- The Longest Path Problem Is Polynomial on Interval GraphsKyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos. 403-414 [doi]
- Synthesis for Structure Rewriting SystemsLukasz Kaiser. 415-426 [doi]
- On the Hybrid Extension of CTL and CTL:::+:::Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick. 427-438 [doi]
- Bounds on Non-surjective Cellular AutomataJarkko Kari, Pascal Vanier, Thomas Zeume. 439-450 [doi]
- FO Model Checking on Nested Pushdown TreesAlexander Kartzow. 451-463 [doi]
- The Prismoid of ResourcesDelia Kesner, Fabien Renaud. 464-476 [doi]
- A Dynamic Algorithm for Reachability Games Played on TreesBakhadyr Khoussainov, Jiamou Liu, Imran Khaliq. 477-488 [doi]
- An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is RecognizableDaniel Kirsten. 489-500 [doi]
- Graph Decomposition for Improving Memoryless Periodic ExplorationAdrian Kosowski, Alfredo Navarra. 501-512 [doi]
- On FO2 Quantifier Alternation over WordsManfred Kufleitner, Pascal Weil. 513-524 [doi]
- On the Recognizability of Self-generating SetsTomi Kärki, Anne Lacroix, Michel Rigo. 525-536 [doi]
- The Isomorphism Problem for k-Trees Is Complete for LogspaceJohannes Köbler, Sebastian Kuhnert. 537-548 [doi]
- Snake-Deterministic Tiling SystemsVioletta Lonati, Matteo Pradella. 549-560 [doi]
- Query Automata for Nested WordsP. Madhusudan, Mahesh Viswanathan. 561-573 [doi]
- A General Class of Models of Giulio Manzonetto. 574-586 [doi]
- The Complexity of Satisfiability for Fragments of Hybrid Logic-Part IArne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss. 587-599 [doi]
- Colouring Non-sparse Random Intersection GraphsSotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. 600-611 [doi]
- On the Structure of Optimal Greedy Computation (for Job Scheduling)Periklis A. Papakonstantinou. 612-623 [doi]
- A Probabilistic PTAS for Shortest Common SuperstringKai Plociennik. 624-635 [doi]
- The Cost of Stability in Network Flow GamesEzra Resnick, Yoram Bachrach, Reshef Meir, Jeffrey S. Rosenschein. 636-650 [doi]
- (Un)Decidability of Injectivity and Surjectivity in One-Dimensional Sand AutomataGaétan Richard. 651-662 [doi]
- From Parity and Payoff Games to Linear ProgrammingSven Schewe. 675-686 [doi]
- Partial Randomness and Dimension of Recursively Enumerable RealsKohtaro Tadaki. 687-699 [doi]
- Partial Solution and EntropyTadao Takaoka. 700-711 [doi]
- On Pebble Automata for Data Languages with Decidable Emptiness ProblemTony Tan. 712-723 [doi]
- Size and Energy of Threshold Circuits Computing Mod FunctionsKei Uchizawa, Takao Nishizeki, Eiji Takimoto. 724-735 [doi]
- Points on Computable Curves of Computable LengthsRobert Rettinger, Xizhong Zheng. 736-743 [doi]
- The Expressive Power of Binary Submodular FunctionsStanislav Zivný, David A. Cohen, Peter G. Jeavons. 744-757 [doi]