Skip to main content
SpringerLink
Log in
Book cover

Fundamentals of Computation Theory

11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997. Proceedings

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Bogdan S. Chlebus
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ludwik Czaja
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1279)

Included in the following conference series:

Conference proceedings info: FCT 1997.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (40 papers)

  1. Front Matter

    Download chapter PDF

  2. The complexity class θ p 2 : Recent results and applications in AI and modal logic

    • Thomas Eiter, Georg Gottlob
    Pages 1-18

  3. Proof systems for structured algebraic specifications: An overview

    • Rolf Hennicker, Martin Wirsing
    Pages 19-37

  4. Average-case analysis via incompressibility

    • Ming Li, Paul Vitányi
    Pages 38-50

  5. Locally computable enumerations

    • Antoni Mazurkiewicz
    Pages 51-66

  6. The complexity of error-correcting codes

    • Daniel A. Spielman
    Pages 67-84

  7. Stochastic analysis of dynamic processes

    • Eli Upfal
    Pages 85-92

  8. k-k Sorting on the multi-mesh

    • Alfons Avermiddig, Manfred Kunde, Andre Osterloh
    Pages 93-104

  9. Refinement of coloured petri nets

    • Eike Best, Thomas Thielke
    Pages 105-116

  10. Stratified petri nets

    • Eric Badouel, Philippe Darondeau
    Pages 117-128

  11. Distributed acyclic orientation of asynchronous anonymous networks

    • Antonio Calabrese
    Pages 129-137

  12. Generalized rational relations and their logical definability

    • Christian Choffrut, Leucio Guerra
    Pages 138-149

  13. A note on broadcasting with linearly bounded transmission faults in constant degree networks

    • Krzysztof Ciebiera, Adam Malinowski
    Pages 150-156

  14. Logics which capture complexity classes over the reals

    • Felipe Cucker, Klaus Meer
    Pages 157-167

  15. Criteria to disprove context-freeness of collage languages

    • Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire
    Pages 169-178

  16. The subword complexity of fixed points of binary uniform morphisms

    • Anna E. Frid
    Pages 179-187

  17. Efficient parallel computing with memory faults

    • Leszek GÄ…sieniec, Piotr Indyk
    Pages 188-197

  18. Bounded concurrency

    • Damas P. Gruska
    Pages 198-209

  19. Concerning the time bounds of existing shortest watchman route algorithms

    • Mikael Hammar, Bengt J. Nilsson
    Pages 210-221

  20. Query order in the polynomial hierarchy

    • Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Pages 222-232
Back to top

Other volumes

  1. Fundamentals of Computation Theory

Keywords

About this book

This book constitutes the refereed proceedings of the 11th International Symposium on Fundamentals of Computer Theory, FCT'97, held in Krakow, Poland, in September 1997.
The 34 revised full papers presented in the volume were selected from a total of 72 submissions. Also included are six invited papers by leading scientists. The papers address a variety of current topics in theoretical computer science including models of computation, concurrency, algorithms, complexity theory, programming theory, formal languages, graph theory and discrete mathematics, networking, automata theory, term rewriting, etc.

Bibliographic Information

  • Book Title: Fundamentals of Computation Theory

  • Book Subtitle: 11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997. Proceedings

  • Editors: Bogdan S. Chlebus, Ludwik Czaja

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/BFb0036167

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1997

  • Softcover ISBN: 978-3-540-63386-0Published: 06 August 1997

  • eBook ISBN: 978-3-540-69529-5Published: 11 December 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XII, 484

  • Topics: Theory of Computation, Discrete Mathematics in Computer Science, Computer Graphics, Data Structures

Publish with us

Policies and ethics

Back to top

Search

Navigation