FST TCS 2001: Foundations of software technology and theoretical computer science. 21st conference, Bangalore, India, December 13--15, 2001. Proceedings (Q5952233)

The articles of mathematical interest will be reviewed individually. The preceding conference (20th, 2000) has been reviewed (see Zbl 0952.00044). Indexed articles: \textit{Allender, Eric}, When worlds collide: Derandomization, lower bounds, and Kolmogorov complexity, 1-15 [Zbl 1052.68059] \textit{Arora, Sanjeev}, Approximation schemes for geometric NP-hard problems: A survey, 16-17 [Zbl 1052.90595] \textit{Harel, David; Koren, Yehuda}, On clustering using random walks, 18-41 [Zbl 1052.68120] \textit{Stirling, Colin}, An introduction to decidability of DPDA equivalence, 42-56 [Zbl 1057.68051] \textit{Zwick, Uri}, Semidefinite programming based approximation algorithms, 57 [Zbl 1052.90602] \textit{Agrawal, Manindra}, Hard sets and pseudo-random generators for constant depth circuits, 58-69 [Zbl 1052.68047] \textit{Agrawal, Manindra}, The first-order isomorphism theorem, 70-82 [Zbl 1052.68048] \textit{Anderson, Richard; Kannan, Sampath; Karloff, Howard; Ladner, Richard E.}, Thresholds and optimal binary comparison search trees, 83-95 [Zbl 1052.68589] \textit{Brim, Luboš; Černá, Ivana; Krčál, Pavel; Pelánek, Radek}, Distributed LTL model checking based on negative cycle detection, 96-107 [Zbl 1052.68631] \textit{Calcagno, Cristiano; Yang, Hongseok; O'Hearn, Peter W.}, Computability and complexity results for a spatial assertion language for data structures, 108-119 [Zbl 1052.68590] \textit{Chen, Jianer; Friesen, Donald K.; Jia, Weijia; Kanj, Iyad A.}, Using nondeterminism to design deterministic algorithms, 120-131 [Zbl 1052.68622] \textit{Dang, Zhe; Ibarra, Oscar H.; San Pietro, Pierluigi}, Liveness verification of reversal-bounded multicounter machines with a free counter, 132-143 [Zbl 1053.03021] \textit{Dold, Axel; Vialard, Vincent}, A mechanically verified compiling specification for a Lisp compiler, 144-155 [Zbl 1052.68584] \textit{Fisman, Dana; Pnueli, Amir}, Beyond regular model checking, 156-170 [Zbl 1052.68084] \textit{Forster, Jürgen; Krause, Matthias; Lokam, Satyanarayana V.; Mubarakzjanov, Rustam; Schmitt, Niels; Simon, Hans Ulrich}, Relations between communication complexity, linear arrangements, and computational complexity, 171-182 [Zbl 1052.68051] \textit{Gupta, Neelima; Chopra, Sumit; Sen, Sandeep}, Optimal, output-sensitive algorithms for constructing upper envelope of line segments in parallel, 183-194 [Zbl 1052.68767] \textit{Guruswami, Venkatesan}, List decoding from erasures: Bounds and code constructions, 195-206 [Zbl 1052.94505] \textit{Jaggi, Neeraj; Gopinath, K.}, Verification of a leader election algorithm in timed asynchronous systems, 207-218 [Zbl 1052.68532] \textit{Jakoby, Andreas; Schindelhauer, Christian}, Efficient addition on field programmable gate arrays, 219-231 [Zbl 1052.68980] \textit{Krishnan, Radha; Raghavachari, Balaji}, The directed minimum-degree spanning tree problem, 232-243 [Zbl 1052.68642] \textit{Lukovszki, Tamás; Maheshwari, Anil; Zeh, Norbert}, I/O-efficient batched range counting and its applications to proximity problems, 244-255 [Zbl 1052.68595] \textit{Madhusudan, P.; Meenakshi, B.}, Beyond message sequence graphs, 256-267 [Zbl 1052.68633] \textit{Mastrolilli, Monaldo}, Grouping techniques for one machine scheduling subject to precedence constraints, 268-279 [Zbl 1052.68562] \textit{Nielsen, Mogens; Sassone, Vladimiro; Srba, Jirí}, Properties of distributed timed-arc Petri nets, 280-291 [Zbl 1052.68639] \textit{Peled, Doron; Pnueli, Amir; Zuck, Lenore}, From falsification to verification, 292-304 [Zbl 1052.68086] \textit{Plaku, Erion; Shparlinski, Igor E.}, On polynomial representations of Boolean functions related to some number theoretic problems, 305-316 [Zbl 1052.68054] \textit{Pnueli, Amir; Rodeh, Yoav; Shtrichman, Ofer}, Range allocation for equivalence logic, 317-333 [Zbl 1052.68088] \textit{Tiwari, Ashish}, Rewrite closure for ground and cancellative AC theories, 334-346 [Zbl 1052.68068]