Publication | Date of Publication | Type |
---|
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 |
https://portal.mardi4nfdi.de/entity/Q6168414 | 2023-08-08 | Paper |
Counting Triangles under Updates in Worst-Case Optimal Time | 2022-07-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q5091136 | 2022-07-21 | Paper |
Joins via Geometric Resolutions | 2021-11-25 | Paper |
On handling negative transfer and imbalanced distributions in multiple source transfer learning | 2020-10-14 | Paper |
Worst-case Optimal Join Algorithms | 2018-12-06 | Paper |
Boolean Tensor Decomposition for Conjunctive Queries with Negation | 2017-12-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q5417695 | 2014-05-22 | Paper |
Black-box Trace\&Revoke codes | 2013-11-11 | Paper |
ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk | 2013-08-06 | Paper |
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors | 2013-01-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q2904764 | 2012-08-23 | Paper |
Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications | 2011-07-06 | Paper |
ANALYZING NONBLOCKING MULTILOG NETWORKS WITH THE KÖNIG–EGEVARÝ THEOREM | 2009-06-23 | Paper |
On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design | 2008-04-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q5457049 | 2008-04-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5494199 | 2006-10-17 | Paper |
WDM Switching Networks, Rearrangeable and Nonblocking [w,f-connectors] | 2006-06-01 | Paper |
On the hardness of approximating the min-hack problem | 2005-10-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q5692514 | 2005-09-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5692764 | 2005-09-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4471380 | 2004-07-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4435201 | 2003-11-27 | Paper |
Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs | 2003-09-28 | Paper |
A new routing algorithm for multirate rearrangeable Clos networks. | 2003-08-17 | Paper |
Super link-connectivity of iterated line digraphs. | 2003-08-17 | Paper |
An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs | 2003-04-02 | Paper |
New bounds on a hypercube coloring problem. | 2003-01-21 | Paper |
Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1 | 2003-01-05 | Paper |
On connectivity of consecutive-\(d\) digraphs | 2002-12-02 | Paper |
New constructions of non-adaptive and error-tolerance pooling designs | 2002-07-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q2751859 | 2002-02-27 | Paper |
Optimal consecutive-\(k\)-out-of-(\(2k+1\)): \(G\) cycle | 2001-02-18 | Paper |