About: Marek Chrobak     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatPolishPeople, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FMarek_Chrobak&invfp=IFP_OFF&sas=SAME_AS_OFF

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.

AttributesValues
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
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software