MFCS B

64 papers

YearTitle / Authors
2009(Un)Decidability of Injectivity and Surjectivity in One-Dimensional Sand Automata.
Gaétan Richard
2009A By-Level Analysis of Multiplicative Exponential Linear Logic.
Marco Gaboardi, Luca Roversi, Luca Vercelli
2009A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
2009A Dichotomy Theorem for Polynomial Evaluation.
Irénée Briquel, Pascal Koiran
2009A Dynamic Algorithm for Reachability Games Played on Trees.
Bakhadyr Khoussainov, Jiamou Liu, Imran Khaliq
2009A General Class of Models of H
Giulio Manzonetto
2009A Probabilistic PTAS for Shortest Common Superstring.
Kai Plociennik
2009Admissible Strategies in Infinite Games over Graphs.
Marco Faella
2009An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable.
Daniel Kirsten
2009An Improved Approximation Bound for Spanning Star Forest and Color Saving.
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
2009Arithmetic Circuits, Monomial Algebras and Finite Automata.
Vikraman Arvind, Pushkar S. Joglekar
2009Balanced Paths in Colored Graphs.
Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano
2009Bounds on Non-surjective Cellular Automata.
Jarkko Kari, Pascal Vanier, Thomas Zeume
2009Branching Programs for Tree Evaluation.
Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr
2009Choosability of P5-Free Graphs.
Petr A. Golovach, Pinar Heggernes
2009Colouring Non-sparse Random Intersection Graphs.
Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2009Constructing Brambles.
Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca
2009DP-Complete Problems Derived from Extremal NP-Complete Properties.
Yi Cao, Joseph C. Culberson, Lorna Stewart
2009Energy-Efficient Communication in Multi-interface Wireless Networks.
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
2009FO Model Checking on Nested Pushdown Trees.
Alexander Kartzow
2009Few Product Gates But Many Zeros.
Bernd Borchert, Pierre McKenzie, Klaus Reinhardt
2009Four Subareas of the Theory of Constraints, and Their Links.
Albert Atserias
2009From Parity and Payoff Games to Linear Programming.
Sven Schewe
2009Future-Looking Logics on Data Words and Trees.
Diego Figueira, Luc Segoufin
2009Graph Decomposition for Improving Memoryless Periodic Exploration.
Adrian Kosowski, Alfredo Navarra
2009How to Sort a Train.
Peter Widmayer
2009How to Use Spanning Trees to Navigate in Graphs.
Feodor F. Dragan, Yang Xiang
2009Hyper-minimisation Made Efficient.
Pawel Gawrychowski, Artur Jez
2009Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings
Rastislav Královic, Damian Niwinski
2009On FO2 Quantifier Alternation over Words.
Manfred Kufleitner, Pascal Weil
2009On Pebble Automata for Data Languages with Decidable Emptiness Problem.
Tony Tan
2009On the Hybrid Extension of CTL and CTL
Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick
2009On the Recognizability of Self-generating Sets.
Tomi Kärki, Anne Lacroix, Michel Rigo
2009On the Structure of Optimal Greedy Computation (for Job Scheduling).
Periklis A. Papakonstantinou
2009Parameterized Complexity Classes under Logical Reductions.
Anuj Dawar, Yuguo He
2009Partial Randomness and Dimension of Recursively Enumerable Reals.
Kohtaro Tadaki
2009Partial Solution and Entropy.
Tadao Takaoka
2009Points on Computable Curves of Computable Lengths.
Robert Rettinger, Xizhong Zheng
2009Private Capacities in Mechanism Design.
Vincenzo Auletta, Paolo Penna, Giuseppe Persiano
2009Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm.
Martin Rötteler
2009Query Automata for Nested Words.
P. Madhusudan, Mahesh Viswanathan
2009Recent Advances in Population Protocols.
Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
2009Regular Expressions with Counting: Weak versus Strong Determinism.
Wouter Gelade, Marc Gyssens, Wim Martens
2009Representing Groups on Graphs.
Sagarmoy Dutta, Piyush P. Kurur
2009Sampling Edge Covers in 3-Regular Graphs.
Ivona Bezáková, William A. Rummler
2009Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants.
Paolo D'Arco, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci
2009Self-indexed Text Compression Using Straight-Line Programs.
Francisco Claude, Gonzalo Navarro
2009Size and Energy of Threshold Circuits Computing Mod Functions.
Kei Uchizawa, Takao Nishizeki, Eiji Takimoto
2009Snake-Deterministic Tiling Systems.
Violetta Lonati, Matteo Pradella
2009Stochastic Data Streams.
S. Muthukrishnan
2009Stochastic Games with Finitary Objectives.
Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn
2009Stochastic Process Creation.
Javier Esparza
2009Synchronization of Regular Automata.
Didier Caucal
2009Synthesis for Structure Rewriting Systems.
Lukasz Kaiser
2009The Communication Complexity of Non-signaling Distributions.
Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland
2009The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I.
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
2009The Cost of Stability in Network Flow Games.
Ezra Resnick, Yoram Bachrach, Reshef Meir, Jeffrey S. Rosenschein
2009The Expressive Power of Binary Submodular Functions.
Stanislav Zivný, David A. Cohen, Peter G. Jeavons
2009The Isomorphism Problem for k-Trees Is Complete for Logspace.
Johannes Köbler, Sebastian Kuhnert
2009The Longest Path Problem Is Polynomial on Interval Graphs.
Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos
2009The Prismoid of Resources.
Delia Kesner, Fabien Renaud
2009The Synchronization Problem for Locally Strongly Transitive Automata.
Arturo Carpi, Flavio D'Alessandro
2009Time-Bounded Kolmogorov Complexity and Solovay Functions.
Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
2009Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules.
Nadja Betzler, Britta Dorn