FCT B

44 papers

YearTitle / Authors
2007A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings.
Abdullah N. Arslan
2007A Novel Information Transmission Problem and Its Optimal Solution.
Eric Bach, Jin-Yi Cai
2007A String-Based Model for Simple Gene Assembly.
Robert Brijder, Miika Langille, Ion Petre
2007An O(1.787
Takeyuki Tamura, Tatsuya Akutsu
2007Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis
2007Approximating Graphs by Graphs and Functions (Abstract).
László Lovász
2007Complexity of Pebble Tree-Walking Automata.
Mathias Samuelides, Luc Segoufin
2007Efficient Parameterized Preprocessing for Cluster Editing.
Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw
2007Expressive Power of LL(k) Boolean Grammars.
Alexander Okhotin
2007FJMIP: A Calculus for a Modular Object Initialization.
Viviana Bono, Jaroslaw D. M. Kusmierek
2007Factorisation Forests for Infinite Words.
Thomas Colcombet
2007Factorization of Fuzzy Automata.
Miroslav Ciric, Aleksandar Stamenkovic, Jelena Ignjatovic, Tatjana Petkovic
2007Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs.
Hadas Shachnai, Omer Yehezkely
2007From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates.
Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
2007Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings
Erzsébet Csuhaj-Varjú, Zoltán Ésik
2007Impossibility Results on Weakly Black-Box Hardness Amplification.
Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu
2007Local Testing of Message Sequence Charts Is Difficult.
Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
2007Marked Systems and Circular Splicing.
Clelia De Felice, Gabriele Fici, Rosalba Zizza
2007Maximal and Minimal Scattered Context Rewriting.
Alexander Meduna, Jirí Techet
2007Multi-dimensional Packing with Conflicts.
Leah Epstein, Asaf Levin, Rob van Stee
2007Notions of Hyperbolicity in Monoids.
Michael Hoffmann, Richard M. Thomas
2007On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time.
Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2007On Block-Wise Symmetric Signatures for Matchgates.
Jin-Yi Cai, Pinyan Lu
2007On Notions of Regularity for Data Languages.
Henrik Björklund, Thomas Schwentick
2007On the Complexity of Kings.
Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe
2007On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation.
Nadia Busi, Claudio Zandron
2007On the Topological Complexity of Weakly Recognizable Tree Languages.
Jacques Duparc, Filip Murlak
2007P Systems with Adjoining Controlled Communication Rules.
Mihai Ionescu, Dragos Sburlan
2007Path Algorithms on Regular Graphs.
Didier Caucal, Dinh Trong Hieu
2007Pattern Matching in Protein-Protein Interaction Graphs.
Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette
2007Product Rules in Semidefinite Programming.
Rajat Mittal, Mario Szegedy
2007Productivity of Stream Definitions.
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop
2007Real-Time Reversible Iterative Arrays.
Martin Kutrib, Andreas Malcher
2007Representing the Boolean OR Function by Quadratic Polynomials Modulo 6.
Gyula Györ
2007Rewriting Systems with Data.
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu
2007Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings.
Andrea Sattler-Klein
2007Spiking Neural P Systems: Some Characterizations.
Oscar H. Ibarra, Sara Woodworth
2007Strictly Deterministic CD-Systems of Restarting Automata.
Hartmut Messerschmidt, Friedrich Otto
2007The Complexity of Membership Problems for Circuits over Sets of Positive Numbers.
Hans-Georg Breunig
2007The Computational Complexity of Monotonicity in Probabilistic Networks.
Johan Kwisthout
2007The Quantum Query Complexity of Algebraic Properties.
Sebastian Dörn, Thomas Thierauf
2007The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable.
Michal Kunc
2007Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems.
Henning Bordihn, György Vaszil
2007Traces, Feedback, and the Geometry of Computation (Abstract).
Philip J. Scott