MFCS B

71 papers

YearTitle / Authors
2004A Case Study of Genome Evolution: From Continuous to Discrete Time Model.
Jerzy Tiuryn, Ryszard Rudnicki, Damian Wójtowicz
2004A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games.
Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov
2004A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract).
Martin Beaudry, José M. Fernandez, Markus Holzer
2004A Generalization of Repetition Threshold.
Lucian Ilie, Pascal Ochem, Jeffrey O. Shallit
2004A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs.
Henning Fernau, David W. Juedes
2004A Hierarchy of Irreducible Sofic Shifts.
Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
2004A New Dimension Sensitive Property for Cellular Automata.
Vincent Bernardi, Bruno Durand, Enrico Formenti, Jarkko Kari
2004A Protocol for Serializing Unique Strategies.
Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta
2004A Reducibility for the Dot-Depth Hierarchy.
Victor L. Selivanov, Klaus W. Wagner
2004Agent-Based Information Handling in Large Networks.
Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
2004Algebraic Recognizability of Languages.
Pascal Weil
2004All Superlinear Inverse Schemes Are coNP-Hard.
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2004An Algebraic Generalization of omega-Regular Languages.
Zoltán Ésik, Werner Kuich
2004An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract).
Harumichi Nishimura, Tomoyuki Yamakami
2004An Elementary Proof for the Non-parametrizability of the Equation xyz=zvx.
Elena Petre
2004Angles and Lengths in Reconfigurations of Polygons and Polyhedra.
Therese Biedl, Anna Lubiw, Michael J. Spriggs
2004Approximating Boolean Functions by OBDDs.
André Gronemeier
2004Approximating Earliest Arrival Flows with Flow-Dependent Transit Times.
Nadine Baumann, Ekkehard Köhler
2004Boxed Ambients with Communication Interfaces.
Eduardo Bonelli, Adriana B. Compagnoni, Mariangiola Dezani-Ciancaglini, Pablo Garralda
2004Captive Cellular Automata.
Guillaume Theyssier
2004Complexity Results in Graph Reconstruction.
Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
2004Complexity of Decision Problems for Simple Regular Expressions.
Wim Martens, Frank Neven, Thomas Schwentick
2004Compositional Verification: Decidability Issues Using Graph Substitutions.
Olivier Ly
2004Computational Aspects of Disjunctive Sequences.
Klaus Ambos-Spies, Edgar Busse
2004Congestion Games and Coordination Mechanisms.
Elias Koutsoupias
2004Crossing Number Is Hard for Cubic Graphs.
Petr Hlinený
2004Decidability of Trajectory-Based Equations.
Michael Domaratzki, Kai Salomaa
2004Efficient View Point Selection for Silhouettes of Convex Polyhedra.
Therese Biedl, Masud Hasan, Alejandro López-Ortiz
2004Epistemic Foundation of the Well-Founded Semantics over Bilattices.
Yann Loyer, Umberto Straccia
2004Equitable Colorings of Bounded Treewidth Graphs.
Hans L. Bodlaender, Fedor V. Fomin
2004Event Structures for Resolvable Conflict.
Rob J. van Glabbeek, Gordon D. Plotkin
2004Extraction and Implication of Path Constraints.
Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
2004Generating Paths and Cuts in Multi-pole (Di)graphs.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2004Generation Problems.
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
2004Geometric Optimization and Unique Sink Orientations of Cubes p.
Emo Welzl
2004Graph Exploration by a Finite Automaton.
Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
2004Group Coloring and List Group Coloring Are Pi
Daniel Král, Pavel Nejedlý
2004Improved Bounds and Schemes for the Declustering Problem.
Benjamin Doerr, Nils Hebbinghaus, Sören Werth
2004Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings
Jirí Fiala, Václav Koubek, Jan Kratochvíl
2004Membership and Reachability Problems for Row-Monomial Transformations.
Alexei Lisitsa, Igor Potapov
2004Multicoloring: Problems and Techniques.
Magnús M. Halldórsson, Guy Kortsarz
2004On Approximation Hardness of the Minimum 2SAT-DELETION Problem.
Miroslav Chlebík, Janka Chlebíková
2004On NC
Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
2004On Polynomially Time Bounded Symmetry of Information.
Troy Lee, Andrei Romashchenko
2004On Pseudovarieties of Semiring Homomorphisms.
Libor Polák
2004One Query Reducibilities Between Partial Information Classes.
Sebastian Bab, Arfst Nickelsen
2004Online Algorithms for Disk Graphs.
Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
2004Optimal Preemptive Scheduling for General Target Functions.
Leah Epstein, Tamir Tassa
2004Optimization, Games, and Quantified Constraint Satisfaction.
Hubie Chen, Martin Pál
2004PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness.
Uzi Vishkin
2004Packing Directed Cycles Efficiently.
Zeev Nutov, Raphael Yuster
2004Parallel Knock-Out Schemes in Networks.
Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger
2004Polynomial Time Approximation Schemes and Parameterized Complexity.
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
2004Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract).
Hans-Joachim Böckenhauer, Dirk Bongartz
2004Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets.
John M. Hitchcock, María López-Valdés, Elvira Mayordomo
2004Schema Evolution for XML: A Consistency-Preserving Approach.
Béatrice Bouchou, Denio Duarte, Mirian Halfeld Ferrari Alves, Dominique Laurent, Martin A. Musicante
2004Simulating 3D Cellular Automata with 2D Cellular Automata.
Victor Poupet
2004Some Meet-in-the-Middle Circuit Lower Bounds.
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen
2004Some Recent Progress in Algorithmic Randomness.
Rodney G. Downey
2004Structural Model Checking for Communicating Hierarchical Machines.
Ruggero Lanotte, Andrea Maggiolo-Schettini, Adriano Peron
2004Sublogarithmic Ambiguity.
Klaus Wich
2004The Bidimensional Theory of Bounded-Genus Graphs.
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2004The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups.
Gustav Nordh
2004The Complexity of Membership Problems for Circuits over Sets of Integers.
Stephen D. Travers
2004The Dual of Concatenation.
Alexander Okhotin
2004The Enumerability of P Collapses P to NC.
Alina Beygelzimer, Mitsunori Ogihara
2004The Price of Anarchy for Polynomial Social Cost.
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2004Theory and Applied Computing: Observations and Anecdotes.
Matthew Brand, Sarah F. Frisken Gibson, Neal Lesh, Joe Marks, Daniel Nikovski, Ronald N. Perry, Jonathan S. Yedidia
2004Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms.
Rolf Niedermeier
2004Universal Test for Quantum One-Way Permutations.
Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra
2004When Can You Play Positionally?
Hugo Gimbert, Wieslaw Zielonka