On oblivious transfer capacity
R Ahlswede, I Csiszár - … Search Theory: In Memory of Rudolf Ahlswede, 2013 - Springer
… Still, the second author considers it proper to publish this paper in this volume, paying tribute
to the memory of Rudolph Ahlswede. The results in [2] are completed by some previously …
to the memory of Rudolph Ahlswede. The results in [2] are completed by some previously …
Threshold and majority group testing
R Ahlswede, C Deppe, V Lebedev - … Theory: In Memory of Rudolf Ahlswede, 2013 - Springer
We consider two generalizations of group testing: threshold group testing (introduced by
Damaschke [11]) and majority group testing (a further generalization, including threshold group …
Damaschke [11]) and majority group testing (a further generalization, including threshold group …
Bibliography of publications by Rudolf Ahlswede
R Ahlswede - … , and Search Theory: in memory of Rudolf Ahlswede, 2013 - dl.acm.org
… Ahlswede on occasion of his 60th birthday, editors I. Althöfer, N. Cai, G. … Ahlswede on
occasion of his 60th birthday, editors I. Althöfer, N. Cai, G. … On September 15th, 2004 …
occasion of his 60th birthday, editors I. Althöfer, N. Cai, G. … On September 15th, 2004 …
[LIVRE][B] Information theory, combinatorics, and search theory
H Aydinian, F Cicalese, C Deppe - 2013 - Springer
… research papers dedicated to the memory of Rudolf Ahlswede and the research areas in …
Furthermore three obituaries and several stories and anecdotes related to Rudolf Ahlswede’…
Furthermore three obituaries and several stories and anecdotes related to Rudolf Ahlswede’…
An efficient algorithm for combinatorial group testing
A Allemann - … , and Search Theory: In Memory of Rudolf Ahlswede, 2013 - Springer
In the (d,n) group testing problem n items have to be identified as either good or defective
and the number of defective items is known to be d. A test on an arbitrary group (subset) of …
and the number of defective items is known to be d. A test on an arbitrary group (subset) of …
New construction of error-tolerant pooling designs
R Ahlswede, H Aydinian - … Search Theory: In Memory of Rudolf Ahlswede, 2013 - Springer
In this paper a new class of error-tolerant pooling designs associated with finite vector
spaces is presented. We construct d z -disjunct inclusion matrices using packings in finite …
spaces is presented. We construct d z -disjunct inclusion matrices using packings in finite …
Capacity results for arbitrarily varying wiretap channels
I Bjelaković, H Boche, J Sommerfeld - … : In Memory of Rudolf Ahlswede, 2013 - Springer
… Together with Wolfowitz in [6] Ahlswede determined the … robustification technique discovered
by Ahlswede will play a … , a result, which is called Ahlswede’s dichotomy for single user …
by Ahlswede will play a … , a result, which is called Ahlswede’s dichotomy for single user …
Generic algorithms for factoring strings
DE Daykin, JW Daykin, CS Iliopoulos… - … of Rudolf Ahlswede, 2013 - Springer
In this paper we describe algorithms for factoring words over sets of strings known as circ-UMFFs,
generalizations of the well-known Lyndon words based on lexorder, whose properties …
generalizations of the well-known Lyndon words based on lexorder, whose properties …
The restricted word shadow problem
R Ahlswede, V Lebedev - … Search Theory: In Memory of Rudolf Ahlswede, 2013 - Springer
Recently we introduced and studied the shadow minimization problem under word-subword
relation. In this paper we consider this problem for the restricted case and give optimal …
relation. In this paper we consider this problem for the restricted case and give optimal …
Family Complexity and VC-dimension
… In [3] Ahlswede, Mauduit and Sárközy extended … Rudolf Ahlswede also died. The two authors
of [2] still alive, Christian Mauduit and András Sárközy dedicate this paper to the memory of …
of [2] still alive, Christian Mauduit and András Sárközy dedicate this paper to the memory of …