Marek Chrobak

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by imported>OAbot at 20:10, 5 July 2021 (Open access bot: doi added to citation with #oabot.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

<templatestyles src="Reflist/styles.css" />

  1. ↑ Script error: No such module "Citation/CS1".
  2. ↑ Script error: No such module "citation/CS1".

Script error: No such module "Check for unknown parameters".

External links

Script error: No such module "Authority control".


Template:Asbox