default search action
In memory of Rudolf Ahlswede 2013
- Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe:
Information Theory, Combinatorics, and Search Theory - In Memory of Rudolf Ahlswede. Lecture Notes in Computer Science 7777, Springer 2013, ISBN 978-3-642-36898-1
Information Theory
- Christian Heup:
Two New Results for Identification for Sources. 1-10 - Christian Heup:
L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order. 11-43 - Binyue Liu, Ning Cai:
Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme. 44-70 - Moritz Wiese, Holger Boche:
Strong Secrecy for Multiple Access Channels. 71-122 - Igor Bjelakovic, Holger Boche, Jochen Sommerfeld:
Capacity Results for Arbitrarily Varying Wiretap Channels. 123-144 - Rudolf Ahlswede, Imre Csiszár:
On Oblivious Transfer Capacity. 145-166 - Anas Chaaban, Aydin Sezgin
, Daniela Tuninetti:
Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay. 167-208 - David M. Einstein, Lee K. Jones:
Uniformly Generating Origin Destination Tables. 209-216 - Andreas J. Winter
Identification via Quantum Channels. 217-233 - Vladimir M. Blinovsky, Minglai Cai:
Classical-Quantum Arbitrarily Varying Wiretap Channel. 234-246 - Igor Bjelakovic, Holger Boche, Gisbert Janßen, Janis Nötzel:
Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities. 247-283 - Travis Gagie
On the Value of Multiple Read/Write Streams for Data Compression. 284-297 - Matthias Löwe:
How to Read a Randomly Mixed Up Message. 298-312 - Evgueni A. Haroutunian, Parandzem M. Hakobyan:
Multiple Objects: Error Exponents in Hypotheses Testing and Identification. 313-345
Combinatorics
- Christian Mauduit, András Sárközy:
Family Complexity and VC-Dimension. 346-363 - Rudolf Ahlswede, Vladimir S. Lebedev:
The Restricted Word Shadow Problem. 364-370 - Harout K. Aydinian, Éva Czabarka
Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals. 371-401 - David E. Daykin, Jacqueline W. Daykin
Generic Algorithms for Factoring Strings. 402-418 - Sergei L. Bezrukov, Uwe Leck, Victor P. Piotrowski:
On Data Recovery in Distributed Databases. 419-431 - Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
An Unstable Hypergraph Problem with a Unique Optimal Solution. 432-450 - Ulrich Tamm:
Multiparty Communication Complexity of Vector-Valued and Sum-Type Functions. 451-462 - Éva Czabarka
Threshold Functions for Distinct Parts: Revisiting Erdős-Lehner. 463-471 - Elena V. Konstantinova:
On Some Structural Properties of Star and Pancake Graphs. 472-487
Search Theory
- Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Threshold and Majority Group Testing. 488-508 - Arkadii G. D'yachkov, Vyacheslav V. Rykov, Christian Deppe, Vladimir S. Lebedev:
Superimposed Codes and Threshold Group Testing. 509-533 - Rudolf Ahlswede, Harout K. Aydinian:
New Construction of Error-Tolerant Pooling Designs. 534-542 - Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener:
Density-Based Group Testing. 543-556 - Hong-Bin Chen, Hung-Lin Fu:
Group Testing with Multiple Mutually-Obscuring Positives. 557-568 - Andreas Allemann:
An Efficient Algorithm for Combinatorial Group Testing. 569-596 - Charles J. Colbourn, Peyman Nayeri:
Randomized Post-optimization for t-Restrictions. 597-608 - Mikhail B. Malyutov:
Search for Sparse Active Inputs: A Review. 609-647 - Gyula O. H. Katona, Krisztián Tichler:
Search When the Lie Depends on the Target. 648-657 - Christian Deppe, Christian Wischmann:
A Heuristic Solution of a Cutting Problem Using Hypergraphs. 658-676 - Ingo Althöfer:
Remarks on History and Presence of Game Tree Search and Research. 677-693 - Michael Bodewig:
Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-Conjecture. 694-710 - Ulrich Tamm:
Creating Order and Ballot Sequences. 711-724
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-13 01:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: