Advertisement

Fundamentals of Computation Theory

14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003. Proceedings

  • Andrzej Lingas
  • Bengt J. Nilsson

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

Table of contents

  1. Front Matter
  2. Approximability 1

  3. Approximability 2

  4. Algorithms 1

    1. Hans Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
      Pages 61-72
    2. Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
      Pages 73-85
    3. Mark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis
      Pages 98-108
  5. Algorithms 2

    1. Ivan Bjerre Damgård, Gudmund Skovbjerg Frandsen
      Pages 109-117
    2. Ivan Bjerre Damgård, Gudmund Skovbjerg Frandsen
      Pages 118-131
    3. Grzegorz Stachowiak
      Pages 144-156
  6. Networks and Complexity

    1. Christos Papadimitriou
      Pages 157-157
    2. Jan Arpe, Andreas Jakoby, Maciej Liśkiewicz
      Pages 158-170
    3. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
      Pages 171-182
  7. Computational Biology

    1. Peter Damaschke
      Pages 183-194
    2. Jens Gramm, Jiong Guo, Rolf Niedermeier
      Pages 195-209
    3. Patricia A. Evans, Andrew D. Smith
      Pages 210-221
  8. Computational Geometry

    1. Mikael Hammar, Bengt J. Nilsson, Mia Persson
      Pages 234-245
    2. Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
      Pages 246-257
    3. John H. Reif, Zheng Sun
      Pages 271-283
  9. Computational Models and Complexity

    1. Gheorghe Păun
      Pages 284-295
    2. Farid Ablayev, Aida Gainutdinova
      Pages 296-302
    3. Luís Antunes, Lance Fortnow, N. V. Vinodchandran
      Pages 303-310
  10. Structural Complexity

    1. Richard J. Lipton, Anastasios Viglas
      Pages 311-320
  11. Formal Languages

    1. Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Éric Pin
      Pages 343-354
    2. Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
      Pages 355-363
    3. Michele Bugliesi, Ambra Ceccato, Sabina Rossi
      Pages 364-375
    4. Werner Kuich, Klaus W. Wagner
      Pages 376-386
    5. Christian Pech
      Pages 387-399
  12. Logic

  13. Back Matter

About these proceedings

Keywords

Boolean function algorithms approximation automata complexity complexity theory computational geometry computational structures computing theory formal language foundations logic mathematical logic optimization theoretical computer science

Editors and affiliations

  • Andrzej Lingas
    • 1
  • Bengt J. Nilsson
    • 2
  1. 1.Department of Computer ScienceLund UniversityLundSweden
  2. 2.School of Technology and SocietyMalmö UniversityMalmöSweden

Bibliographic information

  • DOI https://doi.org/10.1007/b11926
  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-40543-6
  • Online ISBN 978-3-540-45077-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications