| Description |
1 online resource |
| Series |
Lecture notes in computer science, 0302-9743 ; 7777 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7777.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Information Theory. Two New Results for Identification for Sources / Christian Heup -- L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order / Christian Heup -- Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme / Binyue Liu, Ning Cai -- Strong Secrecy for Multiple Access Channels / Moritz Wiese, Holger Boche -- Capacity Results for Arbitrarily Varying Wiretap Channels / Igor Bjelaković, Holger Boche, Jochen Sommerfeld -- On Oblivious Transfer Capacity / Rudolf Ahlswede, Imre Csiszár -- Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay / Anas Chaaban, Aydin Sezgin, Daniela Tuninetti -- Uniformly Generating Origin Destination Tables / David M. Einstein, Lee K. Jones -- Identification via Quantum Channels / Andreas Winter -- Classical-Quantum Arbitrarily Varying Wiretap Channel / Vladimir Blinovsky, Minglai Cai -- Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities / Igor Bjelakovic [and others] |
|
On the Value of Multiple Read/Write Streams for Data Compression / Travis Gagie -- How to Read a Randomly Mixed Up Message / Matthias Löwe -- Multiple Objects: Error Exponents in Hypotheses Testing and Identification / Evgueni Haroutunian, Parandzem Hakobyan -- Combinatorics. Family Complexity and VC-Dimension / Christian Mauduit, András Sárközy -- The Restricted Word Shadow Problem / Rudolf Ahlswede, Vladimir Lebedev -- Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals / Harout Aydinian, Éva Czabarka, László A. Székely -- Generic Algorithms for Factoring Strings / David E. Daykin, Jacqueline W. Daykin, Costas S. Iliopoulos, W.F. Smyth -- On Data Recovery in Distributed Databases / Sergei L. Bezrukov, Uwe Leck, Victor P. Piotrowski -- An Unstable Hypergraph Problem with a Unique Optimal Solution / Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann -- Multiparty Communication Complexity of Vector-Valued and Sum-Type Functions / Ulrich Tamm -- Threshold Functions for Distinct Parts: Revisiting Erdős-Lehner / Éva Czabarka, Matteo Marsili, László A. Székely |
|
On Some Structural Properties of Star and Pancake Graphs / Elena Konstantinova -- Search Theory. Threshold and Majority Group Testing / Rudolf Ahlswede, Christian Deppe, Vladimir Lebedev -- Superimposed Codes and Threshold Group Testing / Arkadii D'yachkov [and others] -- New Construction of Error-Tolerant Pooling Designs / Rudolf Ahlswede, Harout Aydinian -- Density-Based Group Testing / Dániel Gerbner [and others] -- Group Testing with Multiple Mutually-Obscuring Positives / Hong-Bin Chen, Hung-Lin Fu -- An Efficient Algorithm for Combinatorial Group Testing / Andreas Allemann -- Randomized Post-optimization for t-Restrictions / Charles J. Colbourn, Peyman Nayeri -- Search for Sparse Active Inputs: A Review / Mikhail Malyutov -- Search When the Lie Depends on the Target / Gyula O.H. Katona, Krisztián Tichler -- A Heuristic Solution of a Cutting Problem Using Hypergraphs / Christian Deppe, Christian Wischmann -- Remarks on History and Presence of Game Tree Search and Research / Ingo Althöfer -- Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-Conjecture / Michael Bodewig -- Creating Order and Ballot Sequences / Ulrich Tamm |
| 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 |
| Analysis |
Computer science |
|
Coding theory |
|
Computer software |
|
Computational complexity |
|
Combinatorics |
|
Coding and Information Theory |
|
Discrete Mathematics in Computer Science |
|
Algorithm Analysis and Problem Complexity |
|
computerwetenschappen |
|
computer sciences |
|
wiskunde |
|
mathematics |
|
informatietheorie |
|
information theory |
|
combinatoriek |
|
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Bibliography |
Includes bibliographical references and author index |
| Notes |
English |
| Subject |
Information theory.
|
|
Combinatorial analysis.
|
|
Search theory.
|
|
Information Theory
|
|
Decision Theory
|
|
Search theory
|
|
Combinatorial analysis
|
|
Information theory
|
| Genre/Form |
Software.
|
| Form |
Electronic book
|
| Author |
Aydinian, Harout
|
|
Cicalese, Ferdinando
|
|
Deppe, Christian
|
| ISBN |
9783642368998 |
|
3642368999 |
|
3642368980 |
|
9783642368981 |
|
