Screen LibraryInformation theory, combinatorics, and search theory : in memory of Rudolf Ahlswede /
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; combi...
Saved in:
| Corporate Authors: | |
|---|---|
| Group Author: | ; ; |
| Published: |
Springer,
|
| Publisher Address: | Berlin ; New York : |
| Publication Dates: | 2013. |
| Literature type: | eBook |
| Language: | English |
| Series: |
Lecture notes in computer science,
7777 LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Subjects: | |
| Online Access: |
http://dx.doi.org/10.1007/978-3-642-36899-8 |
| Summary: |
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. |
| Carrier Form: | 1 online resource. |
| Bibliography: | Includes bibliographical references and author index. |
| ISBN: |
9783642368998 (electronic bk.) 3642368999 (electronic bk.) 3642368980 (print) 9783642368981 (print) |
| Index Number: | Q360 |
| CLC: | G201 |
| Contents: |
Information Theory. Two New Results for Identification for Sources / L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order / Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme / Strong Secrecy for Multiple Access Channels / Capacity Results for Arbitrarily Varying Wiretap Channels / On Oblivious Transfer Capacity / Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay / Uniformly Generating Origin Destination Tables / Identification via Quantum Channels / Classical-Quantum Arbitrarily Varying Wiretap Channel / Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities / On the Value of Multiple Read/Write Streams for Data Compression / How to Read a Randomly Mixed Up Message / Multiple Objects: Error Exponents in Hypotheses Testing and Identification / Combinatorics. Family Complexity and VC-Dimension / The Restricted Word Shadow Problem / Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals / Generic Algorithms for Factoring Strings / On Data Recovery in Distributed Databases / An Unstable Hypergraph Problem with a Unique Optimal Solution / Multiparty Communication Complexity of Vector-Valued and Sum-Type Functions / Threshold Functions for Distinct Parts: Revisiting Erdo s-Lehner / On Some Structural Properties of Star and Pancake Graphs / Search Theory. Threshold and Majority Group Testing / Superimposed Codes and Threshold Group Testing / New Construction of Error-Tolerant Pooling Designs / Density-Based Group Testing / Group Testing with Multiple Mutually-Obscuring Positives / An Efficient Algorithm for Combinatorial Group Testing / Randomized Post-optimization for t-Restrictions / Search for Sparse Active Inputs: A Review / Search When the Lie Depends on the Target / A Heuristic Solution of a Cutting Problem Using Hypergraphs / Remarks on History and Presence of Game Tree Search and Research / Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-Conjecture / Creating Order and Ballot Sequences / |