网上购物 货比三家
您现在的位置:快乐比价网 > 图书 > 教育/科技 > 科学与研究 > 商品详情

Automata, Languages and Programming 自动化、编程和语言

分享到:
Automata, Languages and Programming 自动化、编程和语言

最 低 价:¥592.10

定 价:¥1003.59

作 者:FernandoOrejas,PaulG.Spirakis 著

出 版 社:湖南文艺出版社

出版时间:2001-1-1

I S B N:3540422870

商品详情

编辑推荐

内容简介

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 research 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 published traditionally includes.
—proceedings (published in time for the respective conference)
—post-proceedings (consisting of thoroughly revised final full papers)
—research monographs(which may be based on outstanding PhD work,research projects,technical reports,etc.)

作者简介

目录

Keynote Papers
Algorithms,Games,and the Internet
Automata,Circuits,and Hybrids:Facets of Continuous Time
Invited Paters
Languages,Rewriting Systems,and Verification of Infinite-Satae Systems
Integrating Semantics for Object-Oriented System Models
Modelling with Partial Orders-Why and Why Not?
Theoretical Aspects of Evolutionary Algorithms
Algebraic and Circuit Complexity
Improvements of the Alder-Strassen Bound:Algebras With Nonzero Radical
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
Division Is in Uniform TC0
Algorithm Analysis
A Framework for Index Bulk Loading and Dynamization
A Characterization of Temporal Locality and Its Portability across Memory Hierarchies
The Complexity of Constructing Evolutionary Trees Using Experiments
Hidden Patten Statistics
Combinatorci and Algorithms on Low-Discrepancy Roundings of a Real Sequence
All-Pairs Shortest Paths Computation in the BSP Model
Approximation and Optimization
Approximating the Minimum Spanning Tree Weight in Sublinear Time
Approximation Hardness of TSP with Bounded Metrics
The RPR2 Rounding Technique for Semidefinte Programs
Approximation Algoriths for Partial Covering Problems
On the Online Bin Packing Problem
Quick k-Median,k-Center,and Facility Location for Spacrse Graphs
Complexity
Parameterized Complexity:Exponential Speed-Up for Planar Graph Problems
……
Concurrency
Efficient Datastructures
Graph Algorithms
Language Theory,Codes and Automata
Model Checking and Protocol Analysis
Networks and Routing
Scheduling
Secure Computation
Specification and Deduction
Structural Complexity
Author Index

商品评论(0条)

暂无评论!

您的浏览历史

loading 内容加载中,请稍后...