| Publication | Date of Publication | Type |
|---|
| Bounds and algorithms for alphabetic codes and binary search trees | 2025-01-23 | Paper |
| An efficient algorithm for group testing with runlength constraints | 2024-12-04 | Paper |
| Improved algorithms and bounds for list union-free families | 2024-07-22 | Paper |
| Bounds and algorithms for generalized superimposed codes | 2023-06-05 | Paper |
| Communication complexity of gossiping by packets | 2022-12-09 | Paper |
| Concurrent multicast in weighted networks | 2022-12-09 | Paper |
| Achievable Rates and Algorithms for Group Testing with Runlength Constraints | 2022-08-30 | Paper |
| Probabilistic secret sharing | 2021-08-04 | Paper |
| Low-weight superimposed codes and their applications | 2020-07-07 | Paper |
| Fast and frugal targeting with incentives | 2020-02-20 | Paper |
| Whom to befriend to influence people | 2020-02-06 | Paper |
| Low-weight superimposed codes and related combinatorial structures: bounds and applications | 2020-01-16 | Paper |
| A new kind of selectors and their applications to conflict resolution in wireless multichannels networks | 2020-01-16 | Paper |
| Minimum-Entropy Couplings and Their Applications | 2019-07-19 | Paper |
| Randomness in distribution protocols | 2019-04-29 | Paper |
| Time-bounded influence diffusion with incentives | 2019-01-30 | Paper |
| On the number of random bits in totally private computation | 2019-01-10 | Paper |
| Fast gossiping by short messages | 2019-01-10 | Paper |
| A new kind of selectors and their applications to conflict resolution in wireless multichannels networks | 2018-12-07 | Paper |
| Evangelism in social networks: Algorithms and complexity | 2018-09-04 | Paper |
| Partial covering arrays: algorithms and asymptotics | 2018-08-03 | Paper |
| Time-Bounded Influence Diffusion with Incentives | 2018-07-18 | Paper |
| Bounds on the Entropy of a Function of a Random Variable and Their Applications | 2018-06-27 | Paper |
| $\epsilon $ -Almost Selectors and Their Applications to Multiple-Access Communication | 2018-06-27 | Paper |
| Discovering small target sets in social networks: a fast and effective algorithm | 2018-06-01 | Paper |
| On \(k\)-strong conflict-free multicoloring | 2018-03-26 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Two Batch Search With Lie Cost | 2017-08-08 | Paper |
| Whom to befriend to influence people | 2016-12-01 | Paper |
| Partial covering arrays: algorithms and asymptotics | 2016-09-29 | Paper |
| Evangelism in Social Networks | 2016-09-29 | Paper |
| On secret sharing schemes | 2016-06-09 | Paper |
| Improved algorithms for group testing with inhibitors | 2016-06-09 | Paper |
| A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks | 2016-02-05 | Paper |
| Optimizing Spread of Influence in Social Networks via Partial Incentives | 2016-01-08 | Paper |
| $$\epsilon $$-Almost Selectors and Their Applications | 2015-09-29 | Paper |
| Spread of influence in weighted networks under time and budget constraints | 2015-05-26 | Paper |
| Influence diffusion in social networks under time window constraints | 2015-05-22 | Paper |
| Latency-bounded target set selection in social networks | 2014-04-29 | Paper |
| Optimal time data gathering in wireless networks with multidirectional antennas | 2014-01-13 | Paper |
| Influence Diffusion in Social Networks under Time Window Constraints | 2013-12-17 | Paper |
| Latency-Bounded Target Set Selection in Social Networks | 2013-08-05 | Paper |
| On the approximability and exact algorithms for vector domination and related problems in graphs | 2013-04-18 | Paper |
| Spider covers and their applications | 2013-02-21 | Paper |
| Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs | 2011-08-19 | Paper |
| Superselectors: Efficient Constructions and Applications | 2010-09-06 | Paper |
| Binary search with delayed and missing answers | 2009-03-23 | Paper |
| Bounding the Average Length of Optimal Source Codes Via Majorization Theory | 2008-12-21 | Paper |
| A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes | 2008-12-21 | Paper |
| Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes | 2008-12-21 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Asynchronous deterministic rendezvous in graphs | 2006-04-28 | Paper |
| Broadcasting in hypercubes and star graphs with dynamic faults. | 2006-01-17 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| Optimal Two-Stage Algorithms for Group Testing Problems | 2005-09-16 | Paper |
| Supermodularity and subadditivity properties of the entropy on the majorization lattice | 2005-05-11 | Paper |
| On searching strategies, parallel questions, and delayed answers | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818867 | 2004-09-24 | Paper |
| Spanning spiders and light-splitting switches | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737170 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472483 | 2004-08-04 | Paper |
| Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449166 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411370 | 2003-07-08 | Paper |
| Bounds on entropy in a guessing game | 2002-08-04 | Paper |
| An improved heuristic for the ``Ulam-Rényi game | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766680 | 2002-07-22 | Paper |
| Randomness complexity of private computation | 2002-04-21 | Paper |
| Least adaptive optimal search with unreliable tests | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2704221 | 2002-01-31 | Paper |
| Efficient communication in unknown networks | 2001-10-14 | Paper |
| Concurrent multicast in weighted networks | 2001-08-20 | Paper |
| Efficient algorithms for chemical threshold testing problems | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722011 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946041 | 2000-09-04 | Paper |
| Efficient collective communciation in optical networks | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954414 | 2000-06-07 | Paper |
| Optimal strategies against a liar | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4950446 | 2000-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940693 | 2000-03-01 | Paper |
| Efficient \(m\)-ary balanced codes | 2000-02-04 | Paper |
| Efficient generation of fair dice with few biased coins | 1999-11-21 | Paper |
| Group testing with unreliable tests | 1999-05-18 | Paper |
| Perfectly secure key distribution for dynamic conferences | 1999-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218414 | 1998-11-11 | Paper |
| Minimum time broadcast in faulty star networks | 1998-10-08 | Paper |
| Fast Gossiping by Short Messages | 1998-09-20 | Paper |
| Tight bounds on the information rate of secret sharing schemes | 1997-12-18 | Paper |
| Communication complexity of gossiping by packets | 1997-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348003 | 1997-11-09 | Paper |
| Randomness in distribution protocols | 1997-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341737 | 1997-07-20 | Paper |
| On the information rate of secret sharing schemes | 1997-02-28 | Paper |
| Fully dynamic secret sharing schemes | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858441 | 1996-05-27 | Paper |
| New bounds on the information rate of secret sharing schemes | 1995-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858451 | 1995-12-13 | Paper |
| On the capacity of Boolean graph formulæ | 1995-09-11 | Paper |
| Optimal detection of a counterfeit coin with multi-arms balances | 1995-08-27 | Paper |
| Graph decompositions and secret sharing schemes | 1995-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318716 | 1995-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318691 | 1995-03-30 | Paper |
| Capacities: From information theory to extremal set theory | 1995-03-05 | Paper |
| A fast algorithm for the unique decipherability of multivalued encodings | 1995-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281571 | 1994-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279656 | 1994-02-22 | Paper |
| On the size of shares for secret sharing schemes | 1994-01-03 | Paper |
| Fault—tolerant hypercube broadcasting via information dispersal | 1993-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694740 | 1993-06-29 | Paper |
| Sperner capacities | 1993-06-29 | Paper |
| Fault tolerant routing in the star and pancake interconnection networks | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035710 | 1993-05-18 | Paper |
| Qualitative independence and Sperner problems for directed graphs | 1993-01-17 | Paper |
| Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults | 1992-09-27 | Paper |
| Search problems for two irregular coins with incomplete feedback: The underweight model | 1992-09-27 | Paper |
| An improved algorithm for quantitative group testing | 1992-09-27 | Paper |
| On the construction of statistically synchronizable codes | 1992-06-28 | Paper |
| Efficient \(q\)-ary immutable codes | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3985385 | 1992-06-27 | Paper |
| Decoders with initial state invariance for multivalued encodings | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033705 | 1990-01-01 | Paper |
| On the construction of minimal broadcast networks | 1989-01-01 | Paper |
| Structure of decoders for multivalued encodings | 1989-01-01 | Paper |
| An efficient algorithm for testing immutability of variable-length codes | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3491466 | 1988-01-01 | Paper |
| On the characterization of statistically synchronizable variable-length codes | 1988-01-01 | Paper |
