ENGLISH

Fundamentals of Computation Theory: 13th International Symposium, FCT 2001 Riga, Latvia, August 22–24, 2001 Proceedings

By Rusins Freivalds (eds.) , Jānis Bārzdiņš , Rūsiņš Freivalds , Carl H. Smith (auth.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2001
ISBN
978-3-540-42487-1, 978-3-540-44669-9, 3-540-42487-3
DOI
10.1007/3-540-44669-9
Language
english
Format
PDF
Filesize
7 MB (7211766 bytes)
Series
Lecture Notes in Computer Science 2138
Edition
1
Pages
550\554
Time added
2014-01-18 08:00:00
Computation by Abstract Devices; Algorithm Analysi

Description

This book constitutes the refereed proceedings of the 13th International Symposium Fundamentals of Computation Theory, FCT 2001, as well as of the International Workshop on Efficient Algorithms, WEA 2001, held in Riga, Latvia, in August 2001. The 28 revised full FCT papers and 15 short papers presented together with six invited contributions and 8 revised full WEA papers as well as three invited WEA contributions have been carefully reviewed and selected. Among the topics addressed are a broad variety of topics from theoretical computer science, algorithmics and programming theory. The WEA papers deal with graph and network algorithms, flow and routing problems, scheduling and approximation algorithms, etc.

Similar books