© 2007

Entropy, Search, Complexity

  • Imre Csiszár
  • Gyula O. H. Katona
  • Gábor Tardos
  • Gábor Wiener

Part of the Bolyai Society Mathematical Studies book series (BSMS, volume 16)

Table of contents

  1. Front Matter
    Pages 1-8
  2. Martin Aigner
    Pages 9-26
  3. Christian Deppe
    Pages 27-70
  4. Arkadii G. D’Yachkov, Anthony J. Macula, Pavel A. Vilenkin
    Pages 71-83
  5. S. Ghosh, T. Shirakura, J. N. Srivastava
    Pages 85-112
  6. Peter Harremoës
    Pages 113-150
  7. Michael Keane
    Pages 151-158
  8. Dénes Petz
    Pages 159-178
  9. Flemming Topsøe
    Pages 179-207
  10. Gábor Wiener
    Pages 233-264

About this book


The present volume is a collection of survey papers in the fields of entropy, search and complexity. 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. Search theory has variegated applications, among others in bioinformatics. Some of these papers also have links to linear statistics and communicational complexity. Further works survey the fundamentals of information theory and quantum source coding. The volume is recommended to experienced researchers as well as young scientists and students both in mathematics and computer science.


algorithm algorithms calculus coding combinatorics communication complexity computer science data compression entropy group information information theory mathematics topology

Editors and affiliations

  • Imre Csiszár
    • 1
  • Gyula O. H. Katona
    • 1
  • Gábor Tardos
    • 1
  • Gábor Wiener
    • 2
  1. 1.Alfréd Rényi Institute of MathematicsHungarian Academy of SciencesBudapestHungary
  2. 2.Budapest University of Technology and EconomicsBudapestHungary

Bibliographic information