Michael Drmota – författare

Through information theory, problems of communication and compression can be precisely modeled, formulated, and analyzed, and this information can be transformed by means of algorithms. Also, learning can be viewed as compression with side information. Aimed at students and researchers, this book addresses data compression and redundancy within existing methods and central topics in theoretical data compression, demonstrating how to use tools from analytic combinatorics to discover and analyze precise behavior of source codes. It shows that to present better learnable or extractable information in its shortest description, one must understand what the information is, and then algorithmically extract it in its most compact form via an efficient compression algorithm. Part I covers fixed-to-variable codes such as Shannon and Huffman codes, variable-to-fixed codes such as Tunstall and Khodak codes, and variable-to-variable Khodak codes for known sources. Part II discusses universal source coding for memoryless, Markov, and renewal sources.

The Memoirs of the AMS is devoted to the publication of new research in all areas of pure and applied mathematics. The Memoirs is designed particularly to publish long papers of groups of cognate papers in book form, and is under the supervision of the Editorial Committee of the AMS journal Transactions of the American Mathematical Society. All papers are peer-reviewed.

Mathematics and Computer Science III contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the Third International Colloquium on Mathematics and Computer Science, held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers.

Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During thelastyearsresearchrelatedto(random)treeshasbeenconstantlyincreasing and several asymptotic and probabilistic techniques have been developed in order to describe characteristics of interest of large trees in di?erent settings. Thepurposeofthisbookistoprovideathoroughintroductionintovarious aspects of trees in randomsettings anda systematic treatment ofthe involved mathematicaltechniques. It shouldserveasa referencebookaswellasa basis for future research. One major conceptual aspect is to connect combinatorial and probabilistic methods that range from counting techniques (generating functions, bijections) over asymptotic methods (singularity analysis, saddle point techniques) to various sophisticated techniques in asymptotic probab- ity (convergence of stochastic processes, martingales). However, the reading of the book requires just basic knowledge in combinatorics, complex analysis, functional analysis and probability theory of master degree level.It is also part of concept of the book to provide full proofs of the major results even if they are technically involved and lengthy.

Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During thelastyearsresearchrelatedto(random)treeshasbeenconstantlyincreasing and several asymptotic and probabilistic techniques have been developed in order to describe characteristics of interest of large trees in di?erent settings. Thepurposeofthisbookistoprovideathoroughintroductionintovarious aspects of trees in randomsettings anda systematic treatment ofthe involved mathematicaltechniques. It shouldserveasa referencebookaswellasa basis for future research. One major conceptual aspect is to connect combinatorial and probabilistic methods that range from counting techniques (generating functions, bijections) over asymptotic methods (singularity analysis, saddle point techniques) to various sophisticated techniques in asymptotic probab- ity (convergence of stochastic processes, martingales). However, the reading of the book requires just basic knowledge in combinatorics, complex analysis, functional analysis and probability theory of master degree level.It is also part of concept of the book to provide full proofs of the major results even if they are technically involved and lengthy.

The main purpose of this book is to give an overview of the developments during the last 20 years in the theory of uniformly distributed sequences. The authors focus on various aspects such as special sequences, metric theory, geometric concepts of discrepancy, irregularities of distribution, continuous uniform distribution and uniform distribution in discrete spaces. Specific applications are presented in detail: numerical integration, spherical designs, random number generation and mathematical finance. Furthermore over 1000 references are collected and discussed. While written in the style of a research monograph, the book is readable with basic knowledge in analysis, number theory and measure theory.

The main purpose of this book is to give an overview of the developments during the last 20 years in the theory of uniformly distributed sequences. The authors focus on various aspects such as special sequences, metric theory, geometric concepts of discrepancy, irregularities of distribution, continuous uniform distribution and uniform distribution in discrete spaces. Specific applications are presented in detail: numerical integration, spherical designs, random number generation and mathematical finance. Furthermore over 1000 references are collected and discussed. While written in the style of a research monograph, the book is readable with basic knowledge in analysis, number theory and measure theory.