
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
This book constitutes the refereed proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002, held in Antibes - Juan les Pins, France, in March 2002. The 50 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 209 submissions. The book offers topical sections on algorithms, current challenges, computational and structural complexity, automata and formal languages, and logic in computer science.
This volume presents the proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2002). The symposium, held in Antibes - Juan les Pins, France, from March 14-16, 2002, brought together researchers to discuss foundational issues in computer science. The collection features 50 peer-reviewed full papers and three invited papers, selected from a substantial pool of submissions, covering key areas such as algorithms, computational complexity, automata theory, formal languages, and the application of logic in computer science.
This collection of papers represents a snapshot of theoretical computer science research as presented at STACS 2002. The inclusion of both submitted and invited papers suggests a curated selection of significant contributions within the field. The topical organization indicates a focus on core areas of theoretical computer science, likely appealing to academics and researchers specializing in these domains.
Page Count:
660
Publication Date:
2003-08-03
Publisher:
Springer
ISBN-10:
3540458417
ISBN-13:
9783540458418
No comments yet. Be the first to share your thoughts!