×

zbMATH — the first resource for mathematics

Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part II. (English) Zbl 1316.68013
Lecture Notes in Computer Science 9135. Berlin: Springer (ISBN 978-3-662-47665-9/pbk; 978-3-662-47666-6/ebook). xxxix, 717 p. (2015).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding colloquium see [Zbl 1291.68018; Zbl 1291.68019]. For Part I of the present colloquium see [Zbl 1316.68014].
Indexed articles:
Kawarabayashi, Ken-Ichi; Kreutzer, Stephan, Towards the graph minor theorems for directed graphs, 3-10 [Zbl 1448.05189]
Muscholl, Anca, Automated synthesis of distributed controllers, 11-27 [Zbl 1440.68178]
Abramsky, Samson; Jagadeesan, Radha; Vákár, Matthijs, Games for dependent types, 31-43 [Zbl 1395.68177]
Aisenberg, James; Bonet, Maria Luisa; Buss, Sam; Crãciun, Adrian; Istrate, Gabriel, Short proofs of the Kneser-Lovász coloring principle, 44-55 [Zbl 1443.03041]
Amarilli, Antoine; Bourhis, Pierre; Senellart, Pierre, Provenance circuits for trees and treelike instances, 56-68 [Zbl 1440.68053]
Beneš, Nikola; Bezděk, Peter; Larsen, Kim G.; Srba, Jiří, Language emptiness of continuous-time parametric timed automata, 69-81 [Zbl 1440.68150]
Boreale, Michele, Analysis of probabilistic systems via generating functions and Padé approximation, 82-94 [Zbl 1440.60071]
Bouajjani, Ahmed; Emmi, Michael; Enea, Constantin; Hamza, Jad, On reducing linearizability to state reachability, 95-107 [Zbl 1395.68089]
Chatterjee, Krishnendu; Doyen, Laurent; Vardi, Moshe Y., The complexity of synthesis from probabilistic components, 108-120 [Zbl 1440.68045]
Chatterjee, Krishnendu; Henzinger, Thomas A.; Ibsen-Jensen, Rasmus; Otop, Jan, Edit distance for pushdown automata, 121-133 [Zbl 1440.68151]
Ciobanu, Laura; Diekert, Volker; Elder, Murray, Solution sets for equations over free groups are EDT0L languages, 134-145 [Zbl 1412.68124]
Colcombet, Thomas; Sreejith, A. V., Limited set quantifiers over countable linear orderings, 146-158 [Zbl 1443.03006]
Datta, Samir; Kulkarni, Raghav; Mukherjee, Anish; Schwentick, Thomas; Zeume, Thomas, Reachability is in DynFO, 159-170 [Zbl 1440.68107]
Dubut, Jérémy; Goubault, Éric; Goubault-Larrecq, Jean, Natural homology, 171-183 [Zbl 1448.55010]
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis, Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes, 184-196 [Zbl 1394.60084]
Fijalkow, Nathanaël; Horn, Florian; Kuperberg, Denis; Skrzypczak, Michał, Trading bounds for memory in games with counters, 197-208 [Zbl 1441.91002]
Filiot, Emmanuel; Maneth, Sebastian; Reynier, Pierre-Alain; Talbot, Jean-Marc, Decision problems of tree transducers with origin, 209-221 [Zbl 1395.68167]
Finkel, Olivier, Incompleteness theorems, large cardinals, and automata over infinite words, 222-233 [Zbl 1440.03056]
Haase, Christoph; Kiefer, Stefan, The odds of staying on budget, 234-246 [Zbl 1440.68119]
Jagadeesan, Radha; Riely, James, From sequential specifications to eventual consistency, 247-259 [Zbl 1440.68020]
Jurdziński, Marcin; Lazić, Ranko; Schmitz, Sylvain, Fixed-dimensional energy games are in pseudo-polynomial time, 260-272 [Zbl 1440.68122]
Kari, Jarkko; Szabados, Michal, An algebraic geometric approach to Nivat’s conjecture, 273-285 [Zbl 1434.68265]
Kozen, Dexter; Mamouras, Konstantinos; Petrişan, Daniela; Silva, Alexandra, Nominal Kleene coalgebra, 286-298 [Zbl 1440.68174]
Kuperberg, Denis; Skrzypczak, Michał, On determinisation of good-for-games automata, 299-310 [Zbl 1440.68158]
Lahav, Ori; Vafeiadis, Viktor, Owicki-Gries reasoning for weak memory models, 311-323 [Zbl 1440.68046]
Leroux, Jérôme; Sutre, Grégoire; Totzke, Patrick, On the coverability problem for pushdown vector addition systems in one dimension, 324-336 [Zbl 1440.68177]
Lohrey, Markus; Maneth, Sebastian; Peternek, Fabian, Compressed tree canonization, 337-349 [Zbl 1440.68148]
Mazza, Damiano; Terui, Kazushige, Parsimonious types and non-uniform computation, 350-361 [Zbl 1440.03041]
Michalewski, Henryk; Mio, Matteo, Baire category quantifier in monadic second order logic, 362-374 [Zbl 1443.03007]
Aminof, Benjamin; Rubin, Sasha; Zuleger, Florian; Spegni, Francesco, Liveness of parameterized timed networks, 375-387 [Zbl 1440.68170]
Schewe, Sven; Trivedi, Ashutosh; Varghese, Thomas, Symmetric strategy improvement, 388-400 [Zbl 1440.91005]
Staton, Sam; Uijlen, Sander, Effect algebras, presheaves, non-locality and contextuality, 401-413 [Zbl 1396.81012]
Swernofsky, Joseph; Wehar, Michael, On the complexity of intersecting regular, context-free, and tree languages, 414-426 [Zbl 1440.68163]
Bojańczyk, Mikołaj; Murlak, Filip; Witkowski, Adam, Containment of monadic Datalog programs via bounded clique-width, 427-439 [Zbl 1440.68054]
Zetzsche, Georg, An approach to computing downward closures, 440-451 [Zbl 1440.68166]
Klein, Felix; Zimmermann, Martin, How much lookahead is needed to win infinite games?, 452-463 [Zbl 1440.68125]
Achlioptas, Dimitris; Siminelakis, Paris, Symmetric graph properties have independent edges, 467-478 [Zbl 1395.05148]
Alistarh, Dan; Gelashvili, Rati, Polylogarithmic-time leader election in population protocols, 479-491 [Zbl 1434.68042]
Avin, Chen; Lotker, Zvi; Nahum, Yinon; Peleg, David, Core size and densification in preferential attachment networks, 492-503 [Zbl 1440.90004]
Bhattacharya, Sayan; Hoefer, Martin; Huang, Chien-Chung; Kavitha, Telikepalli; Wagner, Lisa, Maintaining near-popular matchings, 504-515 [Zbl 1440.68181]
Bringmann, Karl; Friedrich, Tobias; Hoefer, Martin; Rothenberger, Ralf; Sauerwald, Thomas, Ultra-fast load balancing on scale-free networks, 516-527 [Zbl 1440.68019]
Charron-Bost, Bernadette; Függer, Matthias; Nowak, Thomas, Approximate consensus in highly dynamic networks: the role of averaging algorithms, 528-539 [Zbl 1417.68012]
Chattopadhyay, Arkadev; Rudra, Atri, The range of topological effects on communication, 540-551 [Zbl 1440.68011]
Chen, Ning; Hoefer, Martin; Künnemann, Marvin; Lin, Chengyu; Miao, Peihan, Secretary markets with local information, 552-563 [Zbl 1447.91082]
Dahlgaard, Søren; Knudsen, Mathias Bæk Tejs; Rotbart, Noy, A simple and optimal ancestry labeling scheme for trees, 564-574 [Zbl 1440.68048]
Dani, Varsha; Movahedi, Mahnush; Saia, Jared; Young, Maxwell, Interactive communication with unknown noise rate, 575-587 [Zbl 1403.94051]
Feldmann, Andreas Emil, Fixed parameter approximations for \(k\)-center problems in low highway dimension graphs, 588-600 [Zbl 1404.68209]
Feldman, Michal; Friedler, Ophir, A unified framework for strong price of anarchy in clustering games, 601-613 [Zbl 1404.68078]
Friedrich, Tobias; Krohmer, Anton, On the diameter of hyperbolic random graphs, 614-625 [Zbl 1403.05135]
Gairing, Martin; Kollias, Konstantinos; Kotsialou, Grammateia, Tight bounds for cost-sharing in weighted congestion games, 626-637 [Zbl 1447.91013]
Ghaffari, Mohsen, Distributed broadcast revisited: towards universal optimality, 638-649 [Zbl 1440.68013]
Giannakopoulos, Yiannis; Koutsoupias, Elias, Selling two goods optimally, 650-662 [Zbl 1396.91246]
Goldwasser, Shafi; Kalai, Yael Tauman; Park, Sunoo, Adaptively secure coin-flipping, revisited, 663-674 [Zbl 1447.94061]
Kantor, Erez; Kutten, Shay, Optimal competitiveness for the rectilinear Steiner arborescence problem, 675-687 [Zbl 1440.68339]
Karbasi, Amin; Lengler, Johannes; Steger, Angelika, Normalization phenomena in asynchronous networks, 688-700 [Zbl 1440.68014]
Raykov, Pavel, Broadcast from minicast secure against general adversaries, 701-712 [Zbl 1440.68021]

MSC:
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Nxx Theory of software
68Qxx Theory of computing
00B25 Proceedings of conferences of miscellaneous specific interest
PDF BibTeX XML Cite
Full Text: DOI