معرفی
Jiří Sgall is currently a Professor and Vice-Dean for Computer Science at the Computer Science Institute of Charles University, Faculty of Mathematics and Physics. He previously held affiliations with the Department of Applied Mathematics (until 2011) and the Institute of Mathematics of the Czech Academy of Sciences (until 2016).
- Research Interests: Online and approximation algorithms, scheduling, computational complexity, combinatorics, communication complexity, propositional proof systems, circuit complexity, combinatorial games, cryptography, DNA computations, and alternative set theory.
- Scientific Contributions: His work spans competitive analysis of online scheduling, approximation algorithms, and complexity theory. Notable contributions include analyses of bin packing, packet scheduling, and multi-level aggregation algorithms.
- Editorial and Conference Roles: Associate Editor for multiple journals (Information and Computation, Operations Research Letters, Discrete Optimization) and chair/program committee member for conferences like ICALP, MFCS, and MAPSP.
- Grants and Leadership: Served as panel chair for the Czech Science Foundation (2009-2011) and council member of the EATCS (2001-2009, 2017 onwards).
Contact Information: Email - sgall@iuuk.mff.cuni.cz; Office - Malostranské nám. 25, Prague 1, Czech Republic.
۰مقاله منتشرشده
