Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar11. FCT 1997: Kraków, Poland
Bogdan S. Chlebus, Ludwik Czaja:
Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Kraków, Poland, September 1-3, 1997, Proceedings. Lecture Notes in Computer Science 1279, Springer 1997, ISBN 3-540-63386-3
Invited Lectures
- Thomas Eiter, Georg Gottlob:
The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic. 1-18 - Rolf Hennicker, Martin Wirsing:
Proof Systems for Struvtured Algebraic Specifications: An Overview. 19-37
Technical Contributions
- Christian Choffrut, Leucio Guerra:
Generalized Rational Relations and their Logical Definability. 138-149 - Krzysztof Ciebiera, Adam Malinowski:
A Note on Broadcasting with Linearly Bounded Transmission Faults in Constant Degree Networks. 150-156 - Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire:
Criteria to Disprove Context-Freeness of Collage Languages. 169-178 - Mikael Hammar, Bengt J. Nilsson:
Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. 210-221 - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Query Order in the Polynomial Hierarchy. 222-232 - Ulrich Hertrampf:
Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria. 233-244 - Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. 245-256 - Ulla Koppenhagen, Ernst W. Mayr:
The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups. 257-268 - Manfred Kudlek, Solomon Marcus, Alexandru Mateescu:
Contextual Grammars with Distributed Catenation and Shuffle. 269-280 - Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Synchronization of 1-Way Connected Processors. 293-304 - Christos Levcopoulos, Joachim Gudmundsson:
A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). 305-316 - Markus E. Nebel:
On the Average Complexity of the Membership Problem for a Generalized Dyck Language. 352-363 - Rolf Niedermeier, Klaus Reinhardt, Peter Sanders:
Towards Optimal Locality in Mesh-Indexings. 364-375 - Friedrich Otto, Andrea Sattler-Klein:
FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems. 388-399 - Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
From Finite Automata toward Hybrid Systems (Extended Abstract). 411-422 - Zenon Sadowski:
On an Optimal Quantified Propositional Proof System and a Complete Language for NP cap co-NP. 423-428 - Irina Virbitskaite, Anzhelika Votintseva:
Behavioural Characterizations of Partial Order Logics. 463-474
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-25 20:48 CEST by the dblp team