206 Publikationen
-
-
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656530R. Ahlswede, C. Deppe, and V. Lebedev, “Threshold and Majority Group Testing”, Information Theory, Combinatorics, and Search Theory, H. Aydinian, F. Cicalese, and C. Deppe, eds., Lecture Notes in Computer Science, vol. 7777, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp.488-508.PUB | DOI
-
-
-
-
-
-
-
-
2008 | Sonderausgabe Zeitschrift | Veröffentlicht | PUB-ID: 2450290R. Ahlswede, N. Cai, and L. Bäumer, eds., “General theory of information transfer and combinatorics”, Discrete applied mathematics, vol. 156, 2008.PUB
-
-
-
-
-
-
-
2007 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1595873R. Ahlswede and V. Blinovsky, “Classical capacity of classical-quantum arbitrarily varying channels”, IEEE Transactions on Information Theory, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 53, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2007, pp.526-533.PUB | DOI | WoS
-
-
2006 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2449061R. Ahlswede, et al., eds., General theory of information transfer and combinatorics, Lecture notes in computer science, vol. 4123, Berlin: Springer, 2006.PUB
-
-
-
-
2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656516R. Ahlswede, et al., “Information Theoretic Models in Language Evolution”, General Theory of Information Transfer and Combinatorics, R. Ahlswede, et al., eds., Lecture Notes in Computer Science, vol. 4123, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp.769-787.PUB | DOI
-
2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656503R. Ahlswede, et al., “A Fast Suffix-Sorting Algorithm”, General Theory of Information Transfer and Combinatorics, R. Ahlswede, et al., eds., Lecture Notes in Computer Science, vol. 4123, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp.719-734.PUB | DOI
-
-
-
-
-
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913091R. Ahlswede, C. Deppe, and V. Lebedev, “Non-binary error correcting codes with noiseless feedback, localized errors, or both”, Annals of the European Academy of Sciences, vol. 1, 2005, pp. 285-309.PUB
-
-
-
-
-
-
-
-
-
-
-
2003 | Zeitschriftenaufsatz | PUB-ID: 1882110A. Winter and R. Ahlswede, “Addendum to: "Strong converse for identification via quantum channels"”, IEEE Trans. Inform. Theory, vol. 49, 2003, pp. 346-346.PUB
-
2003 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1878790R. Ahlswede and N. Cai, “On lossless quantum data compression and quantum variable-length codes”, Quantum Information Processing, G. Leuchs and T. Beth, eds., Weinheim: Wiley-VCH, 2003, pp.66-78.PUB
-
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913390R. Ahlswede, et al., “A complexity measure for families of binary sequences”, Periodica Mathematica Hungarica, vol. 46, 2003, pp. 107-118.PUB
-
2003 | Zeitschriftenaufsatz | PUB-ID: 1913395R. Ahlswede and V. Blinovski, “Large deviations in quantum information theory”, Problems of Information Transmission, vol. 39, 2003, pp. 373-379.PUB
-
-
-
-
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1878792R. Ahlswede, H. Aydinian, and L. Khachatrian, “Unidirectional error control codes and related combinatorial problems”, Proceedings of Eight International Workshop on Algebraic and Combinatorial Coding Theory, vol. 2002, 2002, pp. 6-9.PUB
-
-
-
-
2001 | Sammelwerksbeitrag | PUB-ID: 1883914R. Ahlswede, “Advances on extremal problems in number theory and combinatorics”, European Congress of Mathematics : Barcelona, July 10 - 14, 2000, C. Casacuberta, ed., Progress in Mathematics, vol. 201, Basel: Birkhäuser, 2001, pp.147-175.PUB
-
-
-
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883897R. Ahlswede, L.H. Khachatrian, and A. Sárközy, “On prefix-free and suffix-free sequences of integers”, Numbers, Information and Complexity, I. Althöfer, et al., eds., Boston: Kluwer Acad. Pub., 2000, pp.1-16.PUB
-
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883900R. Ahlswede and N. Cai, “The AVC with noiseless feedback”, Numbers, Information and Complexity, I. Althöfer, et al., eds., Boston: Kluwer Academic, 2000, pp.151-176.PUB
-
-
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883895R. Ahlswede and L.H. Khachatrian, “Splitting properties in partially ordered sets and set systems”, Numbers, Information and Complexity, I. Althöfer, et al., eds., Boston: Kluwer Acad. Pub., 2000, pp.29-44.PUB
-
-
-
-
-
-
-
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883892L. Bassalygo, M. Pinsker, and R. Ahlswede, “On the Hamming bound for nonbinary localized-error-correcting codes”, Probl. of Inf. Transmission, vol. 35, 1999, pp. 117-124.PUB
-
-
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1623405R. Ahlswede and N. Cai, “Arbitrarily varying multiple-access channels - Part II: Correlated senders' side information, correlated messages, and ambiguous transmission”, IEEE Transactions on Information Theory, vol. 45, 1999, pp. 749-756.PUB | DOI | WoS
-
-
-
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913368R. Ahlswede and Z. Zhang, “Asymptotical isoperimetric problem”, Presented at the Proceedings 1999 IEEE ITW, Krüger National Park, South Africa, 1999.PUB
-
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913370R. Ahlswede, L.A. Bassalygo, and M.S. Pinsker, “Nonstandard coding method for nonbinary codes correcting localized errors”, Presented at the Proceedings 1999 IEEE ITW, Krüger National Park, South Africa, 1999.PUB
-
-
1998 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1626601R. Ahlswede and I. Csiszar, “Common randomness in information theory and cryptography - Part II: CR capacity”, IEEE Transactions on Information Theory, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 44, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 1998, pp.225-240.PUB | DOI | WoS
-
-
-
-
-
-
-
-
-
-
-
1997 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1628236R. Ahlswede, E.-H. Yang, and Z. Zhang, “Identification via compressed data”, IEEE Transactions on Information Theory, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 43, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 1997, pp.48-70.PUB | DOI | WoS
-
-
-
-
-
-
-
1996 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1913322R. Ahlswede and N. Cai, “Cross-disjoint pairs of clouds in the interval lattice”, The Mathematics of Paul Erdos, Vol. I, R.L. Graham and J. Nesetril, eds., Berlin/Heidelberg/New York: Springer Verlag, 1996, pp.155-164.PUB
-
-
-
-
-
-
-
-
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913328R. Ahlswede and V. Balakirsky, “Identification under random processes”, Problems of Information Transmission, vol. 32, 1996, pp. 123-138.PUB
-
1996 | Preprint | Veröffentlicht | PUB-ID: 1913331R. Ahlswede, “Report on work in progress in combinatorial extremal theory: Shadows, AZ-identity, matching”, Ergänzungsreihe des SFB 343 ``Diskrete Strukturen in der Mathematik'', vol. 95-004, 1996.PUB
-
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913343R. Ahlswede, et al., “Intersecting Systems”, Combinatorics, Probability and Computing, vol. 6, 1996, pp. 127-137.PUB
-
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913355R. Ahlswede, N. Cai, and Z. Zhang, “Higher level extremal problems”, Comb. Inf. & Syst. Sc., vol. 21, 1996, pp. 185-210.PUB
-
1996 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1913333R. Ahlswede and L. Khachatrian, “Classical results on primitive and recent results on cross-primitive sequences”, The Mathematics of Paul Erdos, Vol. I, R.L. Graham and J. Nesetril, eds., vol. I, Berlin/Heidelberg/New York: Springer Verlag, 1996, pp.104-116.PUB
-
1996 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913352R. Ahlswede, B. Balkenhol, and L. Khachatrian, “Some properties of fix-free codes”, Presented at the Proc. 1st Int. Seminar on Coding Theory and Combinatorics, Thahkadzor, Armenia, Thahkadzor, Armenia: 1996.PUB
-
-
-
-
-
-
-
-
-
1994 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780546R. Ahlswede, H.S. Haroutunian, and L.H. Khachatrian, “Messy broadcasting in networks”, Communications and cryptography: two sides of one tapestry, R.E. Blahut, ed., The Kluwer international series in engineering and computer science, vol. 276, Boston [u.a.]: Kluwer, 1994, pp.13-24.PUB | PDF
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
1990 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780506R. Ahlswede, N. Cai, and Z. Zhang, “A recursive bound for the number of complete K-subgraphs of a graph”, Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel, R. Bodendiek and R. Henn, eds., Heidelberg: Physica-Verl., 1990, pp.37-39.PUB | PDF
-
-
-
-
-
-
-
-
-
-
-
1987 | Monographie | Veröffentlicht | PUB-ID: 1913125R. Ahlswede and I. Wegener, Search Problems, Wiley Interscience Series in Discrete Mathematics, Chichester : John Wiley & Sons Inc, 1987.PUB
-
-
-
-
-
-
-
-
-
1983 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780414R. Ahlswede and T.S. Han, “On source coding with side information via a multiple-access channel and related problems in multi-user information theory”, IEEE transactions on information theory, vol. 29, 1983, pp. 396-412.PUB | PDF | DOI | WoS
-
-
1982 | Monographie | Veröffentlicht | PUB-ID: 1913139R. Ahlswede and I. Wegener, Zadaci poiska, Moskau: MIR-Verlag, 1982.PUB
-
-
-
-
-
-
-
-
-
-
1979 | Monographie | Veröffentlicht | PUB-ID: 1913120R. Ahlswede and I. Wegener, Suchprobleme, Teubner, 1979.PUB
-
-
-
-
-
-
-
-
1977 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780380R. Ahlswede and J. Körner, “On the connection between the entropies of input and output distributions of discrete memoryless channels”, Proceedings of the fifth Conference on Probability Theory, Bucuresti: Ed. Acad. Republicii Socialiste România, 1977, pp.13-22.PUB | PDF
-
-
-
-
1976 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774856R. Ahlswede, P. Gács, and J. Körner, “Bounds on conditional probabilities with applications in multi-user communication”, Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol. 34, 1976, pp. 157-177.PUB | PDF | DOI | WoS
-
-
-
-
-
-
-
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780373R. Ahlswede, “A constructive proof of the coding theorem for discrete memoryless channels with feedback”, Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes: held at Prague, from September 19 to 25, 1971, J. Kozesník, ed., München: Verl. Dokumentation [u.a.], 1973, pp.39-50.PUB | PDF
-
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780372R. Ahlswede, “On two-way communication channels and a problem by Zarankiewicz”, Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes: held at Prague, from September 19 to 25, 1971, J. Kozesník, ed., München: Verl. Dokumentation [u.a.], 1973, pp.23-37.PUB | PDF
-
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780374R. Ahlswede, “The capacity of a channel with arbitrarily varying additive Gaussian channel probability functions”, Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes: held at Prague, from September 19 to 25, 1971, J. Kozesník, ed., München: Verl. Dokumentation [u.a.], 1973, pp.13-21.PUB | PDF
-
-
-
-
-
-
1970 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781084R. Ahlswede, “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”, The annals of mathematical statistics, vol. 41, 1970, pp. 1027-1033.PUB | PDF
-
1970 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774851R. Ahlswede and J. Wolfowitz, “The capacity of a channel with arbitrarily varying channel probability functions and binary output”, Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 15, 1970, pp. 186-194.PUB | PDF | DOI | WoS
-
-
1969 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1775145R. Ahlswede and J. Wolfowitz, “The structure of capacity functions for compound channels”, Probability and information theory, M. Behara, ed., Lecture notes in mathematics ; 89,1, vol. vol. 1: Proceedings of the international symposium at McMaster University, Canada, April 1968, Berlin: Springer, 1969, pp.12-54.PUB | PDF
-
-
-
1967 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780342R. Ahlswede, “Certain results in coding theory for compound channels”, Proceedings of the Colloquium on Information Theory, A. Rényi, ed., Colloquia mathematica Societatis János Bolyai / Bolyai Janos Matematikai Tarsulat ; 1, Budapest: 1967, pp.35-60.PUB | PDF