FST TCS 2000: Foundations of software technology and theoretical computer science. 20th conference, New Delhi, India, December 13--15, 2000. Proceedings (Q1589872)

The articles of mathematical interest will be reviewed individually. The preceding conference (19th, 1999) has been reviewed (see Zbl 0931.00044). Indexed articles: \textit{Emerson, E. Allen}, Model checking: Theory into practice, 1-10 [Zbl 1044.68673] \textit{Fernandez, Mary; Simeon, Jerome; Wadler, Philip}, An algebra for XML query, 11-45 [Zbl 1044.68577] \textit{Chazelle, Bernard}, Irregularities of distribution, derandomization, and complexity theory, 46-54 [Zbl 1044.68051] \textit{Basin, David; Clavel, Manuel; Meseguer, José}, Rewriting logic as a metalogical framework, 55-80 [Zbl 1044.03020] \textit{Grötschel, Martin}, Frequency assignment in mobile phone systems, 81-86 [Zbl 1044.90500] \textit{Buneman, Peter; Khanna, Sanjeev; Tan, Wang-Chiew}, Data provenance: Some basic issues, 87-93 [Zbl 1044.68573] \textit{Patkar, Sachin B.; Narayanan, H.}, Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition, 94-105 [Zbl 1044.68708] \textit{Favrholdt, Lene Monrad; Nielsen, Morten Nyhave}, On-line edge-coloring with a fixed number of colors, 106-116 [Zbl 1044.68696] \textit{Fujito, Toshihiro}, On approximability of the independent/connected edge dominating set problems, 117-126 [Zbl 1044.68698] \textit{Walukiewicz, Igor}, Model checking CTL properties of pushdown systems, 127-138 [Zbl 1044.68111] \textit{La Torre, Salvatore; Napoli, Margherita}, A decidable dense branching-time temporal logic, 139-150 [Zbl 1044.03012] \textit{Kupferman, Orna; Piterman, Nir; Vardi, Moshe Y.}, Fair equivalence relations, 151-163 [Zbl 1044.68110] \textit{McKenzie, Pierre; Vollmer, Heribert; Wagner, Klaus W.}, Arithmetic circuits and polynomial replacement systems, 164-175 [Zbl 1044.68061] \textit{Radhakrishnan, Jaikumar; Sen, Pranab; Vishwanathan, Sundar}, Depth-3 arithmetic circuits for \(S_n^2(X)\) and extensions of the Graham-Pollack theorem, 176-187 [Zbl 1044.68072] \textit{Ly, Olivier}, The bounded weak monadic quantifier alternation hierarchy of equational graphs is infinite, 188-200 [Zbl 1044.03006] \textit{Abramov, Sergei; Glück, Robert}, Combining semantics with non-standard interpreter hierarchies, 201-213 [Zbl 1044.68664] \textit{Smaus, Jan-Georg; Fages, François; Deransart, Pierre}, Using modes to ensure subject reduction for typed logic programs with subtyping, 214-226 [Zbl 1044.68540] \textit{De Vos, Marina; Vermeir, Dirk}, Dynamically ordered probabilistic choice logic programming, 227-239 [Zbl 1044.68537] \textit{Fellows, Michael R.; McCartin, Catherine; Rosamond, Frances A.; Stege, Ulrike}, Coordinatized kernels and catalytic reductions: An improved FPT algorithm for Max Leaf Spanning Tree and other problems, 240-251 [Zbl 1044.68697] \textit{Baswana, Surender; Sen, Sandeep}, Planar graph blocking for external searching, 252-263 [Zbl 1044.68691] \textit{Guelev, Dimitar P.}, A complete fragment of higher-order duration \(\mu\)-calculus, 264-276 [Zbl 1044.68108] \textit{Lin, Huimin; Yi, Wang}, A complete axiomatisation for timed automata, 277-289 [Zbl 1044.68118] \textit{Crescenzi, Pilu; Del Lungo, Alberto; Grossi, Roberto; Lodi, Elena; Pagli, Linda; Rossi, Gianluca}, Text sparsification via local maxima (extended abstract), 290-301 [Zbl 1044.68625] \textit{Amir, Amihood; Lewenstein, Moshe; Porat, Ely}, Approximate swapped matching, 302-311 [Zbl 1044.68945] \textit{Cleaveland, Rance; Lüttgen, Gerald}, A semantic theory for heterogeneous system design, 312-324 [Zbl 1044.68116] \textit{Sedletsky, Ekaterina; Pnueli, Amir; Ben-Ari, Mordechai}, Formal verification of the Ricart-Agrawala algorithm, 325-335 [Zbl 1044.68677] \textit{Köbler, Johannes; Lindner, Wolfgang}, On distribution-specific learning with membership queries versus pseudorandom generation, 336-347 [Zbl 1044.68074] \textit{Spakowski, Holger; Vogel, Jörg}, \( \Theta_2^p\)-completeness: A classical approach for new results, 348-360 [Zbl 1044.68062] \textit{Köbler, Johannes; Messner, Jochen}, Is the standard proof system for SAT p-optimal? (Extended abstract), 361-372 [Zbl 1044.03541] \textit{König, Barbara}, A general framework for types in graph rewriting, 373-384 [Zbl 1044.68079] \textit{Fu, Yuxi; Yang, Zhenrong}, The ground congruence for chi calculus, 385-396 [Zbl 1044.68685] \textit{Fournet, Cédric; Laneve, Cosimo; Maranget, Luc; Rémy, Didier}, Inheritance in the join calculus (extended abstract), 397-408 [Zbl 1044.68684] \textit{Leonardi, Stefano; Marchetti-Spaccamela, Alberto; Vitaletti, Andrea}, Approximation algorithms for bandwidth and storage allocation problems under real time constraints, 409-420 [Zbl 1044.90501] \textit{Kalyanasundaram, Bala; Pruhs, Kirk}, Dynamic spectrum allocation: The impotency of duration notification, 421-428 [Zbl 1044.68938] \textit{Di Gianantonio, Pietro; Franco, Gianluca}, The fine structure of game lambda models, 429-441 [Zbl 1044.03007] \textit{Parigot, Michel}, Strong normalization of second order symmetric \(\lambda\)-calculus, 442-453 [Zbl 1044.03008] \textit{Afrati, Foto; Bampis, Evripidis; Fishkin, Aleksei V.; Jansen, Klaus; Kenyon, Claire}, Scheduling to minimize the average completion time of dedicated tasks, 454-464 [Zbl 1044.68940] \textit{Hallett, Michael T.; Lagergren, Jens}, Hunting for functionally analogous genes, 465-476 [Zbl 1044.68630] \textit{Adsul, Bharat; Mehta, Aranyak; Sohoni, Milind}, Keeping track of the latest gossip in shared memory systems, 477-488 [Zbl 1044.68510] \textit{Kshemkalyani, Ajay D.}, Concurrent knowledge and logical clock abstractions, 489-502 [Zbl 1044.68514] \textit{Glaßer, Christian; Schmitz, Heinz}, Decidable hierarchies of starfree languages, 503-515 [Zbl 1044.68091] \textit{Woinowski, Jens R.}, Prefix languages of Church-Rosser languages, 516-529 [Zbl 1044.68104]