自動機、語言及編程LNCS-4052

內(nèi)容概要

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.

書籍目錄

Invited LecturesGraph Theory IQuantum ComputingRandommessFormal LanguagesApproximation Algorithms IApproximation Algorithms IIGraph Algorithms IAlgorithms IComplexity IData Structures and Linear AlgebraGraphsComplexity IIGame THeory IAlgorithms IIGame Theory IINetworks，Circuits and Regular ExpressionsFixed Parameter Complexity and Approximation AlgorithmsGraph Algorithms IIAuthor Index

圖書封面

評論、評分、閱讀與下載

---

    自動機、語言及編程LNCS-4052 PDF格式下載

---