![]() | ![]() |
University of Waterloo
List of publications from the DBLP Bibliography Server - FAQother persons with the same name:
| 2012 | ||
|---|---|---|
| 26 | Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin: Succinct geometric indexes supporting point location queries. ACM Transactions on Algorithms 8(2): 10 (2012) | |
| 25 | Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro: Succinct Representation of Labeled Graphs. Algorithmica 62(1-2): 224-257 (2012) | |
| 24 | Craig Dillabaugh, Meng He, Anil Maheshwari: Succinct and I/O Efficient Data Structures for Traversal in Trees. Algorithmica 63(1-2): 201-223 (2012) | |
| 2011 | ||
| 23 | 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 | |
| 22 | Meng He, J. Ian Munro, Gelin Zhou: Path Queries in Weighted Trees. ISAAC 2011: 140-149 | |
| 21 | Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson: Dynamic Range Majority Data Structures. ISAAC 2011: 150-159 | |
| 20 | Meng He, J. Ian Munro, Patrick K. Nicholson: Dynamic Range Selection in Linear Space. ISAAC 2011: 160-169 | |
| 19 | Travis Gagie, Meng He, J. Ian Munro, Patrick K. Nicholson: Finding Frequent Elements in Compressed 2D Arrays and Strings. SPIRE 2011: 295-300 | |
| 18 | Meng He, J. Ian Munro: Space Efficient Data Structures for Dynamic Orthogonal Range Counting. WADS 2011: 500-511 | |
| 17 | Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti: Succinct indexes for strings, binary relations and multilabeled trees. ACM Transactions on Algorithms 7(4): 52 (2011) | |
| 16 | Meng He, J. Ian Munro, Patrick K. Nicholson: Dynamic Range Majority Data Structures CoRR abs/1104.5517: (2011) | |
| 15 | Meng He, J. Ian Munro, Patrick K. Nicholson: Dynamic Range Selection in Linear Space CoRR abs/1106.5076: (2011) | |
| 14 | 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) | |
| 2010 | ||
| 13 | Meng He, J. Ian Munro: Succinct Representations of Dynamic Strings. SPIRE 2010: 334-346 | |
| 12 | Meng He, J. Ian Munro: Succinct Representations of Dynamic Strings CoRR abs/1005.4652: (2010) | |
| 2009 | ||
| 11 | Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh: I/O and Space-Efficient Path Traversal in Planar Graphs. ISAAC 2009: 1175-1184 | |
| 10 | 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 | |
| 9 | Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin: Succinct geometric indexes supporting point location queries. SODA 2009: 635-644 | |
| 8 | 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 | ||
| 7 | Craig Dillabaugh, Meng He, Anil Maheshwari: Succinct and I/O Efficient Data Structures for Traversal in Trees. ISAAC 2008: 112-123 | |
| 6 | Meng He: Succinct Data Structures for Parentheses Matching. Encyclopedia of Algorithms 2008 | |
| 5 | Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin: Succinct Geometric Indexes Supporting Point Location Queries CoRR abs/0805.4147: (2008) | |
| 2007 | ||
| 4 | Meng He, J. Ian Munro, S. Srinivasa Rao: Succinct Ordinal Trees Based on Tree Covering. ICALP 2007: 509-520 | |
| 3 | Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro: Succinct Representation of Labeled Graphs. ISAAC 2007: 316-328 | |
| 2 | 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 | ||
| 1 | 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 | |
| 1 | Luca Castelli Aleardi | [3] [25] |
| 2 | Diego Arroyuelo | [10] [14] |
| 3 | Jérémy Barbay | [2] [3] [17] [25] |
| 4 | Prosenjit Bose | [5] [8] [9] [26] |
| 5 | Eric Y. Chen | [5] [9] [26] |
| 6 | Francisco Claude | [10] [14] |
| 7 | Craig Dillabaugh | [7] [11] [24] |
| 8 | Reza Dorrigiv (Reza Dorri Giv) | [10] [14] |
| 9 | Stephane Durocher | [10] [14] [23] |
| 10 | Amr Elmasry | [21] |
| 11 | Travis Gagie | [19] |
| 12 | Alejandro López-Ortiz (Alex López-Ortiz) | [10] [14] |
| 13 | Anil Maheshwari | [5] [7] [8] [9] [11] [24] [26] |
| 14 | Pat Morin | [5] [8] [9] [26] |
| 15 | J. Ian Munro | [1] [2] [3] [4] [10] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [25] |
| 16 | Patrick K. Nicholson | [10] [14] [15] [16] [19] [20] [21] [23] |
| 17 | S. Srinivasa Rao (Srinivasa Rao Satti) | [1] [2] [4] [17] |
| 18 | Alejandro Salinger | [10] [14] |
| 19 | Matthew Skala | [10] [14] [23] |
| 20 | Norbert Zeh | [11] |
| 21 | Gelin Zhou | [22] |
Data released under the ODC-BY 1.0 license — See also our legal information page