Olgica Milenkovic
#73,077
Most Influential Person Now
Olgica Milenkovic's AcademicInfluence.com Rankings
Olgica Milenkoviccomputer-science Degrees
Computer Science
#3970
World Rank
#4174
Historical Rank
Database
#4350
World Rank
#4524
Historical Rank
Olgica Milenkovicengineering Degrees
Engineering
#3471
World Rank
#4556
Historical Rank
Electrical Engineering
#1089
World Rank
#1172
Historical Rank
Download Badge
Computer Science Engineering
Olgica Milenkovic's Degrees
- Bachelors Electrical Engineering University of Belgrade
Why Is Olgica Milenkovic Influential?
(Suggest an Edit or Addition)According to Wikipedia, Olgica Milenkovic is a coding theorist from the former Yugoslavia, known for her work in compressed sensing, low-density parity-check codes, and DNA digital data storage. She is a professor of electrical and computer engineering at the University of Illinois at Urbana–Champaign.
Olgica Milenkovic's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Subspace Pursuit for Compressive Sensing Signal Reconstruction (2008) (2224)
- A Rewritable, Random-Access DNA-Based Storage System (2015) (284)
- Combinatorial constructions of low-density parity-check codes for iterative decoding (2002) (262)
- Adaptive Universal Generalized PageRank Graph Neural Network (2020) (236)
- Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity (2008) (235)
- Portable and Error-Free DNA-Based Data Storage (2016) (211)
- DNA-Based Storage: Trends and Methods (2015) (146)
- Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes (2005) (141)
- Inhomogeneous Hypergraph Clustering with Applications (2017) (123)
- Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles (2007) (123)
- Shortened Array Codes of Large Girth (2005) (110)
- On the Design of Codes for DNA Computing (2005) (104)
- Generalized low-density parity-check codes for optical communication systems (2005) (98)
- Hybrid ARQ: Theory, State of the Art and Future Directions (2007) (85)
- Codes for DNA Sequence Profiles (2015) (81)
- Compressive Sensing DNA Microarrays (2008) (81)
- Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering (2018) (79)
- Distortion-rate functions for quantized compressive sensing (2009) (77)
- Block-circulant low-density parity-check codes for optical communication systems (2004) (77)
- Information Theoretical and Algorithmic Approaches to Quantized Compressive Sensing (2011) (75)
- Error-Correction in Flash Memories via Codes in the Ulam Metric (2012) (70)
- Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion (2010) (67)
- Repairing Reed-Solomon Codes With Multiple Erasures (2016) (61)
- SET: An algorithm for consistent matrix completion (2009) (59)
- Coded Trace Reconstruction (2019) (58)
- On the Hardness of Approximating Stopping and Trapping Sets (2007) (55)
- On unequal error protection LDPC codes based on Plotkin-type constructions (2004) (55)
- DNA punch cards for storing data on native DNA sequences via enzymatic nicking (2020) (53)
- Coding in 2D: Using Intentional Dispersity to Enhance the Information Capacity of Sequence-Coded Polymer Barcodes. (2016) (52)
- Motif clustering and overlapping clustering for social network analysis (2016) (50)
- Detecting topological variations of DNA at single-molecule level (2019) (48)
- A Geometric Approach to Low-Rank Matrix Completion (2010) (47)
- Sublinear compressive sensing reconstruction via belief propagation decoding (2009) (47)
- Optimizing Generalized PageRank Methods for Seed-Expansion Community Detection (2019) (46)
- Designing Compressive Sensing DNA Microarrays (2007) (45)
- String Reconstruction from Substring Compositions (2014) (45)
- LDPC Codes Based on Latin Squares: Cycle Structure, Stopping Set, and Trapping Set Analysis (2007) (43)
- Multiple-bases belief-propagation decoding of high-density cyclic codes (2009) (42)
- Asymmetric Lee Distance Codes for DNA-Based Storage (2015) (41)
- DNA Array Decoding from Nonlinear Measurements by Belief Propagation (2007) (41)
- Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction (2018) (38)
- Multiple-Bases Belief-Propagation for Decoding of Short Block Codes (2007) (38)
- Mutually Uncorrelated Primers for DNA-Based Data Storage (2017) (35)
- Structured low-density parity-check codes (2004) (35)
- Optimal repair schemes for some families of full-length reed-solomon codes (2017) (34)
- Quantized Compressive Sensing (2009) (34)
- Weighted Superimposed Codes and Constrained Integer Compressed Sensing (2008) (33)
- On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes (2007) (32)
- Correlation Clustering and Biclustering With Locally Bounded Errors (2015) (32)
- Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds (2014) (31)
- A comparative study of quantized compressive sensing schemes (2009) (31)
- Probabilistic Transforms for Combinatorial Urn Models (2004) (30)
- Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes (2007) (29)
- CTH02-4: When Does One Redundant Parity-Check Equation Matter? (2006) (29)
- Semiquantitative Group Testing (2014) (27)
- The Trapping Redundancy of Linear Block Codes (2006) (27)
- High-throughput VLSI Implementations of Iterative Decoders and Related Code Construction Problems (2004) (26)
- Introduction to the special issue on information theory in molecular biology and neuroscience (2010) (25)
- An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation (2014) (25)
- Motif and Hypergraph Correlation Clustering (2018) (25)
- You are AllSet: A Multiset Function Framework for Hypergraph Neural Networks (2021) (25)
- Unique Reconstruction of Coded Sequences from Multiset Substring Spectra (2018) (24)
- Query K-means Clustering and the Double Dixie Cup Problem (2018) (23)
- A new correlation clustering method for cancer mutation analysis (2016) (23)
- DNA codes that avoid secondary structures (2005) (23)
- Quadratic Decomposable Submodular Function Minimization: Theory and Practice (2019) (22)
- Poisson group testing: A probabilistic model for nonadaptive streaming boolean compressed sensing (2014) (22)
- Codes in the damerau distance for DNA storage (2016) (22)
- HyDRA: gene prioritization via hybrid distance-score rank aggregation (2015) (21)
- CaSPIAN: A Causal Compressive Sensing Algorithm for Discovering Directed Interactions in Gene Networks (2014) (21)
- Codes for DNA storage channels (2014) (21)
- Revisiting Decomposable Submodular Function Minimization with Incidence Relations (2018) (20)
- Synchronizing edits in distributed storage networks (2014) (20)
- Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction (2021) (20)
- Sorting of Permutations by Cost-Constrained Transpositions (2010) (19)
- Multipermutation Codes in the Ulam Metric for Nonvolatile Memories (2013) (19)
- Building consensus via iterative voting (2013) (18)
- Unique Reconstruction of Coded Strings From Multiset Substring Spectra (2018) (18)
- On reconstructing a string from its substring compositions (2010) (17)
- On graphical representations of algebraic codes suitable for iterative decoding (2005) (17)
- Quadratic Decomposable Submodular Function Minimization (2018) (16)
- Hybrid Noncoherent Network Coding (2011) (16)
- Repairing reed-solomon codes with two erasures (2017) (15)
- Information theory and coding problems in genetics (2004) (14)
- Semi-quantitative group testing (2012) (14)
- MetaCRAM: an integrated pipeline for metagenomic taxonomy identification and compression (2016) (13)
- Constrained Coding for Context-Free Languages with Applications to Genetic Sequence Modelling (2007) (13)
- Characterization of small trapping sets in LDPC codes from Steiner triple systems (2010) (13)
- Exabytes in a Test Tube (2018) (12)
- The hybrid k-deck problem: Reconstructing sequences from short and long traces (2017) (12)
- Shannon Capacity of M-ary Redundant Multitrack Runlength Limited Codes (1998) (12)
- MaxMinSum Steiner Systems for Access-Balancing in Distributed Storage (2017) (12)
- Rewritable two-dimensional DNA-based data storage with machine learning reconstruction (2021) (11)
- Analysis of the cycle-structure of LDPC codes based on Latin squares (2004) (11)
- Weight Enumerators of Some Classes of Deletion Correcting Codes (2018) (11)
- Compressed Sensing DNA Microarrays ECE , Rice University TREE (2007) (10)
- AC-DC: Amplification Curve Diagnostics for Covid-19 Group Testing (2020) (10)
- Small-sample distribution estimation over sticky channels (2009) (10)
- smallWig: parallel compression of RNA-seq WIG files (2015) (10)
- Access balancing in storage systems by labeling partial Steiner systems (2019) (10)
- Joint Adaptive Feature Smoothing and Topology Extraction via Generalized PageRank GNNs (2020) (10)
- Joint Statistics and MLSD in Filtered Incoherent High-Speed Fiber-Optic Communications (2010) (10)
- The stopping redundancy hierarchy of cyclic codes (2006) (10)
- Reconstruction and Error-Correction Codes for Polymer-Based Data Storage (2019) (10)
- Certified Graph Unlearning (2022) (9)
- Trapping Sets in Irregular LDPC Code Ensembles (2006) (9)
- Structured sublinear compressive sensing via belief propagation (2011) (9)
- Probe Design for Compressive Sensing DNA Microarrays (2008) (9)
- Rank modulation for translocation error correction (2012) (9)
- Novel Distance Measures for Vote Aggregation (2012) (9)
- Scrambling for nonequiprobable signalling (1996) (9)
- Mass Error-Correction Codes for Polymer-Based Data Storage (2020) (9)
- Symmetric group testing and superimposed codes (2011) (9)
- Weakly mutually uncorrelated codes (2016) (9)
- Image Processing in DNA (2019) (8)
- Synchronization and Deduplication in Coded Distributed Storage Networks (2016) (8)
- Multipermutation codes in the Ulam metric (2014) (8)
- DNA Punch Cards: Encoding Data on Native DNA Sequences via Nicking (2019) (8)
- Expanding the Molecular Alphabet of DNA-Based Data Storage Systems with Neural Network Nanopore Readout Processing (2021) (8)
- Nonuniform vote aggregation algorithms (2012) (8)
- Permutation (d, k) codes: Efficient enumerative coding and phrase length distribution shaping (2000) (8)
- The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes (2003) (8)
- Distances on rankings: from social choice to flash memories (2013) (8)
- Multi-MotifGAN (MMGAN): Motif-Targeted Graph Generation And Prediction (2019) (8)
- Efficient Rank Aggregation via Lehmer Codes (2017) (7)
- Higher-Order Spectral Clustering under Superimposed Stochastic Block Model (2018) (7)
- Performance Analysis of Structured LDPC over the Polya-Urn Channel with Finite Memory (7)
- Quadratic-backtracking algorithm for string reconstruction from substring compositions (2014) (7)
- Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations (2016) (7)
- Structured sublinear compressive sensing via dense belief propagation (2011) (7)
- Poisson Group Testing: A Probabilistic Model for Boolean Compressed Sensing (2014) (7)
- Asymmetric Lee distance codes: New bounds and constructions (2015) (6)
- Landing Probabilities of Random Walks for Seed-Set Expansion in Hypergraphs (2019) (6)
- Error and Quality Control Coding for DNA Microarrays (2006) (6)
- Interaction dynamics and site-specific electronic recognition of DNA-nicks with 2D solid-state nanopores (2020) (6)
- Superimposed coding for iterative detection of DNA microarray spot failures (2008) (6)
- Compression of noisy signals with information bottlenecks (2013) (6)
- On modeling gene regulatory networks using Markov random fields (2009) (6)
- Highly Scalable and Provably Accurate Classification in Poincaré Balls (2021) (6)
- Weighted Euclidean superimposed codes for integer compressed sensing (2008) (6)
- Structured LDPC codes over GF(2/sup m/) and companion matrix based decoding (2004) (6)
- Stopping and Trapping Sets in Generalized Covering Arrays (2006) (6)
- Two Methods for Reducing the Error-Floor of LDPC Codes (2007) (6)
- Reconstructing Mixtures of Coded Strings from Prefix and Suffix Compositions (2020) (6)
- A Perspective on Future Research Directions in Information Theory (2015) (5)
- ChIPWig: A Random Access-Enabling Lossless and Lossy Compression Method for ChIP-seq Data (2017) (5)
- Synchronizing rankings via interactive communication (2014) (5)
- Causal compressive sensing for gene network inference (2012) (5)
- Support Weight Enumerators and Coset Weight Distributions of Isodual Codes (2005) (5)
- Semiquantitative Group Testing in at Most Two Rounds (2021) (5)
- Self-assembled microtubular electrodes for on-chip low-voltage electrophoretic manipulation of charged particles and macromolecules (2022) (5)
- A Novel Distance-Based Approach to Constrained Rank Aggregation (2012) (5)
- Online Convex Matrix Factorization with Representative Regions (2019) (5)
- Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing With Nonuniform Thresholds (2014) (5)
- Coding for Polymer-Based Data Storage (2020) (4)
- Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes (2018) (4)
- Portable and Error-Free DNA-Based Data Storage (2017) (4)
- The Third Support Weight Enumerators of the Doubly-Even, Self-Dual Codes (2003) (4)
- Semi-Quantitative Group Testing: a General Paradigm with Applications in Genotyping (2012) (4)
- Finding the Second-Best Candidate under the Mallows Model (2020) (4)
- Query-Based Selection of Optimal Candidates under the Mallows Model (2021) (4)
- Alternating Markov chains for distribution estimation in the presence of errors (2012) (4)
- Weighted rank aggregation via relaxed integer programming (2013) (4)
- Compensating for sneak currents in multi-level crosspoint resistive memories (2015) (4)
- List-decoding methods for inferring polynomials in finite dynamical gene network models (2009) (4)
- Repairing Reed-Solomon Codes via Subspace Polynomials (2020) (4)
- Semi-Quantitative Group Testing: A Unifying Framework for Group Testing with Applications in Genotyping (2012) (3)
- Computing similarity distances between rankings (2013) (3)
- A general framework for distributed vote aggregation (2012) (3)
- Group testing for non-uniformly quantized adder channels (2014) (3)
- Paired threshold graphs (2016) (3)
- Geometry of Similarity Comparisons (2020) (3)
- Reconstruction of Sets of Strings From Prefix/Suffix Compositions (2021) (3)
- A graphical model for computing the minimum cost transposition distance (2010) (3)
- On the triangle clique cover and Kt clique cover problems (2017) (3)
- METHCOMP: a special purpose compression platform for DNA methylation data (2018) (3)
- A list-decoding approach for inferring the dynamics of gene regulatory networks (2008) (3)
- MetaPar: Metagenomic sequence assembly via iterative reclassification (2013) (3)
- Asymptotic distributions of trapping sets in random regular LDPC code ensembles (2005) (3)
- Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes (2007) (3)
- Sparse weighted Euclidean superimposed coding for integer compressed sensing (2008) (3)
- Coding-theoretic methods for reverse engineering of gene regulatory networks (2008) (2)
- Author Correction: Portable and Error-Free DNA-Based Data Storage (2020) (2)
- Set-Codes with Small Intersections and Small Discrepancies (2019) (2)
- Support Estimation with Sampling Artifacts and Errors (2020) (2)
- Group Testing with Runlength Constraints for Topological Molecular Storage (2020) (2)
- Multiclass MinMax rank aggregation (2017) (2)
- Community Detection via Minimax Correlation Clustering and Biclustering (2015) (2)
- Iterative subspace pursuit decoding of weighted euclidean superimposed codes (2008) (2)
- MCUIUC — A new framework for metagenomic read compression (2013) (2)
- Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields (2011) (2)
- Average Case Analysis of Gosper’s Algorithm for a Class of Urn Model Inputs (2005) (2)
- Inference of Latent Network Features via Boolean Intersection Representations of Graphs (2016) (2)
- E2M: A Deep Learning Framework for Associating Combinatorial Methylation Patterns with Gene Expression (2019) (2)
- Power spectral density of multitrack (0,G/I) codes (1997) (2)
- Analysis of Bin models with applications in coding theory (2004) (2)
- Online Convex Dictionary Learning (2019) (2)
- Enumerating RNA Motifs: A coding-Theoretic approach (2006) (2)
- The Postdoc Problem under the Mallows Model (2021) (2)
- Inferring algebraic gene networks using local decoding (2008) (1)
- Balanced and Swap-Robust Trades for Dynamical Distributed Storage (2022) (1)
- Detection and Mapping of dsDNA Breaks using Graphene Nanopore Transistor (2019) (1)
- Compressive list-support recovery for colluder identification (2010) (1)
- Directed Intersection Representations and the Information Content of Digraphs (2019) (1)
- Aggregating rankings with positional constraints (2013) (1)
- HyperAid: Denoising in Hyperbolic Spaces for Tree-fitting and Hierarchical Clustering (2022) (1)
- Low-rank matrix completion with geometric performance guarantees (2011) (1)
- Unlearning Nonlinear Graph Classifiers in the Limited Training Data Regime (2022) (1)
- On DNA Computers Controlling Gene Expression Levels (2005) (1)
- Gene prioritization via weighted Kendall rank aggregation (2013) (1)
- Combinatorial problems in analysis of algorithms and coding theory (2002) (1)
- Decomposing permutations via cost-constrained transpositions (2011) (1)
- Coded Trace Reconstruction (2020) (1)
- Machine Unlearning of Federated Clusters (2022) (1)
- Optimal Stopping Methodology for the Secretary Problem with Random Queries (2021) (1)
- Smooth representation of rankings (2014) (1)
- Generalized low-density parity-check codes for long-haul high-speed optical communications (2005) (1)
- Data Storage and Processing in Cells: An Information Theoretic Approach (2004) (1)
- Regularized Weighted Chebyshev Approximations for Support Estimation (2019) (1)
- N ODE F EATURE E XTRACTION BY S ELF -S UPERVISED M ULTI - SCALE N EIGHBORHOOD P REDICTION (2022) (0)
- Doubly threshold graphs for social network modeling (2016) (0)
- Balanced permutation codes (2016) (0)
- String Reconstruction from Substring (2015) (0)
- Algorithmicand CombinatorialAnalysis of Trapping Setsin StructuredLDPC Codes (2005) (0)
- HyperAid (2022) (0)
- I T ] 2 A pr 2 01 9 Coded Trace Reconstruction (2019) (0)
- On Constant-Weight Binary B2-Sequences (2023) (0)
- Expanding the Biology Toolkit (2015) (0)
- Asymptotic analysis of A* maximum-likelihood decoding with reliability reordering (2003) (0)
- 2 6 M ay 2 01 9 Regularized Weighted Chebyshev Approximations for Support Estimation (2019) (0)
- Detecting topological variations of DNA at single-molecule level (2019) (0)
- Coordinated Science Laboratory 70th Anniversary Symposium: The Future of Computing (2022) (0)
- Similarity distances between permutations (2014) (0)
- Applications of DNA Computers and the Olfactory System (Supplied title) (2007) (0)
- Session TA7a: Biological networks and machine learning (partially invited) (2012) (0)
- Decoding the Dynamics of Gene Regulatory Networks under an Algebraic Expression Model (2008) (0)
- Self-assembled microtubular electrodes for on-chip low-voltage electrophoretic manipulation of charged particles and macromolecules (2022) (0)
- Compressive Sensing DNAMicroarrays (2009) (0)
- A combinatorial proof for the secretary problem with multiple choices (2023) (0)
- Subspace Evolution and Transfer (SET) for (2011) (0)
- Enumeration of RNA Secondary Structures: A Constrained Coding Approach (2006) (0)
- Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein" (2021) (0)
- Analytic Sensing : Localization of ( Sparse ) Sources using FRI 11 : 45 – 12 : 15 (2010) (0)
- The Gapped k-Deck Problem (2022) (0)
- Solid-State MoS2 Nanopore Membranes for Discriminating among the Lengths of RNA Tails on a Double-Stranded DNA: A New Simulation-Based Differentiating Algorithm (2023) (0)
- Iterative Subspace Pursuit Decoding of Weighted (2008) (0)
- On theHardness ofApproximating Stopping and Trapping Setsin LDPC Codes (2007) (0)
- On unequal error protection LDPC codes based on plotkin-type constructions (2006) (0)
- Perturbation-Resilient Sets for Dynamic Service Balancing (2023) (0)
- Small-Sample Estimation of the Mutational Support and Distribution of SARS-CoV-2 (2022) (0)
- Support Estimation via Regularized and Weighted Chebyshev Approximations (2019) (0)
- MetaCRAM: an integrated pipeline for metagenomic taxonomy identification and compression (2016) (0)
- Inferring Single-Molecule Chromatin Interactions via Online Convex Network Dictionary Learning (2022) (0)
- On modeling Gene Regulatory Networks using (2009) (0)
- Author Correction: Portable and Error-Free DNA-Based Data Storage (2020) (0)
- Coding and detection for multitrack systems (2004) (0)
- A method for reducing the number of unknown coefficients of generalized Hamming weight enumerators (2002) (0)
- Directed Intersection Representations and the Information Content of Digraphs (2021) (0)
- I T ] 9 S ep 2 01 9 Coded Trace Reconstruction (2019) (0)
- Finding a Burst of Positives via Nonadaptive Semiquantitative Group Testing (2023) (0)
- Structured LDPC over urn model channels with memory (2004) (0)
- I T ] 2 3 M ay 2 01 9 Coded Trace Reconstruction (2019) (0)
- Provably accurate and scalable linear classifiers in hyperbolic spaces (2022) (0)
- Constrained Coding forContext-Free Languages withApplications toGenetic Sequence Modelling (2007) (0)
- Unlearning Graph Classifiers with Limited Data Resources (2023) (0)
- Compressive Sensing and Coding for Complex Networks (2013) (0)
- Re-writable DNA-based digital storage with random access (2016) (0)
- Inference of latent network features via co-intersection representations of graphs (2016) (0)
- Linear Programming and Message-Passing Approaches to High-Density Parity-Check Codes and High-Density Graphical Models March 1 – 2 (2010) (0)
- DNA punch cards for storing data on native DNA sequences via enzymatic nicking (2020) (0)
- Minimax Correlation Clustering and Biclustering: Bounding Errors Locally (2015) (0)
- Small-sample estimation of the mutational support and the distribution of mutations in the SARS-Cov-2 genome (2020) (0)
- Supplementary Material for ChIPWig : A Random Access-Enabling Lossless and Lossy Compression Method for ChIP-seq Data (2017) (0)
This paper list is powered by the following services:
Other Resources About Olgica Milenkovic
What Schools Are Affiliated With Olgica Milenkovic?
Olgica Milenkovic is affiliated with the following schools:
