Marek Chrobak

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

  1. ^ Chrobak, Marek (1986). "Finite Automata and Unary Languages". Theoretical Computer Science. 47 (3): 147–158. doi:10.1016/0304-3975(86)90142-8.
  2. ^ 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.
  • Official website Edit this at Wikidata
    • Bibliography of papers on online algorithms
  • Marek Chrobak publications indexed by Google Scholar Edit this at Wikidata
  • Marek Chrobak at DBLP Bibliography Server Edit this at Wikidata
  • Marek Chrobak author profile page at the ACM Digital Library Edit this at Wikidata
  • Chrobak, Marek at zbMATH
  • Marek Chrobak at the Mathematics Genealogy Project Edit this at Wikidata
Authority control databases Edit this at Wikidata
International
  • VIAF
  • WorldCat
National
  • United States
  • Israel
Academics
  • Mathematics Genealogy Project
  • Association for Computing Machinery
  • zbMATH
  • Google Scholar
  • DBLP
  • MathSciNet


  • v
  • t
  • e