| Publication | Date of Publication | Type |
|---|
Fourier decay of measures supported on sets of numbers with consecutive partial quotients belonging to a given set
Mathematika | 2026-04-13 | Paper |
Sharp Fourier decay estimates for measures supported on the well-approximable numbers
Annales Fennici Mathematici | 2025-08-29 | Paper |
Fourier restriction and well-approximable numbers
Mathematische Annalen | 2025-02-19 | Paper |
Fourier dimension estimates for sets of exact approximation order: the case of small approximation exponents
IMRN. International Mathematics Research Notices | 2025-02-18 | Paper |
Fourier Dimension Estimates for Sets of Exact Approximation Order: The Well-Approximable Case
IMRN. International Mathematics Research Notices | 2024-02-16 | Paper |
| Fourier restriction and well-approximable numbers | 2023-11-15 | Paper |
| Fourier Dimension Estimates for Sets of Exact Approximation Order: The Badly-Approximable Case | 2023-09-11 | Paper |
Explicit Salem sets in \(\mathbb{R}^n\)
Advances in Mathematics | 2023-03-02 | Paper |
Polynomial Roth Theorems on Sets of Fractional Dimensions
IMRN. International Mathematics Research Notices | 2022-06-16 | Paper |
Three-term arithmetic progressions in subsets of \(\mathbf{F}_q^\infty\) of large Fourier dimension
Annales Fennici Mathematici | 2021-09-15 | Paper |
The local sum conjecture in two dimensions
International Journal of Number Theory | 2020-10-07 | Paper |
A framework for constructing sets without configurations
(available as arXiv preprint) | 2020-06-26 | Paper |
| A framework for constructing sets without configurations | 2020-06-26 | Paper |
Explicit Salem sets, Fourier restriction, and metric Diophantine approximation in the p-adic numbers
Proceedings of the Royal Society of Edinburgh: Section A Mathematics | 2020-04-24 | Paper |
Explicit Salem sets in $\mathbb{R}^n$
(available as arXiv preprint) | 2019-09-10 | Paper |
Polynomial Roth theorems on sets of fractional dimensions
(available as arXiv preprint) | 2019-04-24 | Paper |
On Combinatorial Depth Measures
International Journal of Computational Geometry & Applications | 2019-04-24 | Paper |
Large sets avoiding patterns
Analysis & PDE | 2018-05-04 | Paper |
Guarding orthogonal art galleries with sliding cameras
Computational Geometry | 2017-09-08 | Paper |
The within-strip discrete unit disk cover problem
Theoretical Computer Science | 2017-05-12 | Paper |
| The Hausdorff core problem on simple polygons | 2017-03-09 | Paper |
| Large subsets of Local Fields not containing Configurations | 2016-12-24 | Paper |
Kakeya-type sets in local fields with finite residue field
Mathematika | 2016-06-06 | Paper |
On minimum- and maximum-weight minimum spanning trees with neighborhoods
Theory of Computing Systems | 2015-05-12 | Paper |
Indexed geometric jumbled pattern matching
Combinatorial Pattern Matching | 2014-06-30 | Paper |
A (7/2)-approximation algorithm for guarding orthogonal art galleries with sliding cameras
Lecture Notes in Computer Science | 2014-03-31 | Paper |
The Distance 4-Sector of Two Points Is Unique
Algorithms and Computation | 2014-01-14 | Paper |
On minimum-and maximum-weight minimum spanning trees with neighborhoods
Approximation and Online Algorithms | 2013-09-13 | Paper |
On the discrete unit disk cover problem
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
| Frame bounds for subspaces of L₂( R) | 2012-10-29 | Paper |
On the discrete unit disk cover problem
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
An improved line-separable algorithm for discrete unit disk cover
Discrete Mathematics, Algorithms and Applications | 2010-05-19 | Paper |
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
Algorithms and Computation | 2009-12-17 | Paper |
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Accelerating machines: a review
International Journal of Parallel, Emergent and Distributed Systems | 2008-03-18 | Paper |
