Find Academic Supervisors

• Boolean Functions
• Horn Formulas
• Computational Complexity
• +7 more

Ondřej Čepek is an Associate Professor at the Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University in Prague. His academic career spans several decades with numerous publications demonstrating his expertise in theoretical computer science, particularly in Boolean logic, computational complexity, and operations research. Čepek's research primarily focuses on Boolean functions, Horn formulas, and computational complexity. His work explores structural properties of logical constructs, minimization techniques, and applications in knowledge representation. He has made significant contributions to understanding satisfiability testing complexity, CNF minimization, and Boolean function representations using interval structures. His research also extends to scheduling problems, particularly just-in-time scheduling with periodic time slots, where he has developed efficient algorithms for multislot scheduling on identical parallel machines and nonpreemptive flowshop scheduling with machine dominance. Analysis of his recent publications reveals a consistent research trajectory from theoretical foundations to practical applications. His work demonstrates expertise in tractable classes of Boolean formulas, knowledge compilation techniques, and the relationship between computational complexity and logical representations. The recurring themes include efficient representations for logical formulas, characterization of tractable problem classes, and development of optimization algorithms for discrete structures. His collaborations with researchers like Petr Kučera, Roman Barták, and Endre Boros have produced influential work in constraint programming and artificial intelligence. Distinguished Paper Award at CP2004 for 'Unary resource constraint with optional activities' While specific details about his advising activities are not provided in available sources, his extensive publication record spanning from 1989 to 2017 suggests substantial involvement in academic mentoring. His numerous collaborations both within Charles University and internationally indicate an active role in the academic community. His research has practical applications in knowledge-based systems, constraint satisfaction problems, and artificial intelligence. Čepek maintains an active research profile with publications continuing through 2017. His recent work has focused on knowledge compilation techniques, recognition of tractable DNFs, and the complexity of CNF minimization. He has also explored applications of Boolean techniques to DNA microarray data analysis, demonstrating the interdisciplinary nature of his research.

• Theoretical Computer Science
• Computational Complexity
• Data Structures
• +3 more

Prof. Michal Koucký is a faculty member at the Institute of Informatics, Faculty of Mathematics and Physics, Charles University in Prague. His research focuses on theoretical computer science, particularly computational complexity, data structures, algorithms, and combinatorics. He leads significant research projects including EPAC (supported by GA CR) and LBCAD (funded by ERC). His educational background includes a Ph.D. from Rutgers University (2003) and a Master's degree from Charles University (1998). Prof. Koucký's research spans multiple areas of theoretical computer science with emphasis on computational complexity , data structures , algorithms , and combinatorics . His work explores fundamental questions about computational efficiency, lower bounds, and algorithmic techniques. He has made significant contributions to edit distance algorithms, string processing, and circuit complexity. His research often bridges theoretical foundations with practical algorithmic applications, particularly in areas like dynamic data structures and approximation algorithms. An analysis of his recent publications (2019-2024) reveals a strong focus on string algorithms, particularly edit distance problems. His work develops novel approximation techniques, sketching methods, and sublinear-time algorithms for pattern matching. There's also significant work on data structure lower bounds and connections to popular complexity conjectures. His research demonstrates a consistent pattern of tackling fundamental problems with innovative approaches that push theoretical boundaries while maintaining practical relevance. Antonin Svoboda award for best dissertation in 2014 (awarded to Jan Bulánek) Best paper award at SAGT 2016 for 'The Big Match in Small Space' Best paper award at FOCS 2018 for 'Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time' He has successfully advised numerous graduate students including Pavel Dvořák, Karel Král, Debarati Das, and Jan Bulánek who have gone on to positions at prestigious institutions like Bristol, Google (Zurich), and Penn State. His research is supported by significant grants including the EPAC project (GA CR) and LBCAD project (ERC), demonstrating the impact and relevance of his work in theoretical computer science. Prof. Koucký is an active member of the theoretical computer science community, regularly presenting at major conferences including STOC, FOCS, ICALP, and SODA. His work often involves collaborations with researchers from institutions worldwide, contributing to a vibrant research environment at Charles University's Institute of Informatics.