My work entitled “Counting with prediction: Rank and select queries with adjusted anchoring” has been accepted to IEEE Data Compression Conference 2022.
My patent Efficient encryption method to secure data with reduced number of encryption operations has been the awarded “Best Academic Invention” of the year by the International Federation of Innovation Associations (IFIA) – Istanbul International Inventions Fair (ISIF)’2021.
My patent Efficient encryption method to secure data with reduced number of encryption operations has been recently licensed to the company Procenne . Regarding news from the university website can be accessed via Commercialization success of Prof. Dr. Oğuzhan Külekçi’s triadic patent!
I am serving on the program committee of the SPIRE 2021: 28th International Conference on String Processing and Information Retrieval that will be held in Lille, France October 4-6, 2021.
Our paper “I/O-Efficient Data Structures for Non-Overlapping Indexing, Sahar Hooshmand; PanizAbedin; M.Oğuzhan Külekci; Sharma V.Thankachan” has been published in Theoretical Computer Science journal.
I will be serving in the PC of the SEA-2021: 19th International Symposium on Experimental Algorithms.
The licensing of my patent “Efficient encryption method to secure data with reduced number of encryption operations” to the company Procenne has received a grant from the TÜBİTAK-Patented Technology Transfer programme. The company will be focusing on solutions for secure/private data management on the cloud, particularly keeping data secure with less encryption load, while providing efficient search capabilities.
Our paper “Shape-Preserving Pattern Matching, Simone Faro, Domenico Cantone, M. Oguzhan Kulekci” appeared in the 21st Italian Conference on Theoretical Computer Science.
Our paper “A Survey on Shortest Unique Substring Queries, Paniz Abedin, M. Oğuzhan Külekci, Sharma V. Thankachan” has appeared in the MDPI-Algorithm journal.