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.[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.
References
- ↑ Chrobak, Marek (1986). "Finite Automata and Unary Languages". Theoretical Computer Science. 47 (3): 147–158. doi:10.1016/0304-3975(86)90142-8.
- ↑ Gawrychowski, Pawel (2011). "Chrobak Normal Form Revisited, with Applications". Implementation and Application of Automata. CIAA 2011. Vol. 6807. Blois, France: Springer. pp. 142–153. doi:10.1007/978-3-642-22256-6_14.
External links
- Official website
- Marek Chrobak publications indexed by Google Scholar
- Marek Chrobak at DBLP Bibliography Server
- Marek Chrobak author profile page at the ACM Digital Library
- Chrobak, Marek at zbMATH
- Marek Chrobak at the Mathematics Genealogy Project
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.