基本信息
浏览量:15
职业迁徙
个人简介
Olgica Milenkovic
Olgica Milenkovic
Donald Biggar Willett Scholar
Franklin W. Woeltge Professor
Professor
(217) 244-7358
milenkov@illinois.edu
311 Coordinated Science Lab
For More Information
Personal web-page: link
Education
PhD, Electrical and Computer Engineering, University of Michigan, Ann Arbor, 2002
MSc, Mathematics, University of Michigan, Ann Arbor, 2001
Academic Positions
Franklin W. Woeltge Professor, 2020
Full Professor, 2014-present
Discrete Mathematics and Computer Science (DIMACS) Visitor.
Visiting Professor, ENSEA, Cergy-Pontoise
Visitor, Henri Poincare Institute, Paris
Click for more
Major Consulting Activities
Consultant, Bell Labs-Lucent Technology, May 2005 - May 2006
Professional Registrations
Fellow of the IEEE
Other Professional Activities
James L. Massey award committee, 2019-202
Information Theory Society Fellows Committee
Board of Governors, Information Theory Society
Research Statement
The current research focus of our group is on
1) Developing new approaches for studying problems in bioinformatics and bioengineering using coding and information theory. In particular, we investigate fundamental questions pertaining to design methodologies for DNA microarrays with error- and quality-control features and DNA microarrays that utilize compressed sensing principles.
2) Providing a bridge between the theory of compressed sensing and superimposed coding; non-linear compressive sensing with quantization and fault-tolerant sensing algorithms.
3) Using coding and information theory to study problems such as RNA folding, reverse engineering of gene-regulatory networks, and cost-constrained genome reversal distances.
4) Constructing and analyzing codes on graphs and developing new methods for studying the combinatorial properties of random ensembles of low-density parity-check codes. Our studies mainly focus on the computational complexity of problems quantifying the error-floor phenomena.
5) Analyzing the connections between network coding, matroid theory, and algebraic coding theory.
6) Analyzing the average case complexity of algorithms in coding theory and computer algebra.
Olgica Milenkovic
Donald Biggar Willett Scholar
Franklin W. Woeltge Professor
Professor
(217) 244-7358
milenkov@illinois.edu
311 Coordinated Science Lab
For More Information
Personal web-page: link
Education
PhD, Electrical and Computer Engineering, University of Michigan, Ann Arbor, 2002
MSc, Mathematics, University of Michigan, Ann Arbor, 2001
Academic Positions
Franklin W. Woeltge Professor, 2020
Full Professor, 2014-present
Discrete Mathematics and Computer Science (DIMACS) Visitor.
Visiting Professor, ENSEA, Cergy-Pontoise
Visitor, Henri Poincare Institute, Paris
Click for more
Major Consulting Activities
Consultant, Bell Labs-Lucent Technology, May 2005 - May 2006
Professional Registrations
Fellow of the IEEE
Other Professional Activities
James L. Massey award committee, 2019-202
Information Theory Society Fellows Committee
Board of Governors, Information Theory Society
Research Statement
The current research focus of our group is on
1) Developing new approaches for studying problems in bioinformatics and bioengineering using coding and information theory. In particular, we investigate fundamental questions pertaining to design methodologies for DNA microarrays with error- and quality-control features and DNA microarrays that utilize compressed sensing principles.
2) Providing a bridge between the theory of compressed sensing and superimposed coding; non-linear compressive sensing with quantization and fault-tolerant sensing algorithms.
3) Using coding and information theory to study problems such as RNA folding, reverse engineering of gene-regulatory networks, and cost-constrained genome reversal distances.
4) Constructing and analyzing codes on graphs and developing new methods for studying the combinatorial properties of random ensembles of low-density parity-check codes. Our studies mainly focus on the computational complexity of problems quantifying the error-floor phenomena.
5) Analyzing the connections between network coding, matroid theory, and algebraic coding theory.
6) Analyzing the average case complexity of algorithms in coding theory and computer algebra.
研究兴趣
论文共 286 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
Minji Kim,Ping Wang, Patricia Clow, I Chien,Xiaotao Wang,Jianhao Peng,Haoxi Chai,Xiyuan Liu,Byoungkoo Lee,Chew Yee Ngan,Feng Yue,Olgica Milenkovic,
bioRxiv : the preprint server for biology (2024)
IEEE Transactions on Communicationsno. 99 (2024): 1-1
J. Appl. Probab.no. 4 (2023)
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn