Skip to main content
SpringerLink
Log in

Automata, Languages and Programming

33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Michele Bugliesi

    1. Dipartimento di Informatica, Università Ca’ Foscari, Venice,  

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Bart Preneel

    1. Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Vladimiro Sassone

    1. ECS, University of Southampton, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Ingo Wegener

    1. FB Informatik, LS2, Univ. Dortmund, Dortmund, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4052)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: ICALP 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (50 papers)

  1. Foundations

    1. Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions

      • Iftach Haitner, Danny Harnik, Omer Reingold
      Pages 228-239

    2. Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes

      • Pierre-Alain Fouque, David Pointcheval, Jacques Stern, Sébastien Zimmer
      Pages 240-251

    3. A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs

      • Ricardo Corin, Jerry den Hartog
      Pages 252-263

  2. Multi-party Protocols

    1. Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability

      • Duong Hieu Phan, Reihaneh Safavi-Naini, Dongvu Tonien
      Pages 264-275

    2. An Adaptively Secure Mix-Net Without Erasures

      • Douglas Wikström, Jens Groth
      Pages 276-287

    3. Multipartite Secret Sharing by Bivariate Interpolation

      • Tamir Tassa, Nira Dyn
      Pages 288-299

    4. Identity-Based Encryption Gone Wild

      • Michel Abdalla, Dario Catalano, Alexander W. Dent, John Malone-Lee, Gregory Neven, Nigel P. Smart
      Pages 300-311

  3. Games

    1. Deterministic Priority Mean-Payoff Games as Limits of Discounted Games

      • Hugo Gimbert, Wiesław Zielonka
      Pages 312-323

    2. Recursive Concurrent Stochastic Games

      • Kousha Etessami, Mihalis Yannakakis
      Pages 324-335

    3. Half-Positional Determinacy of Infinite Games

      • Eryk Kopczyński
      Pages 336-347

    4. A Game-Theoretic Approach to Deciding Higher-Order Matching

      • Colin Stirling
      Pages 348-359

  4. Semantics

    1. Descriptive and Relative Completeness of Logics for Higher-Order Functions

      • Kohei Honda, Martin Berger, Nobuko Yoshida
      Pages 360-371

    2. Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism

      • Rasmus Ejlers Møgelberg
      Pages 372-383

    3. Typed GoI for Exponentials

      • Esfandiar Haghverdi
      Pages 384-395

    4. Commutative Locative Quantifiers for Multiplicative Linear Logic

      • Stefano Guerrini, Patrizia Marzuoli
      Pages 396-407

  5. Automata I

    1. The Wadge Hierarchy of Deterministic Tree Languages

      • Filip Murlak
      Pages 408-419

    2. Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences

      • Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier
      Pages 420-431

    3. On Complexity of Grammars Related to the Safety Problem

      • Tomasz Jurdziński
      Pages 432-443

  6. Models

    1. Jumbo λ-Calculus

      • Paul Blain Levy
      Pages 444-455

    2. λ-RBAC: Programming with Role-Based Access Control

      • Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely
      Pages 456-467
Back to top

Other volumes

  1. Automata, Languages and Programming

  2. Automata, Languages and Programming

Keywords

Editors and Affiliations

  • Dipartimento di Informatica, Università Ca’ Foscari, Venice,  

    Michele Bugliesi

  • Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    Bart Preneel

  • ECS, University of Southampton, UK

    Vladimiro Sassone

  • FB Informatik, LS2, Univ. Dortmund, Dortmund, Germany

    Ingo Wegener

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation