Marek Chrobak

{{Use mdy dates|date=July 2025}} {{short description|Professor}} '''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.

In automata theory, Chrobak is known for his contributions to the study of finite automata over a one-letter alphabet.<ref>{{cite journal | last = Chrobak | first = Marek | date = 1986 | title = Finite Automata and Unary Languages | journal = Theoretical Computer Science | volume = 47 | issue = 3 | pages = 147–158 | doi = 10.1016/0304-3975(86)90142-8 | doi-access= free }}</ref> In particular, "Chrobak normal form" for nondeterministic finite automata is known.<ref>{{cite conference | title = Chrobak Normal Form Revisited, with Applications | first = Pawel | last = Gawrychowski | year = 2011 | conference = CIAA 2011 | volume = 6807 | book-title = Implementation and Application of Automata | publisher = Springer | location = Blois, France | pages = 142–153 | doi = 10.1007/978-3-642-22256-6_14 }}</ref>

Chrobak obtained his PhD in Computer Science from Warsaw University in 1985.

==References== {{Reflist}}

==External links== * {{Official website}} ** [http://www.cs.ucr.edu/~marek/pubs/online.bib Bibliography of papers on online algorithms] * {{Google Scholar id|name=Marek Chrobak}} * {{DBLP|name=Marek Chrobak}} * {{ACM Portal|name=Marek Chrobak}} * {{zbMATH|name=Chrobak, Marek}} * {{MathGenealogy|name=Marek Chrobak}}

{{DEFAULTSORT:Chrobak, Marek}} Category:Year of birth missing (living people) Category:Living people Category:University of California, Riverside faculty Category:University of Warsaw alumni