default search action
Helen Xu 0001
Person information
- affiliation: Lawrence Berkeley National Laboratory, CA, USA
- affiliation (PhD 2022): Massachusetts Institute of Technology, USA
Other persons with the same name
- Helen Xu — disambiguation page
- Helen Xu 0002 — Queen's University at Kingston, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Brian Wheatman, Xiaojun Dong, Zheqi Shen, Laxman Dhulipala, Jakub Lacki, Prashant Pandey, Helen Xu:
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers. Proc. VLDB Endow. 17(9): 2307-2320 (2024) - [c20]Helen Xu
, Amanda Li
BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees (Abstract). HOPC@SPAA 2024 - [c19]Brian Wheatman
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers. PPoPP 2024: 348-363 - [i6]Brian Wheatman, Xiaojun Dong, Zheqi Shen, Laxman Dhulipala, Jakub Lacki, Prashant Pandey, Helen Xu:
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers. CoRR abs/2405.11671 (2024) - 2023
- [j1]Helen Xu
BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees. Proc. VLDB Endow. 16(11): 2976-2989 (2023) - [c18]Brian Wheatman
Optimizing Search Layouts in Packed Memory Arrays. ALENEX 2023: 148-161 - [c17]Helen Xu, Tao B. Schardl, Michael Pellauer, Joel S. Emer:
Optimizing Compression Schemes for Parallel Sparse Tensor Algebra. DCC 2023: 373 - [c16]Helen Xu, Tao B. Schardl, Michael Pellauer, Joel S. Emer:
Optimizing Compression Schemes for Parallel Sparse Tensor Algebra. HPEC 2023: 1-7 - [i5]Brian Wheatman, Randal C. Burns, Aydin Buluç
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers. CoRR abs/2305.05055 (2023) - 2022
- [b1]Helen Xu:
The Locality-First Strategy for Developing Efficient Multicore Algorithm. Massachusetts Institute of Technology, USA, 2022 - [c15]Arghya Bhattacharya, Abiyaz Chowdhury, Helen Xu, Rathish Das, Rezaul Alam Chowdhury, Rob Johnson, Rishab Nithyanand, Michael A. Bender:
When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting. ESA 2022: 16:1-16:17 - 2021
- [c14]Helen Xu, Sean Fraser, Charles E. Leiserson:
Multidimensional Included and Excluded Sums. ACDA 2021: 182-192 - [c13]Brian Wheatman
A Parallel Packed Memory Array to Store Dynamic Graphs. ALENEX 2021: 31-45 - [c12]Shahin Kamali, Helen Xu:
Beyond Worst-case Analysis of Multicore Caching Strategies. APOCS 2021: 1-15 - [c11]Prashant Pandey, Brian Wheatman
Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs. SIGMOD Conference 2021: 1372-1385 - [i4]Helen Xu, Sean Fraser, Charles E. Leiserson:
Multidimensional Included and Excluded Sums. CoRR abs/2106.00124 (2021) - 2020
- [c10]Sean Fraser, Helen Xu, Charles E. Leiserson:
Work-Efficient Parallel Algorithms for Accurate Floating-Point Prefix Sums. HPEC 2020: 1-7 - [c9]Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. SPAA 2020: 63-73 - [c8]Shahin Kamali, Helen Xu:
Multicore Paging Algorithms Cannot Be Competitive. SPAA 2020: 547-549 - [i3]Shahin Kamali, Helen Xu:
Beyond Worst-case Analysis of Multicore Caching Strategies. CoRR abs/2011.02046 (2020)
2010 – 2019
- 2019
- [c7]James B. Aimone
Dynamic Programming with Spiking Neural Computing. ICONS 2019: 20:1-20:9 - 2018
- [c6]Brian Wheatman
Packed Compressed Sparse Row: A Dynamic Graph Representation. HPEC 2018: 1-7 - [c5]Willow Ahrens
A Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats. IPDPS 2018: 546-556 - [c4]Andrea Lincoln
Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity. SPAA 2018: 213-222 - 2017
- [c3]Michael A. Bender, Martin Farach-Colton
Write-Optimized Skip Lists. PODS 2017: 69-78 - 2016
- [c2]David John Zage, Helen Xu, Thomas M. Kroeger, Bridger Hahn, Nolan P. Donoghue, Thomas R. Benson:
Secure distributed membership tests via secret sharing: How to hide your hostile hosts: Harnessing shamir secret sharing. ICNC 2016: 1-6 - 2015
- [c1]Nolan P. Donoghue, Bridger Hahn, Helen Xu, Thomas M. Kroeger, David Zage, Rob Johnson:
Tracking Network Events with Write Optimized Data Structures. BADGERS@RAID 2015: 1-7 - [i2]Nolan Donoghue, Bridger Hahn, Helen Xu, Thomas M. Kroeger, David Zage, Rob Johnson:
Tracking Network Events with Write Optimized Data Structures: The Design and Implementation of TWIAD: The Write-Optimized IP Address Database. CoRR abs/1511.09116 (2015) - [i1]David John Zage, Helen Xu, Thomas M. Kroeger, Bridger Hahn, Nolan Donoghue, Thomas R. Benson:
Secure Distributed Membership Tests via Secret Sharing: How to Hide Your Hostile Hosts Harnessing Shamir Secret Sharing. CoRR abs/1512.00102 (2015)
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-10-25 20:11 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: