MFCS B

70 papers

YearTitle / Authors
2005A BDD-Representation for the Logic of Equality and Uninterpreted Functions.
Jaco van de Pol, Olga Tveretina
2005A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs.
Jérémie Chalopin, Yves Métivier
2005Abstract Numeration Systems and Tilings.
Valérie Berthé, Michel Rigo
2005Adversarial Queueing Model for Continuous Network Dynamics.
Maria J. Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés L. Martínez, Agustín Santos, Maria J. Serna
2005Algebras as Knowledge Structures.
Bernhard Heinemann
2005An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems.
Daniel Král, Ondrej Pangrác
2005An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules.
Minming Li, Frances F. Yao
2005An Exact 2.9416
Tobias Riege, Jörg Rothe
2005An Invitation to Play.
Wieslaw Zielonka
2005Approximating Polygonal Objects by Deformable Smooth Surfaces.
Ho-Lun Cheng, Tony Tan
2005Approximating Reversal Distance for Strings with Bounded Number of Duplicates.
Petr Kolman
2005Asynchronous Deterministic Rendezvous in Graphs.
Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro
2005Autoreducibility, Mitoticity, and Immunity.
Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
2005Basic Mereology with Equivalence Relations.
Ryszard Janicki
2005Basic Properties for Sand Automata.
Julien Cervelle, Enrico Formenti, Benoît Masson
2005Basis of Solutions for a System of Linear Inequalities in Integers: Computation and Applications.
Dimitri Chubarov, Andrei Voronkov
2005Canonical Disjoint NP-Pairs of Propositional Proof Systems.
Christian Glaßer, Alan L. Selman, Liyu Zhang
2005Coloring Sparse Random
Julia Böttcher
2005Combining Self-reducibility and Partial Information Algorithms.
André Hernich, Arfst Nickelsen
2005Completeness and Degeneracy in Information Dynamics of Cellular Automata.
Hidenosuke Nishio
2005Complexity Bounds for Regular Games.
Paul Hunter, Anuj Dawar
2005Complexity of DNF and Isomorphism of Monotone Formulas.
Judy Goldsmith, Matthias Hagen, Martin Mundhenk
2005Concurrent Automata vs. Asynchronous Systems.
Rémi Morin
2005D-Width: A More Natural Measure for Directed Tree Width.
Mohammad Ali Safari
2005Dimension Is Compression.
María López-Valdés, Elvira Mayordomo
2005Event Structures for the Collective Tokens Philosophy of Inhibitor Nets.
G. Michele Pinna
2005Explicit Inapproximability Bounds for the Shortest Superstring Problem.
Virginia Vassilevska
2005Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs.
Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2005Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata.
Nazim Fatès, Michel Morvan, Nicolas Schabanel, Eric Thierry
2005Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities.
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2005Goals in the Propositional Horn Language Are Monotone Boolean Circuits.
Joxe Gaintzarain, Montserrat Hermo, Marisa Navarro
2005Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing.
Piotr Krysta
2005Interactive Algorithms 2005.
Yuri Gurevich
2005Inverse Monoids: Decidability and Complexity of Algebraic Questions.
Markus Lohrey, Nicole Ondrusch
2005Isomorphic Implication.
Michael Bauland, Edith Hemaspaandra
2005Knot Theory, Jones Polynomial and Quantum Computing.
Rusins Freivalds
2005Languages Representable by Vertex-Labeled Graphs.
Igor Grunsky, Oleksiy Kurganskyy, Igor Potapov
2005Linearly Bounded Infinite Graphs.
Arnaud Carayol, Antoine Meyer
2005Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings
Joanna Jedrzejowicz, Andrzej Szepietowski
2005Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms.
Jirí Fiala, Daniël Paulusma, Jan Arne Telle
2005New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling.
Wun-Tat Chan, Tak Wah Lam, Kin-Shing Liu, Prudence W. H. Wong
2005Nondeterministic Graph Searching: From Pathwidth to Treewidth.
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
2005On Beta-Shifts Having Arithmetical Languages.
Jakob Grue Simonsen
2005On Small Hard Leaf Languages.
Falk Unger
2005On the Communication Complexity of Co-linearity Problems.
Andrew Chi-Chih Yao
2005On the Complexity of Depth-2 Circuits with Threshold Gates.
Kazuyuki Amano, Akira Maruoka
2005On the Complexity of Mixed Discriminants and Related Problems.
Leonid Gurvits
2005On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions.
César Luis Alonso, José Luis Montaña, Luis Miguel Pardo
2005On the Parameterized Complexity of Exact Satisfiability Problems.
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
2005Online Interval Coloring with Packing Constraints.
Leah Epstein, Meital Levy
2005Online and Dynamic Recognition of Squarefree Strings.
Jesper Jansson, Zeshan Peng
2005Packing Weighted Rectangles into a Square.
Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
2005Page Migration in Dynamic Networks.
Marcin Bienkowski, Friedhelm Meyer auf der Heide
2005Pure Nash Equilibria in Games with a Large Number of Actions.
Carme Àlvarez, Joaquim Gabarró, Maria J. Serna
2005Random Databases and Threshold for Monotone Non-recursive Datalog.
Konstantin Korovin, Andrei Voronkov
2005Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix.
Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu
2005Regular Sets of Higher-Order Pushdown Stacks.
Arnaud Carayol
2005Removing Bidirectionality from Nondeterministic Finite Automata.
Christos A. Kapoutsis
2005Separating the Notions of Self- and Autoreducibility.
Piotr Faliszewski, Mitsunori Ogihara
2005Shrinking Restarting Automata.
Tomasz Jurdzinski, Friedrich Otto
2005Some Computational Issues in Membrane Computing.
Oscar H. Ibarra
2005Stratified Boolean Grammars.
Michal Wrona
2005Strict Language Inequalities and Their Decision Problems.
Alexander Okhotin
2005The Complexity of Model Checking Higher Order Fixpoint Logic.
Martin Lange, Rafal Somla
2005The Complexity of Satisfiability Problems: Refining Schaefer's Theorem.
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
2005The Expressive Power of Two-Variable Least Fixed-Point Logics.
Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
2005The Generalization of Dirac's Theorem for Hypergraphs.
Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl
2005Tight Approximability Results for the Maximum Solution Equation Problem over Z
Fredrik Kuivinen
2005Two Logical Hierarchies of Optimization Problems over the Real Numbers.
Uffe Flarup Hansen, Klaus Meer
2005Zeta-Dimension.
David Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser