1 citations · 1 across the 10 of their papers we have counts for
17 papers
Sum-of-Local-Effects Data Structures for Separable Graphs
Xing Lyu, Travis Gagie, Meng He +2
It is not difficult to think of applications that can be modelled as graph problems in which placing some facility or commodity at a vertex has some positive or negative effect on…
Shortest Beer Path Queries in Interval Graphs
Rathish Das, Meng He, Eitan Kondratovsky +3
Our interest is in paths between pairs of vertices that go through at least one of a subset of the vertices known as beer vertices. Such a path is called a beer path, and the beer…
R2F: A Remote Retraining Framework for AIoT Processors with Computing Errors
Dawen Xu, Meng He, Cheng Liu +5
AIoT processors fabricated with newer technology nodes suffer rising soft errors due to the shrinking transistor sizes and lower power supply. Soft errors on the AIoT processors pa…
Space Efficient Two-Dimensional Orthogonal Colored Range Counting
Younan Gao, Meng He
In the two-dimensional orthogonal colored range counting problem, we preprocess a set, , of colored points on the plane, such that given an orthogonal query rectangle, the n…
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees
Meng He, J. Ian Munro, Yakov Nekrich +2
We present the first succinct distance oracles for (unweighted) interval graphs and related classes of graphs, using a novel succinct data structure for ordinal trees that supports…
Path Query Data Structures in Practice
Meng He, Serikzhan Kazi
We perform experimental studies on data structures that answer path median, path counting, and path reporting queries in weighted trees. These query problems generalize the well-kn…