Daniel Anderson

According to our database, Daniel Anderson authored at least 21 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Parallel Minimum Cuts in <i>O</i>(<i>m</i> log² <i>n</i>) Work and Low Depth.

Daniel Anderson, Guy E. Blelloch

ACM Trans. Parallel Comput., December, 2023

Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span.

Daniel Anderson, Guy E. Blelloch

CoRR, 2023

Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management (Abstract).

Daniel Anderson, Guy E. Blelloch, Yuanhao Wei

Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

2022

Estimating the Size of Branch-and-Bound Trees.

Gregor Hendel, Daniel Anderson, Pierre Le Bodic, Marc E. Pfetsch

INFORMS J. Comput., 2022

Neural Font Rendering.

Daniel Anderson, Ariel Shamir, Ohad Fried

CoRR, 2022

Parallel block-delayed sequences.

Sam Westrick, Mike Rainey, Daniel Anderson, Guy E. Blelloch

Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

The problem-based benchmark suite (PBBS), V2.

Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Magdalen Dobson, Yihan Sun

Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

Turning manual concurrent memory reclamation into automatic reference counting.

Daniel Anderson, Guy E. Blelloch, Yuanhao Wei

Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

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

Parallel Minimum Cuts in O(m log²(n)) Work and Low Depth.

Daniel Anderson, Guy E. Blelloch

CoRR, 2021

Efficient Parallel Self-Adjusting Computation.

Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Concurrent deferred reference counting with constant-time overhead.

Daniel Anderson, Guy E. Blelloch, Yuanhao Wei

Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Fabricaide: Fabrication-Aware Design for 2D Cutting Machines.

Ticha Sethapakdi, Daniel Anderson, Adrian Reginald Chua Sy, Stefanie Müller

Proceedings of the CHI '21: CHI Conference on Human Factors in Computing Systems, 2021

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

ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines.

Guy E. Blelloch, Daniel Anderson, Laxman Dhulipala

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model.

Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Parallel Batch-Dynamic Trees via Change Propagation.

Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Parallel Batch-Dynamic Graph Connectivity.

Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation.

Daniel Anderson, Gregor Hendel, Pierre Le Bodic, Merlin Viernickel

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

An Arbitrary-Order Scheme on Generic Meshes for Miscible Displacements in Porous Media.

Daniel Anderson, Jérôme Droniou

SIAM J. Sci. Comput., 2018

2017

A high-performance algorithm for identifying frequent items in data streams.

Daniel Anderson, Pryce Bevan, Kevin J. Lang, Edo Liberty, Lee Rhodes, Justin Thaler

Proceedings of the 2017 Internet Measurement Conference, 2017