Abstract is missing.
- The Legacy of Turing in Numerical AnalysisFelipe Cucker. 1-13 [doi]
- Turing Machines for Dummies - Why Representations Do MatterPeter van Emde Boas. 14-30 [doi]
- What Is an Algorithm?Yuri Gurevich. 31-42 [doi]
- Strong Bridges and Strong Articulation Points of Directed GraphsGiuseppe F. Italiano. 43 [doi]
- Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the Turing TestJirí Wiedermann. 44-63 [doi]
- A Fully Generic Approach for Realizing the Adaptive WebPaul De Bra, David Smits. 64-76 [doi]
- Multi Feature Indexing Network MUFIN for Similarity Search ApplicationsPavel Zezula. 77-87 [doi]
- Recent Challenges and Ideas in Temporal SynthesisOrna Kupferman. 88-98 [doi]
- Cryptography from Learning Parity with NoiseKrzysztof Pietrzak. 99-114 [doi]
- A Quick Tour of Word Sense Disambiguation, Induction and Related ApproachesRoberto Navigli. 115-129 [doi]
- Not Another Look at the Turing Test!Kevin Warwick. 130-140 [doi]
- The Equational Theory of Weak Complete Simulation Semantics over BCCSPLuca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir. 141-152 [doi]
- Complexity Insights of the Minimum Duplication ProblemGuillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora. 153-164 [doi]
- A Turing Machine Resisting Isolated Bursts of FaultsIlir Çapuni, Péter Gács. 165-176 [doi]
- Properties of SLUR FormulaeOndrej Cepek, Petr Kucera, Václav Vlcek. 177-189 [doi]
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree GraphsPanagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi. 190-201 [doi]
- Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and EnumerationJean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch. 202-213 [doi]
- Randomized Group Testing Both Query-Optimal and Minimal AdaptivePeter Damaschke, Azam Sheikh Muhammad. 214-225 [doi]
- Complexity of Model Checking for Modal Dependence LogicJohannes Ebbing, Peter Lohmann. 226-237 [doi]
- Multitape NFA: Weak Synchronization of the Input HeadsÖmer Egecioglu, Oscar H. Ibarra, Nicholas Q. Trân. 238-250 [doi]
- Visibly Pushdown Transducers with Look-AheadEmmanuel Filiot, Frédéric Servais. 251-263 [doi]
- A Generalization of Spira's Theorem and Circuits with Small Segregators or SeparatorsAnna Gál, Jing-Tang Jang. 264-276 [doi]
- Consistent Consequence for Boolean Equation SystemsMaciej Gazda, Tim A. C. Willemse. 277-288 [doi]
- 4-Coloring H-Free Graphs When H Is SmallPetr A. Golovach, Daniël Paulusma, Jian Song. 289-300 [doi]
- Computing q-Gram Non-overlapping Frequencies on SLP Compressed TextsKeisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. 301-312 [doi]
- A Fast Approximation Scheme for the Multiple Knapsack ProblemKlaus Jansen. 313-324 [doi]
- Counting Maximal Independent Sets in Subcubic GraphsKonstanty Junosza-Szaniawski, Michal Tuczynski. 325-336 [doi]
- Iterated Hairpin Completions of Non-crossing WordsLila Kari, Steffen Kopecki, Shinnosuke Seki. 337-348 [doi]
- On the Approximation Ratio of the Path Matching Christofides AlgorithmSacha Krug. 349-360 [doi]
- Parikh's Theorem and Descriptional ComplexityGiovanna J. Lavado, Giovanni Pighizzini. 361-372 [doi]
- A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc GraphsAndrzej Lingas, Dzmitry Sledneu. 373-384 [doi]
- The Complexity of Small Universal Turing Machines: A SurveyTurlough Neary, Damien Woods. 385-405 [doi]
- A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract)Jirí Síma, Stanislav Zák. 406-418 [doi]
- Complete Problem for Perfect Zero-Knowledge Quantum ProofJun Yan. 419-430 [doi]
- An Algorithm for Probabilistic Alternating SimulationChenyi Zhang, Jun Pang. 431-442 [doi]
- Towards a Smart, Self-scaling Cooperative Web CacheTomás Cerný, Petr Praus, Slávka Jaromerská, Lubos Matl, Michael J. Donahoo. 443-455 [doi]
- Named Entity Disambiguation Based on Explicit SemanticsMartin Jacala, Jozef Tvarozek. 456-466 [doi]
- Design Pattern Support Based on the Source Code Annotations and Feature ModelsPeter Kajsa, Pavol Návrat. 467-478 [doi]
- On the Formalization of UML Activities for Component-Based Protocol Design SpecificationsPrabhu Shankar Kaliappan, Hartmut König. 479-491 [doi]
- Tree Based Domain-Specific Mapping LanguagesElina Kalnina, Audris Kalnins, Agris Sostaks, Edgars Celms, Janis Iraids. 492-504 [doi]
- RESTGroups for Resilient Web ServicesTadeusz Kobus, Pawel T. Wojciechowski. 505-517 [doi]
- Leveraging Microblogs for Resource RankingTomás Majer, Marián Simko. 518-529 [doi]
- Inner Architecture of a Social Networking SystemJaroslav Skrabalek, Petr Kunc, Tomás Pitner. 530-541 [doi]
- State Coverage: Software Validation Metrics beyond Code CoverageDries Vanoverberghe, Jonathan de Halleux, Nikolai Tillmann, Frank Piessens. 542-553 [doi]
- Factorization for Component-Interaction AutomataNikola Benes, Ivana Cerná, Filip Stefanak. 554-565 [doi]
- Optimizing Segment Based Document ProtectionMiroslaw Kutylowski, Maciej Gebala. 566-575 [doi]
- Securing the Future - An Information Flow Analysis of a Distributed OO LanguageMartin Pettai, Peeter Laud. 576-587 [doi]
- Improving Watermark Resistance against Removal Attacks Using Orthogonal Wavelet AdaptationJan Stolarek, Piotr Lipinski. 588-599 [doi]
- MAK€- A System for Modelling, Optimising, and Analyzing Production in Small and Medium EnterprisesRoman Barták, Con Sheahan, Ann Sheahan. 600-611 [doi]
- Knowledge Compilation with EmpowermentLucas Bordeaux, João Marques-Silva. 612-624 [doi]
- Cost-Sensitive Classification with Unconstrained Influence DiagramsJirí Isa, Zuzana Reitermanová, Ondrej Sýkora. 625-636 [doi]
- Modeling and Predicting Students Problem Solving TimesPetr Jarusek, Radek Pelánek. 637-648 [doi]
- Generic Heuristic Approach to General Game PlayingJacek Mandziuk, Maciej Swiechowski. 649-660 [doi]
- The SiMoL Modeling Language for Simulation and (Re-)ConfigurationIulia Nica, Franz Wotawa. 661-672 [doi]