| Publication | Date of Publication | Type |
|---|
| A simple distributed algorithm for sparse fractional covering and packing problems | 2026-06-08 | Paper |
| On exact sampling in the two-variable fragment of first-order logic | 2026-02-27 | Paper |
Variable version Lovász local lemma: a tale of two boundaries
Information and Computation | 2026-02-02 | Paper |
| Variable-version Lovász local lemma: beyond Shearer's bound | 2025-08-06 | Paper |
| Randomized algorithm for MPMD on two sources | 2024-09-20 | Paper |
Lifted algorithms for symmetric weighted first-order model sampling
Artificial Intelligence | 2024-07-03 | Paper |
| The k-Server Problem with Delays on the Uniform Metric Space | 2023-11-14 | Paper |
Delayed packing attack and countermeasure against transaction information based applications
Information Sciences | 2023-11-02 | Paper |
Automatic conjecturing of P-recursions using lifted inference
Inductive Logic Programming | 2023-08-03 | Paper |
Limits of multi-relational graphs
Machine Learning | 2023-06-12 | Paper |
Arbitrage attack: Miners of the world, unite!
Financial Cryptography and Data Security | 2023-05-26 | Paper |
Hoeffding-Serfling inequality for U-statistics without replacement
Journal of Theoretical Probability | 2023-05-16 | Paper |
| On Discovering Interesting Combinatorial Integer Sequences | 2023-02-09 | Paper |
On Discovering Interesting Combinatorial Integer Sequences
(available as arXiv preprint) | 2023-01-01 | Paper |
Space complexity of streaming algorithms on universal quantum computers
(available as arXiv preprint) | 2022-12-22 | Paper |
scientific article; zbMATH DE number 7561370 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| Impatient Online Matching | 2022-07-21 | Paper |
Hoeffding and Bernstein inequalities for U-statistics without replacement
Statistics & Probability Letters | 2022-06-01 | Paper |
Query complexity of generalized Simon's problem
Information and Computation | 2021-11-25 | Paper |
Quantum generative adversarial network for generating discrete distribution
Information Sciences | 2021-11-23 | Paper |
| Min-cost bipartite perfect matching with delays | 2021-07-28 | Paper |
Ride the lightning: the game theory of payment channels
(available as arXiv preprint) | 2021-02-08 | Paper |
Byzantine preferential voting
(available as arXiv preprint) | 2020-06-18 | Paper |
On the Bernstein-Hoeffding method
(available as arXiv preprint) | 2019-11-22 | Paper |
| On the Bernstein-Hoeffding method | 2019-11-22 | Paper |
Learning from networked examples
(available as arXiv preprint) | 2019-01-10 | Paper |
| Learning from networked examples | 2019-01-10 | Paper |
Minimum cost perfect matching with delays for two sources
Theoretical Computer Science | 2018-12-04 | Paper |
| Variable Version Lov\'asz Local Lemma: Beyond Shearer's Bound | 2017-09-15 | Paper |
Minimum cost perfect matching with delays for two sources
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Hölder-type inequalities and their applications to concentration and correlation bounds
Indagationes Mathematicae. New Series | 2017-01-18 | Paper |
An efficiently computable subgraph pattern support measure: counting independent observations
Data Mining and Knowledge Discovery | 2014-02-19 | Paper |
