Abstract is missing.
- Randomness - A Computational Complexity PerspectiveAvi Wigderson. 1-2 [doi]
- Cracks in the Defenses: Scouting Out Approaches on Circuit Lower BoundsEric Allender. 3-10 [doi]
- On Formal Equivalence Verification of HardwareZurab Khasidashvili. 11-12 [doi]
- Twelve Problems in Proof ComplexityPavel Pudlák. 13-27 [doi]
- Manifestation and Exploitation of Invariants in BioinformaticsLimsoon Wong. 28 [doi]
- Simple Stochastic Games, Mean Payoff Games, Parity GamesUri Zwick. 29 [doi]
- Topological Semantics of Justification LogicSergei N. Artëmov, Elena Nogina. 30-39 [doi]
- A Logspace Algorithm for Partial 2-Tree CanonizationVikraman Arvind, Bireswar Das, Johannes Köbler. 40-51 [doi]
- A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic SemanticsArnon Avron, Anna Zamansky. 52-63 [doi]
- Computing Longest Common Substrings Via Suffix ArraysMaxim A. Babenko, Tatiana A. Starikovskaya. 64-75 [doi]
- Logic and Rational Languages of Words Indexed by Linear OrderingsNicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal. 76-85 [doi]
- Complexity of the Bollobás-Riordan PolynomialMarkus Bläser, Holger Dell, Johann A. Makowsky. 86-98 [doi]
- A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 SubgamesEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov. 99-109 [doi]
- Synchronization of GrammarsDidier Caucal, Stéphane Hassen. 110-121 [doi]
- Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary GatesDmitriy Yu. Cherukhin. 122-133 [doi]
- A Semantic Proof of Polytime Soundness of Light Affine LogicUgo Dal Lago, Martin Hofmann. 134-145 [doi]
- On Subword Complexity of Morphic SequencesRostislav Deviatov. 146-157 [doi]
- Comparing Universal Covers in Polynomial TimeJirí Fiala, Daniël Paulusma. 158-167 [doi]
- S4LPand Local RealizabilityMelvin Fitting. 168-179 [doi]
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)Uffe Flarup, Laurent Lyaudet. 180-193 [doi]
- The Most General Conservation Law for a Cellular AutomatonEnrico Formenti, Jarkko Kari, Siamak Taati. 194-203 [doi]
- Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract)Sumit Ganguly. 204-215 [doi]
- From Invariants to Canonization in ParallelJohannes Köbler, Oleg Verbitsky. 216-227 [doi]
- Self-referentiality of Justified KnowledgeRoman Kuznets. 228-239 [doi]
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown AutomataNutan Limaye, Meena Mahajan, Antoine Meyer. 240-251 [doi]
- Public Key Encryption and Encryption Emulation AttacksDenis Osin, Vladimir Shpilrain. 252-260 [doi]
- A Uniform Lower Bound on Weights of PerceptronsVladimir V. Podolskii. 261-272 [doi]
- Lambek Grammars with One Division Are Decidable in Polynomial TimeYury Savateev. 273-282 [doi]
- Cryptanalysis of Stickel s Key Exchange SchemeVladimir Shpilrain. 283-288 [doi]
- Combinatorial Complexity of Regular LanguagesArseny M. Shur. 289-301 [doi]
- On Sequences with Non-learnable SubsequencesVladimir V. V yugin. 302-313 [doi]
- Algorithms for Multiterminal CutsMingyu Xiao. 314-325 [doi]
- Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite SequencesMarius Zimand. 326-338 [doi]
- Multilayer Neuro-fuzzy Network for Short Term Electric Load ForecastingYevgeniy Bodyanskiy, Sergiy Popov, Taras Rybalchenko. 339-348 [doi]
- Invariant Generation for P-Solvable Loops with AssignmentsLaura Kovács. 349-359 [doi]
- Using Coloured Petri Nets to Model and Verify Telecommunications SystemsValery A. Nepomniaschy, Dmitri M. Beloglazov, Tatiana G. Churina, Mikhail Mashukov. 360-371 [doi]
- Additive Preconditioning for Matrix ComputationsVictor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang, Xiaodong Yan. 372-383 [doi]
- Network as a Computer: Ranking Paths to Find FlowsDusko Pavlovic. 384-397 [doi]
- A Unified Categorical Approach for Attributed Graph RewritingMaxime Rebout, Louis Féraud, Sergei Soloviev. 398-409 [doi]