Meng He

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 52

Top Venues

University of Waterloo, Ontario, Canada (PHD)

Education History

University of Waterloo, Ontario, Canada

PHD

Publications

Meng He, Don Sheehy
Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG). Comput. Geom. 116 (2024)
Meng He, Zhen Liu
Exact and Approximate Range Mode Query Data Structures in Practice. SEA (2023)
Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh
Sum-of-Local-Effects Data Structures for Separable Graphs. COCOON (1) (2023)
Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh
Sum-of-Local-Effects Data Structures for Separable Graphs. CoRR (2023)
Travis Gagie, Meng He, Michael St Denis
Dynamic Compact Planar Embeddings. SPIRE (2023)
Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang
Distance Queries over Dynamic Interval Graphs. ISAAC (2023)
Meng He, Serikzhan Kazi
Data structures for categorical path counting queries. Theor. Comput. Sci. 938 (2022)
Younan Gao, Meng He
Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product. ESA (2022)
Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu
Shortest Beer Path Queries in Interval Graphs. CoRR (2022)
Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Kaiyu Wu
Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. SPIRE (2022)
Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu
Shortest Beer Path Queries in Interval Graphs. ISAAC (2022)
Younan Gao, Meng He
Space Efficient Two-Dimensional Orthogonal Colored Range Counting. CoRR (2021)
Younan Gao, Meng He
Space Efficient Two-Dimensional Orthogonal Colored Range Counting. ESA (2021)
Meng He, Serikzhan Kazi
Data Structures for Categorical Path Counting Queries. CPM (2021)
Younan Gao, Meng He, Yakov Nekrich
Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. ESA (2020)
Younan Gao, Meng He, Yakov Nekrich
Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. CoRR (2020)
Meng He, Serikzhan Kazi
Path Query Data Structures in Practice. SEA (2020)
Meng He, Serikzhan Kazi
Path Query Data Structures in Practice. CoRR (2020)
Travis Gagie, Meng He, Gonzalo Navarro
Compressed Dynamic Range Majority and Minority Data Structures. Algorithmica 82 (7) (2020)
Travis Gagie, Meng He, Gonzalo Navarro, Carlos Ochoa
Tree path majority data structures. Theor. Comput. Sci. 833 (2020)
Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro
Fast and compact planar embeddings. Comput. Geom. 89 (2020)
Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. ISAAC (2020)
Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs. CoRR (2020)
Meng He, Serikzhan Kazi
Path and Ancestor Queries over Trees with Multidimensional Weight Vectors. ISAAC (2019)
Meng He, Serikzhan Kazi
Path and Ancestor Queries on Trees with Multidimensional Weight Vectors. CoRR (2019)
Travis Gagie, Meng He, Gonzalo Navarro
Path queries on functions. Theor. Comput. Sci. 770 (2019)
Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund
On Approximate Range Mode and Range Selection. ISAAC (2019)
Meng He, Norbert Zeh
Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG). Comput. Geom. 77 (2019)
Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund
On Approximate Range Mode and Range Selection. CoRR (2019)
Travis Gagie, Meng He, Gonzalo Navarro
Tree Path Majority Data Structures. CoRR (2018)
Travis Gagie, Meng He, Gonzalo Navarro
Tree Path Majority Data Structures. ISAAC (2018)
Meng He, Cuong P. Nguyen, Norbert Zeh
Maximal and Convex Layers of Random Point Sets. LATIN (2018)
Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund
Improved Time and Space Bounds for Dynamic Range Mode. ESA (2018)
Meng He, J. Ian Munro, Gelin Zhou
Dynamic Path Queries in Linear Space. Algorithmica 80 (12) (2018)
Meng He, Richard Peng, Yinzhan Xu
Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts. ANALCO (2018)
Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund
Improved Time and Space Bounds for Dynamic Range Mode. CoRR (2018)
Travis Gagie, Meng He, Gonzalo Navarro
Compressed Dynamic Range Majority Data Structures. DCC (2017)
Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou
Succinct Indices for Path Minimum, with Applications. Algorithmica 78 (2) (2017)
José Fuentes-Sepúlveda, Leo Ferres, Meng He, Norbert Zeh
Parallel construction of succinct trees. Theor. Comput. Sci. 700 (2017)
Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh
I/O-Efficient Path Traversal in Succinct Planar Graphs. Algorithmica 77 (3) (2017)
Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro
Parallel Construction of Compact Planar Embeddings. CoRR (2017)
Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro
Fast and Compact Planar Embeddings. WADS (2017)
Zichu Ai, Jie Mei, Abidalrahman Moh'd, Norbert Zeh, Meng He, Evangelos E. Milios
High-performance Computational Framework for Phrase Relatedness. DocEng (2017)
Travis Gagie, Meng He, Gonzalo Navarro
Path Queries on Functions. CPM (2017)
Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
Dynamic range majority data structures. Theor. Comput. Sci. 647 (2016)
Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro
Fast and Compact Planar Embeddings. CoRR (2016)
Meng He, Chen Miao
Engineering Wavelet Tree Implementations for Compressed Web Graph Representations. DCC (2016)
Meng He, Mengdu Li
Deletion without Rebalancing in Non-Blocking Binary Search Trees. OPODIS (2016)
Meng He, J. Ian Munro, Gelin Zhou
Data Structures for Path Queries. ACM Trans. Algorithms 12 (4) (2016)
Travis Gagie, Meng He, Gonzalo Navarro
Compressed Dynamic Range Majority Data Structures. CoRR (2016)
Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco
On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. Theory Comput. Syst. 56 (1) (2015)
Leo Ferres, José Fuentes-Sepúlveda, Meng He, Norbert Zeh
Parallel Construction of Succinct Trees. SEA (2015)
Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou
Succinct Indices for Path Minimum, with Applications to Path Reporting. ESA (2014)
Meng He, Ganggui Tang, Norbert Zeh
Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. ISAAC (2014)
Meng He, J. Ian Munro
Space efficient data structures for dynamic orthogonal range counting. Comput. Geom. 47 (2) (2014)
Meng He, J. Ian Munro, Gelin Zhou
Dynamic Path Counting and Reporting in Linear Space. ISAAC (2014)
Meng He, J. Ian Munro, Gelin Zhou
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. Algorithmica 70 (4) (2014)
Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson
The Distance 4-Sector of Two Points Is Unique. ISAAC (2013)
Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala
Range majority in constant time and linear space. Inf. Comput. 222 (2013)
Meng He
Succinct and Implicit Data Structures for Computational Geometry. Space-Efficient Data Structures, Streams, and Algorithms (2013)
Craig Dillabaugh, Meng He, Anil Maheshwari
Succinct and I/O Efficient Data Structures for Traversal in Trees. Algorithmica 63 (1-2) (2012)
Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
Succinct Representation of Labeled Graphs. Algorithmica 62 (1-2) (2012)
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin
Succinct geometric indexes supporting point location queries. ACM Trans. Algorithms 8 (2) (2012)
Meng He, J. Ian Munro, Gelin Zhou
Succinct Data Structures for Path Queries. ESA (2012)
Meng He, J. Ian Munro, Gelin Zhou
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. ISAAC (2012)
Meng He, J. Ian Munro, Srinivasa Rao Satti
Succinct ordinal trees based on tree covering. ACM Trans. Algorithms 8 (4) (2012)
Reza Dorrigiv, Meng He, Norbert Zeh
On the Advice Complexity of Buffer Management. ISAAC (2012)
Meng He, Patrick K. Nicholson, Norbert Zeh
A Space-Efficient Framework for Dynamic Point Location. ISAAC (2012)
Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco
On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods. WAOA (2012)
Travis Gagie, Meng He, J. Ian Munro, Patrick K. Nicholson
Finding Frequent Elements in Compressed 2D Arrays and Strings. SPIRE (2011)
Meng He, J. Ian Munro, Patrick K. Nicholson
Dynamic Range Selection in Linear Space CoRR (2011)
Meng He, J. Ian Munro, Patrick K. Nicholson
Dynamic Range Majority Data Structures CoRR (2011)
Meng He, J. Ian Munro, Patrick K. Nicholson
Dynamic Range Selection in Linear Space. ISAAC (2011)
Meng He, J. Ian Munro
Space Efficient Data Structures for Dynamic Orthogonal Range Counting. WADS (2011)
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala
Untangled monotonic chains and adaptive range search. Theor. Comput. Sci. 412 (32) (2011)
Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
Dynamic Range Majority Data Structures. ISAAC (2011)
Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti
Succinct indexes for strings, binary relations and multilabeled trees. ACM Trans. Algorithms 7 (4) (2011)
Meng He, J. Ian Munro, Gelin Zhou
Path Queries in Weighted Trees. ISAAC (2011)
Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala
Range Majority in Constant Time and Linear Space. ICALP (1) (2011)
Meng He, J. Ian Munro
Succinct Representations of Dynamic Strings CoRR (2010)
Meng He, J. Ian Munro
Succinct Representations of Dynamic Strings. SPIRE (2010)
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. WADS (2009)
Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh
I/O and Space-Efficient Path Traversal in Planar Graphs. ISAAC (2009)
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala
Untangled Monotonic Chains and Adaptive Range Search. ISAAC (2009)
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin
Succinct geometric indexes supporting point location queries. SODA (2009)
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin
Succinct Geometric Indexes Supporting Point Location Queries CoRR (2008)
Craig Dillabaugh, Meng He, Anil Maheshwari
Succinct and I/O Efficient Data Structures for Traversal in Trees. ISAAC (2008)
Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
Succinct Representation of Labeled Graphs. ISAAC (2007)
Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao
Succinct indexes for strings, binary relations and multi-labeled trees. SODA (2007)
Meng He, J. Ian Munro, S. Srinivasa Rao
Succinct Ordinal Trees Based on Tree Covering. ICALP (2007)
Meng He, J. Ian Munro, S. Srinivasa Rao
A categorization theorem on suffix arrays with applications to space efficient text indexes. SODA (2005)

Meng He.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Meng He