default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st FCT 2017: Bordeaux, France
- Ralf Klasing, Marc Zeitoun:
Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings. Lecture Notes in Computer Science 10472, Springer 2017, ISBN 978-3-662-55750-1
Invited Papers
- Thomas Colcombet, Laure Daviaud
, Florian Zuleger:
Automata and Program Analysis. 3-10 - Juraj Hromkovic, Peter Rossmanith:
What One Has to Know When Attacking P vs. NP (Extended Abstract). 11-28 - Anca Muscholl:
A Tour of Recent Results on Word Transducers. 29-33 - Jean-Éric Pin:
Some Results of Zoltán Ésik on Regular Languages. 34-37
Contributed Papers
- Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix:
Contextuality in Multipartite Pseudo-Telepathy Graph Games. 41-55 - Albert Atserias, Phokion G. Kolaitis, Simone Severini:
Generalized Satisfiability Problems via Operator Assignments. 56-68 - Indranil Banerjee, Dana Richards:
New Results on Routing via Matchings on Graphs. 69-81 - Andreas Bärtschi, Thomas Tschager:
Energy-Efficient Fast Delivery by Mobile Agents. 82-95 - Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Parameterized Aspects of Triangle Enumeration. 96-110 - Markus Bläser, B. V. Raghavendra Rao, Jayalal Sarma:
Testing Polynomial Equivalence by Scaling Matrices. 111-122 - Endre Boros, Ondrej Cepek, Kazuhisa Makino:
Strong Duality in Horn Minimization. 123-135 - Nicolas Bousquet, Arnaud Mary, Aline Parreau:
Token Jumping in Minor-Closed Classes. 136-149 - Jérémie Cabessa, Olivier Finkel:
Expressive Power of Evolving Neural Networks Working on Infinite Input Streams. 150-163 - Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, Yann Ramusat:
Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching. 164-176 - Gianluca De Marco, Tomasz Jurdzinski, Michal Rózanski, Grzegorz Stachowiak:
Subquadratic Non-adaptive Threshold Group Testing. 177-189 - Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbanska, Pawel Zylinski:
The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). 190-203 - Kord Eickmeyer, Ken-ichi Kawarabayashi:
FO Model Checking on Map Graphs. 204-216 - Joost Engelfriet, Andreas Maletti:
Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars. 217-229 - Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree. 230-242 - Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
Decidable Weighted Expressions with Presburger Combinators. 243-256 - Till Fluschnik, Marco Morik, Manuel Sorge:
The Complexity of Routing with Few Collisions. 257-270 - Pierre Ganty, Elena Gutiérrez:
Parikh Image of Pushdown Automata. 271-283 - Dima Grigoriev, Vladimir V. Podolskii:
Tropical Combinatorial Nullstellensatz and Fewnomials Testing. 284-297 - Pushkar S. Joglekar, B. V. Raghavendra Rao, Siddharth S. Sivakumar:
On Weak-Space Complexity over Complex Numbers. 298-311 - Tomasz Jurdzinski, Michal Rózanski:
Deterministic Oblivious Local Broadcast in the SINR Model. 312-325 - Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities. 326-340 - Christof Löding, Christopher Spinrath:
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. 341-354 - George Manoussakis:
Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time. 355-366 - Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas:
Reliable Communication via Semilattice Properties of Partial Knowledge. 367-380 - Charis Papadopoulos, Spyridon Tzimas:
Polynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs. 381-394 - Simon Perdrix, Luc Sanselme:
Determinism and Computational Power of Real Measurement-Based Quantum Computation. 395-408 - Holger Petersen:
Busy Beaver Scores and Alphabet Size. 409-417 - Alexander Shen:
Automatic Kolmogorov Complexity and Normality Revisited. 418-430
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 2024-11-08 20:18 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:
