MFCS B

69 papers

YearTitle / Authors
2006A Combinatorial Approach to Collapsing Words.
Alessandra Cherubini, Pawel Gawrychowski, Andrzej Kisielewicz, Brunetto Piochi
2006A Core Calculus for Scala Type Checking.
Vincent Cremet, François Garillot, Sergueï Lenglet, Martin Odersky
2006A Polynomial Time Nilpotence Test for Galois Groups and Related Results.
Vikraman Arvind, Piyush P. Kurur
2006A Reachability Algorithm for General Petri Nets Based on Transition Invariants.
Alexander E. Kostin
2006A Unified Construction of the Glushkov, Follow, and Antimirov Automata.
Cyril Allauzen, Mehryar Mohri
2006Algebraic Characterizations of Unitary Linear Quantum Cellular Automata.
Pablo Arrighi
2006An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Cerny Conjecture.
A. N. Trahtman
2006An Expressive Temporal Logic for Real Time.
Yoram Hirshfeld, Alexander Moshe Rabinovich
2006Approximability of Bounded Occurrence Max Ones.
Fredrik Kuivinen
2006Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.
Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
2006Approximation Algorithms and Hardness Results for Labeled Connectivity Problems.
Refael Hassin, Jérôme Monnot, Danny Segev
2006Characterizing Valiant's Algebraic Complexity Classes.
Guillaume Malod, Natacha Portier
2006Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities.
Ulrik Brandes, Jürgen Lerner
2006Completeness of Global Evaluation Logic.
Sergey Goncharov, Lutz Schröder, Till Mossakowski
2006Concrete Multiplicative Complexity of Symmetric Functions.
Joan Boyar, René Peralta
2006Constrained Minimum Enclosing Circle with Center on a Query Line Segment.
Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy
2006Crochemore Factorization of Sturmian and Other Infinite Words.
Jean Berstel, Alessandra Savelli
2006Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles.
Oswin Aichholzer, Clemens Huemer, Sarah Kappes, Bettina Speckmann, Csaba D. Tóth
2006Dimension Characterizations of Complexity Classes.
Xiaoyang Gu, Jack H. Lutz
2006Distributed Data Structures: A Survey on Informative Labeling Schemes.
Cyril Gavoille
2006Equations on Partial Words.
Francine Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis
2006Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability.
Martin Kutrib, Andreas Malcher
2006Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes.
Slawomir Lasota, Wojciech Rytter
2006From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions.
Herman Geuvers, Iris Loeb
2006From Three Ideas in TCS to Three Applications in Bioinformatics.
Ming Li
2006Generalised Integer Programming Based on Logically Defined Relations.
Peter Jonsson, Gustav Nordh
2006Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners.
Christopher M. Homan, Lane A. Hemaspaandra
2006Hierarchical Unambiguity.
Holger Spakowski, Rahul Tripathi
2006Improved Parameterized Upper Bounds for Vertex Cover.
Jianer Chen, Iyad A. Kanj, Ge Xia
2006Learning Bayesian Networks Does Not Have to Be NP-Hard.
Norbert Dojer
2006Lempel-Ziv Dimension for Lempel-Ziv Compression.
María López-Valdés
2006Lower Bounds for the Transition Complexity of NFAs.
Michael Domaratzki, Kai Salomaa
2006Machines that Can Output Empty Words.
Christian Glaßer, Stephen D. Travers
2006Magic Numbers in the State Hierarchy of Finite Automata.
Viliam Geffert
2006Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings
Rastislav Kralovic, Pawel Urzyczyn
2006Minimal Chordal Sense of Direction and Circulant Graphs.
Rodrigo S. C. Leão, Valmir Carneiro Barbosa
2006Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves.
Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli
2006NOF-Multiparty Information Complexity Bounds for Pointer Jumping.
André Gronemeier
2006Non-cooperative Tree Creation.
Martin Hoefer
2006On Comparing Sums of Square Roots of Small Integers.
Qi Cheng
2006On Genome Evolution with Innovation.
Damian Wójtowicz, Jerzy Tiuryn
2006On Matroid Representability and Minor Problems.
Petr Hlinený
2006On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model.
Giuseppe Persiano, Ivan Visconti
2006On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures.
Laurent Boyer, Victor Poupet, Guillaume Theyssier
2006On the Correlation Between Parity and Modular Polynomials.
Anna Gál, Vladimir Trifonov
2006On the Repetition Threshold for Large Alphabets.
Arturo Carpi
2006On the Representation of Kleene Algebras with Tests.
Dexter Kozen
2006Online Single Machine Batch Scheduling.
Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer
2006Optimal Linear Arrangement of Interval Graphs.
Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov
2006Optimally Fast Data Gathering in Sensor Networks.
Luisa Gargano, Adele A. Rescigno
2006Partially Commutative Inverse Monoids.
Volker Diekert, Markus Lohrey, Alexander Miller
2006Probabilistic Length-Reducing Automata.
Tomasz Jurdzinski
2006Quantum Weakly Nondeterministic Communication Complexity.
François Le Gall
2006Querying and Embedding Compressed Texts.
Yury Lifshits, Markus Lohrey
2006Reductions for Monotone Boolean Circuits.
Kazuo Iwama, Hiroki Morizumi
2006Smart Robot Teams Exploring Sparse Trees.
Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Christian Schindelhauer
2006Sorting Long Sequences in a Single Hop Radio Network.
Marcin Kik
2006Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture.
Ondrej Klíma, Benoît Larose, Pascal Tesson
2006The Complexity of Counting Functions with Easy Decision Version.
Aris Pagourtzis, Stathis Zachos
2006The Data Complexity of MDatalog in Basic Modal Logics.
Linh Anh Nguyen
2006The Kleene Equality for Graphs.
Arnaud Carayol, Didier Caucal
2006The Lempel-Ziv Complexity of Fixed Points of Morphisms.
Sorin Constantinescu, Lucian Ilie
2006The Multiparty Communication Complexity of Exact-
Richard Beigel, William I. Gasarch, James Glenn
2006The Price of Defense.
Marios Mavronicolas, Loizos Michael, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
2006The Structure of Tractable Constraint Satisfaction Problems.
Martin Grohe
2006Toward the Eigenvalue Power Law.
Robert Elsässer
2006Tree Exploration with an Oracle.
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2006Valiant's Model: From Exponential Sums to Exponential Products.
Pascal Koiran, Sylvain Perifel
2006Very Sparse Leaf Languages.
Lance Fortnow, Mitsunori Ogihara