zbMATH — the first resource for mathematics

Information theory, combinatorics, and search theory. In memory of Rudolf Ahlswede. (English) Zbl 1259.94005
Lecture Notes in Computer Science 7777. Berlin: Springer (ISBN 978-3-642-36898-1/pbk). xl, 773 p. (2013).

Show indexed articles as search result.

The articles of this volume will be reviewed individually.
Indexed articles:
Heup, Christian, Two new results for identification for sources, 1-10 [Zbl 1303.94021]
Heup, Christian, \(L\)-identification for uniformly distributed sources and the \(q\)-ary identification entropy of second order, 11-43 [Zbl 1302.94021]
Liu, Binyue; Cai, Ning, Optimal rate region of two-hop multiple access channel via amplify-and-forward scheme, 44-70 [Zbl 1302.94027]
Wiese, Moritz; Boche, Holger, Strong secrecy for multiple access channels, 71-122 [Zbl 1334.94050]
Bjelaković, Igor; Boche, Holger; Sommerfeld, Jochen, Capacity results for arbitrarily varying wiretap channels, 123-144 [Zbl 1334.94048]
Ahlswede, Rudolf; Csiszár, Imre, On oblivious transfer capacity, 145-166 [Zbl 1334.94047]
Chaaban, Anas; Sezgin, Aydin; Tuninetti, Daniela, Achieving net feedback gain in the linear-deterministic butterfly network with a full-duplex relay, 167-208 [Zbl 1334.94031]
Einstein, David M.; Jones, Lee K., Uniformly generating origin destination tables, 209-216 [Zbl 1334.94032]
Winter, Andreas, Identification via quantum channels, 217-233 [Zbl 1334.81027]
Blinovsky, Vladimir; Cai, Minglai, Classical-quantum arbitrarily varying wiretap channel, 234-246 [Zbl 1334.81023]
Bjelaković, Igor; Boche, Holger; Janßen, Gisbert; Nötzel, Janis, Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities, 247-283 [Zbl 1334.81022]
Gagie, Travis, On the value of multiple read/write streams for data compression, 284-297 [Zbl 1334.68059]
Löwe, Matthias, How to read a randomly mixed up message, 298-312 [Zbl 1334.94042]
Haroutunian, Evgueni; Hakobyan, Parandzem, Multiple objects: error exponents in hypotheses testing and identification, 313-345 [Zbl 1334.62146]
Mauduit, Christian; Sárközy, András, Family complexity and VC-dimension, 346-363 [Zbl 1334.11061]
Ahlswede, Rudolf; Lebedev, Vladimir, The restricted word shadow problem, 364-370 [Zbl 1334.68164]
Aydinian, Harout; Czabarka, Éva; Székely, László A., Mixed orthogonal arrays, \(k\)-dimensional \(M\)-part Sperner multifamilies, and full multitransversals, 371-401 [Zbl 1378.05016]
Daykin, David E.; Daykin, Jacqueline W.; Iliopoulos, Costas S.; Smyth, W. F., Generic algorithms for factoring strings, 402-418 [Zbl 1377.68327]
Bezrukov, Sergei L.; Leck, Uwe; Piotrowski, Victor P., On data recovery in distributed databases, 419-431 [Zbl 1377.68077]
Hoppen, Carlos; Kohayakawa, Yoshiharu; Lefmann, Hanno, An unstable hypergraph problem with a unique optimal solution, 432-450 [Zbl 1378.05147]
Tamm, Ulrich, Multiparty communication complexity of vector-valued and sum-type functions, 451-462 [Zbl 1377.68089]
Czabarka, Éva; Marsili, Matteo; Székely, László A., Threshold functions for distinct parts: revisiting Erdős-Lehner, 463-471 [Zbl 1377.05012]
Konstantinova, Elena, On some structural properties of star and pancake graphs, 472-487 [Zbl 1377.05159]
Ahlswede, Rudolf; Deppe, Christian; Lebedev, Vladimir, Threshold and majority group testing, 488-508 [Zbl 1377.68222]
D’yachkov, Arkadii; Rykov, Vyacheslav; Deppe, Christian; Lebedev, Vladimir, Superimposed codes and threshold group testing, 509-533 [Zbl 1309.94185]
Ahlswede, Rudolf; Aydinian, Harout, New construction of error-tolerant pooling designs, 534-542 [Zbl 1309.05037]
Gerbner, Dániel; Keszegh, Balázs; Pálvőlgyi, Dőmőtőr; Wiener, Gábor, Density-based group testing, 543-556 [Zbl 1309.68081]
Chen, Hong-Bin; Fu, Hung-Lin, Group testing with multiple mutually-obscuring positives, 557-568 [Zbl 1309.05039]
Allemann, Andreas, An efficient algorithm for combinatorial group testing, 569-596 [Zbl 1309.05038]
Colbourn, Charles J.; Nayeri, Peyman, Randomized post-optimization for \(t\)-restrictions, 597-608 [Zbl 1309.05034]
Malyutov, Mikhail, Search for sparse active inputs: a review, 609-647 [Zbl 1309.94018]
Katona, Gyula O. H.; Tichler, Krisztián, Search when the lie depends on the target, 648-657 [Zbl 1309.05009]
Deppe, Christian; Wischmann, Christian, A heuristic solution of a cutting problem using hypergraphs, 658-676 [Zbl 1309.90042]
Althöfer, Ingo, Remarks on history and presence of game tree search and research, 677-693 [Zbl 1309.68170]
Bodewig, Michael, Multiplied complete fix-free codes and shiftings regarding the 3/4-conjecture, 694-710 [Zbl 1377.94023]
Tamm, Ulrich, Creating order and ballot sequences, 711-724 [Zbl 1377.94022]
94-06 Proceedings, conferences, collections, etc. pertaining to information and communication theory
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68R05 Combinatorics in computer science
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
94A15 Information theory (general)
00B30 Festschriften
Biographic References:
Ahlswede, Rudolf
Full Text: DOI