Publications

PIM-zd-tree: A Fast Space-Partitioning Index Leveraging Processing-in-Memory
Space-partitioning indexes are widely used for managing multi-dimensional data, but their throughput is often memory-bottlenecked. …
Yiwei Zhao, Hongbo Kang, Ziyang Men, Yan Gu, Guy E. Blelloch, Laxman Dhulipala, Charles McGuffey, Phillip B. Gibbons
DOI Conference paper Full paper Code
Parallel Dynamic Spatial Indexes
Maintaining spatial data (points in two or three dimensions) is crucial and has a wide range of applications, such as graphics, GIS, …
Ziyang Men, Bo Huang, Yan Gu, Yihan Sun
DOI Conference paper Full paper Code
Parallel $k$d-tree with Batch Updates
The $k$d-tree is one of the most widely used data structures to manage multi-dimensional data. Due to the ever-growing data volume, it …
Ziyang Men, Zheqi Shen, Yan Gu, Yihan Sun
DOI Conference paper Full paper Code
Parallel Longest Increasing Subsequence and van Emde Boas Trees
This paper studies parallel algorithms for the longest increasing subsequence (LIS) problem. Let $n$ be the input size and $k$ be the …
(In Alphabetical Order) Yan Gu, Ziyang Men, Zheqi Shen, Yihan Sun, Zijin Wan
DOI Conference paper Full paper Code
A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem
Given an undirected graph $G$ with a cost function on vertices, a collection of subgraphs of $G$ such that in each subgraph, there are …
Mengfan Ma, Ziyang Men, André Rossi, Yi Zhou, Mingyu Xiao
DOI Journal paper Code
Leveraging cutting planes reasoning for faster Pseudo-Boolean solving and optimization
Among the execution of modern Boolean Satisfiability (SAT) and Mixed Integer Programming (MIP) solvers, presolving is a commonly …
Ziyang Men
Full paper Supplements and Corrections Code