| Publication | Date of Publication | Type |
|---|
Key-cast over networks
IEEE Transactions on Information Theory | 2025-07-11 | Paper |
Codes for adversaries: between worst-case and average-case jamming
Foundations and Trends in Communications and Information Theory | 2025-01-29 | Paper |
Minimizing the alphabet size in codes with restricted error sets
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Competitive channel-capacity
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Reduced-Rank L1-Norm Principal-Component Analysis With Performance Guarantees
IEEE Transactions on Signal Processing | 2022-09-23 | Paper |
Latency and Alphabet Size in the Context of Multicast Network Coding
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
The Birthday Problem and Zero-Error List Codes
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
| Minimizing the alphabet size of erasure codes with restricted decoding sets | 2020-05-14 | Paper |
\(H\)-wise independence
Chicago Journal of Theoretical Computer Science | 2020-01-29 | Paper |
Sufficiently Myopic Adversaries Are Blind
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
The Edge-Removal Problem’s Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
The Capacity of Online (Causal) $q$ -Ary Error-Erasure Channels
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
The Unbounded Benefit of Encoder Cooperation for the k-User MAC
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Can Negligible Rate Increase Network Reliability?
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Constructing cospectral graphs via a new form of graph product
Linear and Multilinear Algebra | 2018-08-13 | Paper |
Tight Network Topology Dependent Bounds on Rounds of Communication
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Coding for the $\boldsymbol \ell _\infty $ -Limited Permutation Channel
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Network Coding: A Computational Perspective
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
On the Hardness of Approximating the Network Coding Capacity
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Constant-Weight Gray Codes for Local Rank Modulation
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Trajectory Codes for Flash Memory
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Generalized Gray Codes for Local Rank Modulation
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Upper Bounds on the Capacity of Binary Channels With Causal Adversaries
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
\(H\)-wise independence
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Communication Efficient Secret Sharing
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
A Characterization of the Number of Subsequences Obtained via the Deletion Channel
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Asymmetric Error Correction and Flash-Memory Rewriting Using Polar Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Coded Cooperative Data Exchange Problem for General Topologies
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
An Equivalence Between Network Coding and Index Coding
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| Non-linear Cyclic Codes that Attain the Gilbert-Varshamov Bound | 2017-01-04 | Paper |
A characterization of the capacity of online (causal) binary channels
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Fault-tolerant spanners for general graphs
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
A unified framework for approximating and clustering data
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| Universal \({\epsilon}\)-approximators for integrals | 2014-05-22 | Paper |
Distributed broadcasting and mapping protocols in directed anonymous networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
\(f\)-sensitivity distance oracles and routing schemes
Algorithmica | 2012-12-06 | Paper |
| Edge distribution in generalized graph products | 2012-11-07 | Paper |
Fault tolerant spanners for general graphs
SIAM Journal on Computing | 2011-04-04 | Paper |
Approximating maximum subgraphs without short cycles
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
\(f\)-sensitivity distance oracles and routing schemes
Algorithms – ESA 2010 | 2010-09-06 | Paper |
The ROBDD size of simple CNF formulas
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Contraction and expansion of convex sets
Discrete & Computational Geometry | 2009-12-14 | Paper |
Resilient Network Coding in the Presence of Byzantine Adversaries
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Optimal Universal Schedules for Discrete Broadcast
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Oblivious Communication Channels and Their Capacity
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
| The encoding complexity of network coding | 2008-12-21 | Paper |
Approximating Maximum Subgraphs without Short Cycles
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Approximation Algorithms for Graph Homomorphism Problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
The multi-multiway cut problem
Theoretical Computer Science | 2007-06-06 | Paper |
The RPR2 rounding technique for semidefinite programs
Journal of Algorithms | 2006-08-14 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
SIAM Journal on Computing | 2005-02-21 | Paper |
Improved approximation of Max-Cut on graphs of bounded degree
Journal of Algorithms | 2002-09-30 | Paper |
A note on approximating Max-Bisection on regular graphs
Information Processing Letters | 2002-07-14 | Paper |
Approximation algorithms for maximization problems arising in graph partitioning
Journal of Algorithms | 2002-07-08 | Paper |
| scientific article; zbMATH DE number 1754595 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1670535 (Why is no real title available?) | 2001-11-11 | Paper |
