000 05450nam a22005655i 4500
001 978-3-642-36899-8
003 DE-He213
005 20200420221259.0
007 cr nn 008mamaa
008 130305s2013 gw | s |||| 0|eng d
020 _a9783642368998
_9978-3-642-36899-8
024 7 _a10.1007/978-3-642-36899-8
_2doi
050 4 _aQA268
072 7 _aGPJ
_2bicssc
072 7 _aGPF
_2bicssc
072 7 _aCOM031000
_2bisacsh
082 0 4 _a003.54
_223
245 1 0 _aInformation Theory, Combinatorics, and Search Theory
_h[electronic resource] :
_bIn Memory of Rudolf Ahlswede /
_cedited by Harout Aydinian, Ferdinando Cicalese, Christian Deppe.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXL, 773 p. 58 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7777
505 0 _aI. Information Theory -- 1 Two New Results for Identification for Sources -- 2 L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order -- 3 Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme -- 4 Strong Secrecy for Multiple Access Channels -- 5 Capacity Results for Arbitrarily Varying Wiretap Channels -- 6 On Oblivious Transfer Capacity -- 7 Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay -- 8 Uniformly Generating Origin Destination Tables -- 9 Identification via Quantum Channels -- 10 Classical-Quantum Arbitrarily Varying Wiretap Channel -- 11 Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities -- 12 On the Value of Multiple Read/Write Streams for Data Compression -- 13 How to Read a Randomly Mixed Up Message -- 14 Multiple Objects: Error Exponents in Hypotheses Testing and Identification -- II. Combinatorics 15 Family Complexity and VC-Dimension -- 16 The Restricted Word Shadow Problem -- 17 Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multi-families, and Full Multitransversals -- 18 Generic Algorithms for Factoring Strings -- 19 On Data Recovery in Distributed Databases -- 20 An Unstable Hypergraph Problem with a Unique Optimal Solution -- 21 Multiparty Communication Complexity of Vector-Valued and Sum-Type Functions -- 22 Threshold Functions for Distinct Parts: Revisiting Erd�os-Lehner -- 23 On Some Structural Properties of Star and Pancake Graphs -- III. Search Theory -- 24 Threshold and Majority Group Testing -- 25 Superimposed Codes and Threshold Group Testing -- 26 New Construction of Error-Tolerant Pooling Designs -- 27 Density-Based Group Testing -- 28 Group Testing with Multiple Mutually-Obscuring Positives -- 29 An Efficient Algorithm for Combinatorial Group Testing -- 30 Randomized Post-optimization for t-Restrictions -- 31 Search for Sparse Active Inputs: A Review -- 32 Search When the Lie Depends on the Target -- 33 A Heuristic Solution of a Cutting Problem Using Hypergraphs -- 34 Remarks on History and Presence of Game Tree Search and Research -- 35 Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-Conjecture -- Michael Bodewig 36 Creating Order and Ballot Sequences -- Obituaries and Personal Memories -- Abschied -- 38 Rudi -- 39 Gedenkworte f�ur Rudolf Ahlswede -- 40 In Memoriam Rudolf Ahlswede 1938 - 2010 -- 41 Rudolf Ahlswede 1938-2010 -- 42 Remembering Rudolf Ahlswede -- 43 Rudi Ahlswede -- 44 The Happy Connection between Rudi and Japanese Researchers -- 45 From Information Theory to Extremal Combinatorics: My Joint Works with Rudi Ahlswede -- 46 Mr. Schimanski and the Pragmatic Dean -- 47 Broken Pipes -- 48 Rudolf Ahlswede's Funny Character -- 49 Two Anecdotes of Rudolf Ahlswede -- Bibliography of Rudolf Ahlswede's Publications.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aCoding theory.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aCombinatorics.
650 1 4 _aComputer Science.
650 2 4 _aCoding and Information Theory.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aCombinatorics.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aAydinian, Harout.
_eeditor.
700 1 _aCicalese, Ferdinando.
_eeditor.
700 1 _aDeppe, Christian.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642368981
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7777
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-36899-8
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c53115
_d53115