Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
Proceedings of the 41st International Colloquium on Automata, Languages, and Programming, Part II
ICALP (2), 2014.

@proceedings{ICALP-v2-2014,
	address       = "Copenhagen, Denmark",
	doi           = "10.1007/978-3-662-43951-7",
	editor        = "Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias",
	isbn          = "978-3-662-43950-0",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 41st International Colloquium on Automata, Languages, and Programming, Part II}",
	volume        = 8573,
	year          = 2014,
}

Contents (49 items)

5 ×#network
4 ×#algebra
4 ×#automaton
4 ×#complexity
4 ×#problem
3 ×#bound
3 ×#decidability
3 ×#distributed
3 ×#first-order
3 ×#graph

ICALP-v2-2014-BellBMR #complexity #symmetry

Symmetric Groups and Quotient Complexity of Boolean Operations (JB, JAB, NM, RR), pp. 1–12.

ICALP-v2-2014-BlondinFM #branch #infinity

Handling Infinitely Branching WSTS (MB, AF, PM), pp. 13–25.

ICALP-v2-2014-Bojanczyk #transducer

Transducers with Origin Information (MB), pp. 26–37.

ICALP-v2-2014-Bojanczyk14a #infinity #quantifier

Weak MSO+U with Path Quantifiers over Infinite Trees (MB), pp. 38–49.

ICALP-v2-2014-BojanczykGMS #decidability #infinity #on the

On the Decidability of MSO+U on Infinite Trees (MB, TG, HM, MS), pp. 50–61.

ICALP-v2-2014-BonsangueRABR #algebra #induction

A Coalgebraic Foundation for Coinductive Union Types (MMB, JR, DA, FSdB, JJMMR), pp. 62–73.

ICALP-v2-2014-BorelloCV #automaton #set

Turing Degrees of Limit Sets of Cellular Automata (AB, JC, PV), pp. 74–85.

ICALP-v2-2014-BundalaO #complexity #on the

On the Complexity of Temporal-Logic Path Checking (DB, JO), pp. 86–97.

ICALP-v2-2014-CeroneGY

Parameterised Linearisability (AC, AG, HY), pp. 98–109.

ICALP-v2-2014-Chatterjee0 #game studies

Games with a Weak Adversary (KC, LD), pp. 110–121.

ICALP-v2-2014-ChatterjeeI #complexity #game studies

The Complexity of Ergodic Mean-payoff Games (KC, RIJ), pp. 122–133.

ICALP-v2-2014-Chaturvedi #towards

Toward a Structure Theory of Regular Infinitary Trace Languages (NC), pp. 134–145.

ICALP-v2-2014-ChistikovM #automaton #source code

Unary Pushdown Automata and Straight-Line Programs (DVC, RM), pp. 146–157.

ICALP-v2-2014-DerevenetcM #robust

Robustness against Power is PSpace-complete (ED, RM), pp. 158–170.

ICALP-v2-2014-DrosteP #automaton #distance #logic #theorem

A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic (MD, VP), pp. 171–182.

ICALP-v2-2014-EmekSW #network

Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs (YE, JS, RW), pp. 183–195.

ICALP-v2-2014-GoncharovP #algebra #bisimulation #equation #monad #recursion

Coalgebraic Weak Bisimulation from Recursive Equations over Monads (SG, DP), pp. 196–207.

ICALP-v2-2014-Heunen #algebra

Piecewise Boolean Algebras and Their Domains (CH), pp. 208–219.

ICALP-v2-2014-JagadeesanR #consistency

Between Linearizability and Quiescent Consistency — Quantitative Quiescent Consistency (RJ, JR), pp. 220–231.

ICALP-v2-2014-Jancar #bisimulation #equivalence #first-order

Bisimulation Equivalence of First-Order Grammars (PJ), pp. 232–243.

ICALP-v2-2014-Jez #unification

Context Unification is in PSPACE (AJ), pp. 244–255.

ICALP-v2-2014-JungLGS #first-order #logic #probability

Monodic Fragments of Probabilistic First-Order Logic (JCJ, CL, SG, LS), pp. 256–267.

ICALP-v2-2014-KieferW #automaton #complexity #probability

Stability and Complexity of Minimising Probabilistic Automata (SK, BW), pp. 268–279.

ICALP-v2-2014-KozenM #algebra #equation

Kleene Algebra with Equations (DK, KM), pp. 280–292.

ICALP-v2-2014-GogaczM #decidability #termination

All-Instances Termination of Chase is Undecidable (TG, JM), pp. 293–304.

ICALP-v2-2014-Mazza #λ-calculus

Non-uniform Polytime Computation in the Infinitary Affine λ-Calculus (DM), pp. 305–317.

ICALP-v2-2014-OuaknineW #linear #on the #problem #sequence

On the Positivity Problem for Simple Linear Recurrence Sequences, (JO, JW), pp. 318–329.

ICALP-v2-2014-OuaknineW14a #decidability #linear #sequence

Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences (JO, JW), pp. 330–341.

ICALP-v2-2014-PlaceZ #first-order #quantifier #word

Going Higher in the First-Order Quantifier Alternation Hierarchy on Words (TP, MZ), pp. 342–353.

ICALP-v2-2014-Wehar

Hardness Results for Intersection Non-Emptiness (MW), pp. 354–362.

ICALP-v2-2014-YinFHHT #branch #similarity

Branching Bisimilarity Checking for PRS (QY, YF, CH, MH, XT), pp. 363–374.

ICALP-v2-2014-AdjiashviliR #bound #graph

Labeling Schemes for Bounded Degree Graphs (DA, NR), pp. 375–386.

ICALP-v2-2014-AschnerK #bound #constraints #modelling #network

Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints (RA, MJK), pp. 387–398.

ICALP-v2-2014-AvinBLP #axiom #design #distributed #network

Distributed Computing on Core-Periphery Networks: Axiom-Based Design (CA, MB, ZL, DP), pp. 399–410.

ICALP-v2-2014-ChalopinDLP #fault tolerance #network

Fault-Tolerant Rendezvous in Networks (JC, YD, AL, AP), pp. 411–422.

ICALP-v2-2014-ChalopinJMW #delivery #energy #mobile

Data Delivery by Energy-Constrained Mobile Agents on a Line (JC, RJ, MM, PW), pp. 423–434.

ICALP-v2-2014-CooperER #distributed #power of

The Power of Two Choices in Distributed Voting (CC, RE, TR), pp. 435–446.

ICALP-v2-2014-DamsHK #learning #network

Jamming-Resistant Learning in Wireless Networks (JD, MH, TK), pp. 447–458.

ICALP-v2-2014-EisenstatMS #evolution #metric

Facility Location in Evolving Metrics (DE, CM, NS), pp. 459–470.

ICALP-v2-2014-EmekLUW #finite #problem #state machine

Solving the ANTS Problem with Asynchronous Finite State Machines (YE, TL, JU, RW), pp. 471–482.

ICALP-v2-2014-Ghaffari #approximate #distributed #set

Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set (MG), pp. 483–494.

ICALP-v2-2014-GiakkoupisSS #graph #random

Randomized Rumor Spreading in Dynamic Graphs (GG, TS, AS), pp. 495–507.

ICALP-v2-2014-0002HKSV #independence #online #set #worst-case

Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods (OG, MH, TK, TS, BV), pp. 508–519.

ICALP-v2-2014-KantorK #problem #symmetry

Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems (EK, SK), pp. 520–531.

ICALP-v2-2014-KopelowitzKPS #bound #graph #worst-case

Orienting Fully Dynamic Graphs with Worst-Case Time Bounds (TK, RK, EP, SS), pp. 532–543.

ICALP-v2-2014-KosowskiP #case study #difference

Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router (AK, DP), pp. 544–555.

ICALP-v2-2014-OhrimenkoGTU #in the cloud

The Melbourne Shuffle: Improving Oblivious Storage in the Cloud (OO, MTG, RT, EU), pp. 556–567.

ICALP-v2-2014-NikzadR #algorithm #approximate #multi #problem

Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems (AN, RR), pp. 568–607.

ICALP-v2-2014-Parter #hybrid

Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (MP), pp. 608–619.