The following pages link to Wing-Kai Hon (Q386001):
Displayed 50 items.
- Compressed property suffix trees (Q386003) (← links)
- Faster query algorithms for the text fingerprinting problem (Q549671) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- Efficient index for retrieving top-\(k\) most frequent documents (Q616994) (← links)
- Improved data structures for the orthogonal range successor problem (Q617543) (← links)
- Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
- Approximate string matching using compressed suffix arrays (Q818136) (← links)
- Edge-clique covers of the tensor product (Q897963) (← links)
- A space and time efficient algorithm for constructing compressed suffix arrays (Q996703) (← links)
- Scheduling for electricity cost in a smart grid (Q1702731) (← links)
- Budget-constrained multi-battle contests: a new perspective and analysis (Q1704589) (← links)
- Dictionary matching with a bounded gap in pattern or in text (Q1709592) (← links)
- On complexities of minus domination (Q1751171) (← links)
- Faster compressed dictionary matching (Q1939285) (← links)
- Approximating dynamic weighted vertex cover with soft capacities (Q2072101) (← links)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
- A note on the geodetic number and the Steiner number of AT-free graphs (Q2220867) (← links)
- Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions (Q2304567) (← links)
- Geometric BWT: compressed text indexing via sparse suffixes and range searching (Q2346957) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- On position restricted substring searching in succinct space (Q2376796) (← links)
- Non-shared edges and nearest neighbor interchanges revisited (Q2390296) (← links)
- In-place algorithms for exact and approximate shortest unique substring problems (Q2399613) (← links)
- Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem (Q2400576) (← links)
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365) (← links)
- On the Grundy number of Cameron graphs (Q2413405) (← links)
- Compressed text indexing with wildcards (Q2434928) (← links)
- Compressed data structures: Dictionaries and data-aware measures (Q2465063) (← links)
- General max-min fair allocation (Q2695275) (← links)
- Rainbow Domination and Related Problems on Some Classes of Perfect Graphs (Q2798024) (← links)
- Efficient Generation of Top-k Procurements in a Multi-item Auction (Q2803822) (← links)
- Compressed Persistent Index for Efficient Rank/Select Queries (Q2842178) (← links)
- On Independence Domination (Q2842784) (← links)
- Indexes for Document Retrieval with Relevance (Q2848984) (← links)
- On Complexities of Minus Domination (Q2867118) (← links)
- Scheduling for Electricity Cost in Smart Grid (Q2867129) (← links)
- Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval (Q2904490) (← links)
- Document Listing for Queries with Excluded Pattern (Q2904491) (← links)
- Efficient Algorithm for Circular Burrows-Wheeler Transform (Q2904499) (← links)
- (Q2921649) (← links)
- Dictionary Matching with Uneven Gaps (Q2942261) (← links)
- $$Top$$ - $$K$$ Query Retrieval of Combinations with Sum-of-Subsets Ranking (Q2942423) (← links)
- Compressed indexes for dynamic text collections (Q2944558) (← links)
- Convex Independence in Permutation Graphs (Q2958358) (← links)
- On All-Substrings Alignment Problems (Q3082915) (← links)
- Succinct Indexes for Circular Patterns (Q3104669) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- Cache-Oblivious Index for Approximate String Matching (Q3506907) (← links)
- A Faster Query Algorithm for the Text Fingerprinting Problem (Q3527205) (← links)