Automata, Languages and Programming: 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$142.87
Used and New from Other Sellers
Used and New from Other Sellers
from $62.76
Usually ships in 1-2 business days
(Save 62%)
Other sellers (Paperback)
  • All (7) from $62.76   
  • New (5) from $106.06   
  • Used (2) from $62.76   

More About This Textbook

Overview

The two-volume set LNCS 6198 and LNCS 6199 constitutes the refereed proceedings of the 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, held in Bordeaux, France, in July 2010.
The 106 revised full papers (60 papers for track A, 30 for track B, and 16 for track C) presented together with 6 invited talks were carefully reviewed and selected from a total of 389 submissions. The papers are grouped in three major tracks on algorithms, complexity and games; on logic, semantics, automata, and theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 6199 contains 46 contributions of track B and C selected from 167 submissions as well as 4 invited talks.

Read More Show Less

Product Details

Table of Contents

Invited Talks

Informative Labeling Schemes (Abstract) Pierre Fraigniaud Fraigniaud, Pierre 1

Noetherian Spaces in Verification Jean Goubault-Larrecq Goubault-Larrecq, Jean 2

Towards a Theory of Time-Bounded Verification James Worrell Worrell, James 22

Physical Algorithms Roger Wattenhofer Wattenhofer, Roger 38

Session 1 Track B. Automata

Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata Igor Walukiewicz Walukiewicz, Igor 52

Pumping and Counting on the Regular Post Embedding Problem Philippe Schnoebelen Schnoebelen, Philippe 64

Alternation Removal in Buchi Automata Adin Rosenberg Rosenberg, Adin 76

Linear Orders in the Pushdown Hierarchy Arnaud Carayol Carayol, Arnaud 88

Session 1 Track C. Communication in Networks

The Serializability of Network Codes Robert Kleinberg Kleinberg, Robert 100

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) Morteza Zadimoghaddam Zadimoghaddam, Morteza 115

Efficient Information Exchange in the Random Phone-Call Model Leszek Gasieniec Gasieniec, Leszek 127

An O(log n)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines Moti Medina Medina, Moti 139

Session 2 Track B. Formal Languages

A Topological Approach to Recognition Jean-Eric Pin Pin, Jean-Eric 151

On LR(k)-Parsers of polynomial Size (Extended Abstract) Norbert Blum Blum, Norbert 163

On Erasing Productions in Random Context Grammars Georg Zetzsche Zetzsche, Georg 175

Session 4 Track B. Semantics

Game Semantics for Call-by-Value Polymorphism James Laird Laird, James 187

What is a Pure Functional? Helmut Seidl Seidl, Helmut 199

Example-Guided Abstraction Simplification Francesco Ranzato Ranzato, Francesco 211

Compositional Closure for Bayes Risk in Probabilistic Noninterference Carroll Morgan Morgan, Carroll 223

Session 4 Track C. Fault Tolerance, Ranking

Asynchronous Throughput-Optimal Routing In Malicious Networks Rafail Ostrovsky Ostrovsky, Rafail 236

Improved Fault Tolerance and Secure Computation on Sparse Networks Rafail Ostrovsky Ostrovsky, Rafail 249

Sparse Reliable Graph Backbones David Peleg Peleg, David 261

Approximation Algorithms for Diversified Search Ranking Joseph (Seffi) Naor Naor, Joseph (Seffi) 273

Session 5 Track B. Graphs, Categories and Quantum Information

Rewriting Measurement-Based Quantum Computations with Generalised Flow Simon Perdrix Perdrix, Simon 285

The Compositional Structure of Multipartite Quantum Entanglement Aleks Kissinger Kissinger, Aleks 297

Compositionality in Graph Transformation Arend Rensink Rensink, Arend 309

Session 6 Track B. Best Paper Award

On p-Optimal Proof Systems and Logics for PTIME Jorg Flum Flum, Jorg 321

Session 6 Track C. Best Paper Award

Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests Shmuel Zaks Zaks, Shmuel 333

Session 7 Track B. Logic

Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals Pietro Sala Sala, Pietro 345

B and D Are Enough to Make the Halpern-Shoham Logic Undecidable Emanuel Kieronski Kieronski, Emanuel 357

Parameterized Modal Satisfiability Valia Mitsou Mitsou, Valia 369

Automata for Coalgebras: An Approach Using Predicate Liftings Yde Venema Venema, Yde 381

Session 7 Track C. Privacy, Selfishness

Resolving the Complexity of Some Data Privacy Problems Ryan Williams Williams, Ryan 393

Private and Continual Release of Statistics Dawn Song Song, Dawn 405

Envy-Free Pricing in Multi-item Markets Xiaotie Deng Deng, Xiaotie 418

Contention Resolution under Selfishness Evangelia Pyrga Pyrga, Evangelia 430

Session 8 Track B. Concurrency

On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi Alan Schmitt Schmitt, Alan 442

On Bisimilarity and Substitution in Presence of Replication Damien Pous Pous, Damien 454

The Downward-Closure of Petri Net Languages Harro Wimmel Wimmel, Harro 466

Reachability Games on Extended Vector Addition Systems with States Antonin Kucera Kucera, Antonin 478

Session 8 Track C. Mobile Agents

Modelling Mobility: A Discrete Revolution (Extended Abstract) Riccardo Silvestri Silvestri, Riccardo 490

Tell Me Where I Am So I Can Meet You Sooner: (Asynchronous Rendezvous with Location Information) Arnaud Labourel Labourel, Arnaud 502

Rendezvous of Mobile Agents without Agreement on Local Orientation Shantanu Das Das, Shantanu 515

Session 9 Track B. Probabilistic Computation

Probabilistic Automata on Finite Words: Decidable and Undecidable Problems Youssouf Oualhadj Oualhadj, Youssouf 527

Space-Efficient Scheduling of Stochastically Generated Tasks Michael Luttenberger Luttenberger, Michael 539

Exponential Lower Bounds For Policy Iteration John Fearnley Fearnley, John 551

Session 10 Track B. Automata

Regular Temporal Cost Functions Sylvain Lombardy Lombardy, Sylvain 563

Model Checking Succinct and Parametric One-Counter Automata James Worrell Worrell, James 575

Pebble Weighted Automata and Transitive Closure Logics Marc Zeitoun Zeitoun, Marc 587

Energy Parity Games Laurent Doyen Doyen, Laurent 599

Author Index 611

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)