default search action
38. SOFSEM 2012: Špindlerův Mlýn, Czech Republic
- Mária Bieliková, Gerhard Friedrich, Georg Gottlob, Stefan Katzenbeisser, György Turán:
SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 21-27, 2012. Proceedings. Lecture Notes in Computer Science 7147, Springer 2012, ISBN 978-3-642-27659-0
Invited Talks
- Felipe Cucker
:
The Legacy of Turing in Numerical Analysis. 1-13 - Peter van Emde Boas:
Turing Machines for Dummies - Why Representations Do Matter. 14-30 - Yuri Gurevich:
What Is an Algorithm? 31-42 - Giuseppe F. Italiano:
Strong Bridges and Strong Articulation Points of Directed Graphs. 43 - Jirí Wiedermann
Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the Turing Test. 44-63 - Paul De Bra, David Smits:
A Fully Generic Approach for Realizing the Adaptive Web. 64-76 - Pavel Zezula:
Multi Feature Indexing Network MUFIN for Similarity Search Applications. 77-87 - Orna Kupferman:
Recent Challenges and Ideas in Temporal Synthesis. 88-98 - Krzysztof Pietrzak:
Cryptography from Learning Parity with Noise. 99-114 - Roberto Navigli
A Quick Tour of Word Sense Disambiguation, Induction and Related Approaches. 115-129 - Kevin Warwick
Not Another Look at the Turing Test! 130-140
Regular Papers
- Luca Aceto, David de Frutos-Escrig
The Equational Theory of Weak Complete Simulation Semantics over BCCSP. 141-152 - Guillaume Blin
Complexity Insights of the Minimum Duplication Problem. 153-164 - Ilir Çapuni, Péter Gács:
A Turing Machine Resisting Isolated Bursts of Faults. 165-176 - Ondrej Cepek
Properties of SLUR Formulae. 177-189 - Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. 190-201 - Jean-François Couturier, Pinar Heggernes
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. 202-213 - Peter Damaschke, Azam Sheikh Muhammad
Randomized Group Testing Both Query-Optimal and Minimal Adaptive. 214-225 - Johannes Ebbing, Peter Lohmann:
Complexity of Model Checking for Modal Dependence Logic. 226-237 - Ömer Egecioglu, Oscar H. Ibarra, Nicholas Q. Trân:
Multitape NFA: Weak Synchronization of the Input Heads. 238-250 - Emmanuel Filiot, Frédéric Servais:
Visibly Pushdown Transducers with Look-Ahead. 251-263 - Anna Gál, Jing-Tang Jang:
A Generalization of Spira's Theorem and Circuits with Small Segregators or Separators. 264-276 - Maciej Gazda, Tim A. C. Willemse
Consistent Consequence for Boolean Equation Systems. 277-288 - Petr A. Golovach
4-Coloring H-Free Graphs When H Is Small. 289-300 - Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. 301-312 - Klaus Jansen:
A Fast Approximation Scheme for the Multiple Knapsack Problem. 313-324 - Konstanty Junosza-Szaniawski
Counting Maximal Independent Sets in Subcubic Graphs. 325-336 - Lila Kari, Steffen Kopecki, Shinnosuke Seki:
Iterated Hairpin Completions of Non-crossing Words. 337-348 - Sacha Krug:
On the Approximation Ratio of the Path Matching Christofides Algorithm. 349-360 - Giovanna J. Lavado
Parikh's Theorem and Descriptional Complexity. 361-372 - Andrzej Lingas, Dzmitry Sledneu:
A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs. 373-384 - Turlough Neary
The Complexity of Small Universal Turing Machines: A Survey. 385-405 - Jirí Síma, Stanislav Zák:
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract). 406-418 - Jun Yan:
Complete Problem for Perfect Zero-Knowledge Quantum Proof. 419-430 - Chenyi Zhang
An Algorithm for Probabilistic Alternating Simulation. 431-442 - Tomás Cerný
Towards a Smart, Self-scaling Cooperative Web Cache. 443-455 - Martin Jacala, Jozef Tvarozek:
Named Entity Disambiguation Based on Explicit Semantics. 456-466 - Peter Kajsa, Pavol Návrat
Design Pattern Support Based on the Source Code Annotations and Feature Models. 467-478 - Prabhu Shankar Kaliappan, Hartmut König:
On the Formalization of UML Activities for Component-Based Protocol Design Specifications. 479-491 - Elina Kalnina
Tree Based Domain-Specific Mapping Languages. 492-504 - Tadeusz Kobus
RESTGroups for Resilient Web Services. 505-517 - Tomás Majer
Leveraging Microblogs for Resource Ranking. 518-529 - Jaroslav Skrabalek, Petr Kunc, Tomás Pitner
Inner Architecture of a Social Networking System. 530-541 - Dries Vanoverberghe, Jonathan de Halleux, Nikolai Tillmann, Frank Piessens:
State Coverage: Software Validation Metrics beyond Code Coverage. 542-553 - Nikola Benes
Factorization for Component-Interaction Automata. 554-565 - Miroslaw Kutylowski, Maciej Gebala
Optimizing Segment Based Document Protection. 566-575 - Martin Pettai, Peeter Laud
Securing the Future - An Information Flow Analysis of a Distributed OO Language. 576-587 - Jan Stolarek, Piotr Lipinski
Improving Watermark Resistance against Removal Attacks Using Orthogonal Wavelet Adaptation. 588-599 - Roman Barták
MAK€- A System for Modelling, Optimising, and Analyzing Production in Small and Medium Enterprises. 600-611 - Lucas Bordeaux, João Marques-Silva
Knowledge Compilation with Empowerment. 612-624 - Jirí Isa, Zuzana Reitermanová, Ondrej Sýkora:
Cost-Sensitive Classification with Unconstrained Influence Diagrams. 625-636 - Petr Jarusek, Radek Pelánek
Modeling and Predicting Students Problem Solving Times. 637-648 - Jacek Mandziuk
Generic Heuristic Approach to General Game Playing. 649-660 - Iulia Nica, Franz Wotawa
The SiMoL Modeling Language for Simulation and (Re-)Configuration. 661-672
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-29 00:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: