| 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.) |
| invited lectures the assembly of the human and mouse cenomes data structures for one-dimensional packet classification using most-specific-rule matching dna complementarity and paradigms of computing complexity theory i on higher arthur-merlin classes (2＋f(n))-sat and its properties on the minimal polynomial of a matrix computable real functions of bounded variation and semi-computable real numbers discrete algorithms i improved compact routing tables for planar networks via orderly spanning trees coloring algorithms on subcubic graphs efficient algorithms for the hamiltonian problem on distance-hereditary graphs extending the accommodating function computational biology and learning theory i inverse parametric sequence alignment the full steiner tree problem in phylogeny inferring a union of halfspaces from examples dictionary look-up within small edit distance coding theory and cryptography . polynomial interpolation of the elliptic curve and xtr discrete logarithm co-orthogonal codes efficient power-sum systolic architectures for public-key cryptosystems in gf(2m) a combinatorial approach to anonymous membership broadcast parallel and distributed architectures solving constraint satisfaction problems with dna computing new architecture and algorithms for degradable vlsi/wsi arrays cluster: a fast tool to identify groups of similar programs broadcasting in generalized de bruijn digraphs graph theory on the connected domination number of random regular graphs on the number of minimum cuts in a graph …… radio networks automata nad formal languages internet networks computational geometry i computational biology and learnign theory ii discrete algorithms ii computational geometry ii combinatorial optimization complexity ii quantum computing author index |
内容加载中，请稍后...
商品评论（0条）