Person:6072039

MaRDI QIDQ6072039zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Errors are Robustly Tamed in Cumulative Knowledge Processes (available as arXiv preprint)	N/A	Paper
A fast coloring oracle for average case hypergraphs	2026-09-11	Paper
Scramble number and tree-cut decompositions The Art of Discrete and Applied Mathematics	2026-08-31	Paper
Characterizing the distinguishability of product distributions through multicalibration	2026-07-14	Paper
Finding the root in random nearest neighbor trees Random Structures & Algorithms	2026-04-10	Paper
Errors are robustly tamed in cumulative knowledge processes Proceedings of the National Academy of Sciences of the United States of America	2026-03-13	Paper
Recovering Assignments with One-Sided Noise (available as arXiv preprint)	2026-01-01	Paper
Graph k-Coloring in Average Sublinear Time (available as arXiv preprint)	2026-01-01	Paper
Quality Control Algorithms for Pattern Counting (available as arXiv preprint)	2026-01-01	Paper
A Fast Coloring Oracle for Average Case Hypergraphs (available as arXiv preprint)	2025-01-01	Paper
The gonality of circulant graphs (available as arXiv preprint)	2025-01-01	Paper
Quality control in sublinear time: a case study via random graphs (available as arXiv preprint)	2025-01-01	Paper
Uniformity testing over hypergrids with subcube conditioning	2024-11-28	Paper
Finding the root in random nearest neighbor trees (available as arXiv preprint)	2024-01-01	Paper
Uniform scrambles on graphs (available as arXiv preprint)	2023-11-29	Paper
Uniform scrambles on graphs	2023-11-29	Paper
Uniformity Testing over Hypergrids with Subcube Conditioning	2023-02-17	Paper
Scramble number and tree-cut decompositions	2022-09-03	Paper
Bounds on higher graph gonality	2022-06-14	Paper
Bounds on higher graph gonality (available as arXiv preprint)	2022-01-01	Paper
Scramble number and tree-cut decompositions (available as arXiv preprint)	2022-01-01	Paper

Research outcomes over time

This page was built for person: