Abstract is missing.
- Proving Church s ThesisYuri Gurevich. 1-3 [doi]
- The Limits of Quantum ComputersScott Aaronson. 4 [doi]
- Marrying Words and TreesRajeev Alur. 5 [doi]
- TPTP, TSTP, CASC, etcGeoff Sutcliffe. 6-22 [doi]
- Abstract Modeling and Formal Verification of MicroprocessorsZiyad Hanna. 23 [doi]
- Sequences of Level 1, 2, 3, ..., ::::k:::: , ..Géraud Sénizergues. 24-32 [doi]
- Timers and Proximities for Mobile AmbientsBogdan Aman, Gabriel Ciobanu. 33-43 [doi]
- Pushing Random Walk Beyond Golden RatioEhsan Amiri, Evgeny S. Skvortsov. 44-55 [doi]
- Reversible Machine Code and Its Abstract Processor ArchitectureHolger Bock Axelsen, Robert Glück, Tetsuo Yokoyama. 56-69 [doi]
- A Fast Algorithm for Path 2-Packing ProblemMaxim A. Babenko. 70-81 [doi]
- Decidability of Parameterized Probabilistic Information FlowDanièle Beauquier, Marie Duflot, Yury Lifshits. 82-91 [doi]
- Inverting Onto Functions and Polynomial HierarchyHarry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin. 92-103 [doi]
- Proved-Patterns-Based Development for Structured ProgramsDominique Cansell, Dominique Méry. 104-114 [doi]
- Planarity, Determinants, Permanents, and (Unique) MatchingsSamir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan. 115-126 [doi]
- Equivalence Problems for Circuits over Sets of Natural NumbersChristian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr. 127-138 [doi]
- Bouillon: A Wiki-Wiki Social WebVictor S. Grishchenko. 139-145 [doi]
- A PDL-Like Logic of Knowledge AcquisitionBernhard Heinemann. 146-157 [doi]
- Resource Placement in Networks Using Chromatic Sets of Power GraphsNavid Imani, Hamid Sarbazi-Azad, Selim G. Akl. 158-167 [doi]
- Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded GrowthArtur Jez, Alexander Okhotin. 168-181 [doi]
- Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction ProblemsPeter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen. 182-193 [doi]
- New Bounds for MAX-SAT by Clause LearningAlexander S. Kulikov, Konstantin Kutzkov. 194-204 [doi]
- Towards Hierarchical Clustering (Extended Abstract)Mark Sh. Levin. 205-215 [doi]
- Estimation of the Click Volume by Large Scale Regression AnalysisYury Lifshits, Dirk Nowotka. 216-226 [doi]
- Maximal Intersection Queries in Randomized Graph ModelsBenjamin Hoffmann, Yury Lifshits, Dirk Nowotka. 227-236 [doi]
- A Note on Specialization of InterpretersAlexei Lisitsa, Andrei P. Nemytykh. 237-248 [doi]
- Efficient Computation in Groups Via CompressionMarkus Lohrey, Saul Schleimer. 249-258 [doi]
- Constructing a Secret Binary Partition of a Digital Image Robust to a Loss of SynchronizationAlexei Lysenko. 259-268 [doi]
- On the Complexity of Matrix Rank and RigidityMeena Mahajan, Jayalal M. N. Sarma. 269-280 [doi]
- On the Usage of Clustering for Content Based Image RetrievalJorge R. Manjarrez Sanchez, José Martinez, Patrick Valduriez. 281-289 [doi]
- Performance Modeling of Wormhole Hypermeshes Under Hotspot TrafficReza Moraveji, Hamid Sarbazi-Azad, Abbas Nayebi, Keivan Navi. 290-302 [doi]
- Application of Modified Coloured Petri Nets to Modeling and Verification of SDL Specified Communication ProtocolsValery A. Nepomniaschy, Gennady I. Alekseev, Victor S. Argirov, Dmitri M. Beloglazov, Alexandre V. Bystrov, Eugene A. Chetvertakov, Tatiana G. Churina, Sergey P. Mylnikov, Ruslan M. Novikov. 303-314 [doi]
- Symmetry of Information and Nonuniform Lower BoundsSylvain Perifel. 315-327 [doi]
- Perceptrons of Large WeightVladimir V. Podolskii. 328-336 [doi]
- A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity ClassesVictor Poupet. 337-348 [doi]
- Kolmogorov Complexity, Lovász Local Lemma and Critical ExponentsAndrey Yu. Rumyantsev. 349-355 [doi]
- Generic Complexity of Presburger ArithmeticAlexander Rybalov. 356-361 [doi]
- Everywhere ::::alpha:::: -Repetitive Sequences and Sturmian WordsKalle Saari. 362-372 [doi]
- Timed Traces and Strand SpacesRobin Sharp, Michael R. Hansen. 373-386 [doi]
- On Empirical Meaning of Randomness with Respect to a Real ParameterVladimir V. V yugin. 387-396 [doi]
- An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of UnitySergey P. Tarasov, Mikhail N. Vyalyi. 397-406 [doi]
- Generic Complexity of Undecidable ProblemsAlexei G. Myasnikov. 407-417 [doi]