| Publication | Date of Publication | Type |
|---|
Online interval selection on a simple chain
Theoretical Computer Science | 2026-09-29 | Paper |
On the online weighted non-crossing matching problem
Information and Computation | 2026-06-11 | Paper |
Undecidability of polynomial inequalities in subset densities and additive energies
Theoretical Computer Science | 2026-05-08 | Paper |
| Undecidability of polynomial inequalities in subset densities and additive energies | 2026-01-28 | Paper |
Online Interval Selection on a Simple Chain
(available as arXiv preprint) | 2026-01-01 | Paper |
FirstFit online coloring in the random order model
(available as arXiv preprint) | 2026-01-01 | Paper |
FirstFit coloring process of random bipartite graphs and an online coloring lower bound in the random order model
(available as arXiv preprint) | 2026-01-01 | Paper |
Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connections
Procedia Computer Science | 2025-12-11 | Paper |
| On the online weighted non-crossing matching problem | 2025-12-02 | Paper |
Perspective on complexity measures targeting read-once branching programs
Information and Computation | 2024-12-03 | Paper |
Lifting query complexity to time-space complexity for two-way finite automata
Journal of Computer and System Sciences | 2024-01-22 | Paper |
| Perspective on complexity measures targetting read-once branching programs | 2023-05-18 | Paper |
Trading information complexity for error. II: The case of a large error and the external information complexity
Information and Computation | 2022-12-08 | Paper |
Online coloring and a new type of adversary for online graph problems
Algorithmica | 2022-05-03 | Paper |
Online coloring and a new type of adversary for online graph problems
Approximation and Online Algorithms | 2022-03-22 | Paper |
Conflict complexity is lower bounded by block sensitivity
Theoretical Computer Science | 2021-01-19 | Paper |
scientific article; zbMATH DE number 7204267 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
Chang's lemma via Pinsker's inequality
Discrete Mathematics | 2019-12-12 | Paper |
Information complexity of the AND function in the two-party and multi-party settings
Algorithmica | 2019-10-17 | Paper |
Trading information complexity for error II: the case of a large error and external information complexity
(available as arXiv preprint) | 2018-09-26 | Paper |
Trading information complexity for error
Theory of Computing | 2018-06-15 | Paper |
Conflict complexity is lower bounded by block sensitivity
(available as arXiv preprint) | 2018-01-01 | Paper |
Information complexity of the AND function in the two-party and multi-party settings
Lecture Notes in Computer Science | 2017-10-23 | Paper |
A characterization of functions with vanishing averages over products of disjoint sets
European Journal of Combinatorics | 2016-05-11 | Paper |
The winning property of mixed badly approximable numbers
Moscow Journal of Combinatorics and Number Theory | 2014-07-09 | Paper |
