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, on information dissemination in ad-hoc radio networks, and on graph drawing.
[1] In particular, "Chrobak normal form" for nondeterministic finite automata is known.
[2] Chrobak obtained his PhD in Computer Science from Warsaw University in 1985.
This biography of an American academic is a stub.