The following pages link to J. Ian Munro (Q287449):
Displaying 50 items.
- Document retrieval with one wildcard (Q287451) (← links)
- Permuted scaled matching (Q294926) (← links)
- Fast construction of wavelet trees (Q294942) (← links)
- Less space: indexing for queries with wildcards (Q300263) (← links)
- Dynamic range majority data structures (Q306716) (← links)
- Succinct posets (Q329288) (← links)
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- Succinct encoding of arbitrary graphs (Q391972) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- Succinct representation of dynamic trees (Q541673) (← links)
- Untangled monotonic chains and adaptive range search (Q553358) (← links)
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time (Q579942) (← links)
- Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254) (← links)
- Sorting with networks of data structures (Q602673) (← links)
- Selection from read-only memory and sorting with minimum data movement (Q671520) (← links)
- Partial match retrieval in implicit data structures (Q800083) (← links)
- The binomial transform and the analysis of skip lists (Q818124) (← links)
- Representing trees of higher degree (Q818675) (← links)
- On the relative dominance of paging algorithms (Q837160) (← links)
- Integer representation and counting in the bit probe model (Q848941) (← links)
- Analysis of the standard deletion algorithms in exact fit domain binary search trees (Q911249) (← links)
- Stable in situ sorting and minimum data movement (Q911311) (← links)
- Deterministic optimal and expedient move-to-rear list organizing strategies (Q914378) (← links)
- Determining the mode (Q1143172) (← links)
- Selection and sorting with limited storage (Q1143174) (← links)
- Implicit data structures for fast search and update (Q1146004) (← links)
- Optimum reorganization points for arbitrary database costs (Q1168763) (← links)
- An implicit data structure for searching a multikey table in logarithmic time (Q1186547) (← links)
- Average search and update costs in skip lists (Q1196460) (← links)
- On universally easy classes for NP-complete problems. (Q1401418) (← links)
- Finding modes with equality comparisons (Q1680532) (← links)
- Fun-Sort -- or the chaos of unordered binary search (Q1765229) (← links)
- Fast allocation and deallocation with an improved buddy system (Q1772105) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- Efficient visibility queries in simple polygons (Q1862134) (← links)
- Fast stable in-place sorting with \(O(n)\) data moves (Q1920426) (← links)
- Range majority in constant time and linear space (Q1951579) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- Range majorities and minorities in arrays (Q2032347) (← links)
- On the cost of unsuccessful searches in search trees with two-way comparisons (Q2051772) (← links)
- On Huang and Wong's algorithm for generalized binary split trees (Q2089746) (← links)
- Ranked document selection (Q2297857) (← links)
- On hardness of several string indexing problems (Q2342674) (← links)
- Finding median in read-only memory on integer input (Q2342680) (← links)
- Low space data structures for geometric range mode query (Q2345452) (← links)
- Top-\(k\) term-proximity in succinct space (Q2362352) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- A novel approach for leveraging co-occurrence to improve the false positive error in signature files (Q2376805) (← links)
- Deterministic SkipNet (Q2390251) (← links)
