Meng He

University of Waterloo

other persons with the same name:

• Meng He 0002 - Inner Mongolia Univ., Hohhot, China

	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)
	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 Transactions on Algorithms 8(2): 10 (2012)
j3		Meng He, J. Ian Munro, Srinivasa Rao Satti: Succinct ordinal trees based on tree covering. ACM Transactions on Algorithms 8(4): 42 (2012)
c20		Meng He, J. Ian Munro, Gelin Zhou: Succinct Data Structures for Path Queries. ESA 2012: 575-586
c19		Reza Dorrigiv, Meng He, Norbert Zeh: On the Advice Complexity of Buffer Management. ISAAC 2012: 136-145
c18		Meng He, J. Ian Munro, Gelin Zhou: A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. ISAAC 2012: 537-547
c17		Meng He, Patrick K. Nicholson, Norbert Zeh: A Space-Efficient Framework for Dynamic Point Location. ISAAC 2012: 548-557
	2011
j2		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)
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)
	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
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

Last update Sun May 19 03:01:58 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page