Olgica Milenkovic

According to our database1, Olgica Milenkovic authored at least 171 papers between 1998 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Awards

IEEE Fellow

IEEE Fellow 2018, "For contributions to genomic data compression".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Directed Intersection Representations and the Information Content of Digraphs.
IEEE Trans. Inf. Theory, 2021

Linear Classifiers in Mixed Constant Curvature Spaces.
CoRR, 2021

Semiquantitative Group Testing in at Most Two Rounds.
CoRR, 2021

Query-Based Selection of Optimal Candidates under the Mallows Model.
CoRR, 2021

2020
Motif and Hypergraph Correlation Clustering.
IEEE Trans. Inf. Theory, 2020

Coded Trace Reconstruction.
IEEE Trans. Inf. Theory, 2020

Set-Codes with Small Intersections and Small Discrepancies.
SIAM J. Discret. Math., 2020

Quadratic Decomposable Submodular Function Minimization: Theory and Practice.
J. Mach. Learn. Res., 2020

On the triangle clique cover and Kt clique cover problems.
Discret. Math., 2020

Access balancing in storage systems by labeling partial Steiner systems.
Des. Codes Cryptogr., 2020

Finding the Second-Best Candidate under the Mallows Model.
CoRR, 2020

Reconstructing Mixtures of Coded Strings from Prefix and Suffix Compositions.
CoRR, 2020

Repairing Reed-Solomon Codes via Subspace Polynomials.
CoRR, 2020

Support Estimation with Sampling Artifacts and Errors.
CoRR, 2020

Joint Adaptive Feature Smoothing and Topology Extraction via Generalized PageRank GNNs.
CoRR, 2020

Coding for Polymer-Based Data Storage.
CoRR, 2020

Mass Error-Correction Codes for Polymer-Based Data Storage.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Group Testing with Runlength Constraints for Topological Molecular Storage.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Image Processing in DNA.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Multi-MotifGAN (MMGAN): Motif-Targeted Graph Generation And Prediction.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2019
Unique Reconstruction of Coded Strings From Multiset Substring Spectra.
IEEE Trans. Inf. Theory, 2019

Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes.
IEEE Trans. Commun., 2019

Landing Probabilities of Random Walks for Seed-Set Expansion in Hypergraphs.
CoRR, 2019

Online Convex Dictionary Learning.
CoRR, 2019

Support Estimation via Regularized and Weighted Chebyshev Approximations.
CoRR, 2019

Online Convex Matrix Factorization with Representative Regions.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Optimizing Generalized PageRank Methods for Seed-Expansion Community Detection.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Reconstruction and Error-Correction Codes for Polymer-Based Data Storage.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Directed Intersection Representations and the Information Content of Digraphs.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Mutually Uncorrelated Primers for DNA-Based Data Storage.
IEEE Trans. Inf. Theory, 2018

Correlation Clustering and Biclustering With Locally Bounded Errors.
IEEE Trans. Inf. Theory, 2018

Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction.
IEEE Trans. Inf. Theory, 2018

Repairing Reed-Solomon Codes With Multiple Erasures.
IEEE Trans. Inf. Theory, 2018

MaxMinSum Steiner Systems for Access Balancing in Distributed Storage.
SIAM J. Discret. Math., 2018

Paired threshold graphs.
Discret. Appl. Math., 2018

Higher-Order Spectral Clustering under Superimposed Stochastic Block Model.
CoRR, 2018

ChIPWig: a random access-enabling lossless and lossy compression method for ChIP-seq data.
Bioinform., 2018

METHCOMP: a special purpose compression platform for DNA methylation data.
Bioinform., 2018

Revisiting Decomposable Submodular Function Minimization with Incidence Relations.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Quadratic Decomposable Submodular Function Minimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Query K-means Clustering and the Double Dixie Cup Problem.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Unique Reconstruction of Coded Sequences from Multiset Substring Spectra.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Weight Enumerators of Some Classes of Deletion Correcting Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations.
IEEE/ACM Trans. Netw., 2017

Asymmetric Lee Distance Codes for DNA-Based Storage.
IEEE Trans. Inf. Theory, 2017

Computing similarity distances between rankings.
Discret. Appl. Math., 2017

Inhomogeneous Hypergraph Clustering with Applications.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Multiclass MinMax rank aggregation.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

The hybrid k-deck problem: Reconstructing sequences from short and long traces.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Optimal repair schemes for some families of full-length reed-solomon codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Repairing reed-solomon codes with two erasures.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Motif clustering and overlapping clustering for social network analysis.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Efficient Rank Aggregation via Lehmer Codes.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
Synchronization and Deduplication in Coded Distributed Storage Networks.
IEEE/ACM Trans. Netw., 2016

Codes for DNA Sequence Profiles.
IEEE Trans. Inf. Theory, 2016

Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing With Nonuniform Thresholds.
IEEE Trans. Inf. Theory, 2016

MetaCRAM: an integrated pipeline for metagenomic taxonomy identification and compression.
BMC Bioinform., 2016

smallWig: parallel compression of RNA-seq WIG files.
Bioinform., 2016

A new correlation clustering method for cancer mutation analysis.
Bioinform., 2016

Doubly threshold graphs for social network modeling.
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Weakly mutually uncorrelated codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Codes in the damerau distance for DNA storage.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Balanced permutation codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Inference of latent network features via co-intersection representations of graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Poisson Group Testing: A Probabilistic Model for Boolean Compressed Sensing.
IEEE Trans. Signal Process., 2015

DNA-Based Storage: Trends and Methods.
IEEE Trans. Mol. Biol. Multi Scale Commun., 2015

Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds.
SIAM J. Optim., 2015

String Reconstruction from Substring Compositions.
SIAM J. Discret. Math., 2015

A Rewritable, Random-Access DNA-Based Storage System.
CoRR, 2015

Community Detection via Minimax Correlation Clustering and Biclustering.
CoRR, 2015

A Perspective on Future Research Directions in Information Theory.
CoRR, 2015

HyDRA: gene prioritization via hybrid distance-score rank aggregation.
Bioinform., 2015

Codes for DNA storage channels.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Asymmetric Lee distance codes: New bounds and constructions.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Synchronizing edits in distributed storage networks.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Compensating for sneak currents in multi-level crosspoint resistive memories.
Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, 2015

2014
An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation.
IEEE Trans. Inf. Theory, 2014

Semiquantitative Group Testing.
IEEE Trans. Inf. Theory, 2014

Multipermutation Codes in the Ulam Metric for Nonvolatile Memories.
IEEE J. Sel. Areas Commun., 2014

Synchronizing rankings via interactive communication.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Similarity distances between permutations.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Multipermutation codes in the Ulam metric.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Group testing for non-uniformly quantized adder channels.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Quadratic-backtracking algorithm for string reconstruction from substring compositions.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Poisson group testing: A probabilistic model for nonadaptive streaming boolean compressed sensing.
Proceedings of the IEEE International Conference on Acoustics, 2014

Smooth representation of rankings.
Proceedings of the 48th Annual Conference on Information Sciences and Systems, 2014

2013
Hybrid Noncoherent Network Coding.
IEEE Trans. Inf. Theory, 2013

Error-Correction in Flash Memories via Codes in the Ulam Metric.
IEEE Trans. Inf. Theory, 2013

Computing Similarity Distances Between Rankings.
CoRR, 2013

MCUIUC - A new framework for metagenomic read compression.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Aggregating rankings with positional constraints.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Compression of noisy signals with information bottlenecks.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Weighted rank aggregation via relaxed integer programming.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Building consensus via iterative voting.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

MetaPar: Metagenomic sequence assembly via iterative reclassification.
Proceedings of the IEEE Global Conference on Signal and Information Processing, 2013

Gene prioritization via weighted Kendall rank aggregation.
Proceedings of the 5th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2013

A general framework for distributed vote aggregation.
Proceedings of the American Control Conference, 2013

Foreword.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Sorting of Permutations by Cost-Constrained Transpositions.
IEEE Trans. Inf. Theory, 2012

A Geometric Approach to Low-Rank Matrix Completion.
IEEE Trans. Inf. Theory, 2012

Structured sublinear compressive sensing via belief propagation.
Phys. Commun., 2012

A Novel Distance-Based Approach to Constrained Rank Aggregation
CoRR, 2012

Semi-Quantitative Group Testing: a General Paradigm with Applications in Genotyping
CoRR, 2012

Nonuniform Vote Aggregation Algorithms
CoRR, 2012

Causal compressive sensing for gene network inference.
Proceedings of the IEEE Statistical Signal Processing Workshop, 2012

Rank modulation for translocation error correction.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Alternating Markov chains for distribution estimation in the presence of errors.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Semi-quantitative group testing.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Session TA7a: Biological networks and machine learning (partially invited).
Proceedings of the Conference Record of the Forty Sixth Asilomar Conference on Signals, 2012

2011
Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion.
IEEE Trans. Signal Process., 2011

Information Theoretical and Algorithmic Approaches to Quantized Compressive Sensing.
IEEE Trans. Commun., 2011

Structured sublinear compressive sensing via dense belief propagation
CoRR, 2011

Symmetric group testing and superimposed codes.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Decomposing permutations via cost-constrained transpositions.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Low-rank matrix completion with geometric performance guarantees.
Proceedings of the IEEE International Conference on Acoustics, 2011

Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields.
Proceedings of the Global Communications Conference, 2011

2010
Introduction to the special issue on information theory in molecular biology and neuroscience.
IEEE Trans. Inf. Theory, 2010

On the hardness of approximating stopping and trapping sets.
IEEE Trans. Inf. Theory, 2010

Multiple-bases belief-propagation decoding of high-density cyclic codes.
IEEE Trans. Commun., 2010

A graphical model for computing the minimum cost transposition distance.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

On reconstructing a string from its substring compositions.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Compressive list-support recovery for colluder identification.
Proceedings of the IEEE International Conference on Acoustics, 2010

SET: An algorithm for consistent matrix completion.
Proceedings of the IEEE International Conference on Acoustics, 2010

2009
The Trapping Redundancy of Linear Block Codes.
IEEE Trans. Inf. Theory, 2009

Subspace pursuit for compressive sensing signal reconstruction.
IEEE Trans. Inf. Theory, 2009

Weighted superimposed codes and constrained integer compressed sensing.
IEEE Trans. Inf. Theory, 2009

Compressive Sensing DNA Microarrays.
EURASIP J. Bioinform. Syst. Biol., 2009

List-decoding methods for inferring polynomials in finite dynamical gene network models.
Bioinform., 2009

On modeling gene regulatory networks using Markov random fields.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Distortion-rate functions for quantized compressive sensing.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Sublinear compressive sensing reconstruction via belief propagation decoding.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Small-sample distribution estimation over sticky channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

A comparative study of quantized compressive sensing schemes.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes.
IEEE Trans. Inf. Theory, 2008

Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity
CoRR, 2008

Coding-theoretic methods for reverse engineering of gene regulatory networks.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Weighted Euclidean superimposed codes for integer compressed sensing.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

A list-decoding approach for inferring the dynamics of gene regulatory networks.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Sparse weighted Euclidean superimposed coding for integer compressed sensing.
Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

Probe Design for Compressive Sensing DNA Microarrays.
Proceedings of the 2008 IEEE International Conference on Bioinformatics and Biomedicine, 2008

2007
High-throughput VLSI Implementations of Iterative Decoders and Related Code Construction Problems.
J. VLSI Signal Process., 2007

Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles.
IEEE Trans. Inf. Theory, 2007

LDPC Codes Based on Latin Squares: Cycle Structure, Stopping Set, and Trapping Set Analysis.
IEEE Trans. Commun., 2007

Two Methods for Reducing the Error-Floor of LDPC Codes
CoRR, 2007

On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes
CoRR, 2007

Hybrid ARQ: Theory, State of the Art and Future Directions.
Proceedings of the IEEE Information Theory Workshop on Information Theory for Wireless Networks, 2007

Constrained Coding for Context-Free Languages with Applications to Genetic Sequence Modelling.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Multiple-Bases Belief-Propagation for Decoding of Short Block Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Shortened Array Codes of Large Girth.
IEEE Trans. Inf. Theory, 2006

On unequal error protection LDPC codes based on plotkin-type constructions.
IEEE Trans. Commun., 2006

Trapping Sets in Irregular LDPC Code Ensembles.
Proceedings of IEEE International Conference on Communications, 2006

When Does One Redundant Parity-Check Equation Matter?
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005
On graphical representations of algebraic codes suitable for iterative decoding.
IEEE Commun. Lett., 2005

Support Weight Enumerators and Coset Weight Distributions of Isodual Codes.
Des. Codes Cryptogr., 2005

Average Case Analysis of Gosper's Algorithm for a Class of Urn Model Inputs.
Algorithmica, 2005

On the Design of Codes for DNA Computing.
Proceedings of the Coding and Cryptography, International Workshop, 2005

DNA codes that avoid secondary structures.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding.
IEEE Trans. Inf. Theory, 2004

Probabilistic Transforms for Combinatorial Urn Models.
Comb. Probab. Comput., 2004

Information theory and coding problems in genetics.
Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Analysis of Bin models with applications in coding theory.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Structured LDPC codes over GF(2<sup>2</sup>) and companion matrix based decoding.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Analysis of the cycle-structure of LDPC codes based on Latin squares.
Proceedings of IEEE International Conference on Communications, 2004

High-throughput VLSI implementations of iterative decoders and related code construction problems.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

Data Storage and Processing in Cells: An Information Theoretic Approach.
Proceedings of the Advances in Information Recording, 2004

2003
The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes.
IEEE Trans. Inf. Theory, 2003

Asymptotic analysis of A* maximum-likelihood decoding with reliability reordering.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2000
Permutation (d, k) codes: Efficient enumerative coding and phrase length distribution shaping.
IEEE Trans. Inf. Theory, 2000

1998
Shannon Capacity of M-ary Redundant Multitrack Runlength Limited Codes.
IEEE Trans. Inf. Theory, 1998


  Loading...