Photo by Ticha Sethapakdi

Daniel Anderson

Computer Science PhD Student at Carnegie Mellon University

Contact:
Room 7001, Gates Hillman Center
Carnegie Mellon University
4902 Forbes Avenue
Pittsburgh, PA 15213, USA

Refereed Publications

Accepted (To Appear)

  1. Estimating the Size of Branch-and-Bound Trees
    Gregor Hendel, Daniel Anderson, Pierre Le Bodic, Marc E. Pfetsch
    To appear in INFORMS Journal on Computing
    [Preprint]

Published

  1. Efficient Parallel Self-Adjusting Computation
    Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar
    The 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 21), 2021
    [Conference Paper] [Preprint] [DOI] [Code]
  2. Parallel Minimum Cuts in \(O(m \log^2(n))\) Work and Low Depth
    Daniel Anderson, Guy E. Blelloch
    The 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 21), 2021
     SPAA 2021 Best Paper award
    [Conference Paper] [Preprint] [DOI]
  3. Concurrent Deferred Reference Counting with Constant-Time Overhead
    Daniel Anderson, Guy E. Blelloch, Yunhao Wei
    The 42nd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2021), 2021
    [Conference Paper] [DOI] [Code]
  4. Fabricaide: Fabrication-Aware Design for 2D Cutting Machines
    Ticha Sethapakdi, Daniel Anderson, Adrian Reginald Chua Sy, Stefanie Mueller
    The 2021 ACM CHI Conference on Human Factors in Computing Systems (CHI 2021), 2021
    [Conference Paper] [Project Page] [Video] [Code]
  5. Further Results on an Abstract Model for Branching and its Application to Mixed Integer Programming
    Daniel Anderson, Pierre Le Bodic, Kerri Morgan
    Mathematical Programming, 190, 811–841 (2021)
    Published online: 27 August 2020
    [Journal Paper] [Preprint] [DOI]
  6. Parallel Batch-dynamic Trees via Change Propagation
    Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick
    The 28th Annual European Symposium on Algorithms (ESA 2020), 2020
    [Conference paper] [Preprint] [DOI]
  7. Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model
    Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan
    The 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 20), 2020
    [Conference paper] [Preprint] [DOI]
  8. Parallel Batch-Dynamic Graph Connectivity
    Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala
    The 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 19), 2019
    [Conference paper] [Preprint (Full version)] [DOI]
  9. Clairvoyant restarts in branch-and-bound search using online tree size estimation
    Daniel Anderson, Gregor Hendel, Pierre Le Bodic, Merlin Viernickel
    The 33rd AAAI Conference on Artificial Intelligence (AAAI 19), 2019
    [Conference paper] [Preprint] [DOI] [Code]
  10. An Arbitrary-order Scheme on Generic Meshes for Miscible Displacements in Porous Media
    Daniel Anderson, Jérôme Droniou
    SIAM Journal on Scientific Computing, 40 (4), B1020-B1054, 2018
    [Journal paper] [Preprint] [DOI] [Code]

Other Publications

Preprints

Peer-reviewed Brief Announcements

  1. Brief Announcement: ParlayLib — A toolkit for parallel algorithms on shared-memory multicore machines
    Guy E. Blelloch, Daniel Anderson, Laxman Dhulipala
    The 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 20), 2020
    [Brief Announcement] [DOI] [Library]

Technical Reports

  1. The SCIP Optimization Suite 7.0
    Gerald Gamrath, Daniel Anderson, Ksenia Bestuzheva, Wei-Kun Chen, Leon Eifler, Maxime Gasse, Patrick Gemander, Ambros Gleixner, Leona Gottwald, Katrin Halbig, Gregor Hendel, Christopher Hojny, Thorsten Koch, Pierre Le Bodic, Stephen J. Maher, Frederic Matter, Matthias Miltenberger, Erik Mühmer, Benjamin Müller, Marc E. Pfetsch, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Christine Tawfik, Stefan Vigerske, Fabian Wegscheider, Dieter Weninger, Jakob Witzig
    ZIB-Report 20-10, Zuse Institute Berlin, Takustr 7, 14195 Berlin, Germany
    [Tech Report]