| Publication | Date of Publication | Type |
|---|
| Decision problems in information theory | 2026-03-18 | Paper |
| On the convergence rate of linear Datalog^ over stable semirings | 2025-11-11 | Paper |
\textsf{PANDA}: query evaluation in submodular width
TheoretiCS | 2025-05-06 | Paper |
Convergence of datalog over (pre-) semirings
Journal of the ACM | 2025-02-06 | Paper |
| On an information theoretic approach to cardinality estimation (invited talk) | 2024-04-25 | Paper |
| On an information theoretic approach to cardinality estimation (invited talk) | 2024-04-23 | Paper |
| An approximation algorithm for the matrix tree multiplication problem | 2023-08-08 | Paper |
Counting Triangles under Updates in Worst-Case Optimal Time
(available as arXiv preprint) | 2022-07-21 | Paper |
Boolean tensor decomposition for conjunctive queries with negation
(available as arXiv preprint) | 2022-07-21 | Paper |
Joins via geometric resolutions. Worst case and beyond
ACM Transactions on Database Systems | 2021-11-25 | Paper |
On handling negative transfer and imbalanced distributions in multiple source transfer learning
Statistical Analysis and Data Mining: The ASA Data Science Journal | 2020-10-14 | Paper |
Worst-case optimal join algorithms
Journal of the ACM | 2018-12-06 | Paper |
Worst-case optimal join algorithms
Journal of the ACM | 2018-12-06 | Paper |
Boolean Tensor Decomposition for Conjunctive Queries with Negation
(available as arXiv preprint) | 2017-12-20 | Paper |
| Efficiently decodable non-adaptive group testing | 2014-05-22 | Paper |
Black-box Trace\&Revoke codes
Algorithmica | 2013-11-11 | Paper |
\(\ell _{2}/\ell _{2}\)-foreach sparse recovery with low risk
Automata, Languages, and Programming | 2013-08-06 | Paper |
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
Journal of Combinatorial Optimization | 2013-01-03 | Paper |
| Efficiently decodable compressed sensing by list-recoverable codes and recursion | 2012-08-23 | Paper |
Efficiently decodable error-correcting list disjunct matrices and applications (extended abstract)
Automata, Languages and Programming | 2011-07-06 | Paper |
ANALYZING NONBLOCKING MULTILOG NETWORKS WITH THE KÖNIG–EGEVARÝ THEOREM
Discrete Mathematics, Algorithms and Applications | 2009-06-23 | Paper |
On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design
Journal of Combinatorial Optimization | 2008-04-23 | Paper |
| scientific article; zbMATH DE number 5262869 (Why is no real title available?) | 2008-04-14 | Paper |
| WDM switching networks: complexity and constructions | 2006-10-17 | Paper |
WDM Switching Networks, Rearrangeable and Nonblocking [w,f]-connectors
SIAM Journal on Computing | 2006-06-01 | Paper |
On the hardness of approximating the min-hack problem
Journal of Combinatorial Optimization | 2005-10-18 | Paper |
| scientific article; zbMATH DE number 2209789 (Why is no real title available?) | 2005-09-28 | Paper |
| scientific article; zbMATH DE number 2209521 (Why is no real title available?) | 2005-09-28 | Paper |
| scientific article; zbMATH DE number 2079420 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2010364 (Why is no real title available?) | 2003-11-27 | Paper |
Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
SIAM Journal on Computing | 2003-09-28 | Paper |
Super link-connectivity of iterated line digraphs.
Theoretical Computer Science | 2003-08-17 | Paper |
A new routing algorithm for multirate rearrangeable Clos networks.
Theoretical Computer Science | 2003-08-17 | Paper |
An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs
Taiwanese Journal of Mathematics | 2003-04-02 | Paper |
New bounds on a hypercube coloring problem.
Information Processing Letters | 2003-01-21 | Paper |
Optimal Consecutive-<i>k</i>-out-of-<i>n</i>: <i>G</i> Cycle for <i>n</i> \leq 2<i>k</i>+1
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
On connectivity of consecutive-d digraphs
Discrete Mathematics | 2002-12-02 | Paper |
New constructions of non-adaptive and error-tolerance pooling designs
Discrete Mathematics | 2002-07-14 | Paper |
| On the rearrangeability of shuffle-exchange networks | 2002-02-27 | Paper |
Optimal consecutive-\(k\)-out-of-(\(2k+1\)): \(G\) cycle
Journal of Global Optimization | 2001-02-18 | Paper |
