FST TCS 2003: Foundations of software technology and theoretical computer science. 23rd conference, Mumbai, India, December 15--17, 2003. Proceedings (Q1418480)

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1014.00021). Indexed articles: \textit{Backes, Michael; Pfitzmann, Birgit}, A cryptographically sound security proof of the Needham-Schroeder-Lowe public-key protocol., 1-12 [Zbl 1205.94073] \textit{Baltz, Andreas; Jäger, Gerold; Srivastav, Anand}, Constructions of sparse asymmetric connectors (extended abstract), 13-22 [Zbl 1205.68026] \textit{Biri, Nicolas; Galmiche, Didier}, A separation logic for resource distribution (extended abstract), 23-37 [Zbl 1205.03043] \textit{Black, Andrew P.; Cremet, Vincent; Guerraoui, Rachid; Odersky, Martin}, An equational theory for transactions., 38-49 [Zbl 1205.68120] \textit{Bloom, Stephen L.; Ésik, Zoltán}, Axioms for regular words (extended abstract), 50-61 [Zbl 1205.68192] \textit{Bojañczyk, Mikołaj}, 1-bounded TWA cannot be determinized., 62-73 [Zbl 1205.68193] \textit{Bouajjani, Ahmed; Touili, Tayssir}, Reachability analysis of process rewrite systems., 74-87 [Zbl 1205.68183] \textit{Bouquet, Alexis-Julien; Serre, Oliver; Walukiewicz, Igor}, Pushdown games with unboundedness and regular conditions., 88-99 [Zbl 1205.68194] \textit{Bruyère, Véronique; Raskin, Jean-François}, Real-time model-checking: parameters everywhere., 100-111 [Zbl 1205.68219] \textit{Carayol, Arnaud; Wöhrle, Stefan}, The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata., 112-123 [Zbl 1205.03022] \textit{Chevalier, Yannick; Küsters, Ralf; Rusinowitch, Michaël; Turuani, Mathieu}, Deciding the security of protocols with Diffie-Hellman exponentiation and products in exponents., 124-135 [Zbl 1205.94078] \textit{Coquery, Emmanuel; Fages, François}, Subtyping constraints in quasi-lattices., 136-148 [Zbl 1205.68121] \textit{Devanur, Nikhil R.; Vazirani, Vijay V.}, An improved approximation scheme for computing Arrow-Debreu prices for the linear case., 149-155 [Zbl 1205.91109] \textit{Diekert, Volker; Lohrey, Markus}, Word equations over graph products., 156-167 [Zbl 1188.20066] \textit{Dubhashi, Devdatt; Laura, Luigi; Panconesi, Alessandro}, Analysis and experimental evaluation of a simple algorithm for collaborative filtering in planted partition models (extended abstract), 168-182 [Zbl 1205.68259] \textit{Ergun, Funda; Muthukrishnan, S.; Sahinalp, S. Cenk}, Comparing sequences with segment rearrangements., 183-194 [Zbl 1205.68524] \textit{Ésik, Zoltán; Weil, Pascal}, On logically defined recognizable tree languages., 195-207 [Zbl 1196.68149] \textit{Gopalan, Parikshit; Lipton, Richard J.; Mehta, Aranyak}, Randomized time-space tradeoffs for directed graph connectivity., 208-216 [Zbl 1205.68506] \textit{Gudmundsson, Joachim; Narasimhan, Giri; Smid, Michiel}, Distance-preserving approximations of polygonal paths., 217-228 [Zbl 1205.68465] \textit{Guha, Sumanta}, Joint separation of geometric clusters and the extreme irregularities of regular polyhedra., 229-243 [Zbl 1205.68466] \textit{Gupta, Anupam; Srinivasan, Aravind}, On the covering Steiner problem., 244-251 [Zbl 1205.68513] \textit{Hirschkoff, D.; Lozes, É.; Sangiorgi, D.}, Minimality results for the spatial logics., 252-264 [Zbl 1205.03046] \textit{Kashyap, Srinivas; Khuller, Samir}, Algorithms for non-uniform size data placement on parallel disks., 265-276 [Zbl 1205.68145] \textit{Kavitha, T.}, Efficient algorithms for abelian group isomorphism and related problems., 277-288 [Zbl 1205.68521] \textit{Könemann, Jochen; Ravi, R.}, Quasi-polynomial time approximation algorithm for low-degree minimum-cost Steiner trees., 289-301 [Zbl 1205.68515] \textit{Löding, Christof; Rohde, Philipp}, Model checking and satisfiability for sabotage modal logic., 302-313 [Zbl 1205.68222] \textit{Mahajan, Meena; Rama, Raghavan; Raman, Venkatesh; Vijayakumar, S.}, Merging and sorting by strip moves., 314-325 [Zbl 1205.68137] \textit{Maneth, Sebastian}, The macro tree transducer hierarchy collapses for functions of linear size increase., 326-337 [Zbl 1205.68208] \textit{Mohalik, Swarup; Walukiewicz, Igor}, Distributed games., 338-351 [Zbl 1205.68089] \textit{Muthukrishnan, S.; Strauss, Martin}, Maintenance of multidimensional histograms., 352-362 [Zbl 1205.68132] \textit{Ramanujam, R.; Suresh, S. P.}, Tagging makes secrecy decidable with unbounded nonces as well., 363-374 [Zbl 1205.94097] \textit{Spakowski, Holger; Thakur, Mayur; Tripathi, Rahul}, Quantum and classical complexity classes: separations, collapses, and closure properties., 375-386 [Zbl 1205.68166] \textit{Weinard, Maik; Schnitger, Georg}, On the greedy superstring conjecture., 387-398 [Zbl 1205.68528] \textit{Bryant, Randal E.}, Reasoning about infinite state systems using Boolean methods., 399-407 [Zbl 1205.03044] \textit{Cai, Jin-Yi; Watanabe, Osamu}, Stringent relativization., 408-419 [Zbl 1205.68163] \textit{Gössler, Gregor; Sifakis, Joseph}, Component-based construction of deadlock-free systems (extended abstract), 420-433 [Zbl 1205.68245] \textit{Naor, Moni}, Moderately hard functions: from complexity to spam fighting., 434-442 [Zbl 1205.94093]