Konstantin Makarychev

Title: Innovations by Konstantin Makarychev

Introduction

Konstantin Makarychev is a notable inventor based in Yorktown Heights, NY (US). He has made significant contributions to the field of computer science, particularly in the area of data structures and algorithms. His work focuses on enhancing the efficiency of suffix tree construction, which is crucial for processing large datasets.

Latest Patents

Konstantin holds a patent for "Serial and parallel methods for I/O efficient suffix tree construction." This innovative system and method facilitate the creation of suffix trees for large input data and text streams. The methodology leverages the structure of suffix trees to build a suffix tree by simultaneously tiling accesses to both the input string and the partially constructed suffix tree. The end result enables the indexing of very large input strings while maintaining a bounded working set size and a fixed memory footprint. The method is employed for serial processing, and a scalable parallel suffix tree construction is realized, suitable for implementation on parallel distributed memory systems that utilize effective collective communication and in-network caching. Additionally, the methodology is applied for suffix link recovery in both serial and parallel implementations.

Career Highlights

Konstantin is associated with International Business Machines Corporation, commonly known as IBM. His work at IBM has allowed him to explore and develop advanced methodologies that enhance data processing capabilities.

Collaborations

One of his notable collaborators is Amol N Ghoting, with whom he has worked on various projects related to suffix tree construction and data processing.

Conclusion

Konstantin Makarychev's contributions to the field of computer science, particularly through his innovative patent, have significantly advanced the efficiency of data processing techniques. His work continues to influence the development of algorithms and data structures in the industry.