Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRudolf Ahlswede
Person information
- affiliation: Bielefeld University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[b2]Rudolf Ahlswede:
Identification and Other Probabilistic Models - Rudolf Ahlswede's Lectures on Information Theory 6. Springer 2021, ISBN 978-3-030-65070-4, pp. 3-714
2010 – 2019
- 2013
- [c52]Rudolf Ahlswede, Imre Csiszár:
On Oblivious Transfer Capacity. Information Theory, Combinatorics, and Search Theory 2013: 145-166 - [c51]Rudolf Ahlswede, Vladimir S. Lebedev:
The Restricted Word Shadow Problem. Information Theory, Combinatorics, and Search Theory 2013: 364-370 - [c50]Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Threshold and Majority Group Testing. Information Theory, Combinatorics, and Search Theory 2013: 488-508 - [c49]Rudolf Ahlswede, Harout K. Aydinian:
New Construction of Error-Tolerant Pooling Designs. Information Theory, Combinatorics, and Search Theory 2013: 534-542 - [p2]Rudolf Ahlswede, Ning Cai:
Cross-Disjoint Pairs of Clouds in the Interval Lattice. The Mathematics of Paul Erdős I 2013: 107-117 - [p1]Rudolf Ahlswede, Levan H. Khachatrian:
Classical Results on Primitive and Recent Results on Cross-Primitive Sequences. The Mathematics of Paul Erdős I 2013: 119-132 - 2012
- [j144]Rudolf Ahlswede, Vladimir S. Lebedev:
Shadows under the word-subword relation. Probl. Inf. Transm. 48(1): 31-46 (2012) - [j143]Rudolf Ahlswede, Christian Deppe
, Vladimir S. Lebedev:
Finding one of D defective elements in some group testing models. Probl. Inf. Transm. 48(2): 173-181 (2012) - [j142]Rudolf Ahlswede, Harout K. Aydinian:
On Generic Erasure Correcting Sets and Related Problems. IEEE Trans. Inf. Theory 58(2): 501-508 (2012) - 2011
- [j141]Rudolf Ahlswede, Harout K. Aydinian:
On Security of Statistical Databases. SIAM J. Discret. Math. 25(4): 1778-1791 (2011) - [c48]Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Bounds for threshold and majority group testing. ISIT 2011: 69-73 - [c47]Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Majority group testing with density tests. ISIT 2011: 326-330 - [i8]Rudolf Ahlswede, Harout K. Aydinian:
On generic erasure correcting sets and related problems. CoRR abs/1108.1161 (2011) - 2010
- [c46]Rudolf Ahlswede, Igor Bjelakovic, Holger Boche, Janis Noetzel:
Entanglement transmission over arbitrarily varying quantum channels. ISIT 2010: 2718-2722 - [c45]Rudolf Ahlswede:
Every channel with time structure has a capacity sequence. ITW 2010: 1 - [i7]Rudolf Ahlswede, Igor Bjelakovic, Holger Boche, Janis Noetzel:
Entanglement Transmission over Arbitrarily Varying Quantum Channels. CoRR abs/1004.5551 (2010) - [i6]Rudolf Ahlswede, Igor Bjelakovic, Holger Boche, Janis Noetzel:
Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels. CoRR abs/1010.0418 (2010)
2000 – 2009
- 2009
- [j140]Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe, Ugo Vaccaro:
Two Batch Search With Lie Cost. IEEE Trans. Inf. Theory 55(4): 1433-1439 (2009) - [c44]Rudolf Ahlswede, Harout K. Aydinian:
Interactive Communication, Diagnosis and Error Control in Networks. Algorithmics of Large and Complex Networks 2009: 197-226 - [c43]Rudolf Ahlswede, Imre Csiszár:
On oblivious transfer capacity. ITW 2009: 1-3 - [e3]Rudolf Ahlswede, Ferdinando Cicalese, Ugo Vaccaro:
Search Methodologies, 05.07. - 10.07.2009. Dagstuhl Seminar Proceedings 09281, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i5]Rudolf Ahlswede, Ferdinando Cicalese, Ugo Vaccaro:
09281 Abstracts Collection - Search Methodologies. Search Methodologies 2009 - 2008
- [b1]Rudolf Ahlswede, Vladimir M. Blinovsky:
Lectures on advances in combinatorics. Universitext, Springer 2008, ISBN 978-3-540-78601-6, pp. I-XIII, 1-314 - [j139]Rudolf Ahlswede:
Preface. Discret. Appl. Math. 156(9): 1343-1344 (2008) - [j138]Rudolf Ahlswede:
General theory of information transfer: Updated. Discret. Appl. Math. 156(9): 1348-1388 (2008) - [j137]Rudolf Ahlswede:
Ratewise-optimal non-sequential search strategies under constraints on the tests. Discret. Appl. Math. 156(9): 1431-1443 (2008) - [j136]Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe:
Searching with lies under error cost constraints. Discret. Appl. Math. 156(9): 1444-1460 (2008) - [j135]Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner:
T-shift synchronization codes. Discret. Appl. Math. 156(9): 1461-1468 (2008) - [j134]Rudolf Ahlswede, Vladimir M. Blinovsky:
Multiple packing in sum-type metric spaces. Discret. Appl. Math. 156(9): 1469-1477 (2008) - [j133]Rudolf Ahlswede, Julien Cassaigne, András Sárközy:
On the correlation of binary sequences. Discret. Appl. Math. 156(9): 1478-1487 (2008) - [j132]Rudolf Ahlswede, Harout K. Aydinian:
On diagnosability of large multiprocessor networks. Discret. Appl. Math. 156(18): 3464-3474 (2008) - [j131]Rudolf Ahlswede, Harout K. Aydinian:
Error Control Codes for Parallel Asymmetric Channels. IEEE Trans. Inf. Theory 54(2): 831-836 (2008) - [c42]Rudolf Ahlswede, Faina I. Solov'eva:
A Diametric Theorem in Z nm for Lee and Related Distances. ICMCTA 2008: 1-10 - 2007
- [j130]Rudolf Ahlswede:
The final form of Tao's inequality relating conditional expectation and conditional mutual information. Adv. Math. Commun. 1(2): 239-242 (2007) - [j129]Rudolf Ahlswede, Vladimir M. Blinovsky:
Classical Capacity of Classical-Quantum Arbitrarily Varying Channels. IEEE Trans. Inf. Theory 53(2): 526-533 (2007) - [c41]Rudolf Ahlswede, Imre Csiszár:
On Oblivious Transfer Capacity. ISIT 2007: 2061-2064 - 2006
- [j128]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Intersection theorems under dimension constraints. J. Comb. Theory, Ser. A 113(3): 483-519 (2006) - [j127]Rudolf Ahlswede, Harout K. Aydinian:
Construction of asymmetric connectors of depth two. J. Comb. Theory, Ser. A 113(8): 1614-1620 (2006) - [j126]Rudolf Ahlswede, Vladimir M. Blinovsky:
Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes. J. Comb. Theory, Ser. A 113(8): 1621-1628 (2006) - [j125]Rudolf Ahlswede, Ning Cai:
An Interpretation of Identification Entropy. IEEE Trans. Inf. Theory 52(9): 4198-4207 (2006) - [c40]Rudolf Ahlswede:
Introduction. GTIT-C 2006: 1-44 - [c39]Rudolf Ahlswede:
Rudolf Ahlswede - From 60 to 66. GTIT-C 2006: 45-48 - [c38]Rudolf Ahlswede:
Information Theory and Some Friendly Neighbors - Ein Wunschkonzert. GTIT-C 2006: 49-50 - [c37]Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter:
Identification for Sources. GTIT-C 2006: 51-61 - [c36]Rudolf Ahlswede, Ning Cai:
Watermarking Identification Codes with Related Topics on Common Randomness. GTIT-C 2006: 107-153 - [c35]Rudolf Ahlswede, Ning Cai:
Codes with the Identifiable Parent Property and the Multiple-Access Channel. GTIT-C 2006: 249-257 - [c34]Rudolf Ahlswede, Ning Cai:
Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder. GTIT-C 2006: 258-275 - [c33]Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang:
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer. GTIT-C 2006: 285-292 - [c32]Rudolf Ahlswede, Christian Mauduit, András Sárközy:
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I. GTIT-C 2006: 293-307 - [c31]Rudolf Ahlswede, Christian Mauduit, András Sárközy:
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part II. GTIT-C 2006: 308-325 - [c30]Rudolf Ahlswede, Ning Cai:
A Strong Converse Theorem for Quantum Multiple Access Channels. GTIT-C 2006: 460-485 - [c29]Rudolf Ahlswede, Zhen Zhang:
Estimating with Randomized Encoding the Joint Empirical Distribution in a Correlated Source. GTIT-C 2006: 535-546 - [c28]Rudolf Ahlswede, Ella Aloyan, Evgueni A. Haroutunian:
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information. GTIT-C 2006: 547-552 - [c27]Rudolf Ahlswede, Evgueni A. Haroutunian:
On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification. GTIT-C 2006: 553-571 - [c26]Rudolf Ahlswede, Vladimir M. Blinovsky:
Correlation Inequalities in Function Spaces. GTIT-C 2006: 572-577 - [c25]Rudolf Ahlswede:
Identification Entropy. GTIT-C 2006: 595-613 - [c24]Rudolf Ahlswede, Mark S. Pinsker:
Report on Models of Write-Efficient Memories with Localized Errors and Defects. GTIT-C 2006: 628-632 - [c23]Rudolf Ahlswede:
On Concepts of Performance Parameters for Channels. GTIT-C 2006: 639-663 - [c22]Rudolf Ahlswede, János Körner:
Appendix: On Common Information and Related Characteristics of Correlated Information Sources. GTIT-C 2006: 664-677 - [c21]Rudolf Ahlswede, Ning Cai:
Search with Noisy and Delayed Responses. GTIT-C 2006: 695-703 - [c20]Rudolf Ahlswede, Ning Cai:
A Kraft-Type Inequality for d-Delay Binary Search Codes. GTIT-C 2006: 704-706 - [c19]Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich:
A Fast Suffix-Sorting Algorithm. GTIT-C 2006: 719-734 - [c18]Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe:
Information Theoretic Models in Language Evolution. GTIT-C 2006: 769-787 - [c17]Rudolf Ahlswede:
An Outside Opinion. GTIT-C 2006: 858-860 - [c16]Søren Riis, Rudolf Ahlswede:
Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding". GTIT-C 2006: 861-897 - [c15]Rudolf Ahlswede:
Appendix: On Set Coverings in Cartesian Product Spaces. GTIT-C 2006: 926-937 - [c14]Rudolf Ahlswede, Alexander A. Yudin:
On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections. GTIT-C 2006: 941-954 - [c13]Rudolf Ahlswede, Levon H. Khachatrian:
On Attractive and Friendly Sets in Sequence Spaces. GTIT-C 2006: 955-970 - [c12]Rudolf Ahlswede, Ning Cai:
Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs. GTIT-C 2006: 979-1005 - [c11]Rudolf Ahlswede:
Appendix: Solution of Burnashev's Problem and a Sharpening of the Erdös/Ko/Rado Theorem. GTIT-C 2006: 1006-1009 - [c10]Rudolf Ahlswede, Harout K. Aydinian:
Sparse Asymmetric Connectors in Communication Networks. GTIT-C 2006: 1056-1062 - [c9]Rudolf Ahlswede:
Finding CNRI(W), the Identification Capacity of the AVC W, if Randomization in the Encoding Is Excluded. GTIT-C 2006: 1063 - [c8]Rudolf Ahlswede, Iskandar Karapetyan:
Intersection Graphs of Rectangles and Segments. GTIT-C 2006: 1064-1065 - [c7]Rudolf Ahlswede:
The final form of Tao's inequality relating conditional expectation and conditional mutual information. ISIT 2006: 232 - [c6]Rudolf Ahlswede, Vladimir M. Blinovsky:
Capacity of Quantum Arbitrarily Varying Channels. ISIT 2006: 456-458 - [c5]Rudolf Ahlswede, Harout K. Aydinian:
On security of statistical databases. ISIT 2006: 506-508 - [c4]Rudolf Ahlswede, Harout K. Aydinian:
Error control codes for parallel asymmetric channels. ISIT 2006: 1768-1772 - [c3]Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Non-binary error correcting codes with noiseless feedback, localized errors, or both. ISIT 2006: 2486-2487 - [c2]Rudolf Ahlswede:
Another diametric theorem in Hamming spaces: optimal group anticodes. ITW 2006: 212-216 - [e2]Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein:
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006. Dagstuhl Seminar Proceedings 06201, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [e1]Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout K. Aydinian, Vladimir M. Blinovsky, Christian Deppe, Haik Mashurian:
General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science 4123, Springer 2006, ISBN 3-540-46244-9 [contents] - [i4]Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein:
06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - [i3]Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein:
06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - [i2]Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Non--binary error correcting codes with noiseless feedback, localized errors, or both. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - [i1]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian, Ludo M. G. M. Tolhuizen:
On q-ary codes correcting all unidirectional errors of a limited magnitude. CoRR abs/cs/0607132 (2006) - 2005
- [j124]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Forbidden (0, 1)-vectors in Hyperplanes of Rn: The unrestricted case. Des. Codes Cryptogr. 37(1): 151-167 (2005) - [j123]Rudolf Ahlswede:
Editorial Note. Electron. Notes Discret. Math. 21: 1-89 (2005) - [j122]Rudolf Ahlswede, Ella Aloyan, Evgueni A. Haroutunian:
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information. Electron. Notes Discret. Math. 21: 91-95 (2005) - [j121]Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe:
Information theoretic models in language evolution. Electron. Notes Discret. Math. 21: 97-100 (2005) - [j120]Rudolf Ahlswede, Harout K. Aydinian:
On diagnosability of large multiprocessor networks. Electron. Notes Discret. Math. 21: 101-104 (2005) - [j119]Rudolf Ahlswede, Harout K. Aydinian:
Sparse asymmetric connectors in communication networks. Electron. Notes Discret. Math. 21: 105-109 (2005) - [j118]Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich:
A Fast Suffix-Sorting Algorithm. Electron. Notes Discret. Math. 21: 111-114 (2005) - [j117]Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter:
Identification for Sources. Electron. Notes Discret. Math. 21: 115-118 (2005) - [j116]Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner:
T-shift synchronization codes. Electron. Notes Discret. Math. 21: 119-123 (2005) - [j115]Rudolf Ahlswede, Vladimir M. Blinovsky:
Correlation Inequalities in Function Spaces. Electron. Notes Discret. Math. 21: 125-127 (2005) - [j114]Rudolf Ahlswede, Vladimir M. Blinovsky:
Multiple Packing in Sum-type Metric Spaces. Electron. Notes Discret. Math. 21: 129-131 (2005) - [j113]Rudolf Ahlswede, Ning Cai:
A Kraft-type inequality for d-delay binary search codes. Electron. Notes Discret. Math. 21: 133-136 (2005) - [j112]Rudolf Ahlswede, Ning Cai:
A Strong Converse Theorem for Quantum Multiple Access Channels. Electron. Notes Discret. Math. 21: 137-141 (2005) - [j111]Rudolf Ahlswede, Ning Cai:
Codes with the identifiable parent property and the multiple-access channel. Electron. Notes Discret. Math. 21: 143-147 (2005) - [j110]Rudolf Ahlswede, Ning Cai:
Search with noisy and delayed response. Electron. Notes Discret. Math. 21: 149-154 (2005) - [j109]Rudolf Ahlswede, Ning Cai:
Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder. Electron. Notes Discret. Math. 21: 155-159 (2005) - [j108]Rudolf Ahlswede, Ning Cai:
Watermarking Identification Codes with Related Topics on Common Randomness. Electron. Notes Discret. Math. 21: 161-165 (2005) - [j107]Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang:
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers. Electron. Notes Discret. Math. 21: 167-168 (2005) - [j106]Rudolf Ahlswede, Julien Cassaigne, András Sárközy:
On the correlation of binary sequences. Electron. Notes Discret. Math. 21: 169-171 (2005) - [j105]Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe:
Searching with lies under error transition cost constraints. Electron. Notes Discret. Math. 21: 173-179 (2005) - [j104]Rudolf Ahlswede:
General theory of information transfer. Electron. Notes Discret. Math. 21: 181-184 (2005) - [j103]Rudolf Ahlswede, Evgueni A. Haroutunian:
Testing of Hypothesis and Identification. Electron. Notes Discret. Math. 21: 185-189 (2005) - [j102]Rudolf Ahlswede:
Identification Entropy. Electron. Notes Discret. Math. 21: 191-192 (2005) - [j101]Rudolf Ahlswede, Levon H. Khachatrian:
On attractive and friendly sets in sequence spaces. Electron. Notes Discret. Math. 21: 193-198 (2005) - [j100]Rudolf Ahlswede, Christian Mauduit, András Sárközy:
Large families of pseudorandom sequences of k symbols and their complexity, Part II. Electron. Notes Discret. Math. 21: 199-201 (2005) - [j99]Rudolf Ahlswede, Christian Mauduit, András Sárközy:
Large families of pseudorandom sequences of k symbols and their complexity, Part I. Electron. Notes Discret. Math. 21: 203-204 (2005) - [j98]Rudolf Ahlswede, Mark S. Pinsker:
Report on models of write-efficient memories with localized errors and defects. Electron. Notes Discret. Math. 21: 205-207 (2005) - [j97]Rudolf Ahlswede:
Ratewise-optimal non-sequential search strategies under cardinality constraints on the tests. Electron. Notes Discret. Math. 21: 209-210 (2005) - [j96]Rudolf Ahlswede, Alexander A. Yudin:
On partitions of a rectangle into rectangles with restricted number of cross sections. Electron. Notes Discret. Math. 21: 211-212 (2005) - [j95]Rudolf Ahlswede, Zhen Zhang:
Estimating with randomized encoding the joint empirical distribution in a correlated source. Electron. Notes Discret. Math. 21: 213-218 (2005) - 2004
- [j94]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
On Shadows Of Intersecting Families. Comb. 24(4): 555-566 (2004) - [j93]Rudolf Ahlswede, Levon H. Khachatrian:
Katona's Intersection Theorem: Four Proofs. Comb. 25(1): 105-110 (2004) - [j92]Rudolf Ahlswede, Ning Cai:
On Lossless Quantum Data Compression With a Classical Helper. IEEE Trans. Inf. Theory 50(6): 1208-1219 (2004) - [c1]Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe:
Language evolution and information theory. ISIT 2004: 139 - 2003
- [j91]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace. Comb. 23(1): 5-22 (2003) - [j90]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Forbidden (0, 1)-Vectors in Hyperplanes of Rn: The Restricted Case. Des. Codes Cryptogr. 29(1-3): 17-28 (2003) - [j89]