| Publication | Date of Publication | Type |
|---|
Bounds and algorithms for alphabetic codes and binary search trees
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
An efficient algorithm for group testing with runlength constraints
Discrete Applied Mathematics | 2024-12-04 | Paper |
Improved algorithms and bounds for list union-free families
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Bounds and algorithms for generalized superimposed codes
Information Processing Letters | 2023-06-05 | Paper |
Communication complexity of gossiping by packets
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Concurrent multicast in weighted networks
Algorithm Theory — SWAT'98 | 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
Theoretical Computer Science | 2020-02-20 | Paper |
Whom to befriend to influence people
Theoretical Computer Science | 2020-02-06 | Paper |
Low-weight superimposed codes and related combinatorial structures: bounds and applications
Theoretical Computer Science | 2020-01-16 | Paper |
A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
Theoretical Computer Science | 2020-01-16 | Paper |
Minimum-Entropy Couplings and Their Applications
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Randomness in distribution protocols
Automata, Languages and Programming | 2019-04-29 | Paper |
Time-bounded influence diffusion with incentives
| 2019-01-30 | Paper |
On the number of random bits in totally private computation
Automata, Languages and Programming | 2019-01-10 | Paper |
Fast gossiping by short messages
Automata, Languages and Programming | 2019-01-10 | Paper |
A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
Algorithms for Sensor Systems | 2018-12-07 | Paper |
Evangelism in social networks: algorithms and complexity
Networks | 2018-09-04 | Paper |
Partial covering arrays: algorithms and asymptotics
Theory of Computing Systems | 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
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
$\epsilon $ -Almost Selectors and Their Applications to Multiple-Access Communication
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Discovering small target sets in social networks: a fast and effective algorithm
Algorithmica | 2018-06-01 | Paper |
On \(k\)-strong conflict-free multicoloring
| 2018-03-26 | Paper |
Brief Announcement
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Two Batch Search With Lie Cost
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Partial covering arrays: algorithms and asymptotics
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Evangelism in social networks
Lecture Notes in Computer Science | 2016-09-29 | Paper |
On secret sharing schemes
Information Processing Letters | 2016-06-09 | Paper |
Improved algorithms for group testing with inhibitors
Information Processing Letters | 2016-06-09 | Paper |
A fast and effective heuristic for discovering small target sets in social networks
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Optimizing spread of influence in social networks via partial incentives
Structural Information and Communication Complexity | 2016-01-08 | Paper |
\(\varepsilon \)-almost selectors and their applications
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Spread of influence in weighted networks under time and budget constraints
Theoretical Computer Science | 2015-05-26 | Paper |
Influence diffusion in social networks under time window constraints
Theoretical Computer Science | 2015-05-22 | Paper |
Latency-bounded target set selection in social networks
Theoretical Computer Science | 2014-04-29 | Paper |
Optimal time data gathering in wireless networks with multidirectional antennas
Theoretical Computer Science | 2014-01-13 | Paper |
Influence Diffusion in Social Networks under Time Window Constraints
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Latency-bounded target set selection in social networks
Lecture Notes in Computer Science | 2013-08-05 | Paper |
On the approximability and exact algorithms for vector domination and related problems in graphs
Discrete Applied Mathematics | 2013-04-18 | Paper |
Spider covers and their applications
ISRN Discrete Mathematics | 2013-02-21 | Paper |
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Superselectors: efficient constructions and applications
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Binary search with delayed and missing answers
Information Processing Letters | 2009-03-23 | Paper |
Bounding the Average Length of Optimal Source Codes Via Majorization Theory
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science | 2006-04-28 | Paper |
Broadcasting in hypercubes and star graphs with dynamic faults.
Information Processing Letters | 2006-01-17 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Optimal Two-Stage Algorithms for Group Testing Problems
SIAM Journal on Computing | 2005-09-16 | Paper |
Supermodularity and subadditivity properties of the entropy on the majorization lattice
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
On searching strategies, parallel questions, and delayed answers
Discrete Applied Mathematics | 2005-02-23 | Paper |
scientific article; zbMATH DE number 2102779 (Why is no real title available?)
| 2004-09-24 | Paper |
Spanning spiders and light-splitting switches
Discrete Mathematics | 2004-08-19 | Paper |
scientific article; zbMATH DE number 2086635 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2080238 (Why is no real title available?)
| 2004-08-04 | Paper |
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
Theoretical Computer Science | 2004-03-14 | Paper |
scientific article; zbMATH DE number 2038701 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 1947404 (Why is no real title available?)
| 2003-07-08 | Paper |
Bounds on entropy in a guessing game
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
An improved heuristic for the ``Ulam-Rényi game
Information Processing Letters | 2002-07-25 | Paper |
scientific article; zbMATH DE number 1696532 (Why is no real title available?)
| 2002-07-22 | Paper |
Randomness complexity of private computation
Computational Complexity | 2002-04-21 | Paper |
Least adaptive optimal search with unreliable tests
Theoretical Computer Science | 2002-03-03 | Paper |
scientific article; zbMATH DE number 1577986 (Why is no real title available?)
| 2002-01-31 | Paper |
Efficient communication in unknown networks
Networks | 2001-10-14 | Paper |
Concurrent multicast in weighted networks
Theoretical Computer Science | 2001-08-20 | Paper |
Efficient algorithms for chemical threshold testing problems
Theoretical Computer Science | 2001-08-20 | Paper |
scientific article; zbMATH DE number 1617287 (Why is no real title available?)
| 2001-07-11 | Paper |
scientific article; zbMATH DE number 1421019 (Why is no real title available?)
| 2000-09-04 | Paper |
Efficient collective communciation in optical networks
Theoretical Computer Science | 2000-08-23 | Paper |
scientific article; zbMATH DE number 1456816 (Why is no real title available?)
| 2000-06-07 | Paper |
Optimal strategies against a liar
Theoretical Computer Science | 2000-06-04 | Paper |
scientific article; zbMATH DE number 1426190 (Why is no real title available?)
| 2000-03-30 | Paper |
scientific article; zbMATH DE number 1406777 (Why is no real title available?)
| 2000-03-01 | Paper |
Efficient \(m\)-ary balanced codes
Discrete Applied Mathematics | 2000-02-04 | Paper |
Efficient generation of fair dice with few biased coins
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Group testing with unreliable tests
Information Sciences | 1999-05-18 | Paper |
Perfectly secure key distribution for dynamic conferences
Information and Computation | 1999-03-30 | Paper |
scientific article; zbMATH DE number 1222826 (Why is no real title available?)
| 1998-11-11 | Paper |
Minimum time broadcast in faulty star networks
Discrete Applied Mathematics | 1998-10-08 | Paper |
Fast Gossiping by Short Messages
SIAM Journal on Computing | 1998-09-20 | Paper |
Tight bounds on the information rate of secret sharing schemes
Designs, Codes and Cryptography | 1997-12-18 | Paper |
Communication complexity of gossiping by packets
Journal of Parallel and Distributed Computing | 1997-12-17 | Paper |
scientific article; zbMATH DE number 1047923 (Why is no real title available?)
| 1997-11-09 | Paper |
Randomness in distribution protocols
Information and Computation | 1997-10-13 | Paper |
scientific article; zbMATH DE number 1024049 (Why is no real title available?)
| 1997-07-20 | Paper |
On the information rate of secret sharing schemes
Theoretical Computer Science | 1997-02-28 | Paper |
Fully dynamic secret sharing schemes
Theoretical Computer Science | 1997-02-27 | Paper |
scientific article; zbMATH DE number 826055 (Why is no real title available?)
| 1996-05-27 | Paper |
New bounds on the information rate of secret sharing schemes
IEEE Transactions on Information Theory | 1995-12-17 | Paper |
scientific article; zbMATH DE number 826065 (Why is no real title available?)
| 1995-12-13 | Paper |
On the capacity of Boolean graph formulæ
Graphs and Combinatorics | 1995-09-11 | Paper |
Optimal detection of a counterfeit coin with multi-arms balances
Discrete Applied Mathematics | 1995-08-27 | Paper |
Graph decompositions and secret sharing schemes
Journal of Cryptology | 1995-07-16 | Paper |
scientific article; zbMATH DE number 708825 (Why is no real title available?)
| 1995-07-16 | Paper |
scientific article; zbMATH DE number 708803 (Why is no real title available?)
| 1995-03-30 | Paper |
Capacities: From information theory to extremal set theory
Journal of Combinatorial Theory. Series A | 1995-03-05 | Paper |
A fast algorithm for the unique decipherability of multivalued encodings
Theoretical Computer Science | 1995-01-09 | Paper |
scientific article; zbMATH DE number 512874 (Why is no real title available?)
| 1994-10-04 | Paper |
scientific article; zbMATH DE number 503323 (Why is no real title available?)
| 1994-02-22 | Paper |
On the size of shares for secret sharing schemes
Journal of Cryptology | 1994-01-03 | Paper |
Fault—tolerant hypercube broadcasting via information dispersal
Networks | 1993-08-23 | Paper |
scientific article; zbMATH DE number 219254 (Why is no real title available?)
| 1993-06-29 | Paper |
Sperner capacities
Graphs and Combinatorics | 1993-06-29 | Paper |
Fault tolerant routing in the star and pancake interconnection networks
Information Processing Letters | 1993-06-29 | Paper |
scientific article; zbMATH DE number 176543 (Why is no real title available?)
| 1993-05-18 | Paper |
Qualitative independence and Sperner problems for directed graphs
Journal of Combinatorial Theory. Series A | 1993-01-17 | Paper |
Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
SIAM Journal on Discrete Mathematics | 1992-09-27 | Paper |
Search problems for two irregular coins with incomplete feedback: The underweight model
Discrete Applied Mathematics | 1992-09-27 | Paper |
An improved algorithm for quantitative group testing
Discrete Applied Mathematics | 1992-09-27 | Paper |
On the construction of statistically synchronizable codes
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
Efficient \(q\)-ary immutable codes
Discrete Applied Mathematics | 1992-06-27 | Paper |
scientific article; zbMATH DE number 30329 (Why is no real title available?)
| 1992-06-27 | Paper |
Decoders with initial state invariance for multivalued encodings
Theoretical Computer Science | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4132092 (Why is no real title available?)
| 1990-01-01 | Paper |
On the construction of minimal broadcast networks
Networks | 1989-01-01 | Paper |
Structure of decoders for multivalued encodings
Discrete Applied Mathematics | 1989-01-01 | Paper |
An efficient algorithm for testing immutability of variable-length codes
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4164724 (Why is no real title available?)
| 1988-01-01 | Paper |
On the characterization of statistically synchronizable variable-length codes
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
