# Meng He

According to our database

Collaborative distances:

^{1}, Meng He authored at least 52 papers between 2005 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepages:

#### On csauthors.net:

## Bibliography

2020

Path Query Data Structures in Practice.

CoRR, 2020

2019

Path queries on functions.

Theor. Comput. Sci., 2019

Path and Ancestor Queries on Trees with Multidimensional Weight Vectors.

CoRR, 2019

Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG).

Comput. Geom., 2019

On Approximate Range Mode and Range Selection.

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Path and Ancestor Queries over Trees with Multidimensional Weight Vectors.

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Dynamic Path Queries in Linear Space.

Algorithmica, 2018

Maximal and Convex Layers of Random Point Sets.

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Tree Path Majority Data Structures.

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Improved Time and Space Bounds for Dynamic Range Mode.

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts.

Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017

Parallel construction of succinct trees.

Theor. Comput. Sci., 2017

Parallel Construction of Compact Planar Embeddings.

CoRR, 2017

I/O-Efficient Path Traversal in Succinct Planar Graphs.

Algorithmica, 2017

Succinct Indices for Path Minimum, with Applications.

Algorithmica, 2017

Fast and Compact Planar Embeddings.

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

High-performance Computational Framework for Phrase Relatedness.

Proceedings of the 2017 ACM Symposium on Document Engineering, 2017

Compressed Dynamic Range Majority Data Structures.

Proceedings of the 2017 Data Compression Conference, 2017

2016

Succinct Data Structures for Parentheses Matching.

Encyclopedia of Algorithms, 2016

Dynamic range majority data structures.

Theor. Comput. Sci., 2016

Data Structures for Path Queries.

ACM Trans. Algorithms, 2016

Deletion without Rebalancing in Non-Blocking Binary Search Trees.

Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Engineering Wavelet Tree Implementations for Compressed Web Graph Representations.

Proceedings of the 2016 Data Compression Conference, 2016

2015

On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods.

Theory Comput. Syst., 2015

2014

Space efficient data structures for dynamic orthogonal range counting.

Comput. Geom., 2014

A Framework for Succinct Labeled Ordinal Trees over Large Alphabets.

Algorithmica, 2014

Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries.

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Dynamic Path Counting and Reporting in Linear Space.

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Succinct Indices for Path Minimum, with Applications to Path Reporting.

Proceedings of the Algorithms - ESA 2014, 2014

2013

Range majority in constant time and linear space.

Inf. Comput., 2013

The Distance 4-Sector of Two Points Is Unique.

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Succinct and Implicit Data Structures for Computational Geometry.

Proceedings of the Space-Efficient Data Structures, 2013

2012

Succinct ordinal trees based on tree covering.

ACM Trans. Algorithms, 2012

Succinct geometric indexes supporting point location queries.

ACM Trans. Algorithms, 2012

Succinct and I/O Efficient Data Structures for Traversal in Trees.

Algorithmica, 2012

Succinct Representation of Labeled Graphs.

Algorithmica, 2012

A Space-Efficient Framework for Dynamic Point Location.

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

On the Advice Complexity of Buffer Management.

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Succinct Data Structures for Path Queries.

Proceedings of the Algorithms - ESA 2012, 2012

2011

Untangled monotonic chains and adaptive range search.

Theor. Comput. Sci., 2011

Succinct indexes for strings, binary relations and multilabeled trees.

ACM Trans. Algorithms, 2011

Dynamic Range Majority Data Structures

CoRR, 2011

Finding Frequent Elements in Compressed 2D Arrays and Strings.

Proceedings of the String Processing and Information Retrieval, 2011

Path Queries in Weighted Trees.

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Dynamic Range Selection in Linear Space.

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Succinct Representations of Dynamic Strings.

Proceedings of the String Processing and Information Retrieval, 2010

2009

Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing.

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

I/O and Space-Efficient Path Traversal in Planar Graphs.

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Succinct Data Structures for Parentheses Matching.

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Succinct Indexes.

PhD thesis, 2008

2007

Succinct indexes for strings, binary relations and multi-labeled trees.

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2005

A categorization theorem on suffix arrays with applications to space efficient text indexes.

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005