Helen Xu

Orcid: 0000-0003-2232-3305

Affiliations:
  • Lawrence Berkeley National Laboratory, CA, USA
  • Massachusetts Institute of Technology, USA (PhD 2022)


According to our database1, Helen Xu authored at least 21 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

2023
BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees.
Proc. VLDB Endow., 2023

Optimizing Compression Schemes for Parallel Sparse Tensor Algebra.
Proceedings of the Data Compression Conference, 2023

Optimizing Search Layouts in Packed Memory Arrays.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
The Locality-First Strategy for Developing Efficient Multicore Algorithm.
PhD thesis, 2022

When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Beyond Worst-case Analysis of Multicore Caching Strategies.
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

A Parallel Packed Memory Array to Store Dynamic Graphs.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

Multidimensional Included and Excluded Sums.
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020
Multicore Paging Algorithms Cannot Be Competitive.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Work-Efficient Parallel Algorithms for Accurate Floating-Point Prefix Sums.
Proceedings of the 2020 IEEE High Performance Extreme Computing Conference, 2020

2019
Dynamic Programming with Spiking Neural Computing.
Proceedings of the International Conference on Neuromorphic Systems, 2019

2018
Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

A Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Packed Compressed Sparse Row: A Dynamic Graph Representation.
Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

2017
Write-Optimized Skip Lists.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

2016
Secure distributed membership tests via secret sharing: How to hide your hostile hosts: Harnessing shamir secret sharing.
Proceedings of the 2016 International Conference on Computing, 2016

2015
Tracking Network Events with Write Optimized Data Structures: The Design and Implementation of TWIAD: The Write-Optimized IP Address Database.
CoRR, 2015

Tracking Network Events with Write Optimized Data Structures.
Proceedings of the 4th International Workshop on Building Analysis Datasets and Gathering Experience Returns for Security, 2015


  Loading...