Marek Chrobak is a full professor at University of California, Riverside. He is known for his work competitive analysis of online algorithms, particularly for the k-server problem. His contributions, with his co-author Lawrence L. Larmore, led to the application of T-theory to the server problem.
In automata theory, Chrobak is known for his contributions to the study of finite automata over a one-letter alphabet. In particular, "Chrobak normal form" for nondeterministic finite automata is known.
Chrobak obtained his PhD in Computer Science from Warsaw University in 1985.