A high-performance algorithm for identifying frequent items in data streams. - Daniel Anderson; Pryce Bevan; Kevin J. Lang; Edo Liberty; Lee Rhodes; Justin Thaler (Internet Measurement Conference, 2017)

An Arbitrary-Order Scheme on Generic Meshes for Miscible Displacements in Porous Media. - Daniel Anderson; Jérôme Droniou (SIAM J. Sci. Comput., 2018)

Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation. - Daniel Anderson; Gregor Hendel; Pierre Le Bodic; Merlin Viernickel (AAAI, 2019)

Parallel Batch-Dynamic Graph Connectivity. - Umut A. Acar; Daniel Anderson; Guy E. Blelloch; Laxman Dhulipala (SPAA, 2019)

Parallel Batch-Dynamic Trees via Change Propagation. - Umut A. Acar; Daniel Anderson; Guy E. Blelloch; Laxman Dhulipala; Sam Westrick (ESA, 2020)

Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model. - Daniel Anderson; Guy E. Blelloch; Kanat Tangwongsan (SPAA, 2020)

ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines. - Guy E. Blelloch; Daniel Anderson; Laxman Dhulipala (SPAA, 2020)

Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees. - Umut A. Acar; Daniel Anderson; Guy E. Blelloch; Laxman Dhulipala; Sam Westrick (CoRR, 2020)

Fabricaide: Fabrication-Aware Design for 2D Cutting Machines. - Ticha Sethapakdi; Daniel Anderson; Adrian Reginald Chua Sy; Stefanie Müller 001 (CHI, 2021)

Concurrent deferred reference counting with constant-time overhead. - Daniel Anderson; Guy E. Blelloch; Yuanhao Wei (PLDI, 2021)

Efficient Parallel Self-Adjusting Computation. - Daniel Anderson; Guy E. Blelloch; Anubhav Baweja; Umut A. Acar (SPAA, 2021)

Parallel Minimum Cuts in O(m log2(n)) Work and Low Depth. - Daniel Anderson; Guy E. Blelloch (CoRR, 2021)

Further results on an abstract model for branching and its application to mixed integer programming. - Daniel Anderson; Pierre Le Bodic; Kerri Morgan (Math. Program., 2021)

Turning manual concurrent memory reclamation into automatic reference counting. - Daniel Anderson; Guy E. Blelloch; Yuanhao Wei (PLDI, 2022)

The problem-based benchmark suite (PBBS), V2. - Daniel Anderson; Guy E. Blelloch; Laxman Dhulipala; Magdalen Dobson; Yihan Sun 001 (PPoPP, 2022)

Parallel block-delayed sequences. - Sam Westrick; Mike Rainey; Daniel Anderson; Guy E. Blelloch (PPoPP, 2022)

Neural Font Rendering. - Daniel Anderson; Ariel Shamir; Ohad Fried (CoRR, 2022)

Estimating the Size of Branch-and-Bound Trees. - Gregor Hendel; Daniel Anderson; Pierre Le Bodic; Marc E. Pfetsch (INFORMS J. Comput., 2022)

Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management (Abstract). - Daniel Anderson; Guy E. Blelloch; Yuanhao Wei (HOPC@SPAA, 2023)

Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span. - Daniel Anderson; Guy E. Blelloch (CoRR, 2023)

Parallel Minimum Cuts in O(m log2 n) Work and Low Depth. - Daniel Anderson; Guy E. Blelloch (ACM Trans. Parallel Comput., 2023)

A Fast Wait-Free Solution to Read-Reclaim Races in Reference Counting. - Ivo Gabe de Wolff; Daniel Anderson; Gabriele K. Keller; Aleksei Seletskiy (Euro-Par (3), 2024)

Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees. - Daniel Anderson; Guy E. Blelloch (SPAA, 2024)

Big Atomics and Fast Hash Tables. - Daniel Anderson; Guy E. Blelloch; Siddhartha V. Jayanti (PPoPP, 2025)

Parallel Batch Queries on Dynamic Trees: Algorithms and Experiments. - Humza Ikram; Andrew C. Brady; Daniel Anderson; Guy E. Blelloch (SPAA, 2025)

Big Atomics. - Daniel Anderson; Guy E. Blelloch; Siddhartha Jayanti (CoRR, 2025)