| 词条 | 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. His contributions, with his co-author Lawrence L. Larmore, led to the application of T-theory to the server problem. 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. References1. ^{{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}} 2. ^{{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}} External links
4 : Year of birth missing (living people)|Living people|University of California, Riverside faculty|University of Warsaw alumni |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。