Sertac Artan

Title: Sertac Artan: Innovator in Data Structures

Introduction

Sertac Artan is a notable inventor based in Brooklyn, NY (US). He has made significant contributions to the field of data structures, holding 2 patents that showcase his innovative approach to solving complex problems in data management.

Latest Patents

His latest patents include a method for generating a log-log hash-based hierarchical data structure associated with a plurality of known arbitrary-length bit strings. This invention is designed for detecting whether an arbitrary-length bit string input matches one of these known strings. Additionally, he has developed a high-speed, scalable, and easily updateable data structure that provides minimal perfect hashing functionality while supporting low-cost set-membership queries. In some embodiments, this structure ensures that there is at most one match candidate in a set of known arbitrary-length bit strings used to match the query. Another patent focuses on generating a boundary hash-based hierarchical data structure, which is also associated with a plurality of known arbitrary-length bit strings. This invention emphasizes high-speed, space-efficient, and scalable data management while maintaining the same low-cost query capabilities.

Career Highlights

Sertac Artan is affiliated with New York University, where he continues to push the boundaries of innovation in data structures. His work is characterized by a commitment to enhancing the efficiency and effectiveness of data processing technologies.

Collaborations

He collaborates with H Jonathan Chao, contributing to advancements in their shared field of expertise.

Conclusion

Sertac Artan's contributions to data structures through his patents reflect his innovative spirit and dedication to improving data management solutions. His work continues to influence the field and inspire future advancements.