|
|
|
|
| LEADER |
05481nam a22005535i 4500 |
| 001 |
15710 |
| 003 |
DE-He213 |
| 005 |
20130727075619.0 |
| 007 |
cr nn 008mamaa |
| 008 |
130305s2013 gw | s |||| 0|eng d |
| 020 |
# |
# |
|a 9783642368998
|9 978-3-642-36899-8
|
| 024 |
7 |
# |
|a 10.1007/978-3-642-36899-8
|2 doi
|
| 050 |
# |
4 |
|a QA268
|
| 072 |
# |
7 |
|a GPJ
|2 bicssc
|
| 072 |
# |
7 |
|a GPF
|2 bicssc
|
| 072 |
# |
7 |
|a COM031000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 003.54
|2 23
|
| 100 |
1 |
# |
|a Aydinian, Harout.
|e editor.
|
| 245 |
1 |
0 |
|a Information Theory, Combinatorics, and Search Theory
|b In Memory of Rudolf Ahlswede /
|c edited by Harout Aydinian, Ferdinando Cicalese, Christian Deppe.
|h [electronic resource] :
|
| 264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2013.
|
| 300 |
# |
# |
|a XL, 773 p. 58 illus.
|b online resource.
|
| 336 |
# |
# |
|a text
|b txt
|2 rdacontent
|
| 337 |
# |
# |
|a computer
|b c
|2 rdamedia
|
| 338 |
# |
# |
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
# |
# |
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
# |
|a Lecture Notes in Computer Science,
|v 7777
|x 0302-9743 ;
|
| 505 |
0 |
# |
|a I. 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<U+0013>Valued and Sum<U+0013>Type Functions -- 22 Threshold Functions for Distinct Parts: Revisiting Erd·os<U+0013>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<U+0019>s Funny Character -- 49 Two Anecdotes of Rudolf Ahlswede -- Bibliography of Rudolf Ahlswede<U+0019>s Publications.
|
| 520 |
# |
# |
|a 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.
|
| 650 |
# |
0 |
|a Computer science.
|
| 650 |
# |
0 |
|a Coding theory.
|
| 650 |
# |
0 |
|a Computer software.
|
| 650 |
# |
0 |
|a Computational complexity.
|
| 650 |
# |
0 |
|a Combinatorics.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Coding and Information Theory.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Combinatorics.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 700 |
1 |
# |
|a Cicalese, Ferdinando.
|e editor.
|
| 700 |
1 |
# |
|a Deppe, Christian.
|e editor.
|
| 710 |
2 |
# |
|a SpringerLink (Online service)
|
| 773 |
0 |
# |
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642368981
|
| 830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 7777
|x 0302-9743 ;
|
| 856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-36899-8
|
| 912 |
# |
# |
|a ZDB-2-SCS
|
| 912 |
# |
# |
|a ZDB-2-LNC
|
| 950 |
# |
# |
|a Computer Science (Springer-11645)
|