2018 - IEEE Fellow For contributions to genomic data compression
Olgica Milenkovic mostly deals with Algorithm, Low-density parity-check code, Decoding methods, Discrete mathematics and Block code. Her Algorithm research includes elements of Theoretical computer science, Mathematical optimization and Coding. Her Low-density parity-check code research is multidisciplinary, incorporating elements of Forward error correction and Optical communication.
Her study looks at the intersection of Decoding methods and topics like Dna storage with Computer hardware, Database, Markov process and DNA sequencing. As a member of one scientific family, she mostly works in the field of Discrete mathematics, focusing on Tanner graph and, on occasion, Idempotence, Simple and Structure. Her studies deal with areas such as Computational complexity theory, Sparse approximation and Signal reconstruction as well as Compressed sensing.
Olgica Milenkovic mainly focuses on Algorithm, Discrete mathematics, Combinatorics, Decoding methods and Theoretical computer science. Her Algorithm study frequently involves adjacent topics like Mathematical optimization. Her Mathematical optimization study combines topics from a wide range of disciplines, such as Quadratic equation and Matrix completion.
The study incorporates disciplines such as Tanner graph, Block code, Linear code and Low-density parity-check code in addition to Discrete mathematics. Her Combinatorics course of study focuses on Cluster analysis and Graph. Her work in Decoding methods covers topics such as Code which are related to areas like Metric.
Olgica Milenkovic focuses on Algorithm, Combinatorics, Discrete mathematics, Computer data storage and DNA. Her work deals with themes such as Basis, Discriminative model and Convergence of random variables, which intersect with Algorithm. Olgica Milenkovic usually deals with Combinatorics and limits it to topics linked to Upper and lower bounds and Distributed data store, Bandwidth, Steiner system and Order.
Olgica Milenkovic combines subjects such as Class and Pairwise comparison with her study of Discrete mathematics. Her Computer data storage research incorporates elements of Image processing and Topology. She works mostly in the field of Constraint, limiting it down to topics relating to Distribution and, in certain cases, Mathematical optimization, as a part of the same area of interest.
Her main research concerns Algorithm, Topological graph theory, PageRank, DNA sequencing and DNA. The Algorithm study combines topics in areas such as Multiset, Heuristics and Binary number. Decoding methods and Error detection and correction is closely connected to Code rate in her research, which is encompassed under the umbrella topic of Multiset.
The various areas that Olgica Milenkovic examines in her Decoding methods study include Asymptotically optimal algorithm, Factorization and Discrete mathematics, Time complexity. Her PageRank study also includes
Theoretical computer science, Approximation algorithm, Cluster analysis and Correlation clustering most often made with reference to Graph,
Data mining which intersects with area such as SIMPLE and Group testing. Her DNA sequencing study also includes
genomic DNA that intertwine with fields like Restriction enzyme, Computational biology and Computer data storage,
Topology together with Electrophoresis, DNA damage, Sequence and Membrane.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Subspace Pursuit for Compressive Sensing Signal Reconstruction
Wei Dai;O. Milenkovic.
IEEE Transactions on Information Theory (2009)
Combinatorial constructions of low-density parity check codes for iterative decoding
B. Vasic;O. Milenkovic.
international symposium on information theory (2002)
A Rewritable, Random-Access DNA-Based Storage System.
S. M. Hossein Tabatabaei Yazdi;Yongbo Yuan;Jian Ma;Huimin Zhao.
Scientific Reports (2015)
Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity
Wei Dai;Olgica Milenkovic.
Portable and Error-Free DNA-Based Data Storage
S. M. Hossein Tabatabaei Yazdi;Ryan Gabrys;Olgica Milenkovic.
Scientific Reports (2017)
Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes
S. Landner;O. Milenkovic.
international conference on wireless networks (2005)
DNA-Based Storage: Trends and Methods
S. M. Hossein Tabatabaei Yazdi;Han Mao Kiah;Eva Garcia-Ruiz;Jian Ma.
IEEE Transactions on Molecular, Biological, and Multi-Scale Communications (2015)
Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles
O. Milenkovic;E. Soljanin;P. Whiting.
IEEE Transactions on Information Theory (2007)
Shortened Array Codes of Large Girth
O. Milenkovic;N. Kashyap;D. Leyba.
IEEE Transactions on Information Theory (2006)
Hybrid ARQ: Theory, State of the Art and Future Directions
C. Lott;O. Milenkovic;E. Soljanin.
information theory workshop (2007)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: