Csiszár I., Katona G., Tardos G. (eds.) Entropy, Search, Complexity

Springer, 2007. — 261 p. — János Bolyai Mathematical Society.The present volume is a collection of survey papers in the fields given in the title. They summarize the latest developments in their respective areas. More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. The volume is slightly related to the twin conferences Search And Communication Complexity and Information Theory In Mathematics held at Balatonlelle, Hungary in 2000. These conferences led us to believe that there is a need for such a collection of papers.Two Colors and More
Coding with Feedback and Searching with Lies
Nonadaptive and Trivial Two-Stage Group Testing with Error-Correcting de-Disjunct Inclusion Matrices
Model Identification
Using Search Linear Models and Search Designs
Information Topologies with Applications
Reinforced Random Walk
Quantum Source Coding and Data Compression
nformation Theory at the Service of Science
Analysis of Sorting Algorithms by Kolmogorov Complexity
Recognition Problems in Combinatorial Search