The following pages link to Meng He (Q306714):
Displayed 50 items.
- Dynamic range majority data structures (Q306716) (← links)
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- Untangled monotonic chains and adaptive range search (Q553358) (← links)
- Tree path majority data structures (Q784481) (← links)
- Path queries on functions (Q1740690) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- Range majority in constant time and linear space (Q1951579) (← links)
- Data structures for categorical path counting queries (Q2089697) (← links)
- Compressed dynamic range majority and minority data structures (Q2182101) (← links)
- Maximal and convex layers of random point sets (Q2294718) (← links)
- On minimum- and maximum-weight minimum spanning trees with neighborhoods (Q2344217) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Succinct representation of labeled graphs (Q2428673) (← links)
- Succinct and I/O efficient data structures for traversal in trees (Q2429347) (← links)
- On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods (Q2848917) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- The Distance 4-Sector of Two Points Is Unique (Q2872125) (← links)
- Succinct Data Structures for Path Queries (Q2912875) (← links)
- Succinct Indices for Path Minimum, with Applications to Path Reporting (Q2921409) (← links)
- (Q2921650) (← links)
- (Q2934653) (← links)
- Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries (Q2942621) (← links)
- Dynamic Path Counting and Reporting in Linear Space (Q2942661) (← links)
- Range Majority in Constant Time and Linear Space (Q3012810) (← links)
- Path Queries in Weighted Trees (Q3104608) (← links)
- Dynamic Range Majority Data Structures (Q3104609) (← links)
- Dynamic Range Selection in Linear Space (Q3104610) (← links)
- Deletion without Rebalancing in Non-Blocking Binary Search Trees (Q3174967) (← links)
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing (Q3183444) (← links)
- Succinct indexes for strings, binary relations and multilabeled trees (Q3189037) (← links)
- Succinct geometric indexes supporting point location queries (Q3189051) (← links)
- Succinct ordinal trees based on tree covering (Q3189085) (← links)
- (Q3193847) (← links)
- Succinct and I/O Efficient Data Structures for Traversal in Trees (Q3596711) (← links)
- Untangled Monotonic Chains and Adaptive Range Search (Q3652206) (← links)
- I/O and Space-Efficient Path Traversal in Planar Graphs (Q3652302) (← links)
- (Q4633875) (← links)
- On the Advice Complexity of Buffer Management (Q4909530) (← links)
- A Framework for Succinct Labeled Ordinal Trees over Large Alphabets (Q4909570) (← links)
- A Space-Efficient Framework for Dynamic Point Location (Q4909571) (← links)
- Data Structures for Path Queries (Q4962630) (← links)
- Improved Time and Space Bounds for Dynamic Range Mode (Q5009582) (← links)
- (Q5091063) (← links)
- Path queries on functions (Q5110868) (← links)
- Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts (Q5195102) (← links)
- Space Efficient Data Structures for Dynamic Orthogonal Range Counting (Q5199268) (← links)
- (Q5260418) (← links)