The following pages link to M. Oğuzhan Külekci (Q405576):
Displayed 16 items.
- Fast and flexible packed string matching (Q405577) (← links)
- A simple yet time-optimal and linear-space algorithm for shortest unique substring queries (Q476914) (← links)
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation (Q626897) (← links)
- Inverse range selection queries (Q1796846) (← links)
- Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation (Q2003332) (← links)
- I/O-efficient data structures for non-overlapping indexing (Q2220773) (← links)
- The order-preserving pattern matching problem in practice (Q2295620) (← links)
- Range selection and predecessor queries in data aware space and time (Q2397147) (← links)
- Efficient Algorithms for the Order Preserving Pattern Matching Problem (Q2830069) (← links)
- A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching (Q3596744) (← links)
- Boosting Pattern Matching Performance via k-bit Filtering (Q4932641) (← links)
- (Q5140715) (← links)
- Non-Overlapping Indexing - Cache Obliviously (Q5140770) (← links)
- Shortest Unique Substring Query Revisited (Q5165603) (← links)
- Fast Packed String Matching for Short Patterns (Q5232452) (← links)
- (Q5874441) (← links)