Følg
Daniel Anderson
Daniel Anderson
Assistant Teaching Professor, Carnegie Mellon University
Verifisert e-postadresse på cs.cmu.edu - Startside
Tittel
Sitert av
Sitert av
År
The SCIP Optimization Suite 7.0
G Gamrath, D Anderson, K Bestuzheva, WK Chen, L Eifler, M Gasse, ...
Zuse Institute Berlin Technical Report, 2020
3052020
ParlayLib-a toolkit for parallel algorithms on shared-memory multicore machines
GE Blelloch, D Anderson, L Dhulipala
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020
742020
Parallel batch-dynamic graph connectivity
UA Acar, D Anderson, GE Blelloch, L Dhulipala
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 381-392, 2019
502019
An arbitrary-order scheme on generic meshes for miscible displacements in porous media
D Anderson, J Droniou
SIAM Journal on Scientific Computing 40 (4), B1020-B1054, 2018
202018
Fabricaide: Fabrication-aware design for 2d cutting machines
T Sethapakdi, D Anderson, ARC Sy, S Mueller
Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems …, 2021
182021
Estimating the size of branch-and-bound trees
G Hendel, D Anderson, P Le Bodic, ME Pfetsch
INFORMS Journal on Computing 34 (2), 934-952, 2022
172022
Concurrent deferred reference counting with constant-time overhead
D Anderson, GE Blelloch, Y Wei
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming …, 2021
162021
Parallel batch-dynamic trees via change propagation
UA Acar, D Anderson, GE Blelloch, L Dhulipala, S Westrick
Proceedings of the 28th Annual European Symposium on Algorithms, 1-22, 2020
16*2020
The problem-based benchmark suite (PBBS), v2
D Anderson, GE Blelloch, L Dhulipala, M Dobson, Y Sun
Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of …, 2022
152022
Clairvoyant restarts in branch-and-bound search using online tree-size estimation
D Anderson, G Hendel, P Le Bodic, M Viernickel
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1427-1434, 2019
152019
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model
D Anderson, GE Blelloch, K Tangwongsan
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020
92020
Parallel Minimum Cuts in Work and Low Depth
D Anderson, GE Blelloch
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021
82021
Turning manual concurrent memory reclamation into automatic reference counting
D Anderson, GE Blelloch, Y Wei
Proceedings of the 43rd ACM SIGPLAN International Conference on Programming …, 2022
72022
Parallel block-delayed sequences
S Westrick, M Rainey, D Anderson, GE Blelloch
Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of …, 2022
72022
Further results on an abstract model for branching and its application to mixed integer programming
D Anderson, P Le Bodic, K Morgan
Mathematical Programming 190 (1-2), 811 - 841, 2021
52021
Efficient Parallel Self-Adjusting Computation
D Anderson, GE Blelloch, A Baweja, UA Acar
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021
52021
Parallel Batch-Dynamic Algorithms Dynamic Trees, Graphs, and Self-Adjusting Computation
D Anderson
Carnegie Mellon University, 2023
32023
Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span
D Anderson, GE Blelloch
arXiv preprint arXiv:2306.08786, 2023
12023
Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees
D Anderson, GE Blelloch
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and …, 2024
2024
Poster: The Problem-Based Benchmark Suite (PBBS), V2
D Anderson, GE Blelloch, L Dhulipala, M Dobson, Y Sun
Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of …, 2022
2022
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20