Conferences in DBLP
(gtitc) Rudolf Ahlswede Introduction. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede Rudolf Ahlswede - From 60 to 66. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede Information Theory and Some Friendly Neighbors - Ein Wunschkonzert. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Bernhard Balkenhol , Christian Kleinewächter Identification for Sources. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Kleinewächter On Identification. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Bäumer Identification and Prediction. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Ning Cai Watermarking Identification Codes with Related Topics on Common Randomness. [Citation Graph (0, 0)][DBLP ] Conf ] Ashot N. Harutyunyan Notes on Conditions for Successive Refinement of Information. [Citation Graph (0, 0)][DBLP ] Conf ] Bálint Laczay Coding for the Multiple-Access Adder Channel. [Citation Graph (0, 0)][DBLP ] Conf ] Mariam E. Haroutunian Bounds of E -Capacity for Multiple-Access Channel with Random Parameter. [Citation Graph (0, 0)][DBLP ] Conf ] Sándor Csibi , Edward C. von der Meulen Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Ning Cai Codes with the Identifiable Parent Property and the Multiple-Access Channel. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Ning Cai Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder. [Citation Graph (0, 0)][DBLP ] Conf ] Zhaozhi Zhang A Simplified Method for Computing the Key Equivocation for Additive-Like Instantaneous Block Encipherers. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Ning Cai , Zhaozhi Zhang Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Christian Mauduit , András Sárközy Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Christian Mauduit , András Sárközy Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part II. [Citation Graph (0, 0)][DBLP ] Conf ] Katalin Gyarmati On a Fast Version of a Pseudorandom Generator. [Citation Graph (0, 0)][DBLP ] Conf ] Joël Rivat , András Sárközy On Pseudorandom Sequences and Their Application. [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail B. Malyutov Authorship Attribution of Texts: A Review. [Citation Graph (0, 0)][DBLP ] Conf ] Armin Uhlmann Raum-Zeit und Quantenphysik - Ein Geburtstagsständchen für Hans-Jürgen Treder. [Citation Graph (0, 0)][DBLP ] Conf ] Armin Uhlmann Quantum Information Transfer from One System to Another One. [Citation Graph (0, 0)][DBLP ] Conf ] Armin Uhlmann On Rank Two Channels. [Citation Graph (0, 0)][DBLP ] Conf ] Jozef Gruska Universal Sets of Quantum Information Processing Primitives and Their Optimal Use. [Citation Graph (0, 0)][DBLP ] Conf ] Erdal Arikan An Upper Bound on the Rate of Information Transfer by Grover's Oracle. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Ning Cai A Strong Converse Theorem for Quantum Multiple Access Channels. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Winter Identification Via Quantum Channels in the Presence of Prior Correlation and Feedback. [Citation Graph (0, 0)][DBLP ] Conf ] Melvyn B. Nathanson Additive Number Theory and the Ring of Quantum Integers. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Hampel The Proper Fiducial Argument. [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail B. Malyutov , Dmitry M. Malyutov On Sequential Discrimination Between Close Markov Chains. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Zheng Zhang Estimating with Randomized Encoding the Joint Empirical Distribution in a Correlated Source. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Ella Aloyan , Evgueni A. Haroutunian On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Evgueni A. Haroutunian On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Vladimir Blinovsky Correlation Inequalities in Function Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Harremoës Lower Bounds for Divergence in the Central Limit Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede Identification Entropy. [Citation Graph (0, 0)][DBLP ] Conf ] Vieri Benci , Stefano Galatolo Optimal Information Measures for Weakly Chaotic Dynamical Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Mark S. Pinsker Report on Models of Write-Efficient Memories with Localized Errors and Defects. [Citation Graph (0, 0)][DBLP ] Conf ] Kingo Kobayashi , Hiroyoshi Morita , Mamoru Hoshi Percolation on a k-Ary Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede On Concepts of Performance Parameters for Channels. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , János Körner Appendix: On Common Information and Related Characteristics of Correlated Information Sources. [Citation Graph (0, 0)][DBLP ] Conf ] Ferdinando Cicalese , Christian Deppe Q-Ary Ulam-Renyi Game with Constrained Lies. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Ning Cai Search with Noisy and Delayed Responses. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Ning Cai A Kraft-Type Inequality for d-Delay Binary Search Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Damaschke Threshold Group Testing. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Bernhard Balkenhol , Christian Deppe , Martin Fröhlich A Fast Suffix-Sorting Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Marina Kyureghyan Monotonicity Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Stefano Carpin Algorithmic Motion Planning: The Randomized Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Erdal Arikan , Lars Bäumer , Christian Deppe Information Theoretic Models in Language Evolution. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Harremoës , Flemming Topsøe Zipf's Law, Hyperbolic Distributions and Entropy Loss. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Apostolico , Matteo Comin , Laxmi Parida Bridging Lossy and Lossless Compression by Motif Pattern Discovery. [Citation Graph (0, 0)][DBLP ] Conf ] Arkadii G. D'yachkov , David Torney , Pavel A. Vilenkin , Scott White Reverse-Complement Similarity Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Elena V. Konstantinova On Some Applications of Information Indices in Chemical Graph Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Sergey G. Molodtsov Largest Graphs of Diameter 2 and Maximum Degree 6. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede An Outside Opinion. [Citation Graph (0, 0)][DBLP ] Conf ] 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". [Citation Graph (0, 0)][DBLP ] Conf ] Ilya Dumer , Mark S. Pinsker , Vyacheslav V. Prelov On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede Appendix: On Set Coverings in Cartesian Product Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Sergey V. Avgustinovich , Anastasia Yu. Vasil'eva Testing Sets for 1-Perfect Code. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Alexander Yudin On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Levon H. Khachatrian On Attractive and Friendly Sets in Sequence Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Bey Remarks on an Edge Isoperimetric Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Ning Cai Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede Appendix: Solution of Burnashev's Problem and a Sharpening of the Erdös/Ko/Rado Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Kalinowski Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Harout K. Aydinian Sparse Asymmetric Connectors in Communication Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede Finding C NRI W ), the Identification Capacity of the AVC W , if Randomization in the Encoding Is Excluded. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Ahlswede , Iskandar Karapetyan Intersection Graphs of Rectangles and Segments. [Citation Graph (0, 0)][DBLP ] Conf ] Erdal Arikan Cutoff Rate Enhancement. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Artmann Some Problems in Organic Coding Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Harout K. Aydinian Generalized Anticodes in Hamming Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir Blinovsky Two Problems from Coding Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Ning Cai Private Capacity of Broadcast Channels. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Elsholtz A Short Survey on Upper and Lower Bounds for Multidimensional Zero Sums. [Citation Graph (0, 0)][DBLP ] Conf ] Torleiv Kløve Binary Linear Codes That Are Optimal for Error Correction. [Citation Graph (0, 0)][DBLP ] Conf ] Kingo Kobayashi Capacity Problem of Trapdoor Channel. [Citation Graph (0, 0)][DBLP ] Conf ] Eduardo Sany Laber Hotlink Assignment on the Web. [Citation Graph (0, 0)][DBLP ] Conf ] Vasilij S. Lebedev The Rigidity of Hamming Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Uwe Leck A Conjecture in Finite Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Maciej Liskiewicz Multiparty Computations in Non-private Environments. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Nagaoka Some Mathematical Problems Related to Quantum Hypothesis Testing. [Citation Graph (0, 0)][DBLP ] Conf ] Faina I. Solov'eva Designs and Perfect Codes. [Citation Graph (0, 0)][DBLP ] Conf ] 