default search action
Daniel Anderson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c16]Ivo Gabe de Wolff
, Daniel Anderson
A Fast Wait-Free Solution to Read-Reclaim Races in Reference Counting. Euro-Par (3) 2024: 103-118 - [c15]Daniel Anderson
Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees. SPAA 2024: 247-258 - 2023
- [j4]Daniel Anderson
Parallel Minimum Cuts in O(m log2 n) Work and Low Depth. ACM Trans. Parallel Comput. 10(4): 18:1-18:28 (2023) - [c14]Daniel Anderson
Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management (Abstract). HOPC@SPAA 2023: 9-10 - [i10]Daniel Anderson, Guy E. Blelloch:
Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span. CoRR abs/2306.08786 (2023) - 2022
- [j3]Gregor Hendel
Estimating the Size of Branch-and-Bound Trees. INFORMS J. Comput. 34(2): 934-952 (2022) - [c13]Daniel Anderson, Guy E. Blelloch, Yuanhao Wei:
Turning manual concurrent memory reclamation into automatic reference counting. PLDI 2022: 61-75 - [c12]Sam Westrick
Parallel block-delayed sequences. PPoPP 2022: 61-75 - [c11]Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Magdalen Dobson, Yihan Sun:
The problem-based benchmark suite (PBBS), V2. PPoPP 2022: 445-447 - [i9]Daniel Anderson, Guy E. Blelloch, Yuanhao Wei:
Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting. CoRR abs/2204.05985 (2022) - [i8]Daniel Anderson, Ariel Shamir, Ohad Fried:
Neural Font Rendering. CoRR abs/2211.14802 (2022) - 2021
- [j2]Daniel Anderson
Further results on an abstract model for branching and its application to mixed integer programming. Math. Program. 190(1): 811-841 (2021) - [c10]Ticha Sethapakdi, Daniel Anderson, Adrian Reginald Chua Sy, Stefanie Müller:
Fabricaide: Fabrication-Aware Design for 2D Cutting Machines. CHI 2021: 664:1-664:12 - [c9]Daniel Anderson
Concurrent deferred reference counting with constant-time overhead. PLDI 2021: 526-541 - [c8]Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar:
Efficient Parallel Self-Adjusting Computation. SPAA 2021: 59-70 - [c7]Daniel Anderson, Guy E. Blelloch:
Parallel Minimum Cuts in O(m log2n) Work and Low Depth. SPAA 2021: 71-82 - [i7]Daniel Anderson, Guy E. Blelloch:
Parallel Minimum Cuts in O(m log2(n)) Work and Low Depth. CoRR abs/2102.05301 (2021) - [i6]Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar:
Efficient Parallel Self-Adjusting Computation. CoRR abs/2105.06712 (2021) - 2020
- [c6]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick
Parallel Batch-Dynamic Trees via Change Propagation. ESA 2020: 2:1-2:23 - [c5]Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan:
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model. SPAA 2020: 51-61 - [c4]Guy E. Blelloch, Daniel Anderson, Laxman Dhulipala:
ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines. SPAA 2020: 507-509 - [i5]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick:
Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees. CoRR abs/2002.05129 (2020) - [i4]Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan:
Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model. CoRR abs/2002.05710 (2020)
2010 – 2019
- 2019
- [c3]Daniel Anderson, Gregor Hendel, Pierre Le Bodic, Merlin Viernickel:
Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation. AAAI 2019: 1427-1434 - [c2]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala:
Parallel Batch-Dynamic Graph Connectivity. SPAA 2019: 381-392 - [i3]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala:
Parallel Batch-Dynamic Graph Connectivity. CoRR abs/1903.08794 (2019) - 2018
- [j1]Daniel Anderson, Jérôme Droniou:
An Arbitrary-Order Scheme on Generic Meshes for Miscible Displacements in Porous Media. SIAM J. Sci. Comput. 40(4): B1020-B1054 (2018) - 2017
- [c1]Daniel Anderson, Pryce Bevan, Kevin J. Lang, Edo Liberty, Lee Rhodes, Justin Thaler:
A high-performance algorithm for identifying frequent items in data streams. Internet Measurement Conference 2017: 268-282 - [i2]Daniel Anderson, Pryce Bevan, Kevin J. Lang, Edo Liberty, Lee Rhodes, Justin Thaler:
A High-Performance Algorithm for Identifying Frequent Items in Data Streams. CoRR abs/1705.07001 (2017) - [i1]Daniel Anderson, Jérôme Droniou:
An arbitrary order scheme on generic meshes for miscible displacements in porous media. CoRR abs/1707.04038 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: