FSTTCS 2004: Foundations of software technology and theoretical computer science. 24th international conference, Chennai, India, December 16--18, 2004. Proceedings. (Q1780839)

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1029.00064 ). Indexed articles: \textit{Alekseyev, Max A.; Pevzner, Pavel A.}, Genome halving problem revisited, 1-15 [Zbl 1117.92312] \textit{Esparza, Javier; Etessami, Kousha}, Verifying probabilistic procedural programs, 16-31 [Zbl 1117.68428] \textit{Indyk, Piotr}, Streaming algorithms for geometric problems, 32-34 [Zbl 1117.68545] \textit{Reynolds, John C.}, Toward a grainless semantics for shared-variable concurrency, 35-48 [Zbl 1117.68449] \textit{Thérien, Denis}, Regular languages, unambiguous concatenation and computational complexity, 49-57 [Zbl 1117.68413] \textit{Abdulla, Parosh; Mahata, Pritha; Mayr, Richard}, Decidability of Zenoness, syntactic boundedness and token-liveness for dense-timed Petri nets, 58-70 [Zbl 1117.68445] \textit{Adélaïde, Michaël; Pagetti, Claire}, On the urgency expressiveness, 71-83 [Zbl 1117.68390] \textit{Adsul, Bharat; Sohoni, Milind}, Asynchronous automata-theoretic characterization of aperiodic trace languages, 84-96 [Zbl 1117.68391] \textit{Berdine, Josh; Calcagno, Cristiano; O'Hearn, Peter W.}, A decidable fragment of separation logic, 97-109 [Zbl 1117.03337] \textit{de Berg, Mark; Streppel, Micha}, Approximate range searching using binary space partitions, 110-121 [Zbl 1117.68350] \textit{Beyersdorff, Olaf}, Representable disjoint NP-pairs, 122-134 [Zbl 1117.68376] \textit{Bouajjani, Ahmed; Meyer, Antoine}, Symbolic reachability analysis of higher-order context-free processes, 135-147 [Zbl 1117.68395] \textit{Bouyer, Patricia; Cassez, Franck; Fleury, Emmanuel; Larsen, Kim G.}, Optimal strategies in priced timed game automata, 148-160 [Zbl 1117.68396] \textit{Carbone, Marco; Nielsen, Mogens; Sassone, Vladimiro}, A calculus for trust management, 161-173 [Zbl 1117.68446] \textit{Chandru, Vijay; Hariharan, Ramesh; Krishnakumar, Narasimha M.}, Short-cuts on star, source and planar unfoldings, 174-185 [Zbl 1117.68521] \textit{Cheng, Ho-lun; Tan, Tony}, Subdividing alpha complex, 186-197 [Zbl 1117.68522] \textit{Dang, Zhe; Ibarra, Oscar H.; San Pietro, Pierluigi; Xie, Gaoyan}, Real-counter automata and their decision problems (extended abstract), 198-210 [Zbl 1117.68400] \textit{Dawar, Anuj; Gardner, Philippa; Ghelli, Giorgio}, Adjunct elimination through games in static ambient logic (extended abstract), 211-223 [Zbl 1117.03338] \textit{Dawar, Anuj; Janin, David}, On the bisimulation invariant fragment of monadic \(\Sigma_{1}\) in the finite, 224-236 [Zbl 1117.03339] \textit{Devanur, Nikhil R.; Lipton, Richard J.; Vishnoi, Nisheeth K.}, On the complexity of Hilbert's 17th problem, 237-249 [Zbl 1117.68038] \textit{Distefano, Dino; Katoen, Joost-Pieter; Rensink, Arend}, Who is pointing when to whom? On the automated verification of linked list structures, 250-262 [Zbl 1117.68427] \textit{Fürer, Martin; Kasiviswanathan, Shiva Prasad}, An almost linear time approximation algorithm for the permanent of a random (0-1) matrix, 263-274 [Zbl 1117.68547] \textit{Gastin, Paul; Lerman, Benjamin; Zeitoun, Marc}, Distributed games with causal memory are decidable for series-parallel systems, 275-286 [Zbl 1117.68448] \textit{Geeraerts, Gilles; Raskin, Jean-François; Van Begin, Laurent}, Expand, enlarge, and check: new algorithms for the coverability problem of WSTS, 287-298 [Zbl 1105.68353] \textit{Gudmundsson, Joachim; Levcopoulos, Christos}, Minimum weight pseudo-triangulations (extended abstract), 299-310 [Zbl 1117.68523] \textit{Gulwani, Sumit; Tiwari, Ashish; Necula, George C.}, Join algorithms for the theory of uninterpreted functions, 311-323 [Zbl 1117.03340] \textit{Har-Peled, Sariel}, No, coreset, no cry, 324-335 [Zbl 1117.68525] \textit{Hitchcock, John M.; Pavan, A.}, Hardness hypotheses, derandomization, and circuit complexity, 336-347 [Zbl 1117.68036] \textit{Jäger, Gerold; Srivastav, Anand}, Improved approximation algorithms for maximum graph partitioning problems (extended abstract), 348-359 [Zbl 1117.68549] \textit{Jain, Sanjay; Kinber, Efim}, Learning languages from positive data and a finite number of queries, 360-371 [Zbl 1117.68386] \textit{Kempe, Julia; Kitaev, Alexei; Regev, Oded}, The complexity of the local Hamiltonian problem, 372-383 [Zbl 1117.68378] \textit{Klauck, Hartmut}, Quantum and classical communication-space tradeoffs from rectangle bounds (extended abstract), 384-395 [Zbl 1117.68379] \textit{Kutten, Shay; Patt-Shamir, Boaz}, Adaptive stabilization of reactive protocols, 396-407 [Zbl 1117.68319] \textit{Löding, Christof; Madhusudan, P.; Serre, Olivier}, Visibly pushdown games, 408-420 [Zbl 1117.68409] \textit{Mijajlović, Ivana; Torp-Smith, Noah; O'Hearn, Peter}, Refinement and separation contexts, 421-433 [Zbl 1117.68433] \textit{Montanari, Angelo; Puppis, Gabriele}, Decidability of MSO theories of tree structures, 434-446 [Zbl 1117.03315] \textit{Parthasarathy, Srinivasan; Gandhi, Rajiv}, Distributed algorithms for coloring and domination in wireless ad hoc networks, 447-459 [Zbl 1117.68546] \textit{Ponnuswami, Ashok Kumar; Venkateswaran, H.}, Monotone multilinear Boolean circuits for bipartite perfect matching require exponential size, 460-468 [Zbl 1117.68381] \textit{Rademacher, Luis; Vempala, Santosh}, Testing geometric convexity, 469-480 [Zbl 1117.68530] \textit{Thakur, Mayur; Tripathi, Rahul}, Complexity of linear connectivity problems in directed hypergraphs, 481-493 [Zbl 1117.68383] \textit{Vardhan, Abhay; Sen, Koushik; Viswanathan, Mahesh; Agha, Gul}, Actively learning to verify safety for FIFO automata, 494-505 [Zbl 1117.68416] \textit{Venkatesh, G.}, Reasoning about game equilibria using temporal logic, 506-517 [Zbl 1117.03318] \textit{Verma, Kumar Neeraj}, Alternation in equational tree automata modulo XOR, 518-530 [Zbl 1117.68417]