Overview
- Provides a comprehensive picture of the vision Rudolf Ahlswede had and put forward of a broad and systematic theory of search
- One third of the papers originated in framework of the ZiF cooperation group "Search Methodologies"
- Includes obituaries and several stories and anecdotes to Rudolf Ahlswede's life
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 7777)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (36 chapters)
-
Information Theory
Keywords
About this book
This volume is dedicated to the memory of Rudolf Ahlswede, who passed away in December 2010. The Festschrift contains 36 thoroughly refereed research papers from a memorial symposium, which took place in July 2011.
The four macro-topics of this workshop: theory of games and strategic planning; combinatorial group testing and database mining; computational biology and string matching; information coding and spreading and patrolling on networks; provide a comprehensive picture of the vision Rudolf Ahlswede put forward of a broad and systematic theory of search.
Editors and Affiliations
Bibliographic Information
Book Title: Information Theory, Combinatorics, and Search Theory
Book Subtitle: In Memory of Rudolf Ahlswede
Editors: Harout Aydinian, Ferdinando Cicalese, Christian Deppe
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-36899-8
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2013
Softcover ISBN: 978-3-642-36898-1Published: 16 March 2013
eBook ISBN: 978-3-642-36899-8Published: 09 March 2013
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XL, 773
Number of Illustrations: 58 b/w illustrations
Topics: Coding and Information Theory, Discrete Mathematics in Computer Science, Combinatorics, Algorithm Analysis and Problem Complexity