default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th FCT 2007: Budapest, Hungary
- Erzsébet Csuhaj-Varjú, Zoltán Ésik:
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
Invited Lectures
- Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu:
Rewriting Systems with Data. 1-22 - Oscar H. Ibarra, Sara Woodworth:
Spiking Neural P Systems: Some Characterizations. 23-37 - László Lovász:
Approximating Graphs by Graphs and Functions (Abstract). 38 - Philip J. Scott:
Traces, Feedback, and the Geometry of Computation (Abstract). 39
Contributions
- Abdullah N. Arslan:
A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings. 40-51 - Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis:
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. 52-63 - Eric Bach, Jin-yi Cai:
A Novel Information Transmission Problem and Its Optimal Solution. 64-75 - Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Local Testing of Message Sequence Charts Is Difficult. 76-87 - Henrik Björklund, Thomas Schwentick:
On Notions of Regularity for Data Languages. 88-99 - Viviana Bono, Jaroslaw D. M. Kusmierek:
FJMIP: A Calculus for a Modular Object Initialization. 100-112 - Henning Bordihn, György Vaszil:
Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems. 113-124 - Hans-Georg Breunig:
The Complexity of Membership Problems for Circuits over Sets of Positive Numbers. 125-136 - Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette:
Pattern Matching in Protein-Protein Interaction Graphs. 137-148 - Robert Brijder
, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates. 149-160 - Robert Brijder, Miika Langille, Ion Petre:
A String-Based Model for Simple Gene Assembly. 161-172 - Nadia Busi, Claudio Zandron:
On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation. 173-186 - Jin-yi Cai, Pinyan Lu:
On Block-Wise Symmetric Signatures for Matchgates. 187-198 - Didier Caucal, Dinh Trong Hieu:
Path Algorithms on Regular Graphs. 199-212 - Miroslav Ciric, Aleksandar Stamenkovic, Jelena Ignjatovic, Tatjana Petkovic:
Factorization of Fuzzy Automata. 213-225 - Thomas Colcombet:
Factorisation Forests for Infinite Words. 226-237 - Clelia de Felice, Gabriele Fici, Rosalba Zizza:
Marked Systems and Circular Splicing. 238-249 - Sebastian Dörn, Thomas Thierauf:
The Quantum Query Complexity of Algebraic Properties. 250-260 - Jacques Duparc, Filip Murlak:
On the Topological Complexity of Weakly Recognizable Tree Languages. 261-273 - Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop:
Productivity of Stream Definitions. 274-287 - Leah Epstein, Asaf Levin, Rob van Stee:
Multi-dimensional Packing with Conflicts. 288-299 - 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 - Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw:
Efficient Parameterized Preprocessing for Cluster Editing. 312-321 - Gyula Györ:
Representing the Boolean OR Function by Quadratic Polynomials Modulo 6. 322-327 - Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe:
On the Complexity of Kings. 328-340 - Michael Hoffmann, Richard M. Thomas:
Notions of Hyperbolicity in Monoids. 341-352 - Mihai Ionescu, Dragos Sburlan:
P Systems with Adjoining Controlled Communication Rules. 353-364 - Michal Kunc:
The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable. 365-375 - Martin Kutrib, Andreas Malcher:
Real-Time Reversible Iterative Arrays. 376-387 - Johan Kwisthout:
The Computational Complexity of Monotonicity in Probabilistic Networks. 388-399 - Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu:
Impossibility Results on Weakly Black-Box Hardness Amplification. 400-411 - Alexander Meduna, Jirí Techet:
Maximal and Minimal Scattered Context Rewriting. 412-423 - Hartmut Messerschmidt, Friedrich Otto:
Strictly Deterministic CD-Systems of Restarting Automata. 424-434 - Rajat Mittal, Mario Szegedy:
Product Rules in Semidefinite Programming. 435-445 - Alexander Okhotin:
Expressive Power of LL(k) Boolean Grammars. 446-457 - Mathias Samuelides, Luc Segoufin:
Complexity of Pebble Tree-Walking Automata. 458-469 - Andrea Sattler-Klein:
Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings. 470-481 - Hadas Shachnai, Omer Yehezkely:
Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs. 482-493 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-25 00:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
