FCT B

41 papers

YearTitle / Authors
1997A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract).
Christos Levcopoulos, Joachim Gudmundsson
1997A Note on Broadcasting with Linearly Bounded Transmission Faults in Constant Degree Networks.
Krzysztof Ciebiera, Adam Malinowski
1997A Two-Dimensional Hierarchy for Attributed Tree Transducers.
Armin Kühnemann
1997Average-Case Analysis via Incompressibility.
Ming Li, Paul M. B. Vitányi
1997Behavioural Characterizations of Partial Order Logics.
Irina B. Virbitskaite, Anzhelika Votintseva
1997Bounded Concurrency.
Damas P. Gruska
1997Cellular Automata Universality Revisited.
Bruno Martin
1997Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms.
Mikael Hammar, Bengt J. Nilsson
1997Contextual Grammars with Distributed Catenation and Shuffle.
Manfred Kudlek, Solomon Marcus, Alexandru Mateescu
1997Criteria to Disprove Context-Freeness of Collage Languages.
Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire
1997Distributed Acyclic Orientation of Asynchronous Networks.
Antonio Calabrese
1997Efficient Parallel Computing with Memory Faults.
Leszek Gasieniec, Piotr Indyk
1997FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems.
Friedrich Otto, Andrea Sattler-Klein
1997From Finite Automata toward Hybrid Systems (Extended Abstract).
Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
1997Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Kraków, Poland, September 1-3, 1997, Proceedings
Bogdan S. Chlebus, Ludwik Czaja
1997Generalized Rational Relations and their Logical Definability.
Christian Choffrut, Leucio Guerra
1997Locally Computable Enumerations.
Antoni W. Mazurkiewicz
1997Logics Which Capture Complexity Classes over the Reals.
Felipe Cucker, Klaus Meer
1997Lower Bounds in On-Line Geometric Searching.
Sven Schuierer
1997On Occurrence Net Semantics for Petri Nets with Contacts.
Irina A. Lomazova
1997On an Optimal Quantified Propositional Proof System and a Complete Language for NP cap co-NP.
Zenon Sadowski
1997On the Average Complexity of the Membership Problem for a Generalized Dyck Language.
Markus E. Nebel
1997On the Hierarchy of Nondeterministic Branching k-Programs.
Elizaveta A. Okol'nishnikova
1997Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata.
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
1997Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria.
Ulrich Hertrampf
1997Proof Systems for Struvtured Algebraic Specifications: An Overview.
Rolf Hennicker, Martin Wirsing
1997Query Order in the Polynomial Hierarchy.
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997Refinement of Coloured Petri Nets.
Eike Best, Thomas Thielke
1997Stochastic Analysis of Dynamic Processes.
Eli Upfal
1997Stratified Petri Nets.
Éric Badouel, Philippe Darondeau
1997Synchronization of 1-Way Connected Processors.
Salvatore La Torre, Margherita Napoli, Mimmo Parente
1997The Complexity Class Theta
Thomas Eiter, Georg Gottlob
1997The Complexity of Error-Correcting Codes.
Daniel A. Spielman
1997The Complexity of Universal Text-Learners.
Frank Stephan, Sebastiaan Terwijn
1997The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups.
Ulla Koppenhagen, Ernst W. Mayr
1997The Equivalence of Pebbles and Sensing Heads for Finite Automata.
Holger Petersen
1997The Subword Complexity of Fixed Points of Binary Uniform Morphisms.
Anna E. Frid
1997Towards Optimal Locality in Mesh-Indexings.
Rolf Niedermeier, Klaus Reinhardt, Peter Sanders
1997Trade-Off Results for Connection Management.
Marios Mavronicolas, Nikos Papadakis
1997Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps.
Rakesh M. Verma
1997k-k Sorting on the Multi-Mesh.
Alfons Avermiddig, Manfred Kunde, Andre Osterloh