Information 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...
Gardado en:
| Outros autores: | , , |
|---|---|
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Series: | Theoretical Computer Science and General Issues
7777 |
| Acceso en liña: | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Information Theory, Combinatorics, and Search Theory, Texte imprimé, 9783642368981 • Information Theory, Combinatorics, and Search Theory, Texte imprimé, 9783642369001 |
| LEADER | 05654nam a22003617a 4500 | ||
|---|---|---|---|
| 001 | 946270 | ||
| 008 | 130507q2000 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN169139743 | ||
| 020 | |a 9783642368998 | ||
| 041 | 0 | |a eng | |
| 082 | |a 003.54 | ||
| 245 | 0 | 0 | |a Information Theory, Combinatorics, and Search Theory : |b In Memory of Rudolf Ahlswede |c edited by Harout Aydinian, Ferdinando Cicalese, Christian Deppe. |
| 260 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Theoretical Computer Science and General Issues |v 7777 |x 2512-2029 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 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-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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 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. | ||
| 700 | 1 | |a Aydinian, Harout. |4 pbd | |
| 700 | 1 | |a Cicalese, Ferdinando. |4 pbd | |
| 700 | 1 | |a Deppe, Christian. |4 pbd | |
| 776 | 0 | |t Information Theory, Combinatorics, and Search Theory |b Texte imprimé |z 9783642368981 | |
| 776 | 0 | |t Information Theory, Combinatorics, and Search Theory |b Texte imprimé |z 9783642369001 | |
| 856 | 4 | |u https://doi.org/10.1007/978-3-642-36899-8 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://doi.org/10.1007/978-3-642-36899-8 |z Accès sur la plateforme de l'éditeur (Springer) | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-V6KL7LCJ-F |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747858411 |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-3-642-36899-8 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750875895 |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-3-642-36899-8 |z Accès INSA CVL | |
| 997 | |0 946270 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||