Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6--10, 2010. Proceedings, Part II (Q983531)

The articles of this volume will be reviewed individually. The preceding colloquium has been reviewed (see Zbl 1166.68001 and Zbl 1166.68002). For the first part of the proceedings of the present colloquium see Zbl 1194.68005. Indexed articles: \textit{Goubault-Larrecq, Jean}, Noetherian spaces in verification, 2-21 [Zbl 1288.68165] \textit{Ouaknine, Joël; Worrell, James}, Towards a theory of time-bounded verification, 22-37 [Zbl 1288.68170] \textit{Genest, Blaise; Gimbert, Hugo; Muscholl, Anca; Walukiewicz, Igor}, Optimal Zielonka-type construction of deterministic asynchronous automata, 52-63 [Zbl 1288.68154] \textit{Chambart, Pierre; Schnoebelen, Philippe}, Pumping and counting on the regular Post embedding problem, 64-75 [Zbl 1288.68151] \textit{Boker, Udi; Kupferman, Orna; Rosenberg, Adin}, Alternation removal in Büchi automata, 76-87 [Zbl 1288.68148] \textit{Braud, Laurent; Carayol, Arnaud}, Linear orders in the pushdown hierarchy, 88-99 [Zbl 1288.68150] \textit{Blasiak, Anna; Kleinberg, Robert}, The serializability of network codes, 100-114 [Zbl 1288.68009] \textit{Alistarh, Dan; Gilbert, Seth; Guerraoui, Rachid; Zadimoghaddam, Morteza}, How efficient can gossip be? (On the cost of resilient information exchange), 115-126 [Zbl 1288.68007] \textit{Berenbrink, Petra; Czyzowicz, Jurek; Elsässer, Robert; Gąsieniec, Leszek}, Efficient information exchange in the random phone-call model, 127-138 [Zbl 1288.68008] \textit{Even, Guy; Medina, Moti}, An \(O(\log n)\)-competitive online centralized randomized packet-routing algorithm for lines, 139-150 [Zbl 1288.68012] \textit{Gehrke, Mai; Grigorieff, Serge; Pin, Jean-Éric}, A topological approach to recognition, 151-162 [Zbl 1288.68176] \textit{Blum, Norbert}, On \(\mathrm{LR}(k)\)-parsers of polynomial size (extended abstract), 163-174 [Zbl 1288.68143] \textit{Zetzsche, Georg}, On erasing productions in random context grammars, 175-186 [Zbl 1288.68145] \textit{Laird, James}, Game semantics for call-by-value polymorphism, 187-198 [Zbl 1288.68038] \textit{Hofmann, Martin; Karbyshev, Aleksandr; Seidl, Helmut}, What is a pure functional?, 199-210 [Zbl 1288.68037] \textit{Giacobazzi, Roberto; Ranzato, Francesco}, Example-guided abstraction simplification, 211-222 [Zbl 1288.68041] \textit{McIver, Annabelle; Meinicke, Larissa; Morgan, Carroll}, Compositional closure for Bayes risk in probabilistic noninterference, 223-235 [Zbl 1288.68024] \textit{Bunn, Paul; Ostrovsky, Rafail}, Asynchronous throughput-optimal routing in malicious networks, 236-248 [Zbl 1288.68010] \textit{Chandran, Nishanth; Garay, Juan; Ostrovsky, Rafail}, Improved fault tolerance and secure computation on sparse networks, 249-260 [Zbl 1288.68019] \textit{Chechik, Shiri; Emek, Yuval; Patt-Shamir, Boaz; Peleg, David}, Sparse reliable graph backbones, 261-272 [Zbl 1288.68030] \textit{Bansal, Nikhil; Jain, Kamal; Kazeykina, Anna; Naor, Joseph (Seffi)}, Approximation algorithms for diversified search ranking, 273-284 [Zbl 1288.68016] \textit{Duncan, Ross; Perdrix, Simon}, Rewriting measurement-based quantum computations with generalised flow, 285-296 [Zbl 1288.68069] \textit{Coecke, Bob; Kissinger, Aleks}, The compositional structure of multipartite quantum entanglement, 297-308 [Zbl 1288.81025] \textit{Rensink, Arend}, Compositionality in graph transformation, 309-320 [Zbl 1288.68144] \textit{Chen, Yijia; Flum, Jörg}, On \(p\)-optimal proof systems and logics for PTIME, 321-332 [Zbl 1288.03031] \textit{Mertzios, George B.; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel}, Placing regenerators in optical networks to satisfy multiple sets of requests, 333-344 [Zbl 1288.68014] \textit{Montanari, Angelo; Puppis, Gabriele; Sala, Pietro}, Maximal decidable fragments of Halpern and Shoham's modal logic of intervals, 345-356 [Zbl 1288.03017] \textit{Marcinkowski, Jerzy; Michaliszyn, Jakub; Kieroński, Emanuel}, B and D are enough to make the Halpern-Shoham logic undecidable, 357-368 [Zbl 1288.03016] \textit{Achilleos, Antonis; Lampis, Michael; Mitsou, Valia}, Parameterized modal satisfiability, 369-380 [Zbl 1288.03014] \textit{Fontaine, Gaëlle; Leal, Raul; Venema, Yde}, Automata for coalgebras: an approach using predicate liftings, 381-392 [Zbl 1288.68175] \textit{Blocki, Jeremiah; Williams, Ryan}, Resolving the complexity of some data privacy problems, 393-404 [Zbl 1288.68058] \textit{Hubert Chan, T.-H.; Shi, Elaine; Song, Dawn}, Private and continual release of statistics, 405-417 [Zbl 1288.68018] \textit{Chen, Ning; Deng, Xiaotie}, Envy-free pricing in multi-item markets, 418-429 [Zbl 1288.91091] \textit{Christodoulou, George; Ligett, Katrina; Pyrga, Evangelia}, Contention resolution under selfishness, 430-441 [Zbl 1288.68011] \textit{Lanese, Ivan; Pérez, Jorge A.; Sangiorgi, Davide; Schmitt, Alan}, On the expressiveness of polyadic and synchronous communication in higher-order process calculi, 442-453 [Zbl 1288.68183] \textit{Hirschkoff, Daniel; Pous, Damien}, On bisimilarity and substitution in presence of replication, 454-465 [Zbl 1288.68182] \textit{Habermehl, Peter; Meyer, Roland; Wimmel, Harro}, The downward-closure of Petri net languages, 466-477 [Zbl 1288.68181] \textit{Brázdil, Tomáš; Jančar, Petr; Kučera, Antonín}, Reachability games on extended vector addition systems with states, 478-489 [Zbl 1288.68179] \textit{Collins, Andrew; Czyzowicz, Jurek; Gąsieniec, Leszek; Labourel, Arnaud}, Tell me where I am so I can meet you sooner (asynchronous rendezvous with location information), 502-514 [Zbl 1288.68214] \textit{Chalopin, Jérémie; Das, Shantanu}, Rendezvous of mobile agents without agreement on local orientation, 515-526 [Zbl 1288.68213] \textit{Gimbert, Hugo; Oualhadj, Youssouf}, Probabilistic automata on finite words: decidable and undecidable problems, 527-538 [Zbl 1288.68156] \textit{Brázdil, Tomáš; Esparza, Javier; Kiefer, Stefan; Luttenberger, Michael}, Space-efficient scheduling of stochastically generated tasks, 539-550 [Zbl 1288.68032] \textit{Fearnley, John}, Exponential lower bounds for policy iteration, 551-562 [Zbl 1288.68089] \textit{Colcombet, Thomas; Kuperberg, Denis; Lombardy, Sylvain}, Regular temporal cost functions, 563-574 [Zbl 1288.68153] \textit{Göller, Stefan; Haase, Christoph; Ouaknine, Joël; Worrell, James}, Model checking succinct and parametric one-counter automata, 575-586 [Zbl 1288.68164] \textit{Bollig, Benedikt; Gastin, Paul; Monmege, Benjamin; Zeitoun, Marc}, Pebble weighted automata and transitive closure logics, 587-598 [Zbl 1288.68149] \textit{Chatterjee, Krishnendu; Doyen, Laurent}, Energy parity games, 599-610 [Zbl 1288.68160]