Most significant publications
- Lech Duraj, A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem, International Symposium on Theoretical Aspects of Computer Science [STACS] 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) (2020), 41:1-41:18
- Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams, Equivalences between triangle and range query problems, Acm-siam Symposium On Discrete Algorithms 2020 (soda'20) (2020), 30-47
- Lech Duraj, Marvin Künnemann, Adam Polak, Tight Conditional Lower Bounds for Longest Common Increasing Subsequence, Algorithmica (2019), 25 pages
- Lech Duraj, Grzegorz Gutowski, Jakub Kozik, A Note on Two-Colorability of Nonuniform Hypergraphs, International Colloquium on Automata Languages and Programming [ICALP] 107 (Leibniz International Proceedings in Informatics) (2018), 46:1-46:13
- Lech Duraj, Grzegorz Gutowski, Jakub Kozik, Chip Games and Paintability, Electronic Journal of Combinatorics 23 (3) (2016), 12
Recent publications
- Lech Duraj, Jakub Kozik, Dmitry A. Shabanov, Random hypergraphs and property B, European Journal of Combinatorics Volume 91, January 2021, 103205 (2021), 1-11
- Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams, Equivalences between triangle and range query problems, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2020),
- Lech Duraj, A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem, International Symposium on Theoretical Aspects of Computer Science [STACS] 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) (2020), 41:1-41:18
- Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams, Equivalences between triangle and range query problems, Acm-siam Symposium On Discrete Algorithms 2020 (soda'20) (2020), 30-47
- Lech Duraj, Marvin Künnemann, Adam Polak, Tight Conditional Lower Bounds for Longest Common Increasing Subsequence, Algorithmica (2019), 25 pages
Interests
algorithms, fine-grained complexity, combinatorics
Lech Duraj
academic degree/title Doctor of Philosophy (PhD) positionresearch and faculty staff member group, assistant professor
unit
- Algorithmics Research Group
- Theoretical Computer Science
lech.duraj@uj.edu.pl
www