M. Oğuzhan Külekci

Available identifiers

Publication	Date of Publication	Type
Randomized data partitioning with efficient search, retrieval and privacy-preservation	2024-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q5874441	2023-02-07	Paper
I/O-efficient data structures for non-overlapping indexing	2021-01-25	Paper
Non-Overlapping Indexing - Cache Obliviously	2020-12-16	Paper
https://portal.mardi4nfdi.de/entity/Q5140715	2020-12-16	Paper
The order-preserving pattern matching problem in practice	2020-02-14	Paper
Fast Packed String Matching for Short Patterns	2019-09-12	Paper
Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation	2019-07-08	Paper
Inverse range selection queries	2018-10-17	Paper
Range selection and predecessor queries in data aware space and time	2017-05-29	Paper
Efficient Algorithms for the Order Preserving Pattern Matching Problem	2016-11-09	Paper
A simple yet time-optimal and linear-space algorithm for shortest unique substring queries	2014-12-02	Paper
Fast and flexible packed string matching	2014-09-05	Paper
Shortest Unique Substring Query Revisited	2014-06-30	Paper
BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation	2011-02-19	Paper
Boosting Pattern Matching Performance via k-bit Filtering	2010-10-06	Paper
A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching	2009-01-29	Paper

This page was built for person: M. Oğuzhan Külekci