Daniel Anderson

34 papers A* 4A 2B 10Journal 16Unranked 2
YearRankTypeTitle / Venue / Authors
2025 B conf
Big Atomics and Fast Hash Tables.
PPoPP
Daniel Anderson, Guy E. Blelloch, Siddhartha V. Jayanti
2025 J jnl
Big Atomics.
CoRR
Daniel Anderson, Guy E. Blelloch, Siddhartha Jayanti
2025 B conf
Parallel Batch Queries on Dynamic Trees: Algorithms and Experiments.
SPAA
Humza Ikram, Andrew C. Brady, Daniel Anderson, Guy E. Blelloch
2025 J jnl
Parallel batch queries on dynamic trees: algorithms and experiments.
CoRR
Humza Ikram, Andrew C. Brady, Daniel Anderson, Guy E. Blelloch
2024 — conf
A Fast Wait-Free Solution to Read-Reclaim Races in Reference Counting.
Euro-Par (3)
Ivo Gabe de Wolff, Daniel Anderson, Gabriele K. Keller, Aleksei Seletskiy
2024 B conf
Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees.
SPAA
Daniel Anderson, Guy E. Blelloch
2023 J jnl
Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span.
CoRR
Daniel Anderson, Guy E. Blelloch
2023 J jnl
Parallel Minimum Cuts in
ACM Trans. Parallel Comput.
Daniel Anderson, Guy E. Blelloch
2023 — conf
Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management (Abstract).
HOPC@SPAA
Daniel Anderson, Guy E. Blelloch, Yuanhao Wei
2022 J jnl
Estimating the Size of Branch-and-Bound Trees.
INFORMS J. Comput.
Gregor Hendel, Daniel Anderson, Pierre Le Bodic, Marc E. Pfetsch
2022 J jnl
Neural Font Rendering.
CoRR
Daniel Anderson, Ariel Shamir, Ohad Fried
2022 B conf
Parallel block-delayed sequences.
PPoPP
Sam Westrick, Mike Rainey, Daniel Anderson, Guy E. Blelloch
2022 B conf
The problem-based benchmark suite (PBBS), V2.
PPoPP
Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Magdalen Dobson, Yihan Sun
2022 J jnl
Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting.
CoRR
Daniel Anderson, Guy E. Blelloch, Yuanhao Wei
2022 A* conf
Turning manual concurrent memory reclamation into automatic reference counting.
PLDI
Daniel Anderson, Guy E. Blelloch, Yuanhao Wei
2021 A* conf
Concurrent deferred reference counting with constant-time overhead.
PLDI
Daniel Anderson, Guy E. Blelloch, Yuanhao Wei
2021 B conf
Efficient Parallel Self-Adjusting Computation.
SPAA
Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar
2021 J jnl
Efficient Parallel Self-Adjusting Computation.
CoRR
Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar
2021 A* conf
Fabricaide: Fabrication-Aware Design for 2D Cutting Machines.
CHI
Ticha Sethapakdi, Daniel Anderson, Adrian Reginald Chua Sy, Stefanie Müller
2021 J jnl
Further results on an abstract model for branching and its application to mixed integer programming.
Math. Program.
Daniel Anderson, Pierre Le Bodic, Kerri Morgan
2021 B conf
Parallel Minimum Cuts in
SPAA
Daniel Anderson, Guy E. Blelloch
2021 J jnl
Parallel Minimum Cuts in O(m log
CoRR
Daniel Anderson, Guy E. Blelloch
2020 J jnl
Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees.
CoRR
Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick
2020 A conf
Parallel Batch-Dynamic Trees via Change Propagation.
ESA
Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick
2020 B conf
ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines.
SPAA
Guy E. Blelloch, Daniel Anderson, Laxman Dhulipala
2020 B conf
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model.
SPAA
Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan
2020 J jnl
Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model.
CoRR
Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan
2019 A* conf
Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation.
AAAI
Daniel Anderson, Gregor Hendel, Pierre Le Bodic, Merlin Viernickel
2019 B conf
Parallel Batch-Dynamic Graph Connectivity.
SPAA
Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala
2019 J jnl
Parallel Batch-Dynamic Graph Connectivity.
CoRR
Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala
2018 J jnl
An Arbitrary-Order Scheme on Generic Meshes for Miscible Displacements in Porous Media.
SIAM J. Sci. Comput.
Daniel Anderson, Jérôme Droniou
2017 J jnl
A High-Performance Algorithm for Identifying Frequent Items in Data Streams.
CoRR
Daniel Anderson, Pryce Bevan, Kevin J. Lang, Edo Liberty, Lee Rhodes, Justin Thaler
2017 A conf
A high-performance algorithm for identifying frequent items in data streams.
Internet Measurement Conference
Daniel Anderson, Pryce Bevan, Kevin J. Lang, Edo Liberty, Lee Rhodes, Justin Thaler
2017 J jnl
An arbitrary order scheme on generic meshes for miscible displacements in porous media.
CoRR
Daniel Anderson, Jérôme Droniou