自动机、语言及编程LNCS-4052: Automata, languages and programming
点此进入淘宝搜索页搜索分類: 图书,计算机/网络,人工智能,
作者： Michele Bugliesi著
出 版 社： 湖北辞书出版社
出版时间： 2006-12-1字数：版次： 1页数： 602印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540359074包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science resarch forum available.
The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material publised traditionally includes.
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work, research projects, technical reports, etc.)
内容简介
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 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
