Skip to main content
Chaptra
Cover of FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science

FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science

Written by Ramesh Hariharan,Madhavan Mukund,V. Vinay

Not rated yet — tap a star to review it

359 pages, about 7 hours of reading

Chaptra reads alongside you — AI insights, chapter breakdowns and reader discussions for every book. Join free

About this book

This volume contains the proceedings of the 21st international conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), organized under the auspices of the Indian Association for Research in Computing Science (IARCS). This year’s conference attracted 73 submissions from 20 countries. Each s- mission was reviewed by at least three independent referees. In a departure from previous conferences, the ?nal selection of the papers making up the program was done through an electronic discussion spanning two weeks, without a physical meeting of the Program Committee (PC). Since the PC of FSTTCS is distributed across the globe, it is very di?cult to ?x a meeting whose time and venue is convenient for a substantial fraction of the PC. Given this, it was felt that an electronic discussion would enable all members to participate on a more equal footing in the ?nal selection. All reviews, scores, and comments were posted on a secure website, with a mechanism for making updates and automatically sending noti?cations by email to relevant members of the PC. All PC members participated actively in the discussion. The general feedback on the arrangement was very positive, so we hope to continue this in future years. We had ?ve invited speakers this year: Eric Allender, Sanjeev Arora, David Harel, Colin Stirling, and Uri Zwick. We thank them for having readily accepted our invitation to talk at the conference and for providing abstracts (and even full papers) for the proceedings.

Read it with a club

Small groups reading the same books and talking as they go.

All clubs
An open book held up in a dark bookshop

News

  • 1 member
  • 1,813 discussions
  • Active 7h ago

Read FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science alongside people who are reading it too.

Chaptra Prime — paid clubs, every club feature, and unlimited reading support, for $5 a month or $60 once.

See Prime

Reading guide

Themes, characters and key ideas in FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, written by Chaptra AI.

  • about 60 hours
  • advanced
  • Informative
  • Rigorous
  • Academic

FST TCS 2001 is the official proceedings of the 21st international conference on Foundations of Software Technology and Theoretical Computer Science. This volume compiles 73 peer-reviewed research papers from 20 countries, along with abstracts or full papers from five invited speakers, representing the cutting edge of theoretical computer science in 2001. It serves as a crucial academic record, showcasing advancements in algorithms, complexity theory, logic, and other foundational areas. Notably, the conference pioneered a fully electronic discussion for paper selection, a significant innovation for global academic collaboration at the time.

In a departure from previous conferences, the ?nal selection of the papers making up the program was done through an electronic discussion spanning two weeks, without a physical meeting of the Program Committee (PC). Given this, it was felt that an electronic discussion would enable all members to participate on a more equal footing in the ?nal selection. All PC members participated actively in the discussion. The general feedback on the arrangement was very positive, so we hope to continue this in future years.

Key themes

Algorithms and Data Structures
Exploration of efficient methods for computation and data organization, including analysis of time and space complexity, new algorithmic paradigms, and their applications.
Complexity Theory
Investigation into the inherent difficulty of computational problems, classifying them into complexity classes (e.g., P, NP, PSPACE), and exploring the limits of computation. This theme delves into fundamental questions about what can and cannot be computed efficiently.
Logic and Verification
Application of formal logic to specify, verify, and reason about the correctness of software and hardware systems. This includes model checking, theorem proving, and the study of various logical systems relevant to computation.

Worth discussing

What were the most significant open problems or research directions highlighted by the invited speakers at FSTTCS 2001, and how have they evolved or been addressed in the subsequent two decades?

Chapter-by-chapter breakdowns, character arcs and the full thematic analysis come with a free account.

Discussions

No one has started one yet

Join

Questions this book opens up

No discussions yet

Be the first to start a discussion about this book!

Sign up to start the discussion

Reviews

No reviews yet

Be the first to review this book!