Publications

My DBLP Computer Science Bibliography entry and Google Scholar Citations entry are also available.

Referred Journal Publications

  1. Timothy M. Chan, Meng He, J. Ian Munro and Gelin Zhou, Succinct Indices for Path Minimum, with Applications, Algorithmica, Volume 78, Issue 2, pages 453-491, June 2017.
  2. Craig Dillabaugh, Meng He, Anil Maheshwari and Norbert Zeh, I/O and Space-Efficient Path Traversal in Planar Graphs, Algorithmica, Volume 77, Issue 3, pages 714-755, March 2017.
  3. Amr Elmasry, Meng He, J. Ian Munro and Patrick K. Nicholson, Dynamic Range Majority Data Structures, Theoretical Computer Science, Volume 647, pages 59-73, September 2016.
  4. Meng He, J. Ian Munro and Gelin Zhou, Data Structures for Path Queries, ACM Transactions on Algorithms, Volume 12, Issue 4, pages 53:1-53:32, September 2016.
  5. Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz and Diego Seco, On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods, Theory of Computing Systems, Volume 56, Issue 1 (special issue for the 10th Workshop on Approximation and Online Algorithms), pages 220-250, January 2015.
  6. Meng He, J. Ian Munro and Gelin Zhou, A Framework for Succinct Labeled Ordinal Trees over Large Alphabets, Algorithmica, Volume 70, Issue 4 (special issue for the 23rd International Symposium on Algorithms and Computation), pages 696-717, December 2014.
  7. Meng He and J. Ian Munro, Space Efficient Data Structures for Dynamic Orthogonal Range Counting, Computational Geometry - Theory and Applications, Volume 47, Issue 2, Part B (special issue for the 12th Algorithms and Data Structures Symposium), pages 268-281, February 2014.
  8. Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson and Matthew Skala, Range Majority in Constant Time and Linear Space, Information and Computation, Volume 222 (special issue for the 38th International Colloquium on Automata, Language, and Programming), Pages 169–179, January 2013.
  9. Meng He, J. Ian Munro and S. Srinivasa Rao, Succinct Ordinal Trees Based on Tree Covering, ACM Transactions on Algorithms, Volume 8, Issue 4, pages 42:1-42:34, September 2012.
  10. Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari and Pat Morin, Succinct Geometric Indexes Supporting Point Location Queries, ACM Transactions on Algorithms, Volume 8, Issue 2, pages 10:1-10:26, April 2012.
  11. Craig Dillabaugh, Meng He, Anil Maheshwari, Succinct and I/O Efficient Data Structures for Traversal in Trees, in Algorithmica, Volume 63, Numbers 1-2, pages 201-223, January 2012.
  12. Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro, Succinct Representation of Labeled Graphs, in Algorithmica, Volume 62, Numbers 1-2, pages 224-257, January 2012.
  13. Jérémy Barbay, Meng He, J. Ian Munro and S. Srinivasa Rao, Succinct Indexes for Strings, Binary Relations and Multilabeled Trees, ACM Transactions on Algorithms, Volume 7, Issue 4, pages 52:1-52:27, September 2011.
  14. Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger and Matthew Skala, Untangled Monotonic Chains and Adaptive Range Search, in Theoretical Computer Science, Volume 412, Issue 32 (special issue for the 20th International Symposium on Algorithms and Computation), pages 4200-4211, July 2011.

Referred Conference Publications

  1. Leo Ferres, José Fuentes Sepúlveda, Travis Gagie, Meng He and Gonzalo Navarro, Fast and Compact Planar Embeddings, to appear in Proceedings of the 15th Algorithms and Data Structures Symposium (WADS 2017), 12 pages, August 2017.
  2. Travis Gagie, Meng He and Gonzalo Navarro, Path Queries on Functions, to appear in Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 12 pages, July 2017.
  3. Travis Gagie, Meng He and Gonzalo Navarro, Compressed Dynamic Range Majority Data Structures, in Proceedings of the 27th Data Compression Conference (DCC 2017), pages 260-269, April 2017.
  4. Meng He and Mengdu Li, Deletion without Rebalancing in Non-Blocking Binary Search Trees, in Proceedings of the 20th International Conference on Principles of Distributed Systems (OPODIS 2016), pages 34:1-34:17, December 2016.
  5. Meng He and Chen Miao, Engineering Wavelet Trees Implementations for Compressed Web Graph Representations, in Proceedings of the 26th Data Compression Conference (DCC 2016), page 603, April 2016.
  6. Leo Ferres, José Fuentes Sepúlveda, Meng He and Norbert Zeh, Parallel Construction of Succinct Trees, in Proceedings of the 14th International Symposium on Experimental Algorithms (SEA 2015), pages 3-14, June 2015.
  7. Meng He, J. Ian Munro and Gelin Zhou, Dynamic Path Counting and Reporting in Linear Space, in Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014), pages 565-577, December 2014.
  8. Meng He, Ganggui Tang and Norbert Zeh, Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries, in Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014), pages 128-140, December 2014.
  9. Timothy M. Chan, Meng He, J. Ian Munro and Gelin Zhou, Succinct Indices for Path Minimum, with Applications to Path Reporting, in Proceedings of the 22nd European Symposium on Algorithms (ESA 2014), pages 247-259, September 2014.
  10. Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro and Patrick K. Nicholson, The Distance 4-Sector of Two Points is Unique, in Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC 2013), pages 612-622, December 2013.
  11. Meng He, Succinct and Implicit Data Structures for Computational Geometry, in Proceedings of the Conference on Space Efficient Data Structures, Streams and Algorithms, pages 216-235, August 2013.
  12. Meng He, J. Ian Munro and Gelin Zhou, A Framework for Succinct Labeled Ordinal Trees over Large Alphabets, in Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC 2012), pages 537-547, December 2012.
  13. Meng He, Patrick K. Nicholson and Norbert Zeh, A Space-Efficient Framework for Dynamic Point Location, in Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC 2012), pages 548-557, December 2012.
  14. Reza Dorrigiv, Meng He and Norbert Zeh, On the Advice Complexity of Buffer Management, in Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC 2012), pages 136-145, December 2012.
  15. Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz and Diego Seco, On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods, in Proceedings of the 10th Workshop on Approximation and Online Algorithms (WAOA 2012), pages 93-106, September 2012.
  16. Meng He, J. Ian Munro and Gelin Zhou, Succinct Data Structures for Path Queries, in Proceedings of the 20th European Symposium on Algorithms (ESA 2012), pages 575-586, September 2012.
  17. Meng He, J. Ian Munro and Gelin Zhou, Path Queries in Weighted Trees, in Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC 2011), pages 140-149, December 2011.
  18. Meng He, J. Ian Munro and Patrick K. Nicholson, Dynamic Range Selection in Linear Space, in Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC 2011), pages 160-169, December 2011.
  19. Amr Elmasry, Meng He, J. Ian Munro and Patrick K. Nicholson, Dynamic Range Majority Data Structures, in Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC 2011), pages 150-159, December 2011.
  20. Travis Gagie, Meng He, J. Ian Munro and Patrick K. Nicholson, Finding Frequent Elements in Compressed 2D Arrays and Strings, in Proceedings of the 18th International Symposium on String Processing and Information Retrieval (SPIRE 2011), pages 295-300, October 2011.
  21. Meng He and J. Ian Munro, Space Efficient Data Structures for Dynamic Orthogonal Range Counting, in Proceedings of the 12th Algorithms and Data Structures Symposium (WADS 2011), pages 500-511, August 2011. (slides)
  22. Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson and Matthew Skala1a, Range Majority in Constant Time and Linear Space, in Proceedings of the 38th International Colloquium on Automata, Language, and Programming (ICALP 2011), pages 244-255, July 2011.
  23. Meng He and J. Ian Munro, Succinct Representations of Dynamic Strings, in Proceedings of the 17th International Symposium on String Processing and Information Retrieval (SPIRE 2010), pages 334-346, October 2010. (slides)
  24. Craig Dillabaugh, Meng He, Anil Maheshwari and Norbert Zeh, I/O and Space-Efficient Path Traversal in Planar Graphs, in Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), pages 1175-1184, December 2009. (slides)
  25. Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger and Matthew Skala, Untangled Monotonic Chains and Adaptive Range Search, in Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), pages 203-212, December 2009.
  26. Prosenjit Bose, Meng He, Anil Maheshwari and Pat Morin, Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing, in Proceedings of the 11th Algorithms and Data Structures Symposium (WADS 2009), pages 98-109, August 2009. (slides)
  27. Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari and Pat Morin, Succinct Geometric Indexes Supporting Point Location Queries, in Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pages 635-644, January 2009. (slides)
  28. Craig Dillabaugh, Meng He and Anil Maheshwari, Succinct and I/O Efficient Data Structures for Traversal in Trees, Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), pages 112-123, December 2008.
  29. Jérémy Barbay, Luca Castelli Aleardi, Meng He and J. Ian Munro, Succinct Representation of Labeled Graphs, in Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC 2007), pages 316-328, December 2007. (slides)
  30. Meng He, J. Ian Munro and S. Srinivasa Rao, Succinct Ordinal Trees Based on Tree Covering, in Proceedings of the 34th International Colloquium on Automata, Language, and Programming (ICALP 2007), pages 509-520, July 2007. (slides)
  31. Jérémy Barbay, Meng He, J. Ian Munro and S. Srinivasa Rao, Succinct Indexes for Strings, Binary Relations and Multi-labeled Trees, in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pages 680-689, January 2007. (slides)
  32. Meng He, J. Ian Munro and S. Srinivasa Rao, A Categorization Theorem on Suffix Arrays with Applications to Space Efficient Text Indexes, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pages 23-32, January 2005. (slides)

Referred Book Chapters

  1. Meng He, Succinct Data Structures for Parentheses Matching, refereed book chapter in Encyclopedia of Algorithms, Ming-Yang Kao et al. (editors), pages 912-915, July 2008.

Books Edited

  1. Proceedings of the 26th Canadian Conference on Computational Geometry, Meng He and Norbert Zeh, editors, August 2014.

PhD Thesis