Research
Research
Research
Research
499+ open-access research outputs.
Understanding the power of space-bounded computation with access to catalytic space has been an important theme in complexity theory over the recent years. One of the key algorithmic results in this a…
Prompt optimization methods either analyze individual failures in isolation or compare prompt variants across examples, operating on single execution traces with no access to the reasoning process dis…
Inspired by the adaptive Golden Ratio Algorithm (aGRAAL), we propose two new methods for solving monotone variational inequalities. We show that by selecting the momentum parameter beyond the golden r…
We prove that the flow-cut gap for $n$-node directed graphs is at most $n^{1/3 + o(1)}$. This is the first improvement since a previous upper bound of $\widetilde{O}(n^{11/23})$ by Agarwal, Alon, and …
In the (continuous) Euclidean $k$-center problem, given $n$ points in $\mathbb{R}^d$ and an integer $k$, the goal is to find $k$ center points in $\mathbb{R}^d$ that minimize the maximum Euclidean dis…
Hamming Quasi-Cyclic (HQC) was chosen for the latest post-quantum cryptography standardization. A concatenated Reed-Muller (RM) and Reed-Solomon (RS) code is decoded during the HQC decryption. Soft-de…
We determine the phase diagram of the Anderson tight-binding model on random regular graphs with Gaussian disorder and sufficiently large degree. In particular, we prove that if the degree is fixed an…
Just-in-time (JIT) compilers are key components for many popular programming languages with managed runtimes (e.g., Java and JavaScript). JIT compilers perform optimizations and generate native code a…
Many real-world applications generate continuous data streams for regression. Hoeffding trees and their variants have a long-standing tradition due to their effectiveness, either alone or as base mode…
Pseudo-deterministic algorithms are randomized algorithms that, with high constant probability, output a fixed canonical solution. The study of pseudo-deterministic algorithms for the global minimum c…
It is known that two local unitaries (LU) equivalent states possess the same amount of entanglement and can be used to perform the same tasks in quantum information theory (QIT). For a protocol for a …
Many fundamental problems in computational geometry admit no algorithm running in $o(n \log n)$ time for $n$ planar input points, via classical reductions from sorting. Prominent examples include the …
Colored interlacing triangles, introduced by Aggarwal-Borodin-Wheeler (2024), provide the combinatorial framework for the Central Limit Theorem for probability measures arising from the Lascoux-Lecler…
Given a set of $n$ circular arcs of the same radius in the plane, we consider the problem of computing the number of intersections among the arcs. The problem was studied before and the previously bes…
We develop a fractional-order Ginzburg-Landau (GL) framework for nonreciprocal superconducting transport in Josephson junctions formed by fractal superconductors or superconducting media with nonlocal…
The attitudes of today's students toward generative AI (GenAI) will significantly influence its adoption in the workplace in the years to come, carrying both economic and social implications. It is th…
Let $\mathcal{P}$ be the surface of a convex polyhedron with $n$ vertices. We consider the two-point shortest path query problem for $\mathcal{P}$: Constructing a data structure so that given any two …
We present a new construction of triple arrays by combining a symmetric 2-design with a resolution of another 2-design. This is the first general method capable of producing non-extremal triple arrays…
We show that any nonclassicality criterion based on factorial moments, including several higher-order parameters such as the Mandel $Q^{(\ell)}$ parameter, the Lee antibunching function $d^{(\ell-1)}_…
In the Steiner Forest problem, we are given a graph with edge lengths, and a collection of demand pairs; the goal is to find a subgraph of least total length such that each demand pair is connected in…
Free open-access publishing with Google Scholar indexing.
Submission Guide →