【图书简介】 The two volume set LNCS 4051 and LNCS 4052 constitutes the refereed proceedings of the 33rd International Colloquium on Automata， Languages and Programming， ICALP 2006， held in Venice， Italy， in July 2006.The first volume （LNCS 4051） presents 61 revised full papers together with 1 invited lecture that were carefully reviewed and selected from 230 submissions. Those papers have a special focus on algorithms， automata， complexity and games and are organized in topical sections on graph theory， quantum computing， randomness， formal languages， approximation algorithms， graph algorithms， algorithms， complexity， data structures and linear algebra， graphs， game theory， networks， circuits and regular expressions， fixed parameter complexity and approximation algorithms. The second volume （LNCS 4052） comprises 2 invited papers and 2 other conference tracks with 24 papers each - rigorously selected from 96 and 81 submissions - focusing on algorithms， automata， complexity and games as well as on security and cryptography foundation respectively. The papers are organized in topical sections on zero-knowledge and signatures， cryptographic protocols， secrecy and protocol analysis， cryptographic promitives， bounded storage and quantum models， foundations， multi-party protocols， games， semantics， automata， models， equations， and logics.-读书网|DuShu.com
【本书目录】 Invited Lectures Graph Theory I Quantum Computing Randommess Formal Languages Approximation Algorithms I Approximation Algorithms II Graph Algorithms I Algorithms I Complexity I Data Structures and Linear Algebra Graphs Complexity II Game THeory I Algorithms II Game Theory II Networks，Circuits and Regular Expressions Fixed Parameter Complexity and Approximation Algorithms Graph Algorithms II Author Index
【图书简介】
【购买本书】
