Abstract is missing.
- Learning Read-Constant Polynomials of Constant Degree Modulo CompositesArkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien. 29-42 [doi]
- On the Arithmetic Complexity of Euler FunctionManindra Agrawal. 43-49 [doi]
- Pseudo-random Graphs and Bit Probe Schemes with One-Sided ErrorAndrei E. Romashchenko. 50-63 [doi]
- Improving the Space-Bounded Version of Muchnik s Conditional Complexity Theorem via Naive DerandomizationDaniil Musatov. 64-76 [doi]
- The Complexity of Solving Reachability Games Using Value and Strategy IterationKristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen. 77-90 [doi]
- Faster Polynomial Multiplication via Discrete Fourier TransformsAlexey Pospelov. 91-104 [doi]
- Almost ::::k::::-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching ProgramsJirí Síma, Stanislav Zák. 120-133 [doi]
- The Complexity of Inversion of Explicit Goldreich s Function by DPLL AlgorithmsDmitry Itsykson, Dmitry Sokolov. 134-147 [doi]
- Gate Elimination for Linear Functions and New Feebly Secure ConstructionsAlex Davydow, Sergey I. Nikolenko. 148-161 [doi]
- Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las VegasLászló Babai. 162-180 [doi]
- On Maltsev DigraphsCatarina Carvalho, László Egri, Marcel Jackson, Todd Niven. 181-194 [doi]
- Join-Reachability Problems in Directed GraphsLoukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios. 195-208 [doi]
- Graphs of Bounded Treewidth Can Be Canonized in /mbox{{/sf AC} /mbox{{/sf AC}Fabian Wagner. 209-222 [doi]
- Snakes and Cellular Automata: Reductions and Inseparability ResultsJarkko Kari. 223-232 [doi]
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-WidthPinar Heggernes, Daniel Meister, Udi Rotics. 233-246 [doi]
- An Extended Tree-Width Notion for Directed Graphs Related to the Computation of PermanentsKlaus Meer. 247-260 [doi]
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive TreesPetr A. Golovach, Daniël Paulusma, Jian Song. 261-274 [doi]
- Compressed Membership in Automata with Compressed LabelsMarkus Lohrey, Christian Mathissen. 275-288 [doi]
- Locally Decodable CodesSergey Yekhanin. 289-290 [doi]
- Precedence Automata and LanguagesVioletta Lonati, Dino Mandrioli, Matteo Pradella. 291-304 [doi]
- Orbits of Linear Maps and Regular LanguagesSergey P. Tarasov, Mikhail N. Vyalyi. 305-316 [doi]
- Shared-Memory Systems and ChartsRémi Morin. 317-330 [doi]
- On the CSP Dichotomy ConjectureAndrei A. Bulatov. 331-344 [doi]
- ::::LR::::(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown AutomataTamar Aizikowitz, Michael Kaminski. 345-358 [doi]
- Two-Way Automata versus Logarithmic SpaceChristos A. Kapoutsis. 359-372 [doi]
- A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given RowGuillaume Blin, Romeo Rizzi, Stéphane Vialette. 373-384 [doi]
- Two Combinatorial Criteria for BWT ImagesKonstantin M. Likhomanov, Arseny M. Shur. 385-396 [doi]
- Recent Results on Polynomial Identity TestingAmir Shpilka. 397-400 [doi]
- Towards Approximate Matching in Compressed Strings: Local Subsequence RecognitionAlexander Tiskin. 401-414 [doi]
- The Optimal Strategy for the Average Long-Lived ConsensusEric Rémila. 415-428 [doi]
- Improved Online Scheduling in Maximizing Throughput of Equal Length JobsNguyen Kim Thang. 429-442 [doi]
- Recognizing Sparse Perfect Elimination Bipartite GraphsMatthijs Bomhoff. 443-455 [doi]
- A Multiple-Conclusion Calculus for First-Order Gödel LogicArnon Avron, Ori Lahav. 456-469 [doi]