Abstract is missing.
- Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"?Vijay V. Vazirani. 1-5 [doi]
- Resilient Quicksort and SelectionMaxim A. Babenko, Ivan Pouzyrevsky. 6-17 [doi]
- General Quantitative Specification Theories with ModalitiesSebastian S. Bauer, Uli Fahrenberg, Axel Legay, Claus R. Thrane. 18-30 [doi]
- The Complexity of Intersecting Finite Automata Having Few Final StatesMichael Blondin, Pierre McKenzie. 31-42 [doi]
- News about Semiantichains and Unichain CoveringsBartlomiej Bosek, Stefan Felsner, Kolja B. Knauer, Grzegorz Matecki. 43-51 [doi]
- Checking Tests for Read-Once Functions over Arbitrary BasesDmitry V. Chistikov. 52-63 [doi]
- Approximating Minimum Power Edge-Multi-CoversNachshon Cohen, Zeev Nutov. 64-75 [doi]
- A Lower Bound on Circuit Complexity of Vector Function in U 2Evgeny Demenkov. 76-80 [doi]
- Computing All MOD-Functions SimultaneouslyEvgeny Demenkov, Alexander S. Kulikov, Ivan Mihajlin, Hiroki Morizumi. 81-88 [doi]
- Bounded Synchronization Delay in Omega-Rational ExpressionsVolker Diekert, Manfred Kufleitner. 89-98 [doi]
- Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite GraphsMartin Dietzfelbinger, Michael Rink. 99-111 [doi]
- Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGsStefan Dobrev, Evangelos Kranakis, Oscar Morales Ponce, Milan Plzík. 112-124 [doi]
- Worst-Case Optimal Priority Queues via Extended Regular CountersAmr Elmasry, Jyrki Katajainen. 125-137 [doi]
- The Complexity of Minor-Ancestral Graph Properties with Forbidden PairsEli Fox-Epstein, Danny Krizanc. 138-147 [doi]
- Satisfiability Thresholds beyond k -XORSATAndreas Goerdt, Lutz Falke. 148-159 [doi]
- Finding Vertex-Surjective Graph HomomorphismsPetr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma. 160-171 [doi]
- Broadcast Domination on Block Graphs in Linear TimePinar Heggernes, Sigve H. Sæther. 172-183 [doi]
- Characterizing Certain Topological SpecificationsBernhard Heinemann. 184-195 [doi]
- Descriptional Complexity of Operations on Alternating and Boolean AutomataGalina Jirásková. 196-204 [doi]
- Consistency of Multidimensional Combinatorial SubstitutionsTimo Jolivet, Jarkko Kari. 205-216 [doi]
- Two-Way Automata Characterizations of L/poly versus NLChristos A. Kapoutsis, Giovanni Pighizzini. 217-228 [doi]
- Cutting through Regular Post Embedding ProblemsPrateek Karandikar, Philippe Schnoebelen. 229-240 [doi]
- On the Advice Complexity of the Set Cover ProblemDennis Komm, Richard Královic, Tobias Mömke. 241-252 [doi]
- Constraint Satisfaction with Counting QuantifiersFlorent R. Madelaine, Barnaby Martin, Juraj Stacho. 253-265 [doi]
- Space-Bounded Kolmogorov ExtractorsDaniil Musatov. 266-277 [doi]
- Some Results on more Flexible Versions of Graph MotifRomeo Rizzi, Florian Sikora. 278-289 [doi]
- A Characterization of Cellular Automata Generated by Idempotents on the Full ShiftVille Salo. 290-301 [doi]
- Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear TimeSvetlana N. Selezneva. 302-313 [doi]
- Boolean Composition of Visual Secret Sharing SchemesHans-Ulrich Simon. 314-325 [doi]