Rudolf Ahlswede | Academic Influence

Rudolf Ahlswede's AcademicInfluence.com Rankings

Rudolf Ahlswede

Mathematics

#1805

World Rank

#2886

Historical Rank

Measure Theory

#620

World Rank

#853

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Rudolf Ahlswede's Degrees

PhD Mathematics University of Bonn

Why Is Rudolf Ahlswede Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Rudolf F. Ahlswede was a German mathematician. Born in Dielmissen, Germany, he studied mathematics, physics, and philosophy. He wrote his Ph.D. thesis in 1966, at the University of Göttingen, with the topic "Contributions to the Shannon information theory in case of non-stationary channels". He dedicated himself in his further career to information theory and became one of the leading representatives of this area worldwide.

(See a Problem?)

Rudolf Ahlswede's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Network information flow (2000) (8389)
Common randomness in information theory and cryptography - I: Secret sharing (1993) (1204)
Multi-way communication channels (1973) (687)
Strong converse for identification via quantum channels (2000) (484)
Source coding with side information and a converse for degraded broadcast channels (1975) (439)
The Capacity Region of a Channel with Two Senders and Two Receivers (1974) (357)
The Complete Intersection Theorem for Systems of Finite Sets (1997) (342)
Elimination of correlation in random codes for arbitrarily varying channels (1978) (339)
Common Randomness in Information Theory and Cryptography - Part II: CR Capacity (1998) (297)
Founding Cryptography on Oblivious Transfer (2016) (291)
Identification via channels (1989) (235)
Hypothesis testing with communication constraints (1986) (225)
Search Problems (1987) (225)
Coloring hypergraphs: A new approach to multi-user source coding, 1 (1979) (169)
Bounds on conditional probabilities with applications in multi-user communication (1976) (164)
Spreading of Sets in Product Spaces and Hypercontraction of the Markov Operator (1976) (163)
The rate-distortion region for multiple descriptions without excess rate (1985) (162)
An inequality for the weights of two families of sets, their unions and intersections (1978) (149)
On source coding with side information via a multiple-access channel and related problems in multi-user information theory (1983) (147)
General Theory of Information Transfer and Combinatorics (2006) (142)
On Perfect Codes and Related Concepts (2001) (127)
Graphs with maximal number of adjacent pairs of edges (1978) (122)
The diametric theorem in Hamming spaces-optimal anticodes (1997) (113)
The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets (1996) (113)
Identification in the presence of feedback-A discovery of new capacity formulas (1989) (107)
Arbitrarily varying channels with states sequence known to the sender (1986) (104)
Contributions to the geometry of hamming spaces (1977) (94)
Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder (2005) (94)
A Note on the Existence of the Weak Capacity for Channels with Arbitrarily Varying Channel Probability Functions and Its Relation to Shannon's Zero Error Capacity (1970) (67)
An elementary proof of the strong converse theorem for the multiple-access channel (1982) (64)
Coding for Write-Efficient Memory (1989) (59)
Good codes can be produced by a few permutations (1982) (59)
On Oblivious Transfer Capacity (2007) (56)
Optimal coding strategies for certain permuting channels (1987) (53)
Channel capacities for list codes (1973) (52)
Appendix: On Common Information and Related Characteristics of Correlated Information Sources (2006) (51)
A Pushing-Pulling Method: New Proofs of Intersection Theorems (1999) (49)
An identity in combinatorial extremal theory (1990) (47)
New directions in the theory of identification via channels (1995) (46)
Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels (2010) (45)
A complexity measure for families of binary sequences (2003) (44)
The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet (1970) (44)
Identification for Sources (2005) (43)
Edge isoperimetric theorems for integer point arrays (1995) (43)
Unidirectional error control codes and related combinatorial problems (2002) (43)
Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel (1999) (42)
Erasure, list, and detection zero-error capacities for low noise and a relation to identification (1994) (41)
Some properties of fix-free codes (1996) (40)
Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback (1973) (40)
Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels (1971) (40)
General theory of information transfer: Updated (2008) (39)
On communication complexity of vector-valued functions (1994) (37)
Classical Capacity of Classical-Quantum Arbitrarily Varying Channels (2007) (37)
Identification via compressed data (1994) (37)
Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True (1997) (37)
A method of coding and its application to arbitrarily varying channels (1980) (37)
On error control codes for random network coding (2009) (36)
Lectures on advances in combinatorics (2008) (35)
Certain results in coding theory for compound channels (1967) (35)
On minimax estimation in the presence of side information about remote data (1990) (34)
On two-way communication channels and a problem by Zarankiewicz (1973) (34)
On the connection between the entropies of input and output distributions of discrete memoryless channels (1977) (33)
Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding" (2006) (32)
On q-ary codes correcting all unidirectional errors of a limited magnitude (2006) (32)
Quantum data processing (1999) (31)
On identification via multiway channels with feedback (1991) (31)
To get a bit of information may be as hard as to get full information (1981) (30)
Correlated sources help transmission over an arbitrarily varying channel (1997) (29)
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I (2006) (29)
Inequalities for a pair of mapsS×S→S withS a finite set (1979) (28)
Correlated Decoding for Channels with Arbitrarily Varying Channel Probability Functions (1969) (27)
On multiple descriptions and team guessing (1986) (26)
Extremal properties of rate distortion functions (1990) (26)
On cloud-antichains and related configurations (1990) (26)
On Concepts of Performance Parameters for Channels (2006) (26)
Fault-tolerant minimum broadcast networks (1996) (25)
A constructive proof of the coding theorem for discrete memoryless channels with feedback (1973) (24)
Two proofs of Pinsker's conjecture concerning arbitrarily varying channels (1991) (24)
Universal coding of integers and unbounded search trees (1995) (23)
Simple hypergraphs with maximal number of adjacent pairs of edges (1980) (23)
On extremal sets without coprimes (1994) (22)
Maximal sets of numbers not containing k+1 pairwise coprime integers (1995) (22)
On diagnosability of large multiprocessor networks (2005) (22)
Non-binary error correcting codes with noiseless feedback, localized errors, or both (2006) (22)
Watermarking Identification Codes with Related Topics on Common Randomness (2005) (21)
A general 4-words inequality with consequences for 2-way communication complexity (1989) (21)
A splitting property of maximal antichains (1995) (21)
On multiuser write-efficient memories (1994) (20)
Messy Broadcasting In Networks (1994) (20)
Every bad code has a good subcode: A local converse to the coding theorem (1976) (20)
Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace (2003) (19)
The weak capacity of averaged channels (1968) (19)
Nonbinary codes correcting localized errors (1993) (19)
General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods (1997) (19)
A two-family extremal problem in hamming space (1984) (19)
The structure of capacity functions for compound channels (1969) (19)
On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification (2006) (19)
Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true (1997) (18)
Bounds on Algebraic Code Capacities for Noisy Channels. I (1971) (17)
Creating Order in Sequence Spaces with Simple Machines (1990) (17)
Bounds on Algebraic Code Capacities for Noisy Channels. II (1971) (17)
The Intersection Theorem for Direct Products (1998) (17)
Sets of integers and quasi-integers with pairwise common divisor (1996) (17)
Identification under random processes (1996) (16)
The maximal error capacity of arbitrarily varying channels for constant list sizes (1993) (16)
Identification Entropy (2005) (16)
Advances on Extremal Problems in Number Theory and Combinatorics (2001) (16)
The Asymptotic Behavior of Diameters in the Average (1994) (16)
A generalization of the AZ identity (1993) (15)
The AVC with noiseless feedback and maximal error probability : A capacity formula with a trichotomy (2006) (15)
Zero-error capacity for models with memory and the enlightened dictator channel (1997) (15)
Addendum to "Strong converse for identification via quantum channels" (2003) (15)
Searching with lies under error cost constraints (2008) (15)
Communication complexity in lattices (1993) (14)
Channels without synchronization (1971) (14)
Incomparability and Intersection Properties of Boolean Interval Lattices and Chain Posets (1996) (14)
Shadows and isoperimetry under the sequence-subsequence relation (1997) (13)
Rich colorings with local constraints (1992) (13)
More about shifting techniques (2003) (13)
Identification without randomization (1999) (13)
Two Batch Search With Lie Cost (2009) (13)
Bad codes are good ciphers (1982) (13)
General Theory of Information Transfer and Combinatorics (Lecture Notes in Computer Science) (2007) (13)
Threshold and Majority Group Testing (2013) (12)
Large families of pseudorandom sequences of k symbols and their complexity, Part II (2005) (12)
General theory of information transfer (2005) (12)
Remarks on Shannon's secrecy systems (1982) (12)
Intersection Graphs of Rectangles and Segments (2006) (12)
Katona’s Intersection Theorem: Four Proofs (2004) (12)
On the optimal structure of recovering set pairs in lattices: the sandglass conjecture (1994) (12)
On security of statistical databases (2006) (12)
General Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographical Solutions (1997) (11)
An Interpretation of Identification Entropy (2006) (11)
On code pairs with specified Hamming distances (1987) (11)
A new direction in extremal theory (1994) (11)
Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission (1997) (11)
On the correlation of binary sequences (2005) (11)
Large families of pseudorandom sequences of k symbols and their complexity, Part I (2005) (11)
Transmitting and Gaining Data: Rudolf Ahlswede’s Lectures on Information Theory 2 (2014) (11)
On lossless quantum data compression with a classical helper (2004) (11)
Parallel error correcting codes (2002) (10)
Approximation of continuous functions in p-adic analysis (1975) (10)
The capacity of a channel with arbitrarily varying additive Gaussian channel probability functions (1973) (10)
A Counterexample to Kleitman's Conjecture Concerning an Edge-Isoperimetric Problem (1999) (10)
Storing and Transmitting Data (2014) (9)
Error Control Codes for Parallel Asymmetric Channels (2006) (9)
On the Counting Function of Primitive Sets of Integers (1999) (9)
Counterexample to the Frankl-Pach conjecture for uniform, dense families (1997) (9)
Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs (2006) (9)
Inequalities for Code Pairs (1988) (9)
Extremal problems under dimension constraints (2001) (9)
Localized random and arbitrary errors in the light of arbitrarily varying channel theory (1995) (9)
Higher level extremal problems (1996) (9)
Bounds for threshold and majority group testing (2011) (9)
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information (2006) (8)
A General Theory of Information Transfer (1993) (8)
Towards a General Theory of Information Transfer (2006) (8)
The final form of Tao's inequality relating conditional expectation and conditional mutual information (2006) (8)
Codes with the Identifiable Parent Property and the Multiple-Access Channel (2005) (8)
Sets of integers with pairwise common divisor and a factor from a specified set of primes (1996) (8)
Binary constant-weight codes correcting localized errors and defects (1994) (8)
A Strong Converse Theorem for Quantum Multiple Access Channels (2005) (8)
Two contributions to information theory (1975) (8)
Reusable memories in the light of the old arbitrarily varying-and a new outputwise varying channel theory (1991) (7)
Contributions to a theory of ordering for sequence spaces (1989) (7)
Number theoretic correlation inequalities for Dirichlet densities (1997) (7)
Coding for Write{eecient Memory (1989) (7)
The maximal length of cloud-antichains (1994) (7)
Cone Dependence—A Basic Combinatorial Concept (2003) (7)
Integral inequalities for increasing functions (1979) (7)
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information (2005) (7)
Finding one of D defective elements in some group testing models (2012) (7)
Optimal pairs of incomparable clouds in multisets (1996) (7)
Models of Multi-User Write-Efficient Memories and General Diametric Theorems (1997) (7)
Improvements of Winograd's result on computation in the presence of noise (1984) (7)
Intersecting Systems (1997) (7)
Isoperimetric theorems in the binary sequences of finite lengths (1998) (7)
Large Deviations in Quantum Information Theory (2003) (7)
On Extremal Set Partitions in Cartesian Product Spaces (1993) (7)
Ratewise-optimal non-sequential search strategies under constraints on the tests (2008) (6)
On Generic Erasure Correcting Sets and Related Problems (2011) (6)
Two-way communication complexity of sum-type functions for one processor to be informed (1994) (6)
Information and control: matching channels (1997) (6)
The AVC with noiseless feedback and maximal error probability: a capacity formula with a trichotomy (1997) (6)
THE NUMBER OF VALUES OF COMBINATORIAL FUNCTIONS (1979) (6)
Random Network Coding (2018) (6)
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part II (2006) (6)
On Set Coverings In Cartesian Product Spaces (1992) (6)
Erasure, list and detection zero-error capacities for low noise and a relation to identification (1994) (6)
On Partitioning and Packing Products with Rectangles (1994) (5)
Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes (2006) (5)
On the Hamming bound for nonbinary localized-error-correcting codes (1999) (5)
Note on an extremal problem arising for unreliable networks in parallel computing (1983) (5)
Splitting Properties in Partially Ordered Sets and Set Systems (2000) (5)
Density Inequalities for Sets of Multiples (1995) (5)
Testing of Hypothesis and Identification (2005) (5)
Multiple packing in sum-type metric spaces (2005) (4)
Sparse asymmetric connectors in communication networks (2005) (4)
Probabilistic Methods and Distributed Information (2018) (4)
On interactive communication (1994) (4)
T-shift synchronization codes (2005) (4)
Intersection theorems under dimension constraints (2006) (4)
Forbidden (0,1)-Vectors in Hyperplanes of ℝn: The Restricted Case (2003) (4)
Transmitting and gaining data (2015) (4)
Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback (2002) (4)
On Prefix-Free and Suffix-Free Sequences of Integers (2000) (4)
On Maximal Shadows of Members in Left-compressed Sets (1999) (4)
The t-intersection Problem in the Truncated Boolean Lattice (2002) (3)
Another diametric theorem in Hamming spaces: optimal group anticodes (2006) (3)
Asymptotically dense nonbinary codes correcting a constant number of localized errors [Manuskript] (1993) (3)
Eight Problems in Information Theory (1987) (3)
The Entropy as a Measure of Uncertainty (2014) (3)
Storing and Transmitting Data: Rudolf Ahlswede’s Lectures on Information Theory 1 (2014) (3)
On Multi{user Write{eecient Memories (1994) (3)
Construction of asymmetric connectors of depth two (2006) (3)
Two Proofs Of Pinser's Conjecture Concerning AV Channels (1991) (3)
Searching with lies under error transition cost constraints (2005) (3)
On partitions of a rectangle into rectangles with restricted number of cross sections (2005) (3)
A counterexample to Aharoni's strongly maximal matching conjecture (1996) (3)
Correction to bounds on conditional probabilities with applications (1977) (3)
Hiding Data - Selected Topics (2016) (3)
On the quotient sequence of sequences of integers (1999) (3)
A Diametric Theorem in Z nm for Lee and Related Distances (2008) (3)
Majority group testing with density tests (2011) (3)
Towards characterizing equality in correlation inequalities (1995) (3)
On the density of primitive sets (2004) (3)
On Bohman's conjecture related to a sum packing problem of Erdös (2004) (3)
Code pairs with specified parity of the Hamming distances (1997) (3)
Asymptotically optimal binary codes of polynomial complexity correcting localized errors (1995) (2)
Classical Results on Primitive and Recent Results on Cross-Primitive Sequences (2013) (2)
A Diametric Theorem for Edges (2000) (2)
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer (2006) (2)
Extremal Properties of Rate-Distortion Functions (2018) (2)
A counterexample in rate-distortion theory for correlated sources (1999) (2)
Identification via wiretap channels (1994) (2)
Jacob Wolfowitz (1910-1981) (1982) (2)
On Shadows Of Intersecting Families (2004) (2)
Shadows under the word-subword relation (2012) (2)
New Construction of Error-Tolerant Pooling Designs (2013) (2)
Arbitrarily varying multiple-access channels. II. Correlated sender's side information, correlated messages, and ambiguous transmission (1997) (2)
Every channel with time structure has a capacity sequence (2010) (2)
Partitioning the n-cube into sets with mutual distance 1 (1993) (2)
Entanglement transmission over arbitrarily varying quantum channels (2010) (2)
On Lossless Quantum Data Compression and Quantum Variable‐Length Codes (2005) (2)
Report on work in progress in combinatorial extremal theory: Shadows, AZ-identity, matching (1996) (2)
The Slepian-Wolf Theorem for Individual Sequences (2018) (2)
Maximal antichains under dimension constraints (2003) (2)
Asymptotical isoperimetric problem (1999) (2)
Maximal number of constant weight vertices of the unit n-cube contained in a k-dimensional subspace (2000) (2)
An Isoperimetric Theorem for Sequences Generated by Feedback and Feedback-Codes for Unequal Error Protection (2001) (2)
Ergodic Theory and Encoding of Individual Sequences (2018) (2)
Estimating with randomized encoding the joint empirical distribution in a correlated source (2005) (2)
Orthogonal Polynomials in Information Theory (2018) (2)
A Fast Suffix-Sorting Algorithm (2005) (1)
On sets of words with pairwise common letter in different positions (1994) (1)
The Role Of Common Randomness In Information Theory And Cryptography, Part 1: Secrecy Constraints (1991) (1)
Combinatorial Methods and Models (2018) (1)
On primitive sets of squarefree integers (2001) (1)
Entanglement Transmission under Adversarially Selected Quantum Noise (2010) (1)
Combinatorial Methods and Models: Rudolf Ahlswede's Lectures on Information Theory 4 (2017) (1)
Shadows under the word-subword relation (2012) (1)
Covering, Coloring, and Packing Hypergraphs (2018) (1)
06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006) (1)
A General Model Of Information Transfer (1991) (1)
Coding for channels with localized errors: The non-binary cases (1990) (1)
On the number of step functions with restrictions (2006) (1)
Information theoretic models in language evolution (2005) (1)
Rank formulas for certain products of matrices (1993) (1)
Elliptic Curve Cryptosystems (2016) (1)
A Recursive Bound for the Number of Complete K-Subgraphs of a Graph (1990) (1)
Cross-Disjoint Pairs of Clouds in the Interval Lattice (2013) (1)
Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels (2012) (1)
Combinatorics, Geometry and Probability: On Extremal Set Partitions in Cartesian Product Spaces (1997) (1)
A Complexity Problem (1987) (1)
On ObliviousTransfer Capacity (2007) (0)
Search with Noisy and Delayed Responses (2006) (0)
On Sliding-Block Codes (2015) (0)
A Short Course on Cryptography (2016) (0)
Appendix to Part I: The AVC and AVWC (2018) (0)
On the Advantage of Network Coding (2018) (0)
Appendix: Solution of Burnashev's Problem and a Sharpening of the Erdös/Ko/Rado Theorem (2006) (0)
Arbitrarily Varying Channels with Worst Channels (2018) (0)
Codes as Orbits (1987) (0)
Random Correlated Codes for the AVC and the Compound Channels (2018) (0)
Advanced Problems: 6288-6290 (1980) (0)
On \lambda -Capacities and Information Stability (2015) (0)
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers (2005) (0)
Information Theory and Some Friendly Neighbors - Ein Wunschkonzert (2006) (0)
The Mathematical Background of the Advanced Encryption Standard (2016) (0)
09281 Abstracts Collection - Search Methodologies (2009) (0)
Appendix: On Set Coverings in Cartesian Product Spaces (2006) (0)
for Sequences Generated by Feedback and Feedback-Codes for Unequal Error Protection (2001) (0)
NOTE C0UNTERE~AMPLE TO TiiE FRANKL-PACH CONJECTURE FOR UNIFORM, DENSE FAMILIES (1997) (0)
Coding Theorems and Converses for the DMC (2014) (0)
The Restricted Word Shadow Problem (2013) (0)
Packing: Combinatorial Models for Various Types of Errors (2018) (0)
Special issue: General theory of information transfer and combinatorics - Preface (2008) (0)
Nonstandard coding method for nonbinary codes correcting localized errors (1999) (0)
Channels with Infinite Alphabets (2015) (0)
Arbitrarily Varying Source (2018) (0)
Covering, Packing, and List Codes (2008) (0)
Conventions and Auxiliary Results (2008) (0)
Edge-isoperimetric inequalities .1. Information-theoretical methods (1997) (0)
Arbitrarily Varying Channels w ith States (1998) (0)
A Kraft-type inequality for d-delay binary search codes (2005) (0)
Finding one of D defective elements in some group testing models (2012) (0)
Finding CNRI(W), the Identification Capacity of the AVC W, if Randomization in the Encoding Is Excluded (2006) (0)
Outputwise Varying Channels - A General Model For Memories (1991) (0)
On attractive and friendly sets in sequence spaces (2005) (0)
Classical Work: Edge-Disjoint Branchings, Min-Max Theorems, and Shortest Connection Networks (2018) (0)
Bibliography of publications by Rudolf Ahlswede (2013) (0)
Authentication and Secret-Key Cryptology (2016) (0)
More than restoring strings of symbols transmitted means transfer today (2006) (0)
Correlation Inequalities in Function Spaces (2005) (0)
\(\beta \)-Biased Estimators in Data Compression (2015) (0)
Network Coding (2018) (0)
Applications and Related Problems (2018) (0)
Dedicated to Mark Pinsker on his 70th birthday) (1998) (0)
Towards Capacity Functions (2014) (0)
Capacity of Quantum Arbitrarily Varying Channels (2006) (0)
6 On Lossless Quantum Data Compression and Quantum Variable – Length Codes (2006) (0)
Shannon’s Model for Continuous Transmission (2015) (0)
Report on models of write-efficient memories with localized errors and defects (2005) (0)
Forbidden (0,1)-vectors in Hyperplanes of $$\mathbb{R}^{n}$$: The unrestricted case (2005) (0)
Results for Classical Extremal Problems (2018) (0)
VIII An Outside Opinion (2006) (0)
Coding for the Multiple-Access Channel: The Combinatorial Model (2018) (0)
Codes Produced by Permutations: The Link Between Source and Channel Coding (2018) (0)
06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006) (0)
An Outside Opinion (2006) (0)
Estimation Under Communication Constraints (2018) (0)
Search with noisy and delayed response (2005) (0)
Selected Topics of Information Theory and Mathematical Statistics (2015) (0)
Higher Level and Dimension Constrained Extremal Problems (2008) (0)
Language evolution and information theory (2004) (0)
Multiple Descriptions (2018) (0)
Identification via compressed data (1995) (0)
Rudolf Ahlswede - From 60 to 66 (2006) (0)
Basic Problems from Combinatorial Number Theory (2008) (0)
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 3 On security of statistical databases (2006) (0)
Communication complexity in lattices [Manuskript] (1993) (0)
LYM-Related AZ-Identities, Antichain Splittings and Correlation Inequalities (2008) (0)
Non-standard Decoders (2018) (0)
Distributive Information Storage (2018) (0)
Elimination and Robustification Techniques (2018) (0)
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006 (2006) (0)
Ratewise-optimal non-sequential search strategies under cardinality constraints on the tests (2005) (0)
Feedback and Correlated Sources (2018) (0)
Interactive Communication, Diagnosis and Error Control in Networks (2009) (0)
A Wringing Method: An Elementary Proof of the Strong Converse Theorem for Multiple-Access Channels (2018) (0)
The AVC with noiseless feedback (2000) (0)
Intersection and Diametric Problems (2008) (0)
Book reviews (1986) (0)
Abstracts Collection Search Methodologies Dagstuhl Seminar (2009) (0)
Hypothesis Testing Under Communication Constraints (2018) (0)
Algorithms for Computing Channel Capacities and Rate-Distortion Functions (2015) (0)

This paper list is powered by the following services:

Other Resources About Rudolf Ahlswede

en.wikipedia.org

What Schools Are Affiliated With Rudolf Ahlswede?

Rudolf Ahlswede is affiliated with the following schools:

Image Attributions

Image Source for Rudolf Ahlswede