default search action
41st ICALP 2014: Copenhagen, Denmark - Part II
- Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias:
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II. Lecture Notes in Computer Science 8573, Springer 2014, ISBN 978-3-662-43950-0
Track B: Logic, Semantics, Automata, and Theory of Programming
- Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira
, Rogério Reis
Symmetric Groups and Quotient Complexity of Boolean Operations. 1-12 - Michael Blondin
Handling Infinitely Branching WSTS. 13-25 - Mikolaj Bojanczyk:
Transducers with Origin Information. 26-37 - Mikolaj Bojanczyk:
Weak MSO+U with Path Quantifiers over Infinite Trees. 38-49 - Mikolaj Bojanczyk, Tomasz Gogacz, Henryk Michalewski, Michal Skrzypczak:
On the Decidability of MSO+U on Infinite Trees. 50-61 - Marcello M. Bonsangue
A Coalgebraic Foundation for Coinductive Union Types. 62-73 - Alex Borello, Julien Cervelle, Pascal Vanier
Turing Degrees of Limit Sets of Cellular Automata. 74-85 - Daniel Bundala, Joël Ouaknine
On the Complexity of Temporal-Logic Path Checking. 86-97 - Andrea Cerone
Parameterised Linearisability. 98-109 - Krishnendu Chatterjee, Laurent Doyen:
Games with a Weak Adversary. 110-121 - Krishnendu Chatterjee, Rasmus Ibsen-Jensen
The Complexity of Ergodic Mean-payoff Games. 122-133 - Namit Chaturvedi:
Toward a Structure Theory of Regular Infinitary Trace Languages. 134-145 - Dmitry Chistikov
Unary Pushdown Automata and Straight-Line Programs. 146-157 - Egor Derevenetc, Roland Meyer:
Robustness against Power is PSpace-complete. 158-170 - Manfred Droste, Vitaly Perevoshchikov:
A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic. 171-182 - Yuval Emek, Jochen Seidel, Roger Wattenhofer:
Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs. 183-195 - Sergey Goncharov
Coalgebraic Weak Bisimulation from Recursive Equations over Monads. 196-207 - Chris Heunen:
Piecewise Boolean Algebras and Their Domains. 208-219 - Radha Jagadeesan, James Riely
Between Linearizability and Quiescent Consistency - Quantitative Quiescent Consistency. 220-231 - Petr Jancar
Bisimulation Equivalence of First-Order Grammars. 232-243 - Artur Jez
Context Unification is in PSPACE. 244-255 - Jean Christoph Jung, Carsten Lutz
Monodic Fragments of Probabilistic First-Order Logic. 256-267 - Stefan Kiefer, Björn Wachter:
Stability and Complexity of Minimising Probabilistic Automata. 268-279 - Dexter Kozen, Konstantinos Mamouras:
Kleene Algebra with Equations. 280-292 - Tomasz Gogacz, Jerzy Marcinkowski:
All-Instances Termination of Chase is Undecidable. 293-304 - Damiano Mazza:
Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus. 305-317 - Joël Ouaknine
On the Positivity Problem for Simple Linear Recurrence Sequences, . 318-329 - Joël Ouaknine
Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences. 330-341 - Thomas Place, Marc Zeitoun
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words. 342-353 - Michael Wehar:
Hardness Results for Intersection Non-Emptiness. 354-362 - Qiang Yin
Branching Bisimilarity Checking for PRS. 363-374
Track C: Foundations of Networked Computing
- David Adjiashvili, Noy Rotbart:
Labeling Schemes for Bounded Degree Graphs. 375-386 - Rom Aschner, Matthew J. Katz:
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints. 387-398 - Chen Avin
Distributed Computing on Core-Periphery Networks: Axiom-Based Design. 399-410 - Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Fault-Tolerant Rendezvous in Networks. 411-422 - Jérémie Chalopin, Riko Jacob, Matús Mihalák, Peter Widmayer:
Data Delivery by Energy-Constrained Mobile Agents on a Line. 423-434 - Colin Cooper, Robert Elsässer, Tomasz Radzik
The Power of Two Choices in Distributed Voting. 435-446 - Johannes Dams, Martin Hoefer, Thomas Kesselheim:
Jamming-Resistant Learning in Wireless Networks. 447-458 - David Eisenstat, Claire Mathieu, Nicolas Schabanel:
Facility Location in Evolving Metrics. 459-470 - Yuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer:
Solving the ANTS Problem with Asynchronous Finite State Machines. 471-482 - Mohsen Ghaffari:
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set. 483-494 - George Giakkoupis, Thomas Sauerwald, Alexandre Stauffer
Randomized Rumor Spreading in Dynamic Graphs. 495-507 - Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking:
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. 508-519 - Erez Kantor, Shay Kutten:
Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems. 520-531 - Tsvi Kopelowitz, Robert Krauthgamer
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. 532-543 - Adrian Kosowski, Dominik Pajak
Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router. 544-555 - Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. 556-567 - Afshin Nikzad, R. Ravi:
Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems. 568-607 - Merav Parter:
Bypassing Erdős' Girth Conjecture: Hybrid Stretch and Sourcewise Spanners. 608-619
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: