default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeng He 0001
Person information
- affiliation: Dalhousie University
- affiliation: University of Waterloo
Other persons with the same name
- Meng He — disambiguation page
- Meng He 0002 — Inner Mongolia University, Hohhot, China
- Meng He 0003 — Northwestern Polytechnical University, Xi'an, Shaanxi, China
- Meng He 0004 — Sichuan University, Chengdu, China
- Meng He 0005 — Wuhan University, School of Resource and Environmental and Sciences, China
- Meng He 0006 — Chinese Academy of Sciences, Innovation Academy for Precision Measurement Science and Technology, Wuhan, China
- Meng He 0007
![[0000-0002-8290-6548]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-8290-6548")
— Changchun University of Technology, Mechatronic Engineering Department, China - Meng He 0008 — Chinese University of Hong Kong, Future Network of Intelligence Institute, Shenzhen, China (and 1 more)
- Meng He 0009 — Beijing University of Technology, College of Computer Science, China
- Meng He 0010 — Yunnan University, Department of Electronic Engineering, Kunming, China
- Meng He 0011 — Jiangxi University of Science and Technology, School of Electronic and Automation, Ganzhou, China
- Meng He 0012 — Hefei University of Technology, China
- Meng He 0013 — Inner Mongolia Agricultural University, College of Computer and Information Engineering, China
- Meng He 0014 — Inspur Electronic Information Industry Co., Ltd., Jinan, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j26]Meng He, Don Sheehy:
Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG). Comput. Geom. 116: 102035 (2024)- [j25]Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang:
Distance queries over dynamic interval graphs. Comput. Geom. 122: 102103 (2024) - [c55]Meng He, Kaiyu Wu:
Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval Graphs. CPM 2024: 17:1-17:18 - [c54]Meng He, J. Ian Munro, Kaiyu Wu:
Succinct Data Structures for Path Graphs and Chordal Graphs Revisited. DCC 2024: 492-501 - [c53]Meng He, J. Ian Munro, Kaiyu Wu:
Succinct Data Structures for Bounded Degree/Chromatic Number Interval Graphs. DCC 2024: 502-511 - [c52]Younan Gao, Meng He:
On Approximate Colored Path Counting. LATIN (1) 2024: 209-224 - 2023
- [j24]Meng He, Anna Lubiw, Mohammad R. Salavatipour:
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021). Algorithmica 85(6): 1736-1737 (2023) - [j23]Meng He, Anna Lubiw, Mohammad R. Salavatipour:
Preface. Comput. Geom. 110: 101958 (2023) - [c51]Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh:
Sum-of-Local-Effects Data Structures for Separable Graphs. COCOON (1) 2023: 195-206 - [c50]Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang:
Distance Queries over Dynamic Interval Graphs. ISAAC 2023: 18:1-18:19 - [c49]Travis Gagie, Meng He, Michael St Denis:
Dynamic Compact Planar Embeddings. SPIRE 2023: 233-245 - [c48]Meng He, Zhen Liu:
Exact and Approximate Range Mode Query Data Structures in Practice. SEA 2023: 19:1-19:22 - [i17]Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh:
Sum-of-Local-Effects Data Structures for Separable Graphs. CoRR abs/2305.03240 (2023) - 2022
- [j22]Meng He, Serikzhan Kazi:
Data structures for categorical path counting queries. Theor. Comput. Sci. 938: 97-111 (2022) - [c47]Younan Gao, Meng He:
Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product. ESA 2022: 59:1-59:15 - [c46]Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu:
Shortest Beer Path Queries in Interval Graphs. ISAAC 2022: 59:1-59:17 - [c45]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: 217-232 - [i16]Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu:
Shortest Beer Path Queries in Interval Graphs. CoRR abs/2209.14401 (2022) - 2021
- [c44]Meng He, Serikzhan Kazi:
Data Structures for Categorical Path Counting Queries. CPM 2021: 15:1-15:17 - [c43]Younan Gao, Meng He:
Space Efficient Two-Dimensional Orthogonal Colored Range Counting. ESA 2021: 46:1-46:17 - [e1]Meng He, Don Sheehy:
Proceedings of the 33rd Canadian Conference on Computational Geometry, CCCG 2021, August 10-12, 2021, Dalhousie University, Halifax, Nova Scotia, Canada. 2021 [contents] - [i15]Younan Gao, Meng He:
Space Efficient Two-Dimensional Orthogonal Colored Range Counting. CoRR abs/2107.02787 (2021) - 2020
- [j21]Travis Gagie, Meng He, Gonzalo Navarro:
Compressed Dynamic Range Majority and Minority Data Structures. Algorithmica 82(7): 2063-2086 (2020) - [j20]Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro:
Fast and compact planar embeddings. Comput. Geom. 89: 101630 (2020) - [j19]Travis Gagie, Meng He, Gonzalo Navarro, Carlos Ochoa:
Tree path majority data structures. Theor. Comput. Sci. 833: 107-119 (2020) - [c42]Younan Gao, Meng He, Yakov Nekrich:
Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. ESA 2020: 54:1-54:18 - [c41]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: 25:1-25:18 - [c40]Meng He, Serikzhan Kazi:
Path Query Data Structures in Practice. SEA 2020: 27:1-27:16 - [i14]Meng He, Serikzhan Kazi:
Path Query Data Structures in Practice. CoRR abs/2001.10567 (2020) - [i13]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 abs/2005.07644 (2020) - [i12]Younan Gao, Meng He, Yakov Nekrich:
Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. CoRR abs/2006.11978 (2020)
2010 – 2019
- 2019
- [j18]Meng He, Norbert Zeh:
Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG). Comput. Geom. 77: 1-2 (2019) - [j17]Travis Gagie, Meng He, Gonzalo Navarro:
Path queries on functions. Theor. Comput. Sci. 770: 34-50 (2019) - [c39]Meng He, Serikzhan Kazi:
Path and Ancestor Queries over Trees with Multidimensional Weight Vectors. ISAAC 2019: 45:1-45:17 - [c38]Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund:
On Approximate Range Mode and Range Selection. ISAAC 2019: 57:1-57:14 - [i11]Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund:
On Approximate Range Mode and Range Selection. CoRR abs/1907.08579 (2019) - [i10]Meng He, Serikzhan Kazi:
Path and Ancestor Queries on Trees with Multidimensional Weight Vectors. CoRR abs/1910.01147 (2019) - 2018
- [j16]Meng He, J. Ian Munro, Gelin Zhou:
Dynamic Path Queries in Linear Space. Algorithmica 80(12): 3728-3765 (2018) - [c37]Meng He, Richard Peng, Yinzhan Xu:
Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts. ANALCO 2018: 32-39 - [c36]Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund:
Improved Time and Space Bounds for Dynamic Range Mode. ESA 2018: 25:1-25:13 - [c35]Travis Gagie, Meng He, Gonzalo Navarro:
Tree Path Majority Data Structures. ISAAC 2018: 68:1-68:12 - [c34]Meng He, Cuong P. Nguyen, Norbert Zeh:
Maximal and Convex Layers of Random Point Sets. LATIN 2018: 597-610 - [i9]Travis Gagie, Meng He, Gonzalo Navarro:
Tree Path Majority Data Structures. CoRR abs/1806.01804 (2018) - [i8]Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund:
Improved Time and Space Bounds for Dynamic Range Mode. CoRR abs/1807.03827 (2018) - 2017
- [j15]Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Path Traversal in Succinct Planar Graphs. Algorithmica 77(3): 714-755 (2017) - [j14]Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou:
Succinct Indices for Path Minimum, with Applications. Algorithmica 78(2): 453-491 (2017) - [j13]José Fuentes-Sepúlveda, Leo Ferres, Meng He, Norbert Zeh:
Parallel construction of succinct trees. Theor. Comput. Sci. 700: 1-22 (2017) - [c33]Travis Gagie, Meng He, Gonzalo Navarro:
Path Queries on Functions. CPM 2017: 5:1-5:15 - [c32]Travis Gagie, Meng He, Gonzalo Navarro:
Compressed Dynamic Range Majority Data Structures. DCC 2017: 260-269 - [c31]Zichu Ai, Jie Mei, Abidalrahman Moh'd, Norbert Zeh, Meng He, Evangelos E. Milios:
High-performance Computational Framework for Phrase Relatedness. DocEng 2017: 145-148 - [c30]Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro:
Fast and Compact Planar Embeddings. WADS 2017: 385-396 - [i7]Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro:
Parallel Construction of Compact Planar Embeddings. CoRR abs/1705.00415 (2017) - 2016
- [j12]Meng He, J. Ian Munro, Gelin Zhou:
Data Structures for Path Queries. ACM Trans. Algorithms 12(4): 53:1-53:32 (2016) - [j11]Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson:
Dynamic range majority data structures. Theor. Comput. Sci. 647: 59-73 (2016) - [c29]Meng He, Chen Miao:
Engineering Wavelet Tree Implementations for Compressed Web Graph Representations. DCC 2016: 603 - [c28]Meng He, Mengdu Li:
Deletion without Rebalancing in Non-Blocking Binary Search Trees. OPODIS 2016: 34:1-34:17 - [r2]Meng He:
Succinct Data Structures for Parentheses Matching. Encyclopedia of Algorithms 2016: 2136-2139 - [i6]Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro:
Fast and Compact Planar Embeddings. CoRR abs/1610.00130 (2016) - [i5]Travis Gagie, Meng He, Gonzalo Navarro:
Compressed Dynamic Range Majority Data Structures. CoRR abs/1611.01835 (2016) - 2015
- [j10]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): 220-250 (2015) - [c27]Leo Ferres, José Fuentes-Sepúlveda, Meng He, Norbert Zeh:
Parallel Construction of Succinct Trees. SEA 2015: 3-14 - 2014
- [j9]Meng He, J. Ian Munro, Gelin Zhou:
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. Algorithmica 70(4): 696-717 (2014) - [j8]Meng He, J. Ian Munro:
Space efficient data structures for dynamic orthogonal range counting. Comput. Geom. 47(2): 268-281 (2014) - [c26]Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou:
Succinct Indices for Path Minimum, with Applications to Path Reporting. ESA 2014: 247-259 - [c25]Meng He, Ganggui Tang, Norbert Zeh:
Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. ISAAC 2014: 128-140 - [c24]Meng He, J. Ian Munro, Gelin Zhou:
Dynamic Path Counting and Reporting in Linear Space. ISAAC 2014: 565-577 - 2013
- [j7]Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala:
Range majority in constant time and linear space. Inf. Comput. 222: 169-179 (2013) - [c23]Meng He:
Succinct and Implicit Data Structures for Computational Geometry. Space-Efficient Data Structures, Streams, and Algorithms 2013: 216-235 - [c22]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: 612-622 - 2012
- [j6]Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro:
Succinct Representation of Labeled Graphs. Algorithmica 62(1-2): 224-257 (2012) - [j5]Craig Dillabaugh, Meng He, Anil Maheshwari:
Succinct and I/O Efficient Data Structures for Traversal in Trees. Algorithmica 63(1-2): 201-223 (2012) - [j4]Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct geometric indexes supporting point location queries. ACM Trans. Algorithms 8(2): 10:1-10:26 (2012) - [j3]Meng He, J. Ian Munro, Srinivasa Rao Satti:
Succinct ordinal trees based on tree covering. ACM Trans. Algorithms 8(4): 42:1-42:32 (2012) - [c21]Meng He, J. Ian Munro, Gelin Zhou:
Succinct Data Structures for Path Queries. ESA 2012: 575-586 - [c20]Reza Dorrigiv, Meng He, Norbert Zeh:
On the Advice Complexity of Buffer Management. ISAAC 2012: 136-145 - [c19]Meng He, J. Ian Munro, Gelin Zhou:
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. ISAAC 2012: 537-547 - [c18]Meng He, Patrick K. Nicholson, Norbert Zeh:
A Space-Efficient Framework for Dynamic Point Location. ISAAC 2012: 548-557 - [c17]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: 93-106 - 2011
- [j2]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): 52:1-52:27 (2011) - [j1]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): 4200-4211 (2011) - [c16]Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala:
Range Majority in Constant Time and Linear Space. ICALP (1) 2011: 244-255 - [c15]Meng He, J. Ian Munro, Gelin Zhou:
Path Queries in Weighted Trees. ISAAC 2011: 140-149 - [c14]Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson:
Dynamic Range Majority Data Structures. ISAAC 2011: 150-159 - [c13]Meng He, J. Ian Munro, Patrick K. Nicholson:
Dynamic Range Selection in Linear Space. ISAAC 2011: 160-169 - [c12]Travis Gagie, Meng He, J. Ian Munro, Patrick K. Nicholson:
Finding Frequent Elements in Compressed 2D Arrays and Strings. SPIRE 2011: 295-300 - [c11]Meng He, J. Ian Munro:
Space Efficient Data Structures for Dynamic Orthogonal Range Counting. WADS 2011: 500-511 - [i4]Meng He, J. Ian Munro, Patrick K. Nicholson:
Dynamic Range Majority Data Structures. CoRR abs/1104.5517 (2011) - [i3]Meng He, J. Ian Munro, Patrick K. Nicholson:
Dynamic Range Selection in Linear Space. CoRR abs/1106.5076 (2011) - 2010
- [c10]Meng He, J. Ian Munro:
Succinct Representations of Dynamic Strings. SPIRE 2010: 334-346 - [i2]Meng He, J. Ian Munro:
Succinct Representations of Dynamic Strings. CoRR abs/1005.4652 (2010)
2000 – 2009
- 2009
- [c9]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: 203-212 - [c8]Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh:
I/O and Space-Efficient Path Traversal in Planar Graphs. ISAAC 2009: 1175-1184 - [c7]Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct geometric indexes supporting point location queries. SODA 2009: 635-644 - [c6]Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin:
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. WADS 2009: 98-109 - 2008
- [b1]Meng He:
Succinct Indexes. University of Waterloo, Ontario, Canada, 2008 - [c5]Craig Dillabaugh, Meng He, Anil Maheshwari:
Succinct and I/O Efficient Data Structures for Traversal in Trees. ISAAC 2008: 112-123 - [r1]Meng He:
Succinct Data Structures for Parentheses Matching. Encyclopedia of Algorithms 2008 - [i1]Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct Geometric Indexes Supporting Point Location Queries. CoRR abs/0805.4147 (2008) - 2007
- [c4]Meng He, J. Ian Munro, S. Srinivasa Rao:
Succinct Ordinal Trees Based on Tree Covering. ICALP 2007: 509-520 - [c3]Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro:
Succinct Representation of Labeled Graphs. ISAAC 2007: 316-328 - [c2]Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao:
Succinct indexes for strings, binary relations and multi-labeled trees. SODA 2007: 680-689 - 2005
- [c1]Meng He, J. Ian Munro, S. Srinivasa Rao:
A categorization theorem on suffix arrays with applications to space efficient text indexes. SODA 2005: 23-32
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
