Abstract is missing.
- Two New Results for Identification for SourcesChristian Heup. 1-10 [doi]
- L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second OrderChristian Heup. 11-43 [doi]
- Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward SchemeBinyue Liu, Ning Cai. 44-70 [doi]
- Strong Secrecy for Multiple Access ChannelsMoritz Wiese, Holger Boche. 71-122 [doi]
- Capacity Results for Arbitrarily Varying Wiretap ChannelsIgor Bjelakovic, Holger Boche, Jochen Sommerfeld. 123-144 [doi]
- On Oblivious Transfer CapacityRudolf Ahlswede, Imre Csiszár. 145-166 [doi]
- Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex RelayAnas Chaaban, Aydin Sezgin, Daniela Tuninetti. 167-208 [doi]
- Uniformly Generating Origin Destination TablesDavid M. Einstein, Lee K. Jones. 209-216 [doi]
- Identification via Quantum ChannelsAndreas Winter. 217-233 [doi]
- Classical-Quantum Arbitrarily Varying Wiretap ChannelVladimir Blinovsky, Minglai Cai. 234-246 [doi]
- Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error CapacitiesIgor Bjelakovic, Holger Boche, Gisbert Janßen, Janis Nötzel. 247-283 [doi]
- On the Value of Multiple Read/Write Streams for Data CompressionTravis Gagie. 284-297 [doi]
- How to Read a Randomly Mixed Up MessageMatthias Löwe. 298-312 [doi]
- Multiple Objects: Error Exponents in Hypotheses Testing and IdentificationEvgueni A. Haroutunian, Parandzem M. Hakobyan. 313-345 [doi]
- Family Complexity and VC-DimensionChristian Mauduit, András Sárközy. 346-363 [doi]
- The Restricted Word Shadow ProblemRudolf Ahlswede, Vladimir Lebedev. 364-370 [doi]
- Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full MultitransversalsHarout K. Aydinian, Éva Czabarka, László A. Székely. 371-401 [doi]
- Generic Algorithms for Factoring StringsDavid E. Daykin, Jacqueline W. Daykin, Costas S. Iliopoulos, W. F. Smyth. 402-418 [doi]
- On Data Recovery in Distributed DatabasesSergei L. Bezrukov, Uwe Leck, Victor P. Piotrowski. 419-431 [doi]
- An Unstable Hypergraph Problem with a Unique Optimal SolutionCarlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann. 432-450 [doi]
- Multiparty Communication Complexity of Vector-Valued and Sum-Type FunctionsUlrich Tamm. 451-462 [doi]
- Threshold Functions for Distinct Parts: Revisiting Erdős-LehnerÉva Czabarka, Matteo Marsili, László A. Székely. 463-471 [doi]
- On Some Structural Properties of Star and Pancake GraphsElena V. Konstantinova. 472-487 [doi]
- Threshold and Majority Group TestingRudolf Ahlswede, Christian Deppe, Vladimir Lebedev. 488-508 [doi]
- Superimposed Codes and Threshold Group TestingArkadii G. D'yachkov, Vyacheslav V. Rykov, Christian Deppe, Vladimir Lebedev. 509-533 [doi]
- New Construction of Error-Tolerant Pooling DesignsRudolf Ahlswede, Harout K. Aydinian. 534-542 [doi]
- Density-Based Group TestingDániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener. 543-556 [doi]
- Group Testing with Multiple Mutually-Obscuring PositivesHong-Bin Chen, Hung-Lin Fu. 557-568 [doi]
- An Efficient Algorithm for Combinatorial Group TestingAndreas Allemann. 569-596 [doi]
- Randomized Post-optimization for t-RestrictionsCharles J. Colbourn, Peyman Nayeri. 597-608 [doi]
- Search for Sparse Active Inputs: A ReviewMikhail B. Malyutov. 609-647 [doi]
- Search When the Lie Depends on the TargetGyula O. H. Katona, Krisztián Tichler. 648-657 [doi]
- A Heuristic Solution of a Cutting Problem Using HypergraphsChristian Deppe, Christian Wischmann. 658-676 [doi]
- Remarks on History and Presence of Game Tree Search and ResearchIngo Althöfer. 677-693 [doi]
- Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-ConjectureMichael Bodewig. 694-710 [doi]
- Creating Order and Ballot SequencesUlrich Tamm. 711-724 [doi]