null Skip to main content

✨ Buy more, save 5% Ends

Fundamentals of Computation Theory: 14th International Symposium, Fct 2003, Malmö, Sweden, August 12-15, 2003, Proceedings

Fundamentals of Computation Theory: 14th International Symposium, Fct 2003, Malmö, Sweden, August 12-15, 2003, Proceedings

$60.32
(No reviews yet) Write a Review
Physical book delivery

Shipping calculated at checkout.

Estimated delivery
Adding to cart… The item has been added
Product Details
Author:
Andrzej Lingas
Publisher:
Springer
Publication Date:
Jul 29, 2003
Number of pages:
440 pages
Binding:
Paperback or Softback
ISBN-10:
3540405437
ISBN-13:
9783540405436

Overview

The papers in this volume were presented at the 14th Symposium on Fun- mentals of Computation Theory. The symposium was established in 1977 as a biennial event for researchers interested in all aspects of theoretical computer science, in particular in al- rithms, complexity, and formal and logical methods. The previous FCT con- rences were held in the following cities: Poznan (Poland, 1977), Wendisch-Rietz (Germany, 1979), Szeged (Hungary, 1981), Borgholm (Sweden, 1983), Cottbus (Germany, 1985), Kazan (Russia, 1987), Szeged (Hungary, 1989), Gosen-Berlin (Germany, 1991), Szeged (Hungary, 1993), Dresden (Germany, 1995), Krak ow (Poland, 1997), Iasi (Romania, 1999), and Riga (Latvia, 2001). The FCT conferences are coordinated by the FCT steering committee, which consistsofB.Chlebus(Denver/Warsaw), Z.Esik(Szeged), M.Karpinski(Bonn), A. Lingas (Lund), M. Santha (Paris), E. Upfal (Providence), and I. Wegener (Dortmund). The call for papers sought contributions on original research in all aspects of theoretical computer science including design and analysis of algorithms, abstract data types, approximation algorithms, automata and formal lang- ges, categorical and topological approaches, circuits, computational and str- turalcomplexity, circuitandprooftheory, computationalbiology, computational geometry, computer systems theory, concurrency theory, cryptography, domain theory, distributed algorithms and computation, molecular computation, qu- tum computation and information, granular computation, probabilistic com- tation, learning theory, rewriting, semantics, logicin computer science, speci?- tion, transformation and veri?cation, and algebraic aspects of computer science. There were 73 papers submitted, of which the majority were very good.


  • | Author: Andrzej Lingas
  • | Publisher: Springer
  • | Publication Date: Jul 29, 2003
  • | Number of Pages: 440 pages
  • | Binding: Paperback or Softback
  • | ISBN-10: 3540405437
  • | ISBN-13: 9783540405436

Reviews

0 Reviews

Write a Review

No reviews yet.

Share your experience and help another reader choose their next book.

Discover your next great book

Get new releases, reader favourites, and special offers delivered to your inbox.