Mgr. Michal Opler, Ph.D., a member of the G2OAT research group from the Department of Theoretical Computer Science, presented his paper "An Optimal Algorithm for Sorting Pattern-Avoiding Sequences" at one of the most prestigious conferences in the field of theoretical computer science, FOCS (Foundations of Computer Science). The conference took place from October 27 to 30, 2024, in Chicago and featured lectures and workshops, attracting leading scientists from around the world.
The paper "An Optimal Algorithm for Sorting Pattern-Avoiding Sequences" addresses the problem of sorting sequences that do not contain a specific fixed pattern as a subsequence. The paper presents an optimal algorithm to solve this problem, providing a solution to an open problem in the area of sorting algorithms.
"FOCS 2024 was an incredibly inspiring conference that brought numerous new discoveries in theoretical computer science and offered interesting contributions from renowned speakers. In addition to gaining new insights, I left with many open questions that I would like to explore further in my future research. Furthermore, I had the opportunity to establish connections with experts from top global universities, which opens up possibilities for future collaborations on joint research," says Opler.
The G²OAT group focuses on discrete optimization, studying the complexity of graph and other problems, game mechanisms, and combinatorial games, as well as designing efficient algorithms.
