16. FCT 2007:
Budapest,
Hungary
Erzsébet Csuhaj-Varjú, Zoltán Ésik (Eds.):
Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings.
Lecture Notes in Computer Science 4639 Springer 2007, ISBN 978-3-540-74239-5 BibTeX
Invited Lectures
Contributions
- Abdullah N. Arslan:
A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings.
40-51
Electronic Edition (link) BibTeX
- Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis:
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.
52-63
Electronic Edition (link) BibTeX
- Eric Bach, Jin-yi Cai:
A Novel Information Transmission Problem and Its Optimal Solution.
64-75
Electronic Edition (link) BibTeX
- Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Local Testing of Message Sequence Charts Is Difficult.
76-87
Electronic Edition (link) BibTeX
- Henrik Björklund, Thomas Schwentick:
On Notions of Regularity for Data Languages.
88-99
Electronic Edition (link) BibTeX
- Viviana Bono, Jaroslaw D. M. Kusmierek:
FJMIP: A Calculus for a Modular Object Initialization.
100-112
Electronic Edition (link) BibTeX
- Henning Bordihn, György Vaszil:
Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems.
113-124
Electronic Edition (link) BibTeX
- Hans-Georg Breunig:
The Complexity of Membership Problems for Circuits over Sets of Positive Numbers.
125-136
Electronic Edition (link) BibTeX
- Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette:
Pattern Matching in Protein-Protein Interaction Graphs.
137-148
Electronic Edition (link) BibTeX
- Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates.
149-160
Electronic Edition (link) BibTeX
- Robert Brijder, Miika Langille, Ion Petre:
A String-Based Model for Simple Gene Assembly.
161-172
Electronic Edition (link) BibTeX
- Nadia Busi, Claudio Zandron:
On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation.
173-186
Electronic Edition (link) BibTeX
- Jin-yi Cai, Pinyan Lu:
On Block-Wise Symmetric Signatures for Matchgates.
187-198
Electronic Edition (link) BibTeX
- Didier Caucal, Dinh Trong Hieu:
Path Algorithms on Regular Graphs.
199-212
Electronic Edition (link) BibTeX
- Miroslav Ciric, Aleksandar Stamenkovic, Jelena Ignjatovic, Tatjana Petkovic:
Factorization of Fuzzy Automata.
213-225
Electronic Edition (link) BibTeX
- Thomas Colcombet:
Factorisation Forests for Infinite Words.
226-237
Electronic Edition (link) BibTeX
- Clelia de Felice, Gabriele Fici, Rosalba Zizza:
Marked Systems and Circular Splicing.
238-249
Electronic Edition (link) BibTeX
- Sebastian Dörn, Thomas Thierauf:
The Quantum Query Complexity of Algebraic Properties.
250-260
Electronic Edition (link) BibTeX
- Jacques Duparc, Filip Murlak:
On the Topological Complexity of Weakly Recognizable Tree Languages.
261-273
Electronic Edition (link) BibTeX
- Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop:
Productivity of Stream Definitions.
274-287
Electronic Edition (link) BibTeX
- Leah Epstein, Asaf Levin, Rob van Stee:
Multi-dimensional Packing with Conflicts.
288-299
Electronic Edition (link) BibTeX
- Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time.
300-311
Electronic Edition (link) BibTeX
- Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw:
Efficient Parameterized Preprocessing for Cluster Editing.
312-321
Electronic Edition (link) BibTeX
- Gyula Györ:
Representing the Boolean OR Function by Quadratic Polynomials Modulo 6.
322-327
Electronic Edition (link) BibTeX
- Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe:
On the Complexity of Kings.
328-340
Electronic Edition (link) BibTeX
- Michael Hoffmann, Richard M. Thomas:
Notions of Hyperbolicity in Monoids.
341-352
Electronic Edition (link) BibTeX
- Mihai Ionescu, Dragos Sburlan:
P Systems with Adjoining Controlled Communication Rules.
353-364
Electronic Edition (link) BibTeX
- Michal Kunc:
The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable.
365-375
Electronic Edition (link) BibTeX
- Martin Kutrib, Andreas Malcher:
Real-Time Reversible Iterative Arrays.
376-387
Electronic Edition (link) BibTeX
- Johan Kwisthout:
The Computational Complexity of Monotonicity in Probabilistic Networks.
388-399
Electronic Edition (link) BibTeX
- Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu:
Impossibility Results on Weakly Black-Box Hardness Amplification.
400-411
Electronic Edition (link) BibTeX
- Alexander Meduna, Jirí Techet:
Maximal and Minimal Scattered Context Rewriting.
412-423
Electronic Edition (link) BibTeX
- Hartmut Messerschmidt, Friedrich Otto:
Strictly Deterministic CD-Systems of Restarting Automata.
424-434
Electronic Edition (link) BibTeX
- Rajat Mittal, Mario Szegedy:
Product Rules in Semidefinite Programming.
435-445
Electronic Edition (link) BibTeX
- Alexander Okhotin:
Expressive Power of LL(k) Boolean Grammars.
446-457
Electronic Edition (link) BibTeX
- Mathias Samuelides, Luc Segoufin:
Complexity of Pebble Tree-Walking Automata.
458-469
Electronic Edition (link) BibTeX
- Andrea Sattler-Klein:
Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings.
470-481
Electronic Edition (link) BibTeX
- Hadas Shachnai, Omer Yehezkely:
Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs.
482-493
Electronic Edition (link) BibTeX
- Takeyuki Tamura, Tatsuya Akutsu:
An O(1.787n)-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes.
494-505
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:11:58 2009
by Michael Ley (ley@uni-trier.de)
