Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar42. ICALP 2015: Kyoto, Japan - Part II
Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann:
Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II. Lecture Notes in Computer Science 9135, Springer 2015, ISBN 978-3-662-47665-9
Invited Talks
- Ken-ichi Kawarabayashi, Stephan Kreutzer:
Towards the Graph Minor Theorems for Directed Graphs. 3-10
Track B: Logic, Semantics, Automata and Theory of Programming
- James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate:
Short Proofs of the Kneser-Lovász Coloring Principle. 44-55 - Antoine Amarilli, Pierre Bourhis, Pierre Senellart:
Provenance Circuits for Trees and Treelike Instances. 56-68 - Nikola Benes, Peter Bezdek, Kim Guldstrand Larsen, Jirí Srba:
Language Emptiness of Continuous-Time Parametric Timed Automata. 69-81 - Michele Boreale:
Analysis of Probabilistic Systems via Generating Functions and Padé Approximation. 82-94 - Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
On Reducing Linearizability to State Reachability. 95-107 - Krishnendu Chatterjee, Laurent Doyen, Moshe Y. Vardi:
The Complexity of Synthesis from Probabilistic Components. 108-120 - Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop:
Edit Distance for Pushdown Automata. 121-133 - Laura Ciobanu, Volker Diekert, Murray Elder:
Solution Sets for Equations over Free Groups are EDT0L Languages. 134-145 - Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability is in DynFO. 159-170 - Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes. 184-196 - Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak:
Trading Bounds for Memory in Games with Counters. 197-208 - Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot:
Decision Problems of Tree Transducers with Origin. 209-221 - Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz:
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. 260-272 - Dexter Kozen, Konstantinos Mamouras, Daniela Petrisan, Alexandra Silva:
Nominal Kleene Coalgebra. 286-298 - Jérôme Leroux, Grégoire Sutre, Patrick Totzke:
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. 324-336 - Benjamin Aminof, Sasha Rubin, Florian Zuleger, Francesco Spegni:
Liveness of Parameterized Timed Networks. 375-387 - Joseph Swernofsky, Michael Wehar:
On the Complexity of Intersecting Regular, Context-Free, and Tree Languages. 414-426 - Mikolaj Bojanczyk, Filip Murlak, Adam Witkowski:
Containment of Monadic Datalog Programs via Bounded Clique-Width. 427-439
Track C: Foundations of Networked Computation: Models, Algorithms and Information Management
- Dan Alistarh, Rati Gelashvili:
Polylogarithmic-Time Leader Election in Population Protocols. 479-491 - Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg:
Core Size and Densification in Preferential Attachment Networks. 492-503 - Sayan Bhattacharya, Martin Hoefer, Chien-Chung Huang, Telikepalli Kavitha, Lisa Wagner:
Maintaining Near-Popular Matchings. 504-515 - Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald:
Ultra-Fast Load Balancing on Scale-Free Networks. 516-527 - Bernadette Charron-Bost, Matthias Függer, Thomas Nowak:
Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms. 528-539 - Ning Chen, Martin Hoefer, Marvin Künnemann, Chengyu Lin, Peihan Miao:
Secretary Markets with Local Information. 552-563 - Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
A Simple and Optimal Ancestry Labeling Scheme for Trees. 564-574 - Varsha Dani, Mahnush Movahedi, Jared Saia, Maxwell Young:
Interactive Communication with Unknown Noise Rate. 575-587 - Andreas Emil Feldmann:
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. 588-600 - Michal Feldman, Ophir Friedler:
A Unified Framework for Strong Price of Anarchy in Clustering Games. 601-613 - Martin Gairing, Konstantinos Kollias, Grammateia Kotsialou:
Tight Bounds for Cost-Sharing in Weighted Congestion Games. 626-637 - Shafi Goldwasser, Yael Tauman Kalai, Sunoo Park:
Adaptively Secure Coin-Flipping, Revisited. 663-674 - Erez Kantor, Shay Kutten:
Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem. 675-687 - Amin Karbasi, Johannes Lengler, Angelika Steger:
Normalization Phenomena in Asynchronous Networks. 688-700
maintained by 
at 
at 
last updated on 2018-08-17 20:37 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint