STACS 96
STACS 96

Author: Claude Puech

Publisher: Springer Science & Business Media

Published: 1996-02-14

Total Pages: 710

ISBN-13: 9783540609223

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 13th Symposium on Theoretical Aspects of Computer Science, STACS 96, held in Grenoble, France in February 1996. The 52 revised papers presented were selected from a total of 185 submissions; also included are three invited papers. The volume addresses all current aspects of theoretical computer science and is organized in sections on complexity theory, automata theory, parallel algorithms, learning, parallel and distributed systems, cryptography, logic and database theory, algorithms, semantics and program verification, and communication complexity.

STACS 98
STACS 98

Author: Michel Morvan

Publisher: Springer Science & Business Media

Published: 1998-02-18

Total Pages: 652

ISBN-13: 9783540642305

DOWNLOAD EBOOK

This book constitutes the strictly refereed proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, STACS 98, held in Paris, France, in February 1998. The volume presents three invited surveys together with 52 revised full papers selected from a total of 155 submissions. The papers are organized in topical sections on algorithms and data structures, logic, complexity, and automata and formal languages.

STACS 97
STACS 97

Author: Rüdiger Reischuk

Publisher: Springer Science & Business Media

Published: 1997-02-21

Total Pages: 638

ISBN-13: 9783540626169

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference.

ECOOP '96 - Object-Oriented Programming
ECOOP '96 - Object-Oriented Programming

Author: Pierre Cointe

Publisher: Springer Science & Business Media

Published: 1996-06-26

Total Pages: 520

ISBN-13: 9783540614395

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 10th European Conference on Object-Oriented Programming, ECOOP '96, held in Linz, Austria, in July 1996. The 21 full papers included in revised version were selected from a total of 173 submissions, based on technical quality and originality criteria. The papers reflect the most advanced issues in the field of object-oriented programming and cover a wide range of current topics, including applications, programming languages, implementation, specification, distribution, databases, and design.

Automata, Languages and Programming
Automata, Languages and Programming

Author: Friedhelm Meyer auf der Heide

Publisher: Springer Science & Business Media

Published: 1996-06-26

Total Pages: 700

ISBN-13: 9783540614401

DOWNLOAD EBOOK

This volume constitutes the refereed proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP '96), held at Paderborn, Germany, in July 1996. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS). The proceedings contain 52 refereed papers selected from 172 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are organized in sections on: Process Theory; Fairness, Domination, and the u-Calculus; Logic and Algebra; Languages and Processes; Algebraic Complexity; Graph Algorithms; Automata; Complexity Theory; Combinatorics on Words; Algorithms; Lower Bounds; Data Structures...

Secure Broadcast Communication
Secure Broadcast Communication

Author: Adrian Perrig

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 224

ISBN-13: 1461502292

DOWNLOAD EBOOK

Secure Broadcast Communication in Wired and Wireless Networks presents a set of fundamental protocols for building secure information distribution systems. Applications include wireless broadcast, IP multicast, sensor networks and webs, ad hoc networks, and satellite broadcast. This book presents and compares new techniques for basic operations including: *key distribution for access control, *source authentication of transmissions, and *non-repudiation of streams. This book discusses how to realize these operations both with high performance processors and resource constrained processors. It shows how to protect against adversaries who inject packets or eavesdrop. The focus is on functional descriptions rather than theoretical discussions. Protocols are presented as basic building blocks that can be combined with each other and traditional security protocols. The book illustrates these protocols in practice by presenting a real implementation that provides security for an ad hoc sensor network. This book can serve as a textbook or supplementary reading in graduate level courses on security or networking, or can be used for self study.

Descriptive Complexity and Finite Models
Descriptive Complexity and Finite Models

Author: Neil Immerman

Publisher: American Mathematical Soc.

Published: 1997

Total Pages: 265

ISBN-13: 0821805177

DOWNLOAD EBOOK

From the Preface: We hope that this small volume will suggest directions of synergy and contact for future researchers to build upon, creating connections and making discoveries that will help explain some of the many mysteries of computation. Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This area has been developing through continuous interaction with computational complexity, database theory, and combinatorics. The volume presents articles by leading researchers who delivered talks at the "Workshop on Finite Models and Descriptive Complexity" at Princeton in January 1996 during a DIMACS sponsored Special Year on Logic and Algorithms. Each article is self-contained and provides a valuable introduction to the featured research areas connected with finite model theory. This text will also be of interest to those working in discrete mathematics and combinatorics.

Formal Languages, Automata and Numeration Systems 2
Formal Languages, Automata and Numeration Systems 2

Author: Michel Rigo

Publisher: John Wiley & Sons

Published: 2014-11-17

Total Pages: 268

ISBN-13: 1848217889

DOWNLOAD EBOOK

The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to recent dramatic developments, for example, the transcendence results for the real numbers having a "simple" binary expansion, by B. Adamczewski and Y. Bugeaud. This book is at the heart of this interplay through a unified exposition. Objects are considered with a perspective that comes both from theoretical computer science and mathematics. Theoretical computer science offers here topics such as decision problems and recognizability issues, whereas mathematics offers concepts such as discrete dynamical systems. The main goal is to give a quick access, for students and researchers in mathematics or computer science, to actual research topics at the intersection between automata and formal language theory, number theory and combinatorics on words. The second of two volumes on this subject, this book covers regular languages, numeration systems, formal methods applied to decidability issues about infinite words and sets of numbers.

Formal Languages, Automata and Numeration Systems 1
Formal Languages, Automata and Numeration Systems 1

Author: Michel Rigo

Publisher: John Wiley & Sons

Published: 2014-11-17

Total Pages: 332

ISBN-13: 1848216157

DOWNLOAD EBOOK

Formal Languages, Automaton and Numeration Systems presents readers with a review of research related to formal language theory, combinatorics on words or numeration systems, such as Words, DLT (Developments in Language Theory), ICALP, MFCS (Mathematical Foundation of Computer Science), Mons Theoretical Computer Science Days, Numeration, CANT (Combinatorics, Automata and Number Theory). Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidable regularities or patterns. When considering some numeration systems, any integer can be represented as a finite word over an alphabet of digits. This simple observation leads to the study of the relationship between the arithmetical properties of the integers and the syntactical properties of the corresponding representations. One of the most profound results in this direction is given by the celebrated theorem by Cobham. Surprisingly, a recent extension of this result to complex numbers led to the famous Four Exponentials Conjecture. This is just one example of the fruitful relationship between formal language theory (including the theory of automata) and number theory.

Automata, Languages and Programming
Automata, Languages and Programming

Author: Pierpaolo Degano

Publisher: Springer Science & Business Media

Published: 1997-06-18

Total Pages: 884

ISBN-13: 9783540631651

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 24th International Colloquium on Automata, Languages and Programming, ICALP '97, held in Bologna, Italy, in July 1997. ICALP '97 celebrated the 25th anniversary of the European Association for Theoretical Computer Science (EATCS), which has sponsored the ICALP meetings since 1972. The volume presents 73 revised full papers selected from a total of 197 submissions. Also included are six invited contributions. ICALP is one of the few flagship conferences in the area. The book addresses all current topics in theoretical computer science.