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.

This book constitutes the refereed proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 99, held in Trier, Germany in March 1999. The 51 revised full papers presented were selected from a total of 146 submissions. Also included are three invited papers. The volume is divided in topical sections on complexity, parallel algorithms, computational geometry, algorithms and data structures, automata and formal languages, verification, algorithmic learning, and logic in computer science.

Tenascin, a recently characterized extracellular matrix (ECM) protein which is expressed during embryonic and fetal development, wound healing and various benign and malignant tumors (but highly restricted in normal adult tissues) is believed to affect a number of cellular functions such as cellular growth, differentiation, adhesion and motility. It has been extensively studied in recent years to elucidate cellular phenomena that are associated with development, tissue regeneration and neoplastic growth and behavior. It may be a potential target in the treatment of cancers and other disorders. This book focuses mainly on tissue expression and the poorly known biological role of this ECM protein.

This book presents the refereed proceedings of the EP'98 and RIDT'98 conferences, held jointly during the Second International Week on Electronic Publishing and Typography in St. Malo, France, in March/April 1998. The 43 revised full papers presented were carefully selected for inclusion in the book. Among the topics covered are artistic imaging, tools and methods in typography, non-latin type, typographic creation, imaging, character recognition, handwriting models, legibility and design issues, fonts and design, time and multimedia, electronic and paper documents, document engineering, documents and linguistics, document reuse, hypertext and the Web, and hypertext creation and management.

This book constitutes the refereed proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science, MFCS'98, held in Brno, Czech Republic, in August 1998. The 71 revised full papers presented were carefully reviewed and selected from a total of 168 submissions. Also included are 11 full invited surveys by prominent leaders in the area. The papers are organized in topical sections on problem complexity; logic, semantics, and automata; rewriting; automata and transducers; typing; concurrency, semantics, and logic; circuit complexity; programming; structural complexity; formal languages; graphs; Turing complexity and logic; binary decision diagrams, etc..

Content Description #Includes bibliographical references and index.

This book constitutes the thoroughly refereed post-proceedings of the Second International Conference on Information Security and Cryptology, ICISC'99, held in Seoul, Korea, in December 1999. The 20 revised full papers presented together with an invited paper were carefully reviewed and selected from a total of 61 submissions. The book is divided into topical sections on cryptoanalysis and cryptographic design; cryptographic theory and computation complexity; cryptographic protocols and authentication design; digital signatures and secret sharing; and electronic cash, applications, and implementation.

This book constitutes the refereeed proceedings of the Third European Conference on Multimedia Applications, Services and Techniques, ECMAST '98, held in Berlin, Germany, in May 1998. The 40 revised full papers presented were carefully selected for inclusion in the book by the program committee. The topics covered include multimedia networks and protocols; coded representation of images, sound, and data; multimedia delivery on broadcast and telecom networks; servers and storage architechtures; advanced multimedia terminals and in house networks; multimedia services; Internet and multimedia scenario; and multimedia trials.

This book constitutes the refereed proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2002, held in Singapore, in December 2002. The 34 revised full papers presented together with two invited contributions were carefully reviewed and selected from 173 submissions on the basis of 875 review reports. The papers are organized in topical sections on public key cryptography, authentication, theory, block ciphers, distributed cryptography, cryptanalysis, public key cryptanalysis, secret sharing, digital signatures, applications, Boolean functions, key management, and ID-based cryptography.

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.