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. In particular, "Chrobak normal form" for nondeterministic finite automata is known. Chrobak obtained his PhD in Computer Science from Warsaw University in 1985.
Attributes | Values |
---|
rdf:type
| |
rdfs:label
| - Marek Chrobak (de)
- Marek Chrobak (en)
|
rdfs:comment
| - Marek Chrobak (* um 1955 in Polen) ist ein polnischer Informatiker und Professor an der University of California. Seine wichtigste wissenschaftliche Errungenschaft war der Algorithmus zur Minimierung von endlichen Automaten. (de)
- 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. In particular, "Chrobak normal form" for nondeterministic finite automata is known. Chrobak obtained his PhD in Computer Science from Warsaw University in 1985. (en)
|
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
Link from a Wikipage to an external page
| |
sameAs
| |
dbp:wikiPageUsesTemplate
| |
has abstract
| - Marek Chrobak (* um 1955 in Polen) ist ein polnischer Informatiker und Professor an der University of California. Seine wichtigste wissenschaftliche Errungenschaft war der Algorithmus zur Minimierung von endlichen Automaten. (de)
- 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. In particular, "Chrobak normal form" for nondeterministic finite automata is known. Chrobak obtained his PhD in Computer Science from Warsaw University in 1985. (en)
|
gold:hypernym
| |
schema:sameAs
| |
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
nationality
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is Wikipage disambiguates
of | |
is editor
of | |
is editor
of | |
is foaf:primaryTopic
of | |