Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg
Proceedings of the 40th International Colloquium on Automata, Languages, and Programming, Part II
ICALP (2), 2013.

@proceedings{ICALP-v2-2013,
	address       = "Riga, Latvia",
	doi           = "10.1007/978-3-642-39212-2",
	editor        = "Fedor V. Fomin and Rusins Freivalds and Marta Z. Kwiatkowska and David Peleg",
	isbn          = "978-3-642-39211-5",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 40th International Colloquium on Automata, Languages, and Programming, Part II}",
	volume        = 7966,
	year          = 2013,
}

Contents (59 items)

8 ×#automaton
6 ×#complexity
6 ×#graph
6 ×#performance
5 ×#network
4 ×#logic
3 ×#algorithm
3 ×#game studies
3 ×#probability
3 ×#problem

ICALP-v2-2013-Kleinberg #algorithm #network #social

Algorithms, Networks, and Social Phenomena (JMK), pp. 1–3.

ICALP-v2-2013-Albers #problem #scheduling

Recent Advances for a Classical Scheduling Problem (SA), pp. 4–14.

ICALP-v2-2013-AlmagorBK #formal method #quality #reasoning

Formalizing and Reasoning about Quality (SA, UB, OK), pp. 15–27.

ICALP-v2-2013-Marx #graph

The Square Root Phenomenon in Planar Graphs (DM), p. 28.

ICALP-v2-2013-SpirakisNR #graph #random

A Guided Tour in Random Intersection Graphs (PGS, SEN, CR), pp. 29–35.

ICALP-v2-2013-Widmayer #nondeterminism

To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous (PW), p. 36.

ICALP-v2-2013-AlurR #problem

Decision Problems for Additive Regular Functions (RA, MR), pp. 37–48.

ICALP-v2-2013-BartheO #composition #difference #logic #privacy #probability #relational #source code #theorem

Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs (GB, FO), pp. 49–60.

ICALP-v2-2013-Basset #automaton #probability #process

A Maximal Entropy Stochastic Process for a Timed Automaton, (NB), pp. 61–73.

ICALP-v2-2013-BenaimBCKLMW #complexity #finite #logic

Complexity of Two-Variable Logic on Finite Trees (SB, MB, WC, EK, RL, FM, JW), pp. 74–88.

ICALP-v2-2013-BokerKKS #nondeterminism

Nondeterminism in the Presence of a Diverse or Unknown Future (UB, DK, OK, MS), pp. 89–100.

ICALP-v2-2013-CarreiroGS #algebra #logic

Coalgebraic Announcement Logics (FC, DG, LS), pp. 101–112.

ICALP-v2-2013-CharlierKPZ #self #word

Self-shuffling Words (EC, TK, SP, LQZ), pp. 113–124.

ICALP-v2-2013-ChenM #quantifier #query

Block-Sorted Quantified Conjunctive Queries (HC, DM), pp. 125–136.

ICALP-v2-2013-ChretienCD #automaton #protocol #security

From Security Protocols to Pushdown Automata (RC, VC, SD), pp. 137–149.

ICALP-v2-2013-CzerwinskiMM #performance #regular expression #sequence

Efficient Separability of Regular Languages by Subsequences and Suffixes (WC, WM, TM), pp. 150–161.

ICALP-v2-2013-DemriDS #complexity #on the #verification

On the Complexity of Verifying Regular Properties on Flat Counter Systems, (SD, AKD, AS), pp. 162–173.

ICALP-v2-2013-DenielouY #automaton #communication #multi #synthesis

Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types (PMD, NY), pp. 174–186.

ICALP-v2-2013-CosmoMZZ #component #configuration management

Component Reconfiguration in the Presence of Conflicts (RDC, JM, SZ, GZ), pp. 187–198.

ICALP-v2-2013-EtessamiSY #context-free grammar #probability #regular expression

Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method (KE, AS, MY), pp. 199–211.

ICALP-v2-2013-FearnleyJ #automaton #reachability

Reachability in Two-Clock Timed Automata Is PSPACE-Complete (JF, MJ), pp. 212–223.

ICALP-v2-2013-FriedmannKL #automaton

Ramsey Goes Visibly Pushdown (OF, FK, ML), pp. 224–237.

ICALP-v2-2013-Fu #similarity

Checking Equality and Regularity for Normed BPA with Silent Moves (YF), pp. 238–249.

ICALP-v2-2013-GanianHKOST #graph #model checking

FO Model Checking of Interval Graphs (RG, PH, DK, JO, JS, JT), pp. 250–262.

ICALP-v2-2013-Gelderie #composition #game studies

Strategy Composition in Compositional Games (MG), pp. 263–274.

ICALP-v2-2013-GenestGMW #architecture #game studies

Asynchronous Games over Tree Architectures (BG, HG, AM, IW), pp. 275–286.

ICALP-v2-2013-GottlobPT #query #transitive

Querying the Guarded Fragment with Transitivity (GG, AP, LT), pp. 287–298.

ICALP-v2-2013-ImNP #data type #parametricity #recursion

Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types (HI, KN, SP), pp. 299–311.

ICALP-v2-2013-Janin #algebra #automaton #logic

Algebras, Automata and Logic for Languages of Labeled Birooted Trees (DJ), pp. 312–323.

ICALP-v2-2013-Jez #equation #linear #word

One-Variable Word Equations in Linear Time (AJ), pp. 324–335.

ICALP-v2-2013-KobeleS #revisited

The IO and OI Hierarchies Revisited (GMK, SS), pp. 336–348.

ICALP-v2-2013-LeivantM #complexity #evolution

Evolving Graph-Structures and Their Implicit Computational Complexity (DL, JYM), pp. 349–360.

ICALP-v2-2013-LohreySZ #set

Rational Subsets and Submonoids of Wreath Products (ML, BS, GZ), pp. 361–372.

ICALP-v2-2013-Padovani #type system

Fair Subtyping for Open Session Types (LP), pp. 373–384.

ICALP-v2-2013-PetricekOM #named #static analysis

Coeffects: Unified Static Analysis of Context-Dependence (TP, DAO, AM), pp. 385–397.

ICALP-v2-2013-Stirling #proving #λ-calculus

Proof Systems for Retracts in Simply Typed λ Calculus (CS), pp. 398–409.

ICALP-v2-2013-Woods #generative

Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (KW), pp. 410–421.

ICALP-v2-2013-Worrell #automaton #equivalence #finite #multi #problem

Revisiting the Equivalence Problem for Finite Multitape Automata (JW), pp. 422–433.

ICALP-v2-2013-Zetzsche #automaton

Silent Transitions in Automata with Storage (GZ), pp. 434–445.

ICALP-v2-2013-AlbersP #algorithm #online #scheduling #web

New Online Algorithms for Story Scheduling in Web Advertising (SA, AP), pp. 446–458.

ICALP-v2-2013-BachrachP #big data #performance #pseudo #recommendation #sketching #using

Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints (YB, EP), pp. 459–471.

ICALP-v2-2013-BecchettiBDKM #bound #complexity #convergence #proving

Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds (LB, VB, MD, AK, KM), pp. 472–483.

ICALP-v2-2013-CelisGK #information management #on the

On Revenue Maximization for Agents with Costly Information Acquisition — Extended Abstract (LEC, DCG, ARK), pp. 484–495.

ICALP-v2-2013-ChristodoulouG #game studies #polynomial

Price of Stability in Polynomial Congestion Games (GC, MG), pp. 496–507.

ICALP-v2-2013-CzyzowiczKP #locality

Localization for a System of Colliding Robots (JC, EK, EP), pp. 508–519.

ICALP-v2-2013-DereniowskiDKPU #collaboration #graph #performance

Fast Collaborative Graph Exploration (DD, YD, AK, DP, PU), pp. 520–532.

ICALP-v2-2013-DieudonneP #approach #polynomial

Deterministic Polynomial Approach in the Plane (YD, AP), pp. 533–544.

ICALP-v2-2013-FaustHV #outsourcing #pattern matching

Outsourced Pattern Matching (SF, CH, DV), pp. 545–556.

ICALP-v2-2013-FuscoPP #learning #performance

Learning a Ring Cheaply and Fast (EGF, AP, RP), pp. 557–568.

ICALP-v2-2013-GravinL

Competitive Auctions for Markets with Positive Externalities (NG, PL), pp. 569–580.

ICALP-v2-2013-HarrisMPRS #performance

Efficient Computation of Balanced Structures (DGH, EM, GP, PR, AS), pp. 581–593.

ICALP-v2-2013-HartungNNS #analysis #complexity #graph

A Refined Complexity Analysis of Degree Anonymization in Graphs (SH, AN, RN, OS), pp. 594–606.

ICALP-v2-2013-HenzingerKN #maintenance #network

Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks (MH, SK, DN), pp. 607–619.

ICALP-v2-2013-HoeferW #strict

Locally Stable Marriage with Strict Preferences (MH, LW), pp. 620–631.

ICALP-v2-2013-JurdzinskiKS #distributed #network

Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices (TJ, DRK, GS), pp. 632–644.

ICALP-v2-2013-LipmaaT #complexity #online #similarity #sublinear #testing

Secure Equality and Greater-Than Tests with Sublinear Online Complexity (HL, TT), pp. 645–656.

ICALP-v2-2013-MertziosMCS #constraints #network #optimisation

Temporal Network Optimization Subject to Connectivity Constraints (GBM, OM, IC, PGS), pp. 657–668.

ICALP-v2-2013-MertziosS #bound #evolution #network

Strong Bounds for Evolution in Networks (GBM, PGS), pp. 669–680.

ICALP-v2-2013-PettieS #algorithm #distributed #graph #performance

Fast Distributed Coloring Algorithms for Triangle-Free Graphs (SP, HHS), pp. 681–693.