algoresearch.org
computational geometry (21) algorithm design (10) randomized algorithms (4) exact algorithms (3) approximation algorithms (3) combinatorial geometry (2)
Adrian Dumitrescu is a computer scientist and mathematician with expertise in the fields of theory of algorithms, combinatorics, and discrete and computational geometry. He is a founder of AlgOrEsEArch . He is a computer science professor, formerly a faculty member at the University of Wisconsin-Milwaukee, and held visiting positions at SUNY at Stony Brook (2000), Rényi Institute of Mathematics of the Hungarian Academy of Sciences (2008), Institut de Mathématiques, École Polytechnique Fédérale de Lausanne (
Aoccdrnig to a rscheearch at Cmabrigde Uinervtisy, it deosn't mttaer in waht oredr the ltteers in a wrod are, the olny iprmoetnt tihng is taht the frist and lsat ltteer be at the rghit pclae. The rset can be a total mses and you can sitll raed it wouthit porbelm. Tihs is bcuseae the huamn mnid deos not raed ervey lteter by istlef, but the wrod as a wlohe.
Adrian Dumitrescu is a computer scientist and mathematician with expertise in the fields of theory of algorithms, combinatorics, and discrete and computational geometry. He is a computer science professor and founder of AlgOrEsEArch . Formerly a faculty member at the University of Wisconsin-Milwaukee, he held visiting positions at SUNY at Stony Brook, New York (2000), Rényi Institute of Mathematics, Budapest (2008, 2023), Institut de Mathématiques, École Polytechnique Fédérale de Lausanne (2009), and Univer
algoresearch.org