Specialty
A mathematical analysis of the GREEDY algorithm finds sharply different worst-case behavior across fixed input lengths. The work proves a lower bound of 2 for every length k ≥ 6 and determines the exact ratio for k = 3.
Scientific publication5 min read
An arXiv modeling paper studies fair allocation as indivisible items arrive over time. It finds constructive guarantees in restricted settings, but shows that TEF1 implies no more than a tight 1/n temporal maximin-share guarantee for additive goods.
Scientific publication3 min read
A preprint on Seg-Agony charts the computational boundary for temporal directed-graph instances. It reports fixed-parameter tractability for the combined parameters n + ℓ, a polynomial-time algorithm for two ranks, and hardness results in unweighted three- and four-rank regimes.
Scientific publication4 min read
An arXiv preprint reports tractable Argmin and Argmax logic on bounded-width graphs, alongside hardness results for an external-set formulation.
Scientific publication3 min read
An arXiv preprint develops a formal probability framework for a six-valued logical system representing gaps, gluts and reliability. It connects several probability representations through inverse mappings and reports equivalent semantic and syntactic update rules. The work is mathematical rather than empirical.
Scientific publication5 min read
A methods preprint studies how allowing relative error changes the guarantees for differentially private continual release. Its bounds improve additive error for several tasks and stream settings, while adaptive MinSelect remains subject to a large lower bound.
Scientific publication4 min read
An arXiv preprint finds a sharp divide in Product-Gap, a randomized facility-location rule on the real line. Its expected social cost is at most 2k times optimal for every k ≥ 2, but strategyproofness in expectation holds only for two and three facilities and fails from four onward.
Scientific publication5 min read
A computational geometry preprint reports new counts of flat polyomino nets that can fold into multiple cuboid shapes, while leaving the minimum-area and four-shape questions open.
Scientific publication4 min read