31. MFCS 2006:
Stará Lesná, Slovakia
Invited Talks
Cyril Gavoille:
Distributed Data Structures: A Survey on Informative Labeling Schemes.
38
Herman Geuvers,
Iris Loeb:
From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions.
39-57
Martin Grohe:
The Structure of Tractable Constraint Satisfaction Problems.
58-72
Dexter Kozen:
On the Representation of Kleene Algebras with Tests.
73-83
Ming Li:
From Three Ideas in TCS to Three Applications in Bioinformatics.
84-85
Contributed Papers
Pablo Arrighi:
Algebraic Characterizations of Unitary Linear Quantum Cellular Automata.
122-133
Arturo Carpi:
On the Repetition Threshold for Large Alphabets.
226-237
Qi Cheng:
On Comparing Sums of Square Roots of Small Integers.
250-255
Norbert Dojer:
Learning Bayesian Networks Does Not Have to Be NP-Hard.
305-314
Viliam Geffert:
Magic Numbers in the State Hierarchy of Finite Automata.
412-423
Andre Gronemeier:
NOF-Multiparty Information Complexity Bounds for Pointer Jumping.
459-470
Petr Hlinený:
On Matroid Representability and Minor Problems.
505-516
Marcin Kik:
Sorting Long Sequences in a Single Hop Radio Network.
573-583
Alexander E. Kostin:
A Reachability Algorithm for General Petri Nets Based on Transition Invariants.
608-621
François Le Gall:
Quantum Weakly Nondeterministic Communication Complexity.
658-669
Linh Anh Nguyen:
The Data Complexity of MDatalog in Basic Modal Logics.
729-740
A. N. Trahtman:
An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Cerny Conjecture.
789-800
data released under the ODC-BY 1.0 license
