Automata, Languages and Programming 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings / edited by Luis Caires, Guiseppe F. Italiano, Luis Monteiro, Catuscia Palamidessi, Moti Yung.

The 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005) was held in Lisbon, Portugal from July 11 to July 15, 2005. These proceedings contain all contributed papers presented at ICALP 2005, - getherwiththepapersbytheinvitedspeakersGiuseppeCastagna(ENS),Leonid Libkin (To...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Caires, Luis (Editor), Italiano, Guiseppe F. (Editor), Monteiro, Luis (Editor), Palamidessi, Catuscia (Editor), Yung, Moti (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edition:1st ed. 2005.
Series:Theoretical Computer Science and General Issues ; 3580
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • Invited Lectures
  • Data Structures I
  • Cryptography and Complexity
  • Data Structures II
  • Cryptography and Distributed Systems
  • Graph Algorithms I
  • Security Mechanisms
  • Graph Algorithms II
  • Automata and Formal Languages I
  • Signature and Message Authentication
  • Algorithmic Game Theory
  • Automata and Logic
  • Computational Algebra
  • Cache-Oblivious Algorithms and Algorithmic Engineering
  • On-line Algorithms
  • Security Protocols Logic
  • Random Graphs
  • Concurrency I
  • Encryption and related Primitives
  • Approximation Algorithms I
  • Games
  • Approximation Algorithms II
  • Lower Bounds
  • Probability
  • Approximation Algorithms III
  • Automata and Formal Languages II
  • Approximation Algorithms IV
  • Algebraic Computation and Communication Complexity
  • Concurrency II
  • String Matching and Computational Biology
  • Quantum Complexity
  • Analysis and Verification
  • Geometry and Load Balancing
  • Concrete Complexity and Codes
  • Model Theory and Model Checking.