• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 83 matches

• 2006
• 
  Rudolf Ahlswede:
  Introduction. GTIT-C 2006: 1-44
• 
  Rudolf Ahlswede:
  Rudolf Ahlswede - From 60 to 66. GTIT-C 2006: 45-48
• 
  Rudolf Ahlswede:
  Information Theory and Some Friendly Neighbors - Ein Wunschkonzert. GTIT-C 2006: 49-50
• 
  Rudolf Ahlswede:
  Identification Entropy. GTIT-C 2006: 595-613
• 
  Rudolf Ahlswede:
  On Concepts of Performance Parameters for Channels. GTIT-C 2006: 639-663
• 
  Rudolf Ahlswede:
  An Outside Opinion. GTIT-C 2006: 858-860
• 
  Rudolf Ahlswede:
  Appendix: On Set Coverings in Cartesian Product Spaces. GTIT-C 2006: 926-937
• 
  Rudolf Ahlswede:
  Appendix: Solution of Burnashev's Problem and a Sharpening of the Erdös/Ko/Rado Theorem. GTIT-C 2006: 1006-1009
• 
  Rudolf Ahlswede:
  Finding C_NRI(W), the Identification Capacity of the AVC W, if Randomization in the Encoding Is Excluded. GTIT-C 2006: 1063
• 
  Rudolf Ahlswede, Harout K. Aydinian:
  Sparse Asymmetric Connectors in Communication Networks. GTIT-C 2006: 1056-1062
• 
  Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe:
  Information Theoretic Models in Language Evolution. GTIT-C 2006: 769-787
• 
  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
• 
  Rudolf Ahlswede, Vladimir M. Blinovsky:
  Correlation Inequalities in Function Spaces. GTIT-C 2006: 572-577
• 
  Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich:
  A Fast Suffix-Sorting Algorithm. GTIT-C 2006: 719-734
• 
  Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter:
  Identification for Sources. GTIT-C 2006: 51-61
• 
  Rudolf Ahlswede, Ning Cai:
  Watermarking Identification Codes with Related Topics on Common Randomness. GTIT-C 2006: 107-153
• 
  Rudolf Ahlswede, Ning Cai:
  Codes with the Identifiable Parent Property and the Multiple-Access Channel. GTIT-C 2006: 249-257
• 
  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
• 
  Rudolf Ahlswede, Ning Cai:
  A Strong Converse Theorem for Quantum Multiple Access Channels. GTIT-C 2006: 460-485
• 
  Rudolf Ahlswede, Ning Cai:
  Search with Noisy and Delayed Responses. GTIT-C 2006: 695-703
• 
  Rudolf Ahlswede, Ning Cai:
  A Kraft-Type Inequality for d-Delay Binary Search Codes. GTIT-C 2006: 704-706
• 
  Rudolf Ahlswede, Ning Cai:
  Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs. GTIT-C 2006: 979-1005
• 
  Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang:
  Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer. GTIT-C 2006: 285-292
• 
  Rudolf Ahlswede, Evgueni A. Haroutunian:
  On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification. GTIT-C 2006: 553-571
• 
  Rudolf Ahlswede, János Körner:
  Appendix: On Common Information and Related Characteristics of Correlated Information Sources. GTIT-C 2006: 664-677
• 
  Rudolf Ahlswede, Levon H. Khachatrian:
  On Attractive and Friendly Sets in Sequence Spaces. GTIT-C 2006: 955-970
• 
  Rudolf Ahlswede, Iskandar Karapetyan:
  Intersection Graphs of Rectangles and Segments. GTIT-C 2006: 1064-1065
• 
  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
• 
  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
• 
  Rudolf Ahlswede, Mark S. Pinsker:
  Report on Models of Write-Efficient Memories with Localized Errors and Defects. GTIT-C 2006: 628-632

skipping 53 more matches