×

zbMATH — the first resource for mathematics

Külekci, Muhammed Oğuzhan

Compute Distance To:
Author ID: kulekci.muhammed-oguzhan Recent zbMATH articles by "Külekci, Muhammed Oğuzhan"
Published as: Külekci, M. Oguzhan; Külekci, M. Oğuzhan; Külekci, M. Oǧuzhan; Külekci, Muhammed Oğuzhan
Documents Indexed: 15 Publications since 2008

Publications by Year

Citations contained in zbMATH Open

9 Publications have been cited 22 times in 20 Documents Cited by Year
Efficient algorithms for the order preserving pattern matching problem. Zbl 06649757
Faro, Simone; Külekci, M. Oğuzhan
6
2016
Shortest unique substring query revisited. Zbl 1409.68354
İleri, Atalay Mert; Külekci, M. Oğuzhan; Xu, Bojian
4
2014
Fast and flexible packed string matching. Zbl 1305.68381
Faro, Simone; Külekci, M. Oğuzhan
3
2014
A method to overcome computer word size limitation in bit-parallel pattern matching. Zbl 1183.68761
Külekci, M. Oǧuzhan
3
2008
A simple yet time-optimal and linear-space algorithm for shortest unique substring queries. Zbl 1303.68163
İleri, Atalay Mert; Külekci, M. Oğuzhan; Xu, Bojian
2
2015
The order-preserving pattern matching problem in practice. Zbl 1434.68727
Cantone, Domenico; Faro, Simone; Külekci, M. Oğuzhan
1
2020
Non-overlapping indexing – cache obliviously. Zbl 07286734
Hooshmand, Sahar; Abedin, Paniz; Külekci, M. Oğuzhan; Thankachan, Sharma V.
1
2018
Fast packed string matching for short patterns. Zbl 1430.68460
Faro, Simone; Külekci, M. Oğuzhan
1
2013
BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation. Zbl 1205.68526
Külekci, M. Oğuzhan
1
2010
The order-preserving pattern matching problem in practice. Zbl 1434.68727
Cantone, Domenico; Faro, Simone; Külekci, M. Oğuzhan
1
2020
Non-overlapping indexing – cache obliviously. Zbl 07286734
Hooshmand, Sahar; Abedin, Paniz; Külekci, M. Oğuzhan; Thankachan, Sharma V.
1
2018
Efficient algorithms for the order preserving pattern matching problem. Zbl 06649757
Faro, Simone; Külekci, M. Oğuzhan
6
2016
A simple yet time-optimal and linear-space algorithm for shortest unique substring queries. Zbl 1303.68163
İleri, Atalay Mert; Külekci, M. Oğuzhan; Xu, Bojian
2
2015
Shortest unique substring query revisited. Zbl 1409.68354
İleri, Atalay Mert; Külekci, M. Oğuzhan; Xu, Bojian
4
2014
Fast and flexible packed string matching. Zbl 1305.68381
Faro, Simone; Külekci, M. Oğuzhan
3
2014
Fast packed string matching for short patterns. Zbl 1430.68460
Faro, Simone; Külekci, M. Oğuzhan
1
2013
BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation. Zbl 1205.68526
Külekci, M. Oğuzhan
1
2010
A method to overcome computer word size limitation in bit-parallel pattern matching. Zbl 1183.68761
Külekci, M. Oǧuzhan
3
2008

Citations by Year