You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
This book constitutes the thoroughly refereed post-proceedings of the Third International Conference on Security in Communication Networks, SCN 2002, held in Amalfi, Italy in September 2002. The 24 revised full papers presented together with two invited papers were carefully selected from 90 submissions during two rounds of reviewing and revision. The papers are organized in topical sections on forward security, foundations of cryptography, key management, cryptanalysis, systems security, digital signature schemes, zero knowledge, and information theory and secret sharing.
This book constitutes the refereed proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2005, held in Stuttgart, Germany in February 2005. The 54 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 217 submissions. A broad variety of topics from theoretical computer science are addressed, in particular complexity theory, algorithmics, computational discrete mathematics, automata theory, combinatorial optimization and approximation, networking and graph theory, computational geometry, grammar systems and formal languages, etc.
This volume constitutes the proceedings of the Second International Symposium, Latin American Theoretical Informatics, LATIN '95, held in Valparaiso, Chile in April 1995. The LATIN symposia are intended to be comprehensive events on the theory of computing; they provide a high-level forum for theoretical computer science research in Latin America and facilitate a strong and healthy interaction with the international community. The 38 papers presented in this volume were carefully selected from 68 submissions. Despite the intended broad coverage there are quite a number of papers devoted to computational graph theory; other topics strongly represented are complexity, automata theory, networks, symbolic computation, formal languages, data structures, and pattern matching.
The research results published in this set of proceedings range from pure semigroup theory to theoretical computer science, in particular formal languages and automata. Contributed by internationally recognized researchers, the papers address issues in the algebraic and combinatorial theories of semigroups, the structure theory of automata, the classification theory of formal languages and codes and applications of these theories to various areas like circuit testing, coding theory, or cryptography. The underlying theme is the semigroup and automaton theories and their role in certain applications.
This book consitutes the proceedings of the Third Annual European Symposium on Algorithms, ESA '95, held in Corfu, Greece in September 1995. The volume presents 42 full revised papers selected during a careful refereeing process from a total of 119 submissions; in addition, there is a prominent keynote address. This year, the scope has been further expanded to new areas of computational endeavour in science; the book covers many aspects of algorithms research and application ranging from combinatorial mathematics to hardware design.
description not available right now.
Ancestors include: Gennaro DiNinni (ca. 1770-1830) of Palmoli, Chieti, Italy -- Stefano Pagano (fl. 1772) of Palmoli, Italy -- Domenico Bolognese (fl. 1740) of Palmoli, Italy -- Giuseppe Pascucci (ca. 1720-1801) of Parmoli, Italy -- Michael Bowerman (1711-1795), immigrant, of Northampton County, Pennsylvania -- William Good (d. 1779) of Lancaster County, Pennsylvania -- John Nicholas Bayer/Boyer (ca. 1760-1823) of Halifax, Pennsylvania -- John Powell/Paul (d. 1748) of Lancaster, Pennsylvania.
This book constitutes the refereed proceedings of the 7th Italian Conference on Theoretical Computer Science, ICTCS 2001, held in Torino, Italy in October 2001. The 25 revised full papers presented together with two invited papers were carefully reviewed and selected from 45 submissions. The papers are organized in topical sections on lambda calculus and types, algorithms and data structures, new computing paradigms, formal languages, objects and mobility, computational complexitiy, security, and logics and logic programming.