Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis
Proceedings of the 37th International Colloquium on Automata, Languages and Programming, Part II
ICALP (2), 2010.
@proceedings{ICALP-v2-2010,
address = "Bordeaux, France",
doi = "10.1007/978-3-642-14162-1",
editor = "Samson Abramsky and Cyril Gavoille and Claude Kirchner and Friedhelm Meyer auf der Heide and Paul G. Spirakis",
isbn = "978-3-642-14161-4",
publisher = "{Springer International Publishing}",
series = "{Lecture Notes in Computer Science}",
title = "{Proceedings of the 37th International Colloquium on Automata, Languages and Programming, Part II}",
volume = 6199,
year = 2010,
}
Contents (50 items)
- ICALP-v2-2010-Fraigniaud
- Informative Labeling Schemes (PF), p. 1.
- ICALP-v2-2010-Goubault-Larrecq #verification
- Noetherian Spaces in Verification (JGL), pp. 2–21.
- ICALP-v2-2010-OuaknineW #bound #formal method #towards #verification
- Towards a Theory of Time-Bounded Verification (JO, JW), pp. 22–37.
- ICALP-v2-2010-Wattenhofer #algorithm #physics
- Physical Algorithms (RW), pp. 38–51.
- ICALP-v2-2010-GenestGMW #automaton
- Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata (BG, HG, AM, IW), pp. 52–63.
- ICALP-v2-2010-ChambartS #problem
- Pumping and Counting on the Regular Post Embedding Problem (PC, PS), pp. 64–75.
- ICALP-v2-2010-BokerKR #automaton
- Alternation Removal in Büchi Automata (UB, OK, AR), pp. 76–87.
- ICALP-v2-2010-BraudC #automaton #linear #order
- Linear Orders in the Pushdown Hierarchy (LB, AC), pp. 88–99.
- ICALP-v2-2010-BlasiakK #network
- The Serializability of Network Codes (AB, RDK), pp. 100–114.
- ICALP-v2-2010-AlistarhGGZ #cost analysis #how #performance
- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) (DA, SG, RG, MZ), pp. 115–126.
- ICALP-v2-2010-BerenbrinkCEG #performance #random
- Efficient Information Exchange in the Random Phone-Call Model (PB, JC, RE, LG), pp. 127–138.
- ICALP-v2-2010-EvenM #algorithm #online #random
- An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines (GE, MM), pp. 139–150.
- ICALP-v2-2010-GehrkeGP #approach #recognition
- A Topological Approach to Recognition (MG, SG, JÉP), pp. 151–162.
- ICALP-v2-2010-Blum #lr #on the #polynomial
- On LR(k)-Parsers of Polynomial Size (NB), pp. 163–174.
- ICALP-v2-2010-Zetzsche #on the #random
- On Erasing Productions in Random Context Grammars (GZ), pp. 175–186.
- ICALP-v2-2010-Laird #call-by #game studies #morphism #polymorphism #semantics
- Game Semantics for Call-by-Value Polymorphism (JL), pp. 187–198.
- ICALP-v2-2010-HofmannKS #functional #question #what
- What Is a Pure Functional? (MH, AK, HS), pp. 199–210.
- ICALP-v2-2010-GiacobazziR #abstraction
- Example-Guided Abstraction Simplification (RG, FR), pp. 211–222.
- ICALP-v2-2010-McIverMM #composition #probability
- Compositional Closure for Bayes Risk in Probabilistic Noninterference (AM, LM, CM), pp. 223–235.
- ICALP-v2-2010-BunnO #network
- Asynchronous Throughput-Optimal Routing in Malicious Networks (PB, RO), pp. 236–248.
- ICALP-v2-2010-ChandranGO #fault tolerance #network
- Improved Fault Tolerance and Secure Computation on Sparse Networks (NC, JAG, RO), pp. 249–260.
- ICALP-v2-2010-ChechikEPP #graph #reliability
- Sparse Reliable Graph Backbones (SC, YE, BPS, DP), pp. 261–272.
- ICALP-v2-2010-BansalJKN #algorithm #approximate #ranking
- Approximation Algorithms for Diversified Search Ranking (NB, KJ, AK, JN), pp. 273–284.
- ICALP-v2-2010-DuncanP #quantum
- Rewriting Measurement-Based Quantum Computations with Generalised Flow (RD, SP), pp. 285–296.
- ICALP-v2-2010-CoeckeK #composition #multi #quantum
- The Compositional Structure of Multipartite Quantum Entanglement (BC, AK), pp. 297–308.
- ICALP-v2-2010-Rensink #composition #graph transformation
- Compositionality in Graph Transformation (AR), pp. 309–320.
- ICALP-v2-2010-ChenF #logic #on the #proving
- On p-Optimal Proof Systems and Logics for PTIME (YC, JF), pp. 321–332.
- ICALP-v2-2010-MertziosSSZ #multi #network #set
- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests (GBM, IS, MS, SZ), pp. 333–344.
- ICALP-v2-2010-MontanariPS #decidability #logic
- Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals (AM, GP, PS), pp. 345–356.
- ICALP-v2-2010-MarcinkowskiMK #decidability #logic
- B and D Are Enough to Make the Halpern-Shoham Logic Undecidable (JM, JM, EK), pp. 357–368.
- ICALP-v2-2010-AchilleosLM #satisfiability
- Parameterized Modal Satisfiability (AA, ML, VM), pp. 369–380.
- ICALP-v2-2010-FontaineLV #algebra #approach #automaton #using
- Automata for Coalgebras: An Approach Using Predicate Liftings (GF, RAL, YV), pp. 381–392.
- ICALP-v2-2010-BlockiW #complexity #privacy #problem
- Resolving the Complexity of Some Data Privacy Problems (JB, RW), pp. 393–404.
- ICALP-v2-2010-ChanSS #statistics
- Private and Continual Release of Statistics (THHC, ES, DS), pp. 405–417.
- ICALP-v2-2010-ChenD #multi
- Envy-Free Pricing in Multi-item Markets (NC, XD), pp. 418–429.
- ICALP-v2-2010-ChristodoulouLP
- Contention Resolution under Selfishness (GC, KL, EP), pp. 430–441.
- ICALP-v2-2010-LanesePSS #calculus #communication #higher-order #on the #process
- On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi (IL, JAP, DS, AS), pp. 442–453.
- ICALP-v2-2010-HirschkoffP #on the #replication #similarity
- On Bisimilarity and Substitution in Presence of Replication (DH, DP), pp. 454–465.
- ICALP-v2-2010-HabermehlMW #petri net
- The Downward-Closure of Petri Net Languages (PH, RM, HW), pp. 466–477.
- ICALP-v2-2010-BrazdilJK #game studies #reachability
- Reachability Games on Extended Vector Addition Systems with States (TB, PJ, AK), pp. 478–489.
- ICALP-v2-2010-ClementiMS #modelling
- Modelling Mobility: A Discrete Revolution (AEFC, AM, RS), pp. 490–501.
- ICALP-v2-2010-CollinsCGL
- Tell Me Where I Am So I Can Meet You Sooner (AC, JC, LG, AL), pp. 502–514.
- ICALP-v2-2010-ChalopinD #mobile
- Rendezvous of Mobile Agents without Agreement on Local Orientation (JC, SD), pp. 515–526.
- ICALP-v2-2010-GimbertO #automaton #decidability #finite #probability #problem #word
- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems (HG, YO), pp. 527–538.
- ICALP-v2-2010-BrazdilEKL #scheduling
- Space-Efficient Scheduling of Stochastically Generated Tasks (TB, JE, SK, ML), pp. 539–550.
- ICALP-v2-2010-Fearnley #bound #exponential #policy
- Exponential Lower Bounds for Policy Iteration (JF), pp. 551–562.
- ICALP-v2-2010-ColcombetKL #cost analysis
- Regular Temporal Cost Functions (TC, DK, SL), pp. 563–574.
- ICALP-v2-2010-GollerHOW #automaton #model checking #parametricity
- Model Checking Succinct and Parametric One-Counter Automata (SG, CH, JO, JW), pp. 575–586.
- ICALP-v2-2010-BolligGMZ #automaton #logic #transitive
- Pebble Weighted Automata and Transitive Closure Logics (BB, PG, BM, MZ), pp. 587–598.
- ICALP-v2-2010-ChatterjeeD #energy #game studies
- Energy Parity Games (KC, LD), pp. 599–610.
7 ×#automaton
5 ×#on the
4 ×#logic
4 ×#network
3 ×#algorithm
3 ×#composition
3 ×#decidability
3 ×#game studies
3 ×#multi
3 ×#problem
5 ×#on the
4 ×#logic
4 ×#network
3 ×#algorithm
3 ×#composition
3 ×#decidability
3 ×#game studies
3 ×#multi
3 ×#problem