Meng He

According to our database, Meng He authored at least 70 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG).

Meng He, Don Sheehy

Comput. Geom., January, 2024

On Approximate Colored Path Counting.

Younan Gao, Meng He

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021).

Meng He, Anna Lubiw, Mohammad R. Salavatipour

Algorithmica, June, 2023

Preface.

Meng He, Anna Lubiw, Mohammad R. Salavatipour

Comput. Geom., 2023

Exact and Approximate Range Mode Query Data Structures in Practice.

Meng He, Zhen Liu

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Dynamic Compact Planar Embeddings.

Travis Gagie, Meng He, Michael St Denis

Proceedings of the String Processing and Information Retrieval, 2023

Distance Queries over Dynamic Interval Graphs.

Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Sum-of-Local-Effects Data Structures for Separable Graphs.

Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

Data structures for categorical path counting queries.

Meng He, Serikzhan Kazi

Theor. Comput. Sci., 2022

Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries.

Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Kaiyu Wu

Proceedings of the String Processing and Information Retrieval, 2022

Shortest Beer Path Queries in Interval Graphs.

Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product.

Younan Gao, Meng He

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Space Efficient Two-Dimensional Orthogonal Colored Range Counting.

Younan Gao, Meng He

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Tree path majority data structures.

Travis Gagie, Meng He, Gonzalo Navarro, Carlos Ochoa

Theor. Comput. Sci., 2020

Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs.

Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu

CoRR, 2020

Fast and compact planar embeddings.

Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro

Comput. Geom., 2020

Compressed Dynamic Range Majority and Minority Data Structures.

Travis Gagie, Meng He, Gonzalo Navarro

Algorithmica, 2020

Path Query Data Structures in Practice.

Meng He, Serikzhan Kazi

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees.

Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing.

Younan Gao, Meng He, Yakov Nekrich

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Path queries on functions.

Travis Gagie, Meng He, Gonzalo Navarro

Theor. Comput. Sci., 2019

Path and Ancestor Queries on Trees with Multidimensional Weight Vectors.

Meng He, Serikzhan Kazi

CoRR, 2019

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

Meng He, Norbert Zeh

Comput. Geom., 2019

On Approximate Range Mode and Range Selection.

Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund

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

Path and Ancestor Queries over Trees with Multidimensional Weight Vectors.

Meng He, Serikzhan Kazi

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

2018

Dynamic Path Queries in Linear Space.

Meng He, J. Ian Munro, Gelin Zhou

Algorithmica, 2018

Maximal and Convex Layers of Random Point Sets.

Meng He, Cuong P. Nguyen, Norbert Zeh

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Tree Path Majority Data Structures.

Travis Gagie, Meng He, Gonzalo Navarro

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

Improved Time and Space Bounds for Dynamic Range Mode.

Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund

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

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

Meng He, Richard Peng, Yinzhan Xu

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

2017

Parallel construction of succinct trees.

José Fuentes-Sepúlveda, Leo Ferres, Meng He, Norbert Zeh

Theor. Comput. Sci., 2017

Parallel Construction of Compact Planar Embeddings.

Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro

CoRR, 2017

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

Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh

Algorithmica, 2017

Succinct Indices for Path Minimum, with Applications.

Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou

Algorithmica, 2017

High-performance Computational Framework for Phrase Relatedness.

Zichu Ai, Jie Mei, Abidalrahman Moh'd, Norbert Zeh, Meng He, Evangelos E. Milios

Proceedings of the 2017 ACM Symposium on Document Engineering, 2017

Compressed Dynamic Range Majority Data Structures.

Travis Gagie, Meng He, Gonzalo Navarro

Proceedings of the 2017 Data Compression Conference, 2017

2016

Succinct Data Structures for Parentheses Matching.

Meng He

Encyclopedia of Algorithms, 2016

Dynamic range majority data structures.

Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson

Theor. Comput. Sci., 2016

Data Structures for Path Queries.

Meng He, J. Ian Munro, Gelin Zhou

ACM Trans. Algorithms, 2016

Deletion without Rebalancing in Non-Blocking Binary Search Trees.

Meng He, Mengdu Li

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

Engineering Wavelet Tree Implementations for Compressed Web Graph Representations.

Meng He, Chen Miao

Proceedings of the 2016 Data Compression Conference, 2016

2015

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

Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco

Theory Comput. Syst., 2015

2014

Space efficient data structures for dynamic orthogonal range counting.

Meng He, J. Ian Munro

Comput. Geom., 2014

A Framework for Succinct Labeled Ordinal Trees over Large Alphabets.

Meng He, J. Ian Munro, Gelin Zhou

Algorithmica, 2014

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

Meng He, Ganggui Tang, Norbert Zeh

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

Dynamic Path Counting and Reporting in Linear Space.

Meng He, J. Ian Munro, Gelin Zhou

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

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

Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou

Proceedings of the Algorithms - ESA 2014, 2014

2013

Range majority in constant time and linear space.

Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala

Inf. Comput., 2013

The Distance 4-Sector of Two Points Is Unique.

Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson

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

Succinct and Implicit Data Structures for Computational Geometry.

Meng He

Proceedings of the Space-Efficient Data Structures, 2013

2012

Succinct ordinal trees based on tree covering.

Meng He, J. Ian Munro, Srinivasa Rao Satti

ACM Trans. Algorithms, 2012

Succinct geometric indexes supporting point location queries.

Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin

ACM Trans. Algorithms, 2012

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

Craig Dillabaugh, Meng He, Anil Maheshwari

Algorithmica, 2012

Succinct Representation of Labeled Graphs.

Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro

Algorithmica, 2012

A Space-Efficient Framework for Dynamic Point Location.

Meng He, Patrick K. Nicholson, Norbert Zeh

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

On the Advice Complexity of Buffer Management.

Reza Dorrigiv, Meng He, Norbert Zeh

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

Succinct Data Structures for Path Queries.

Meng He, J. Ian Munro, Gelin Zhou

Proceedings of the Algorithms - ESA 2012, 2012

2011

Untangled monotonic chains and adaptive range search.

Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala

Theor. Comput. Sci., 2011

Succinct indexes for strings, binary relations and multilabeled trees.

Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti

ACM Trans. Algorithms, 2011

Dynamic Range Majority Data Structures

Meng He, J. Ian Munro, Patrick K. Nicholson

CoRR, 2011

Finding Frequent Elements in Compressed 2D Arrays and Strings.

Travis Gagie, Meng He, J. Ian Munro, Patrick K. Nicholson

Proceedings of the String Processing and Information Retrieval, 2011

Path Queries in Weighted Trees.

Meng He, J. Ian Munro, Gelin Zhou

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

Dynamic Range Selection in Linear Space.

Meng He, J. Ian Munro, Patrick K. Nicholson

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

2010

Succinct Representations of Dynamic Strings.

Meng He, J. Ian Munro

Proceedings of the String Processing and Information Retrieval, 2010

2009

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

Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin

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

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

Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh

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

2008

Succinct Data Structures for Parentheses Matching.

Meng He

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Succinct Indexes.

Meng He

PhD thesis, 2008

2007

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

Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao

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.

Meng He, J. Ian Munro, S. Srinivasa Rao

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