default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Ian Munro
Ian Munro 0001
Person information
- affiliation: University of Waterloo, Cheriton School of Computer Science
Other persons with the same name
- Ian Munro 0002 — Mount Cook Airlines, Christchurch, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j105]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)- [c157]Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun:
Enumeration and Succinct Encoding of AVL Trees. AofA 2024: 2:1-2:12 - [c156]Meng He, J. Ian Munro, Kaiyu Wu:
Succinct Data Structures for Path Graphs and Chordal Graphs Revisited. DCC 2024: 492-501 - [c155]Meng He, J. Ian Munro, Kaiyu Wu:
Succinct Data Structures for Bounded Degree/Chromatic Number Interval Graphs. DCC 2024: 502-511 - 2023
- [c154]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 - [i37]Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun:
A Compact Representation for AVL Trees. CoRR abs/2311.15511 (2023) - 2022
- [j104]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On Huang and Wong's algorithm for generalized binary split trees. Acta Informatica 59(6): 687-708 (2022) - [j103]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons. ACM Trans. Algorithms 18(1): 2:1-2:11 (2022) - [c153]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 - [c152]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 - [i36]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
- [j102]Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Range Majorities and Minorities in Arrays. Algorithmica 83(6): 1707-1733 (2021) - [j101]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On the cost of unsuccessful searches in search trees with two-way comparisons. Inf. Comput. 281: 104707 (2021) - [c151]J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild:
Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. ESA 2021: 70:1-70:18 - [c150]Rathish Das, Andrea Lincoln, Jayson Lynch, J. Ian Munro:
Dynamic Boolean Formula Evaluation. ISAAC 2021: 61:1-61:19 - [i35]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On the Cost of Unsuccessful Searches in Search Trees with Two-way Comparisons. CoRR abs/2103.01052 (2021) - [i34]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons. CoRR abs/2103.01084 (2021) - [i33]J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild:
Hypersuccinct Trees - New universal tree source codes for optimal compressed tree data structures. CoRR abs/2104.13457 (2021) - 2020
- [j100]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Fast Compressed Self-indexes with Deterministic Linear-Time Construction. Algorithmica 82(2): 316-337 (2020) - [j99]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster algorithms for some optimization problems on collinear points. J. Comput. Geom. 11(1): 418-432 (2020) - [j98]J. Ian Munro, Gonzalo Navarro, Rahul Shah, Sharma V. Thankachan:
Ranked document selection. Theor. Comput. Sci. 812: 149-159 (2020) - [c149]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Text Indexing and Searching in Sublinear Time. CPM 2020: 24:1-24:15 - [c148]Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg:
Space Efficient Construction of Lyndon Arrays in Linear Time. ICALP 2020: 14:1-14:18 - [c147]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 - [c146]J. Ian Munro, Bryce Sandlund, Corwin Sinnamon:
Space-Efficient Data Structures for Lattices. SWAT 2020: 31:1-31:22 - [i32]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)
2010 – 2019
- 2019
- [c145]J. Ian Munro, Yakov Nekrich:
Dynamic Planar Point Location in External Memory. SoCG 2019: 52:1-52:15 - [c144]Arnab Ganguly, J. Ian Munro, Yakov Nekrich, Rahul Shah, Sharma V. Thankachan:
Categorical Range Reporting with Frequencies. ICDT 2019: 9:1-9:19 - [c143]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 - [e4]Marni Mishna, J. Ian Munro:
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019, San Diego, CA, USA, January 6, 2019. SIAM 2019 [contents] - [i31]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On Huang and Wong's Algorithm for Generalized Binary Split Trees. CoRR abs/1901.03783 (2019) - [i30]J. Ian Munro, Bryce Sandlund, Corwin Sinnamon:
Space-Efficient Data Structures for Lattices. CoRR abs/1902.05166 (2019) - [i29]J. Ian Munro, Sebastian Wild:
Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space. CoRR abs/1903.02533 (2019) - [i28]J. Ian Munro, Yakov Nekrich:
Dynamic Planar Point Location in External Memory. CoRR abs/1903.06601 (2019) - [i27]Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund:
On Approximate Range Mode and Range Selection. CoRR abs/1907.08579 (2019) - [i26]J. Ian Munro, Richard Peng, Sebastian Wild, Lingyi Zhang:
Dynamic Optimality Refuted - For Tournament Heaps. CoRR abs/1908.00563 (2019) - [i25]Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, Ian Munro, Eva Rotenberg:
Space Efficient Construction of Lyndon Arrays in Linear Time. CoRR abs/1911.03542 (2019) - 2018
- [j97]Meng He, J. Ian Munro, Gelin Zhou:
Dynamic Path Queries in Linear Space. Algorithmica 80(12): 3728-3765 (2018) - [j96]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Selection and Sorting in the "Restore" Model. ACM Trans. Algorithms 14(2): 11:1-11:18 (2018) - [c142]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster Algorithms for some Optimization Problems on Collinear Points. SoCG 2018: 8:1-8:14 - [c141]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 - [c140]Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich:
Dynamic Trees with Almost-Optimal Access Cost. ESA 2018: 38:1-38:14 - [c139]J. Ian Munro, Sebastian Wild:
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. ESA 2018: 63:1-63:16 - [c138]J. Ian Munro, Kaiyu Wu:
Succinct Data Structures for Chordal Graphs. ISAAC 2018: 67:1-67:12 - [c137]J. Ian Munro, Corwin Sinnamon:
Time and Space Efficient Representations of Distributive Lattices. SODA 2018: 550-567 - [c136]Hicham El-Zein, J. Ian Munro, Yakov Nekrich:
Succinct Dynamic One-Dimensional Point Reporting. SWAT 2018: 17:1-17:11 - [i24]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster Algorithms for some Optimization Problems on Collinear Points. CoRR abs/1802.09505 (2018) - [i23]J. Ian Munro, Sebastian Wild:
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. CoRR abs/1805.04154 (2018) - [i22]Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich:
Dynamic Trees with Almost-Optimal Access Cost. CoRR abs/1806.10498 (2018) - [i21]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
- [j95]J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan:
Top-k Term-Proximity in Succinct Space. Algorithmica 78(2): 379-393 (2017) - [j94]Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou:
Succinct Indices for Path Minimum, with Applications. Algorithmica 78(2): 453-491 (2017) - [j93]Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan:
On the Succinct Representation of Equivalence Classes. Algorithmica 78(3): 1020-1040 (2017) - [j92]Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao:
Finding modes with equality comparisons. Theor. Comput. Sci. 704: 28-41 (2017) - [c135]Hicham El-Zein, J. Ian Munro, Yakov Nekrich:
Succinct Color Searching in One Dimension. ISAAC 2017: 30:1-30:11 - [c134]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. ISAAC 2017: 57:1-57:12 - [c133]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. SODA 2017: 408-424 - [i20]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. CoRR abs/1707.01743 (2017) - [i19]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Text Indexing and Searching in Sublinear Time. CoRR abs/1712.07431 (2017) - 2016
- [j91]J. Ian Munro, Patrick K. Nicholson:
Succinct Posets. Algorithmica 76(2): 445-473 (2016) - [j90]Meng He, J. Ian Munro, Gelin Zhou:
Data Structures for Path Queries. ACM Trans. Algorithms 12(4): 53:1-53:32 (2016) - [j89]Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan:
Document retrieval with one wildcard. Theor. Comput. Sci. 635: 94-101 (2016) - [j88]Ayelet Butman, Noa Lewenstein, J. Ian Munro:
Permuted scaled matching. Theor. Comput. Sci. 638: 27-32 (2016) - [j87]J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter:
Fast construction of wavelet trees. Theor. Comput. Sci. 638: 91-97 (2016) - [j86]Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson:
Dynamic range majority data structures. Theor. Comput. Sci. 647: 59-73 (2016) - [c132]Hicham El-Zein, J. Ian Munro, Matthew Robertson:
Raising Permutations to Powers in Place. ISAAC 2016: 29:1-29:12 - [c131]J. Ian Munro:
Succinct Data Structures ... Potential for Symbolic Computation? ISSAC 2016: 5-8 - [r3]J. Ian Munro, Patrick K. Nicholson:
Compressed Representations of Graphs. Encyclopedia of Algorithms 2016: 382-386 - [i18]Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Range Majorities and Minorities in Arrays. CoRR abs/1606.04495 (2016) - [i17]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. CoRR abs/1607.04346 (2016) - 2015
- [j85]Stephane Durocher, Hicham El-Zein, J. Ian Munro, Sharma V. Thankachan:
Low space data structures for geometric range mode query. Theor. Comput. Sci. 581: 97-101 (2015) - [j84]Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan:
On hardness of several string indexing problems. Theor. Comput. Sci. 582: 74-82 (2015) - [j83]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Finding median in read-only memory on integer input. Theor. Comput. Sci. 583: 51-56 (2015) - [c130]J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan:
Range Counting with Distinct Constraints. CCCG 2015 - [c129]J. Ian Munro, Yakov Nekrich:
Compressed Data Structures for Dynamic Sequences. ESA 2015: 891-902 - [c128]Hicham El-Zein, J. Ian Munro, Siwei Yang:
On the Succinct Representation of Unlabeled Permutations. ISAAC 2015: 49-59 - [c127]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
Optimal Search Trees with 2-Way Comparisons. ISAAC 2015: 71-82 - [c126]J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter:
Dynamic Data Structures for Document Collections and Graphs. PODS 2015: 277-289 - [c125]Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti:
Sorting and Selection with Equality Comparisons. WADS 2015: 434-445 - [i16]J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter:
Dynamic Data Structures for Document Collections and Graphs. CoRR abs/1503.05977 (2015) - [i15]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
Optimal search trees with equality tests. CoRR abs/1505.00357 (2015) - [i14]J. Ian Munro, Yakov Nekrich:
Compressed Data Structures for Dynamic Sequences. CoRR abs/1507.06866 (2015) - 2014
- [j82]Arash Farzan, J. Ian Munro:
A Uniform Paradigm to Succinctly Encode Various Families of Trees. Algorithmica 68(1): 16-40 (2014) - [j81]Meng He, J. Ian Munro, Gelin Zhou:
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. Algorithmica 70(4): 696-717 (2014) - [j80]Meng He, J. Ian Munro:
Space efficient data structures for dynamic orthogonal range counting. Comput. Geom. 47(2): 268-281 (2014) - [j79]Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala:
The Hausdorff Core Problem on Simple Polygons. J. Comput. Geom. 5(1): 14-40 (2014) - [j78]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan:
Less space: Indexing for queries with wildcards. Theor. Comput. Sci. 557: 120-127 (2014) - [c124]Shrinu Kushagra, Alejandro López-Ortiz, Aurick Qiao, J. Ian Munro:
Multi-Pivot Quicksort: Theory and Experiments. ALENEX 2014: 47-60 - [c123]Stephane Durocher, Hicham El-Zein, J. Ian Munro, Sharma V. Thankachan:
Low Space Data Structures for Geometric Range Mode Query. CCCG 2014 - [c122]Ayelet Butman, Noa Lewenstein, J. Ian Munro:
Permuted Scaled Matching. CPM 2014: 70-78 - [c121]Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan:
On Hardness of Several String Indexing Problems. CPM 2014: 242-251 - [c120]Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou:
Succinct Indices for Path Minimum, with Applications to Path Reporting. ESA 2014: 247-259 - [c119]Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman:
Improved Explicit Data Structures in the Bitprobe Model. ESA 2014: 630-641 - [c118]J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan:
Top- k Term-Proximity in Succinct Space. ISAAC 2014: 169-180 - [c117]Hicham El-Zein, J. Ian Munro, Venkatesh Raman:
Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. ISAAC 2014: 543-552 - [c116]Meng He, J. Ian Munro, Gelin Zhou:
Dynamic Path Counting and Reporting in Linear Space. ISAAC 2014: 565-577 - [c115]Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan:
Document Retrieval with One Wildcard. MFCS (2) 2014: 529-540 - [c114]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Selection and Sorting in the "Restore" Model. SODA 2014: 995-1004 - [c113]J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter:
Fast Construction of Wavelet Trees. SPIRE 2014: 101-110 - [c112]J. Ian Munro, Gonzalo Navarro, Rahul Shah, Sharma V. Thankachan:
Ranked Document Selection. SWAT 2014: 344-356 - [c111]J. Ian Munro:
In as Few Comparisons as Possible. WALCOM 2014: 5-6 - 2013
- [j77]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
Sorting under partial information (without the ellipsoid algorithm). Comb. 33(6): 655-697 (2013) - [j76]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) - [j75]Pedram Ghodsnia, Kamran Tirdad, J. Ian Munro, Alejandro López-Ortiz:
A novel approach for leveraging co-occurrence to improve the false positive error in signature files. J. Discrete Algorithms 18: 63-74 (2013) - [j74]Arash Farzan, J. Ian Munro:
Succinct encoding of arbitrary graphs. Theor. Comput. Sci. 513: 38-52 (2013) - [c110]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan:
Less Space: Indexing for Queries with Wildcards. ISAAC 2013: 89-99 - [c109]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. ISAAC 2013: 405-412 - [c108]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman:
Succinct Data Structures for Representing Equivalence Classes. ISAAC 2013: 502-512 - [c107]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 - [c106]Francisco Claude, J. Ian Munro:
Adaptive Data Structures for Permutations and Binary Relations. SPIRE 2013: 64-71 - [c105]Francisco Claude, J. Ian Munro:
Document Listing on Versioned Documents. SPIRE 2013: 72-83 - [i13]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman:
Succinct data structures for representing equivalence classes. CoRR abs/1306.4287 (2013) - 2012
- [j73]Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro:
Succinct Representation of Labeled Graphs. Algorithmica 62(1-2): 224-257 (2012) - [j72]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) - [j71]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct representations of permutations and functions. Theor. Comput. Sci. 438: 74-88 (2012) - [c104]J. Ian Munro:
The Complexity of Partial Orders. ALENEX 2012: 64 - [c103]J. Ian Munro:
The Complexity of Partial Orders. ANALCO 2012: 40 - [c102]Meng He, J. Ian Munro, Gelin Zhou:
Succinct Data Structures for Path Queries. ESA 2012: 575-586 - [c101]J. Ian Munro, Patrick K. Nicholson:
Succinct Posets. ESA 2012: 743-754 - [c100]Arash Farzan, J. Ian Munro, Rajeev Raman:
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima. ICALP (1) 2012: 327-338 - [c99]Meng He, J. Ian Munro, Gelin Zhou:
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. ISAAC 2012: 537-547 - [i12]J. Ian Munro, Patrick K. Nicholson:
Succinct Posets. CoRR abs/1204.1957 (2012) - [i11]Arash Farzan, J. Ian Munro, Rajeev Raman:
Succinct Indices for Range Queries with applications to Orthogonal Range Maxima. CoRR abs/1204.4835 (2012) - 2011
- [j70]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) - [j69]Arash Farzan, J. Ian Munro:
Succinct representation of dynamic trees. Theor. Comput. Sci. 412(24): 2668-2678 (2011) - [j68]