default search action
37th ICALP 2010: Bordeaux, France - Part I
- Samson Abramsky
, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis:
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6199, Springer 2010, ISBN 978-3-642-14161-4
Invited Talks
- Pierre Fraigniaud:
Informative Labeling Schemes. 1 - Jean Goubault-Larrecq:
Noetherian Spaces in Verification. 2-21 - Joël Ouaknine
Towards a Theory of Time-Bounded Verification. 22-37 - Roger Wattenhofer:
Physical Algorithms. 38-51
Session 1-Track B. Automata
- Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. 52-63 - Pierre Chambart, Philippe Schnoebelen:
Pumping and Counting on the Regular Post Embedding Problem. 64-75 - Udi Boker, Orna Kupferman, Adin Rosenberg:
Alternation Removal in Büchi Automata. 76-87 - Laurent Braud, Arnaud Carayol:
Linear Orders in the Pushdown Hierarchy. 88-99
Session 1-Track C. Communication in Networks
- Anna Blasiak
The Serializability of Network Codes. 100-114 - Dan Alistarh, Seth Gilbert
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). 115-126 - Petra Berenbrink, Jurek Czyzowicz, Robert Elsässer, Leszek Gasieniec:
Efficient Information Exchange in the Random Phone-Call Model. 127-138 - Guy Even, Moti Medina
An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines. 139-150
Session 2-Track B. Formal Languages
- Mai Gehrke, Serge Grigorieff, Jean-Eric Pin:
A Topological Approach to Recognition. 151-162 - Norbert Blum:
On LR(k)-Parsers of Polynomial Size. 163-174 - Georg Zetzsche
On Erasing Productions in Random Context Grammars. 175-186
Session 4-Track B. Semantics
- James Laird
Game Semantics for Call-by-Value Polymorphism. 187-198 - Martin Hofmann, Aleksandr Karbyshev
What Is a Pure Functional? 199-210 - Roberto Giacobazzi, Francesco Ranzato:
Example-Guided Abstraction Simplification. 211-222 - Annabelle McIver
Compositional Closure for Bayes Risk in Probabilistic Noninterference. 223-235
Session 4-Track C. Fault Tolerance, Ranking
- Paul Bunn, Rafail Ostrovsky:
Asynchronous Throughput-Optimal Routing in Malicious Networks. 236-248 - Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky:
Improved Fault Tolerance and Secure Computation on Sparse Networks. 249-260 - Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg:
Sparse Reliable Graph Backbones. 261-272 - Nikhil Bansal, Kamal Jain, Anna Kazeykina, Joseph Naor:
Approximation Algorithms for Diversified Search Ranking. 273-284
Session 5-Track B. Graphs, Categories and Quantum Information
- Ross Duncan
Rewriting Measurement-Based Quantum Computations with Generalised Flow. 285-296 - Bob Coecke, Aleks Kissinger
The Compositional Structure of Multipartite Quantum Entanglement. 297-308 - Arend Rensink:
Compositionality in Graph Transformation. 309-320
Session 6-Track B. Best Paper Award
- Yijia Chen, Jörg Flum:
On p-Optimal Proof Systems and Logics for PTIME. 321-332
Session 6-Track C. Best Paper Award
- George B. Mertzios, Ignasi Sau
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. 333-344
Session 7-Track B. Logic
- Angelo Montanari, Gabriele Puppis
Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals. 345-356 - Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. 357-368 - Antonis Achilleos
Parameterized Modal Satisfiability. 369-380 - Gaëlle Fontaine, Raul Andres Leal, Yde Venema:
Automata for Coalgebras: An Approach Using Predicate Liftings. 381-392
Session 7-Track C. Privacy, Selfishness
- Jeremiah Blocki
Resolving the Complexity of Some Data Privacy Problems. 393-404 - T.-H. Hubert Chan, Elaine Shi, Dawn Song:
Private and Continual Release of Statistics. 405-417 - Ning Chen, Xiaotie Deng
Envy-Free Pricing in Multi-item Markets. 418-429 - George Christodoulou
Contention Resolution under Selfishness. 430-441
Session 8-Track B. Concurrency
- Ivan Lanese
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi. 442-453 - Daniel Hirschkoff, Damien Pous
On Bisimilarity and Substitution in Presence of Replication. 454-465 - Peter Habermehl, Roland Meyer, Harro Wimmel:
The Downward-Closure of Petri Net Languages. 466-477 - Tomás Brázdil, Petr Jancar
Reachability Games on Extended Vector Addition Systems with States. 478-489
Session 8-Track C. Mobile Agents
- Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Modelling Mobility: A Discrete Revolution. 490-501 - Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Arnaud Labourel:
Tell Me Where I Am So I Can Meet You Sooner. 502-514 - Jérémie Chalopin, Shantanu Das:
Rendezvous of Mobile Agents without Agreement on Local Orientation. 515-526
Session 9-Track B. Probabilistic Computation
- Hugo Gimbert, Youssouf Oualhadj
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems. 527-538 - Tomás Brázdil, Javier Esparza
Space-Efficient Scheduling of Stochastically Generated Tasks. 539-550 - John Fearnley:
Exponential Lower Bounds for Policy Iteration. 551-562
Session 10-Track B. Automata
- Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy:
Regular Temporal Cost Functions. 563-574 - Stefan Göller, Christoph Haase
Model Checking Succinct and Parametric One-Counter Automata. 575-586 - Benedikt Bollig, Paul Gastin, Benjamin Monmege
Pebble Weighted Automata and Transitive Closure Logics. 587-598 - Krishnendu Chatterjee, Laurent Doyen:
Energy Parity Games. 599-610
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-22 19:32 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: