Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlgica Milenkovic
Person information
- affiliation: University of Illinois, Urbana-Champaign, Urbana, IL, USA
- affiliation (former): University of Colorado, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2002
[b1]Olgica Milenkovic:
Combinatorial problems in analysis of algorithms and coding theory. University of Michigan, USA, 2002
Journal Articles
- 2024
- [j74]Ananthan Nambiar, Chao Pan, Vishal Rana, Mahdi Cheraghchi, João Ribeiro, Sergei Maslov, Olgica Milenkovic:
Semi-quantitative group testing for efficient and accurate qPCR screening of pathogens with a wide range of loads. BMC Bioinform. 25(1): 195 (2024) - [j73]George V. Moustakides, Xujun Liu, Olgica Milenkovic:
Optimal stopping methodology for the secretary problem with random queries. J. Appl. Probab. 61(2): 578-602 (2024) - 2023
- [j72]George V. Moustakides, Xujun Liu, Olgica Milenkovic:
Optimal Stopping Methodology for the Secretary Problem with Random Queries - ADDENDUM. J. Appl. Probab. 60(4): 1532 (2023) - [j71]Chao Pan
, Eli Chien, Puoya Tabaghi, Jianhao Peng, Olgica Milenkovic:
Provably accurate and scalable linear classifiers in hyperbolic spaces. Knowl. Inf. Syst. 65(4): 1817-1850 (2023) - [j70]Vishal Rana, Eli Chien, Jianhao Peng, Olgica Milenkovic:
Small-Sample Estimation of the Mutational Support and Distribution of SARS-CoV-2. IEEE ACM Trans. Comput. Biol. Bioinform. 20(1): 668-682 (2023) - [j69]Ryan Gabrys, Srilakshmi Pattabiraman, Olgica Milenkovic:
Reconstruction of Sets of Strings From Prefix/Suffix Compositions. IEEE Trans. Commun. 71(1): 3-12 (2023) - [j68]Xujun Liu, Olgica Milenkovic, George V. Moustakides:
Query-based selection of optimal candidates under the Mallows model. Theor. Comput. Sci. 979: 114206 (2023) - [j67]Srilakshmi Pattabiraman, Ryan Gabrys, Olgica Milenkovic:
Coding for Polymer-Based Data Storage. IEEE Trans. Inf. Theory 69(8): 4812-4836 (2023) - 2022
- [j66]Xujun Liu, Olgica Milenkovic:
Finding the second-best candidate under the Mallows model. Theor. Comput. Sci. 929: 39-68 (2022) - 2021
- [j65]Xujun Liu, Roberto Assis Machado, Olgica Milenkovic:
Directed Intersection Representations and the Information Content of Digraphs. IEEE Trans. Inf. Theory 67(1): 347-357 (2021) - [j64]Alexander Barg, Lara Dolecek, Ryan Gabrys, Gyula O. H. Katona, János Körner, Andrew McGregor, Olgica Milenkovic, Sihem Mesnager, Gilles Zémor:
Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein". IEEE Trans. Inf. Theory 67(6): 3187-3189 (2021) - [j63]Son Hoang Dau, Dinh Thi Xinh, Han Mao Kiah, Tran Thi Luong, Olgica Milenkovic:
Repairing Reed-Solomon Codes via Subspace Polynomials. IEEE Trans. Inf. Theory 67(10): 6395-6407 (2021) - 2020
- [j62]Yeow Meng Chee, Charles J. Colbourn, Hoang Dau, Ryan Gabrys, Alan C. H. Ling, Dylan Lusi, Olgica Milenkovic:
Access balancing in storage systems by labeling partial Steiner systems. Des. Codes Cryptogr. 88(11): 2361-2376 (2020) - [j61]Hoang Dau, Olgica Milenkovic, Gregory J. Puleo:
On the triangle clique cover and Kt clique cover problems. Discret. Math. 343(1): 111627 (2020) - [j60]Pan Li, Niao He, Olgica Milenkovic:
Quadratic Decomposable Submodular Function Minimization: Theory and Practice. J. Mach. Learn. Res. 21: 106:1-106:49 (2020) - [j59]Ryan Gabrys, Son Hoang Dau, Charles J. Colbourn, Olgica Milenkovic:
Set-Codes with Small Intersections and Small Discrepancies. SIAM J. Discret. Math. 34(2): 1148-1171 (2020) - [j58]Pan Li, Gregory J. Puleo, Olgica Milenkovic:
Motif and Hypergraph Correlation Clustering. IEEE Trans. Inf. Theory 66(5): 3065-3078 (2020) - [j57]Mahdi Cheraghchi, Ryan Gabrys, Olgica Milenkovic, João Ribeiro:
Coded Trace Reconstruction. IEEE Trans. Inf. Theory 66(10): 6084-6103 (2020) - 2019
- [j56]Khodakhast Bibak, Olgica Milenkovic:
Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes. IEEE Trans. Commun. 67(3): 1809-1816 (2019) - [j55]Ryan Gabrys, Olgica Milenkovic:
Unique Reconstruction of Coded Strings From Multiset Substring Spectra. IEEE Trans. Inf. Theory 65(12): 7682-7696 (2019) - 2018
- [j54]Vida Ravanmehr, Minji Kim, Zhiying Wang, Olgica Milenkovic:
ChIPWig: a random access-enabling lossless and lossy compression method for ChIP-seq data. Bioinform. 34(6): 911-919 (2018) - [j53]Jianhao Peng, Olgica Milenkovic, Idoia Ochoa:
METHCOMP: a special purpose compression platform for DNA methylation data. Bioinform. 34(15): 2654-2656 (2018) - [j52]Vida Ravanmehr, Gregory J. Puleo, Sadegh Bolouki, Olgica Milenkovic:
Paired threshold graphs. Discret. Appl. Math. 250: 291-308 (2018) - [j51]Hoang Dau, Olgica Milenkovic:
MaxMinSum Steiner Systems for Access Balancing in Distributed Storage. SIAM J. Discret. Math. 32(3): 1644-1671 (2018) - [j50]Ryan Gabrys, Eitan Yaakobi, Olgica Milenkovic:
Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction. IEEE Trans. Inf. Theory 64(4): 2550-2570 (2018) - [j49]Gregory J. Puleo, Olgica Milenkovic:
Correlation Clustering and Biclustering With Locally Bounded Errors. IEEE Trans. Inf. Theory 64(6): 4105-4119 (2018) - [j48]S. M. Hossein Tabatabaei Yazdi, Han Mao Kiah, Ryan Gabrys, Olgica Milenkovic:
Mutually Uncorrelated Primers for DNA-Based Data Storage. IEEE Trans. Inf. Theory 64(9): 6283-6296 (2018) - [j47]Hoang Dau, Iwan M. Duursma, Han Mao Kiah, Olgica Milenkovic:
Repairing Reed-Solomon Codes With Multiple Erasures. IEEE Trans. Inf. Theory 64(10): 6567-6582 (2018) - 2017
- [j46]Farzad Farnoud Hassanzadeh, Olgica Milenkovic, Gregory J. Puleo, Lili Su:
Computing similarity distances between rankings. Discret. Appl. Math. 232: 157-175 (2017) - [j45]Ryan Gabrys, Han Mao Kiah, Olgica Milenkovic:
Asymmetric Lee Distance Codes for DNA-Based Storage. IEEE Trans. Inf. Theory 63(8): 4982-4995 (2017) - [j44]Hoang Dau, Olgica Milenkovic:
Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations. IEEE/ACM Trans. Netw. 25(5): 3219-3234 (2017) - 2016
- [j43]Zhiying Wang, Tsachy Weissman, Olgica Milenkovic:
smallWig: parallel compression of RNA-seq WIG files. Bioinform. 32(2): 173-180 (2016) - [j42]Jack P. Hou, Amin Emad, Gregory J. Puleo, Jian Ma, Olgica Milenkovic:
A new correlation clustering method for cancer mutation analysis. Bioinform. 32(24): 3717-3728 (2016) - [j41]Minji Kim, Xiejia Zhang, Jonathan G. Ligo, Farzad Farnoud, Venugopal V. Veeravalli, Olgica Milenkovic:
MetaCRAM: an integrated pipeline for metagenomic taxonomy identification and compression. BMC Bioinform. 17: 94 (2016) - [j40]Amin Emad, Olgica Milenkovic:
Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing With Nonuniform Thresholds. IEEE Trans. Inf. Theory 62(4): 1674-1687 (2016) - [j39]Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic:
Codes for DNA Sequence Profiles. IEEE Trans. Inf. Theory 62(6): 3125-3146 (2016) - [j38]Salim El Rouayheb, Sreechakra Goparaju, Han Mao Kiah, Olgica Milenkovic:
Synchronization and Deduplication in Coded Distributed Storage Networks. IEEE/ACM Trans. Netw. 24(5): 3056-3069 (2016) - 2015
- [j37]Minji Kim, Farzad Farnoud, Olgica Milenkovic:
HyDRA: gene prioritization via hybrid distance-score rank aggregation. Bioinform. 31(7): 1034-1043 (2015) - [j36]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
String Reconstruction from Substring Compositions. SIAM J. Discret. Math. 29(3): 1340-1371 (2015) - [j35]Gregory J. Puleo, Olgica Milenkovic:
Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds. SIAM J. Optim. 25(3): 1857-1872 (2015) - [j34]S. M. Hossein Tabatabaei Yazdi, Han Mao Kiah, Eva Ruiz Garcia, Jian Ma, Huimin Zhao, Olgica Milenkovic:
DNA-Based Storage: Trends and Methods. IEEE Trans. Mol. Biol. Multi Scale Commun. 1(3): 230-248 (2015) - [j33]Amin Emad, Olgica Milenkovic:
Poisson Group Testing: A Probabilistic Model for Boolean Compressed Sensing. IEEE Trans. Signal Process. 63(16): 4396-4410 (2015) - 2014
- [j32]Farzad Farnoud Hassanzadeh, Olgica Milenkovic:
Multipermutation Codes in the Ulam Metric for Nonvolatile Memories. IEEE J. Sel. Areas Commun. 32(5): 919-932 (2014) - [j31]Amin Emad, Olgica Milenkovic:
Semiquantitative Group Testing. IEEE Trans. Inf. Theory 60(8): 4614-4636 (2014) - [j30]Farzad Farnoud Hassanzadeh, Olgica Milenkovic:
An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation. IEEE Trans. Inf. Theory 60(10): 6417-6439 (2014) - 2013
- [j29]Farzad Farnoud, Vitaly Skachek, Olgica Milenkovic:
Error-Correction in Flash Memories via Codes in the Ulam Metric. IEEE Trans. Inf. Theory 59(5): 3003-3020 (2013) - [j28]Vitaly Skachek, Olgica Milenkovic, Angelia Nedic:
Hybrid Noncoherent Network Coding. IEEE Trans. Inf. Theory 59(6): 3317-3331 (2013) - 2012
- [j27]Wei Dai, Olgica Milenkovic, Hoa Vinh Pham:
Structured sublinear compressive sensing via belief propagation. Phys. Commun. 5(2): 76-90 (2012) - [j26]Farzad Farnoud, Olgica Milenkovic:
Sorting of Permutations by Cost-Constrained Transpositions. IEEE Trans. Inf. Theory 58(1): 3-23 (2012) - [j25]Wei Dai, Ely Kerman, Olgica Milenkovic:
A Geometric Approach to Low-Rank Matrix Completion. IEEE Trans. Inf. Theory 58(1): 237-247 (2012) - 2011
- [j24]Wei Dai, Olgica Milenkovic:
Information Theoretical and Algorithmic Approaches to Quantized Compressive Sensing. IEEE Trans. Commun. 59(7): 1857-1866 (2011) - [j23]Wei Dai, Olgica Milenkovic, Ely Kerman:
Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion. IEEE Trans. Signal Process. 59(7): 3120-3132 (2011) - 2010
- [j22]Thorsten Hehn, Johannes B. Huber, Olgica Milenkovic, Stefan Laendner:
Multiple-bases belief-propagation decoding of high-density cyclic codes. IEEE Trans. Commun. 58(1): 1-8 (2010) - [j21]Olgica Milenkovic, Gil Alterovitz, Gerard Battail, Todd P. Coleman, Joachim Hagenauer, Sean P. Meyn, Nathan D. Price, Marco Ramoni, Ilya Shmulevich, Wojciech Szpankowski:
Introduction to the special issue on information theory in molecular biology and neuroscience. IEEE Trans. Inf. Theory 56(2): 649-652 (2010) - [j20]Andrew McGregor, Olgica Milenkovic:
On the hardness of approximating stopping and trapping sets. IEEE Trans. Inf. Theory 56(4): 1640-1650 (2010) - 2009
- [j19]Janis Dingel, Olgica Milenkovic:
List-decoding methods for inferring polynomials in finite dynamical gene network models. Bioinform. 25(13): 1686-1693 (2009) - [j18]Wei Dai, Mona A. Sheikh, Olgica Milenkovic, Richard G. Baraniuk:
Compressive Sensing DNA Microarrays. EURASIP J. Bioinform. Syst. Biol. 2009 (2009) - [j17]Stefan Laendner, Thorsten Hehn, Olgica Milenkovic, Johannes B. Huber:
The Trapping Redundancy of Linear Block Codes. IEEE Trans. Inf. Theory 55(1): 53-63 (2009) - [j16]Wei Dai, Olgica Milenkovic:
Weighted superimposed codes and constrained integer compressed sensing. IEEE Trans. Inf. Theory 55(5): 2215-2229 (2009) - [j15]Wei Dai, Olgica Milenkovic:
Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inf. Theory 55(5): 2230-2249 (2009) - 2008
- [j14]Thorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber:
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes. IEEE Trans. Inf. Theory 54(12): 5308-5331 (2008) - 2007
- [j13]Stefan Laendner, Olgica Milenkovic:
LDPC Codes Based on Latin Squares: Cycle Structure, Stopping Set, and Trapping Set Analysis. IEEE Trans. Commun. 55(2): 303-312 (2007) - [j12]Olgica Milenkovic, Emina Soljanin, Philip Whiting:
Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles. IEEE Trans. Inf. Theory 53(1): 39-55 (2007) - [j11]Vijay Nagarajan, Stefan Laendner, Nikhil Jayakumar, Olgica Milenkovic, Sunil P. Khatri:
High-throughput VLSI Implementations of Iterative Decoders and Related Code Construction Problems. J. VLSI Signal Process. 49(1): 185-206 (2007) - 2006
- [j10]Vidya Kumar, Olgica Milenkovic:
On unequal error protection LDPC codes based on plotkin-type constructions. IEEE Trans. Commun. 54(6): 994-1005 (2006) - [j9]Olgica Milenkovic, Navin Kashyap, David Leyba:
Shortened Array Codes of Large Girth. IEEE Trans. Inf. Theory 52(8): 3707-3722 (2006) - 2005
- [j8]Olgica Milenkovic, Kevin J. Compton:
Average Case Analysis of Gosper's Algorithm for a Class of Urn Model Inputs. Algorithmica 43(3): 211-244 (2005) - [j7]Olgica Milenkovic:
Support Weight Enumerators and Coset Weight Distributions of Isodual Codes. Des. Codes Cryptogr. 35(1): 81-109 (2005) - [j6]Vidya Kumar, Olgica Milenkovic:
On graphical representations of algebraic codes suitable for iterative decoding. IEEE Commun. Lett. 9(8): 729-731 (2005) - 2004
- [j5]Olgica Milenkovic, Kevin J. Compton:
Probabilistic Transforms for Combinatorial Urn Models. Comb. Probab. Comput. 13(4-5): 645-675 (2004) - [j4]Bane Vasic, Olgica Milenkovic:
Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding. IEEE Trans. Inf. Theory 50(6): 1156-1176 (2004) - 2003
- [j3]Olgica Milenkovic, T. S. Coffey, Kevin J. Compton:
The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes. IEEE Trans. Inf. Theory 49(3): 740-746 (2003) - 2000
- [j2]Olgica Milenkovic, Bane Vasic:
Permutation (d, k) codes: Efficient enumerative coding and phrase length distribution shaping. IEEE Trans. Inf. Theory 46(7): 2671-2675 (2000) - 1998
- [j1]Bane V. Vasic, Steven W. McLaughlin, Olgica Milenkovic:
Shannon Capacity of M-ary Redundant Multitrack Runlength Limited Codes. IEEE Trans. Inf. Theory 44(2): 766-774 (1998)
Conference and Workshop Papers
- 2024
- [c117]Jin Sima, Changlong Wu, Olgica Milenkovic, Wojciech Szpankowski:
Online Distribution Learning with Local Privacy Constraints. AISTATS 2024: 460-468 - 2023
- [c116]Chao Pan, Jin Sima, Saurav Prakash, Vishal Rana, Olgica Milenkovic:
Machine Unlearning of Federated Clusters. ICLR 2023 - [c115]Eli Chien, Chao Pan, Olgica Milenkovic:
Efficient Model Updates for Approximate Unlearning of Graph-Structured Data. ICLR 2023 - [c114]Eli Chien, Jiong Zhang, Cho-Jui Hsieh, Jyun-Yu Jiang, Wei-Cheng Chang, Olgica Milenkovic, Hsiang-Fu Yu:
PINA: Leveraging Side Information in eXtreme Multi-label Classification via Predicted Instance Neighborhood Aggregation. ICML 2023: 5616-5630 - [c113]Jin Sima, Yun-Han Li, Ilan Shomorony, Olgica Milenkovic:
On Constant-Weight Binary B2-Sequences. ISIT 2023: 886-891 - [c112]Yun-Han Li, Ryan Gabrys, Jin Sima, Ilan Shomorony, Olgica Milenkovic:
Finding a Burst of Positives via Nonadaptive Semiquantitative Group Testing. ISIT 2023: 1848-1853 - [c111]Jin Sima, Chao Pan, Olgica Milenkovic:
Perturbation-Resilient Sets for Dynamic Service Balancing. ISIT 2023: 2278-2283 - [c110]Xujun Liu, Olgica Milenkovic, George V. Moustakides:
A Combinatorial Proof for the Dowry Problem. ITW 2023: 538-543 - [c109]Eli Chien, Wei-Ning Chen, Chao Pan, Pan Li, Ayfer Özgür, Olgica Milenkovic:
Differentially Private Decoupled Graph Convolutions for Multigranular Topology Protection. NeurIPS 2023 - [c108]Chao Pan, Eli Chien, Olgica Milenkovic:
Unlearning Graph Classifiers with Limited Data Resources. WWW 2023: 716-726 - 2022
- [c107]Eli Chien, Wei-Cheng Chang, Cho-Jui Hsieh, Hsiang-Fu Yu, Jiong Zhang, Olgica Milenkovic, Inderjit S. Dhillon:
Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction. ICLR 2022 - [c106]Eli Chien, Chao Pan, Jianhao Peng, Olgica Milenkovic:
You are AllSet: A Multiset Function Framework for Hypergraph Neural Networks. ICLR 2022 - [c105]Rebecca Golm, Mina Nahvi, Ryan Gabrys, Olgica Milenkovic:
The Gapped k-Deck Problem. ISIT 2022: 49-54 - [c104]Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic:
Balanced and Swap-Robust Trades for Dynamical Distributed Storage. ISIT 2022: 2385-2390 - [c103]Eli Chien, Puoya Tabaghi, Olgica Milenkovic:
HyperAid: Denoising in Hyperbolic Spaces for Tree-fitting and Hierarchical Clustering. KDD 2022: 201-211 - 2021
- [c102]Eli Chien, Chao Pan, Puoya Tabaghi, Olgica Milenkovic:
Highly Scalable and Provably Accurate Classification in Poincaré Balls. ICDM 2021: 61-70 - [c101]Eli Chien, Jianhao Peng, Pan Li, Olgica Milenkovic:
Adaptive Universal Generalized PageRank Graph Neural Network. ICLR 2021 - [c100]Eli Chien, Olgica Milenkovic, Angelia Nedich:
Support Estimation with Sampling Artifacts and Errors. ISIT 2021: 244-249 - [c99]Mahdi Cheraghchi, Ryan Gabrys, Olgica Milenkovic:
Semiquantitative Group Testing in at Most Two Rounds. ISIT 2021: 1973-1978 - [c98]Xujun Liu, Olgica Milenkovic:
The Postdoc Problem under the Mallows Model. ISIT 2021: 3214-3219 - [c97]Eli Chien, Pan Li, Olgica Milenkovic:
Landing Probabilities of Random Walks for Seed-Set Expansion in Hypergraphs. ITW 2021: 1-6 - 2020
- [c96]Anuththari Gamage, Eli Chien, Jianhao Peng, Olgica Milenkovic:
Multi-MotifGAN (MMGAN): Motif-Targeted Graph Generation And Prediction. ICASSP 2020: 4182-4186 - [c95]Chao Pan, S. M. Hossein Tabatabaei Yazdi, S. Kasra Tabatabaei, Alvaro G. Hernandez, Charles Schroeder, Olgica Milenkovic:
Image Processing in DNA. ICASSP 2020: 8831-8835 - [c94]Ryan Gabrys, Srilakshmi Pattabiraman, Olgica Milenkovic:
Mass Error-Correction Codes for Polymer-Based Data Storage. ISIT 2020: 25-30 - [c93]Abhishek Agarwal, Olgica Milenkovic, Srilakshmi Pattabiraman, João Ribeiro:
Group Testing with Runlength Constraints for Topological Molecular Storage. ISIT 2020: 132-137 - [c92]Yeow Meng Chee, Charles Joseph Colbourn, Hoang Dau, Ryan Gabrys, Alan Chi Hung Ling, Dylan Lusi, Olgica Milenkovic:
Access Balancing in Storage Systems by Labeling Partial Steiner Systems. ISIT 2020: 566-570 - [c91]Ryan Gabrys, Srilakshmi Pattabiraman, Olgica Milenkovic:
Reconstructing Mixtures of Coded Strings from Prefix and Suffix Compositions. ITW 2020: 1-5 - 2019
- [c90]Alexandr V. Kostochka, Xujun Liu, Roberto Assis Machado, Olgica Milenkovic:
Directed Intersection Representations and the Information Content of Digraphs. ISIT 2019: 1477-1481 - [c89]Ryan Gabrys, Hoang Dau, Charles J. Colbourn, Olgica Milenkovic:
Set-Codes with Small Intersections and Small Discrepancies. ISIT 2019: 2359-2363 - [c88]Mahdi Cheraghchi, João Ribeiro, Ryan Gabrys, Olgica Milenkovic:
Coded Trace Reconstruction. ITW 2019: 1-5 - [c87]Srilakshmi Pattabiraman, Ryan Gabrys, Olgica Milenkovic:
Reconstruction and Error-Correction Codes for Polymer-Based Data Storage. ITW 2019: 1-5 - [c86]Pan Li, I (Eli) Chien, Olgica Milenkovic:
Optimizing Generalized PageRank Methods for Seed-Expansion Community Detection. NeurIPS 2019: 11705-11716 - [c85]Jianhao Peng, Olgica Milenkovic, Abhishek Agarwal:
Online Convex Matrix Factorization with Representative Regions. NeurIPS 2019: 13221-13231 - 2018
- [c84]Pan Li, Olgica Milenkovic:
Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering. ICML 2018: 3020-3029 - [c83]Khodakhast Bibak, Olgica Milenkovic:
Weight Enumerators of Some Classes of Deletion Correcting Codes. ISIT 2018: 431-435 - [c82]Ryan Gabrys, Olgica Milenkovic:
Unique Reconstruction of Coded Sequences from Multiset Substring Spectra. ISIT 2018: 2540-2544 - [c81]Pan Li, Niao He, Olgica Milenkovic:
Quadratic Decomposable Submodular Function Minimization. NeurIPS 2018: 1062-1072 - [c80]Pan Li, Olgica Milenkovic:
Revisiting Decomposable Submodular Function Minimization with Incidence Relations. NeurIPS 2018: 2242-2252 - [c79]I (Eli) Chien, Chao Pan, Olgica Milenkovic:
Query K-means Clustering and the Double Dixie Cup Problem. NeurIPS 2018: 6650-6659 - 2017
- [c78]Pan Li, Arya Mazumdar, Olgica Milenkovic:
Efficient Rank Aggregation via Lehmer Codes. AISTATS 2017: 450-459 - [c77]Pan Li, Hoang Dau, Gregory J. Puleo, Olgica Milenkovic:
Motif clustering and overlapping clustering for social network analysis. INFOCOM 2017: 1-9 - [c76]Hoang Dau, Olgica Milenkovic:
Optimal repair schemes for some families of full-length reed-solomon codes. ISIT 2017: 346-350 - [c75]Hoang Dau, Iwan M. Duursma, Han Mao Kiah, Olgica Milenkovic:
Repairing reed-solomon codes with two erasures. ISIT 2017: 351-355 - [c74]Ryan Gabrys, Olgica Milenkovic:
The hybrid k-deck problem: Reconstructing sequences from short and long traces. ISIT 2017: 1306-1310 - [c73]Pan Li, Olgica Milenkovic:
Multiclass MinMax rank aggregation. ISIT 2017: 3000-3004 - [c72]Pan Li, Olgica Milenkovic:
Inhomogeneous Hypergraph Clustering with Applications. NIPS 2017: 2308-2318 - 2016
- [c71]Gregory J. Puleo, Olgica Milenkovic:
Correlation Clustering and Biclustering with Locally Bounded Errors. ICML 2016: 869-877 - [c70]Ryan Gabrys, Olgica Milenkovic:
Balanced permutation codes. ISIT 2016: 390-394 - [c69]Son Hoang Dau, Olgica Milenkovic:
Inference of latent network features via co-intersection representations of graphs. ISIT 2016: 1351-1355 - [c68]Ryan Gabrys, Eitan Yaakobi, Olgica Milenkovic:
Codes in the damerau distance for DNA storage. ISIT 2016: 2644-2648 - [c67]S. M. Hossein Tabatabaei Yazdi, Han Mao Kiah, Olgica Milenkovic:
Weakly mutually uncorrelated codes. ISIT 2016: 2649-2653 - [c66]Vida Ravanmehr, Sadegh Bolouki, Gregory J. Puleo, Olgica Milenkovic:
Doubly threshold graphs for social network modeling. ITW 2016: 231-235 - 2015
- [c65]Tianqiong Luo, Olgica Milenkovic, Borja Peleato:
Compensating for sneak currents in multi-level crosspoint resistive memories. ACSSC 2015: 839-843 - [c64]Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic:
Codes for DNA sequence profiles. ISIT 2015: 814-818 - [c63]Ryan Gabrys, Han Mao Kiah, Olgica Milenkovic:
Asymmetric Lee distance codes for DNA-based storage. ISIT 2015: 909-913 - [c62]Salim El Rouayheb, Sreechakra Goparaju, Han Mao Kiah, Olgica Milenkovic:
Synchronizing edits in distributed storage networks. ISIT 2015: 1472-1476 - [c61]Ryan Gabrys, Han Mao Kiah, Olgica Milenkovic:
Asymmetric Lee distance codes: New bounds and constructions. ITW 2015: 1-5 - [c60]Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic:
Codes for DNA storage channels. ITW 2015: 1-5 - 2014
- [c59]Arya Mazumdar, Olgica Milenkovic:
Smooth representation of rankings. CISS 2014: 1-4 - [c58]Amin Emad, Olgica Milenkovic:
Poisson group testing: A probabilistic model for nonadaptive streaming boolean compressed sensing. ICASSP 2014: 3335-3339 - [c57]Lili Su, Olgica Milenkovic:
Synchronizing rankings via interactive communication. ISIT 2014: 1056-1060 - [c56]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
Quadratic-backtracking algorithm for string reconstruction from substring compositions. ISIT 2014: 1296-1300 - [c55]Lili Su, Farzad Farnoud, Olgica Milenkovic:
Similarity distances between permutations. ISIT 2014: 2267-2271 - [c54]Amin Emad, Olgica Milenkovic:
Group testing for non-uniformly quantized adder channels. ISIT 2014: 2351-2355 - [c53]Farzad Farnoud, Olgica Milenkovic:
Multipermutation codes in the Ulam metric. ISIT 2014: 2754-2758 - 2013
- [c52]Tamer Basar, Olgica Milenkovic:
Foreword. Allerton 2013: 1 - [c51]Behrouz Touri, Farzad Farnoud, Angelia Nedic, Olgica Milenkovic:
A general framework for distributed vote aggregation. ACC 2013: 3827-3832 - [c50]Minji Kim, Fardad Raisali, Farzad Farnoud, Olgica Milenkovic:
Gene prioritization via weighted Kendall rank aggregation. CAMSAP 2013: 184-187 - [c49]Minji Kim, Jonathan G. Ligo, Amin Emad, Farzad Farnoud, Olgica Milenkovic, Venugopal V. Veeravalli:
MetaPar: Metagenomic sequence assembly via iterative reclassification. GlobalSIP 2013: 43-46 - [c48]Farzad Farnoud Hassanzadeh, Eitan Yaakobi, Behrouz Touri, Olgica Milenkovic, Jehoshua Bruck:
Building consensus via iterative voting. ISIT 2013: 1082-1086 - [c47]Fardad Raisali, Farzad Farnoud Hassanzadeh, Olgica Milenkovic:
Weighted rank aggregation via relaxed integer programming. ISIT 2013: 2765-2769 - [c46]Amin Emad, Olgica Milenkovic:
Compression of noisy signals with information bottlenecks. ITW 2013: 1-5 - [c45]Farzad Farnoud Hassanzadeh, Olgica Milenkovic:
Aggregating rankings with positional constraints. ITW 2013: 1-5 - [c44]Jonathan G. Ligo, Minji Kim, Amin Emad, Olgica Milenkovic, Venugopal V. Veeravalli:
MCUIUC - A new framework for metagenomic read compression. ITW 2013: 1-5 - 2012
- [c43]Olgica Milenkovic:
Session TA7a: Biological networks and machine learning (partially invited). ACSCC 2012: 762-764 - [c42]Amin Emad, Olgica Milenkovic:
Semi-quantitative group testing. ISIT 2012: 1847-1851 - [c41]Farzad Farnoud, Narayana P. Santhanam, Olgica Milenkovic:
Alternating Markov chains for distribution estimation in the presence of errors. ISIT 2012: 2017-2021 - [c40]Farzad Farnoud, Vitaly Skachek, Olgica Milenkovic:
Rank modulation for translocation error correction. ISIT 2012: 2988-2992 - [c39]Vitaly Skachek, Olgica Milenkovic, Angelia Nedic:
Hybrid noncoherent network coding. NetCod 2012: 7-12 - [c38]Mo Deng, Amin Emad, Olgica Milenkovic:
Causal compressive sensing for gene network inference. SSP 2012: 696-699 - 2011
- [c37]Amin Emad, Olgica Milenkovic:
Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields. GLOBECOM 2011: 1-5 - [c36]Wei Dai, Ely Kerman, Olgica Milenkovic:
Low-rank matrix completion with geometric performance guarantees. ICASSP 2011: 3740-3743 - [c35]Farzad Farnoud, Olgica Milenkovic:
Decomposing permutations via cost-constrained transpositions. ISIT 2011: 2095-2099 - [c34]Amin Emad, Jun Shen, Olgica Milenkovic:
Symmetric group testing and superimposed codes. ITW 2011: 20-24 - 2010
- [c33]Wei Dai, Olgica Milenkovic:
SET: An algorithm for consistent matrix completion. ICASSP 2010: 3646-3649 - [c32]Hoa Vinh Pham, Wei Dai, Olgica Milenkovic:
Compressive list-support recovery for colluder identification. ICASSP 2010: 4166-4169 - [c31]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
On reconstructing a string from its substring compositions. ISIT 2010: 1238-1242 - [c30]Farzad Farnoud, Chien-Yu Chen, Olgica Milenkovic, Navin Kashyap:
A graphical model for computing the minimum cost transposition distance. ITW 2010: 1-5 - 2009
- [c29]Wei Dai, Hoa Vinh Pham, Olgica Milenkovic:
A comparative study of quantized compressive sensing schemes. ISIT 2009: 11-15 - [c28]Hoa Vinh Pham, Wei Dai, Olgica Milenkovic:
Sublinear compressive sensing reconstruction via belief propagation decoding. ISIT 2009: 674-678 - [c27]Farzad Farnoud, Olgica Milenkovic, Narayana P. Santhanam:
Small-sample distribution estimation over sticky channels. ISIT 2009: 1125-1129 - [c26]Narayana Santhanam, Janis Dingel, Olgica Milenkovic:
On modeling gene regulatory networks using Markov random fields. ITW 2009: 156-160 - [c25]Wei Dai, Hoa Vinh Pham, Olgica Milenkovic:
Distortion-rate functions for quantized compressive sensing. ITW 2009: 171-175 - 2008
- [c24]Wei Dai, Olgica Milenkovic, Mona A. Sheikh, Richard G. Baraniuk:
Probe Design for Compressive Sensing DNA Microarrays. BIBM 2008: 163-169 - [c23]Wei Dai, Olgica Milenkovic:
Sparse weighted Euclidean superimposed coding for integer compressed sensing. CISS 2008: 470-475 - [c22]Wei Dai, Olgica Milenkovic:
Sparse weighted Euclidean superimposed coding for integer compressed sensing. CISS 2008: 480-485 - [c21]Janis Dingel, Olgica Milenkovic:
A list-decoding approach for inferring the dynamics of gene regulatory networks. ISIT 2008: 2282-2286 - [c20]Janis Dingel, Olgica Milenkovic:
Coding-theoretic methods for reverse engineering of gene regulatory networks. ITW 2008: 114-118 - [c19]Wei Dai, Olgica Milenkovic:
Weighted Euclidean superimposed codes for integer compressed sensing. ITW 2008: 124-128 - 2007
- [c18]Thorsten Hehn, Johannes B. Huber, Stefan Laendner, Olgica Milenkovic:
Multiple-Bases Belief-Propagation for Decoding of Short Block Codes. ISIT 2007: 311-315 - [c17]Olgica Milenkovic:
Constrained Coding for Context-Free Languages with Applications to Genetic Sequence Modelling. ISIT 2007: 1686-1690 - [c16]Thorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber:
Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes. ISIT 2007: 2926-2930 - [c15]Christopher Lott, Olgica Milenkovic, Emina Soljanin:
Hybrid ARQ: Theory, State of the Art and Future Directions. ITW 2007: 1-5 - 2006
- [c14]Olgica Milenkovic, Emina Soljanin, Philip Whiting:
Stopping and Trapping Sets in Generalized Covering Arrays. CISS 2006: 259-264 - [c13]Stefan Laendner, Thorsten Hehn, Olgica Milenkovic, Johannes B. Huber:
When Does One Redundant Parity-Check Equation Matter? GLOBECOM 2006 - [c12]Olgica Milenkovic, Emina Soljanin, Philip Whiting:
Trapping Sets in Irregular LDPC Code Ensembles. ICC 2006: 1101-1106 - 2005
- [c11]Olgica Milenkovic, Navin Kashyap, Bane Vasic:
On DNA Computers Controlling Gene Expression Levels. CDC/ECC 2005: 1770-1775 - [c10]Olgica Milenkovic, Navin Kashyap:
DNA codes that avoid secondary structures. ISIT 2005: 288-292 - [c9]Olgica Milenkovic, Navin Kashyap:
On the Design of Codes for DNA Computing. WCC 2005: 100-119 - 2004
- [c8]Olgica Milenkovic:
Data Storage and Processing in Cells: An Information Theoretic Approach. Advances in Information Recording 2004: 105-146 - [c7]Vijay Nagarajan, Nikhil Jayakumar, Sunil P. Khatri, Olgica Milenkovic:
High-throughput VLSI implementations of iterative decoders and related code construction problems. GLOBECOM 2004: 361-365 - [c6]Vidya Kumar, Olgica Milenkovic:
On unequal error protection LDPC codes based on Plotkin-type constructions. GLOBECOM 2004: 493-497 - [c5]Olgica Milenkovic, Stefan Laendner:
Analysis of the cycle-structure of LDPC codes based on Latin squares. ICC 2004: 777-781 - [c4]Olgica Milenkovic:
Analysis of Bin models with applications in coding theory. ISIT 2004: 226 - [c3]Vidya Kumar, Olgica Milenkovic, Bane Vasic:
Structured LDPC codes over GF(22) and companion matrix based decoding. ISIT 2004: 273 - [c2]Olgica Milenkovic, Bane Vasic:
Information theory and coding problems in genetics. ITW 2004: 60-65 - 2003
- [c1]Olgica Milenkovic, Bane Vasic:
Asymptotic analysis of A* maximum-likelihood decoding with reliability reordering. ITW 2003: 316-319
Informal and Other Publications
- 2024
- [i110]Jin Sima, Changlong Wu, Olgica Milenkovic, Wojciech Szpankowski:
Online Distribution Learning with Local Private Constraints. CoRR abs/2402.00315 (2024) - [i109]Aristomenis Tsopelakos, Olgica Milenkovic:
Multiple sequences Prophet Inequality Under Observation Constraints. CoRR abs/2402.02059 (2024) - [i108]Peizhi Niu, Chao Pan, Siheng Chen, Olgica Milenkovic:
Graph Transductive Defense: a Two-Stage Defense for Graph Membership Inference Attacks. CoRR abs/2406.07917 (2024) - [i107]Jin Sima, Chao Pan, Olgica Milenkovic:
Perturbation-Resilient Trades for Dynamic Service Balancing. CoRR abs/2406.11075 (2024) - 2023
- [i106]Xujun Liu, Olgica Milenkovic, George V. Moustakides:
A combinatorial proof for the secretary problem with multiple choices. CoRR abs/2303.02361 (2023) - [i105]Jin Sima, Yun-Han Li, Ilan Shomorony, Olgica Milenkovic:
On Constant-Weight Binary B2-Sequences. CoRR abs/2303.12990 (2023) - [i104]Jin Sima, Chao Pan, Olgica Milenkovic:
Perturbation-Resilient Sets for Dynamic Service Balancing. CoRR abs/2303.12996 (2023) - [i103]Yun-Han Li, Ryan Gabrys, Jin Sima, Ilan Shomorony, Olgica Milenkovic:
Finding a Burst of Positives via Nonadaptive Semiquantitative Group Testing. CoRR abs/2304.01365 (2023) - [i102]Eli Chien, Jiong Zhang, Cho-Jui Hsieh, Jyun-Yu Jiang, Wei-Cheng Chang, Olgica Milenkovic, Hsiang-Fu Yu:
PINA: Leveraging Side Information in eXtreme Multi-label Classification via Predicted Instance Neighborhood Aggregation. CoRR abs/2305.12349 (2023) - [i101]Eli Chien, Wei-Ning Chen, Chao Pan, Pan Li, Ayfer Özgür, Olgica Milenkovic:
Differentially Private Decoupled Graph Convolutions for Multigranular Topology Protection. CoRR abs/2307.06422 (2023) - [i100]Anantham Nambiar, Chao Pan, Vishal Rana, Mahdi Cheraghchi, João Ribeiro, Sergei Maslov, Olgica Milenkovic:
Semi-Quantitative Group Testing for Efficient and Accurate qPCR Screening of Pathogens with a Wide Range of Loads. CoRR abs/2307.16352 (2023) - [i99]Saurav Prakash, Jin Sima, Chao Pan, Eli Chien, Olgica Milenkovic:
Federated Classification in Hyperbolic Spaces via Secure Aggregation of Convex Hulls. CoRR abs/2308.06895 (2023) - [i98]Olgica Milenkovic, Chao Pan:
DNA-Based Data Storage Systems: A Review of Implementations and Code Constructions. CoRR abs/2310.04694 (2023) - 2022
- [i97]Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic:
Balanced and Swap-Robust Trades for Dynamical Distributed Storage. CoRR abs/2201.09171 (2022) - [i96]Chao Pan, Eli Chien, Puoya Tabaghi, Jianhao Peng, Olgica Milenkovic:
Provably Accurate and Scalable Linear Classifiers in Hyperbolic Spaces. CoRR abs/2203.03730 (2022) - [i95]Eli Chien, Puoya Tabaghi, Olgica Milenkovic:
HyperAid: Denoising in hyperbolic spaces for tree-fitting and hierarchical clustering. CoRR abs/2205.09721 (2022) - [i94]Eli Chien, Chao Pan, Olgica Milenkovic:
Certified Graph Unlearning. CoRR abs/2206.09140 (2022) - [i93]Klara Nahrstedt, Naresh R. Shanbhag, Vikram S. Adve, Nancy M. Amato, Romit Roy Choudhury, Carl A. Gunter, Nam Sung Kim, Olgica Milenkovic, Sayan Mitra, Lav R. Varshney, Yurii Vlasov, Sarita V. Adve, Rashid Bashir, Andreas Cangellaris, James DiCarlo, Katie Driggs Campbell, Nick Feamster, Mattia Gazzola, Karrie Karahalios, Sanmi Koyejo, Paul G. Kwiat, Bo Li, Negar Mehr, Ravish Mehra, Andrew Miller, Daniela Rus, Alexander G. Schwing, Anshumali Shrivastava:
Coordinated Science Laboratory 70th Anniversary Symposium: The Future of Computing. CoRR abs/2210.08974 (2022) - [i92]Chao Pan, Jin Sima, Saurav Prakash, Vishal Rana, Olgica Milenkovic:
Machine Unlearning of Federated Clusters. CoRR abs/2210.16424 (2022) - [i91]Chao Pan, Eli Chien, Olgica Milenkovic:
Unlearning Nonlinear Graph Classifiers in the Limited Training Data Regime. CoRR abs/2211.03216 (2022) - 2021
- [i90]Xujun Liu, Olgica Milenkovic, George V. Moustakides:
Query-Based Selection of Optimal Candidates under the Mallows Model. CoRR abs/2101.07250 (2021) - [i89]Mahdi Cheraghchi, Ryan Gabrys, Olgica Milenkovic:
Semiquantitative Group Testing in at Most Two Rounds. CoRR abs/2102.04519 (2021) - [i88]Puoya Tabaghi, Eli Chien, Chao Pan, Olgica Milenkovic:
Linear Classifiers in Mixed Constant Curvature Spaces. CoRR abs/2102.10204 (2021) - [i87]Eli Chien, Chao Pan, Jianhao Peng, Olgica Milenkovic:
You are AllSet: A Multiset Function Framework for Hypergraph Neural Networks. CoRR abs/2106.13264 (2021) - [i86]George V. Moustakides, Xujun Liu, Olgica Milenkovic:
Optimal Stopping Methodology for the Secretary Problem with Random Queries. CoRR abs/2107.07513 (2021) - [i85]Eli Chien, Chao Pan, Puoya Tabaghi, Olgica Milenkovic:
Highly Scalable and Provably Accurate Classification in Poincare Balls. CoRR abs/2109.03781 (2021) - [i84]Ryan Gabrys, Srilakshmi Pattabiraman, Olgica Milenkovic:
Reconstruction of Sets of Strings from Prefix/Suffix Compositions. CoRR abs/2110.02352 (2021) - [i83]Eli Chien, Wei-Cheng Chang, Cho-Jui Hsieh, Hsiang-Fu Yu, Jiong Zhang, Olgica Milenkovic, Inderjit S. Dhillon:
Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction. CoRR abs/2111.00064 (2021) - 2020
- [i82]Abhishek Agarwal, Olgica Milenkovic, Srilakshmi Pattabiraman, João Ribeiro:
Group Testing with Runlength Constraints for Topological Molecular Storage. CoRR abs/2001.04577 (2020) - [i81]Ryan Gabrys, Srilakshmi Pattabiraman, Olgica Milenkovic:
Mass Error-Correction Codes for Polymer-Based Data Storage. CoRR abs/2001.04967 (2020) - [i80]Srilakshmi Pattabiraman, Ryan Gabrys, Olgica Milenkovic:
Coding for Polymer-Based Data Storage. CoRR abs/2003.02121 (2020) - [i79]Eli Chien, Jianhao Peng, Pan Li, Olgica Milenkovic:
Joint Adaptive Feature Smoothing and Topology Extraction via Generalized PageRank GNNs. CoRR abs/2006.07988 (2020) - [i78]Eli Chien, Olgica Milenkovic, Angelia Nedich:
Support Estimation with Sampling Artifacts and Errors. CoRR abs/2006.07999 (2020) - [i77]Hoang Dau, Dinh Thi Xinh, Han Mao Kiah, Tran Thi Luong, Olgica Milenkovic:
Repairing Reed-Solomon Codes via Subspace Polynomials. CoRR abs/2007.15253 (2020) - [i76]Ryan Gabrys, Srilakshmi Pattabiraman, Olgica Milenkovic:
Reconstructing Mixtures of Coded Strings from Prefix and Suffix Compositions. CoRR abs/2010.11116 (2020) - [i75]Xujun Liu, Olgica Milenkovic:
Finding the Second-Best Candidate under the Mallows Model. CoRR abs/2011.07666 (2020) - 2019
- [i74]Ryan Gabrys, Son Hoang Dau, Charles J. Colbourn, Olgica Milenkovic:
Set-Codes with Small Intersections and Small Discrepancies. CoRR abs/1901.05559 (2019) - [i73]I (Eli) Chien, Olgica Milenkovic:
Support Estimation via Regularized and Weighted Chebyshev Approximations. CoRR abs/1901.07506 (2019) - [i72]Pan Li, Niao He, Olgica Milenkovic:
Quadratic Decomposable Submodular Function Minimization: Theory and Practice. CoRR abs/1902.10132 (2019) - [i71]Mahdi Cheraghchi, Ryan Gabrys, Olgica Milenkovic, João Ribeiro:
Coded trace reconstruction. CoRR abs/1903.09992 (2019) - [i70]Abhishek Agarwal, Jianhao Peng, Olgica Milenkovic:
Online Convex Dictionary Learning. CoRR abs/1904.02580 (2019) - [i69]Srilakshmi Pattabiraman, Ryan Gabrys, Olgica Milenkovic:
Reconstruction and Error-Correction Codes for Polymer-Based Data Storage. CoRR abs/1904.09280 (2019) - [i68]Pan Li, I (Eli) Chien, Olgica Milenkovic:
Optimizing Generalized PageRank Methods for Seed-Expansion Community Detection. CoRR abs/1905.10881 (2019) - [i67]Yeow Meng Chee, Charles J. Colbourn, Hoang Dau, Ryan Gabrys, Alan C. H. Ling, Dylan Lusi, Olgica Milenkovic:
Access Balancing in Storage Systems by Labeling Partial Steiner Systems. CoRR abs/1906.12073 (2019) - [i66]Eli Chien, Pan Li, Olgica Milenkovic:
Landing Probabilities of Random Walks for Seed-Set Expansion in Hypergraphs. CoRR abs/1910.09040 (2019) - [i65]Chao Pan, S. M. Hossein Tabatabaei Yazdi, S. Kasra Tabatabaei, Alvaro G. Hernandez, Charles Schroeder, Olgica Milenkovic:
Image processing in DNA. CoRR abs/1910.10095 (2019) - [i64]Anuththari Gamage, Eli Chien, Jianhao Peng, Olgica Milenkovic:
Multi-MotifGAN (MMGAN): Motif-targeted Graph Generation and Prediction. CoRR abs/1911.05469 (2019) - 2018
- [i63]Pan Li, Olgica Milenkovic:
Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering. CoRR abs/1803.03833 (2018) - [i62]Pan Li, Olgica Milenkovic:
Revisiting Decomposable Submodular Function Minimization with Incidence Relations. CoRR abs/1803.03851 (2018) - [i61]Ryan Gabrys, Olgica Milenkovic:
Unique Reconstruction of Coded Strings from Multiset Substring Spectra. CoRR abs/1804.04548 (2018) - [i60]I (Eli) Chien, Chao Pan, Olgica Milenkovic:
Query K-means Clustering and the Double Dixie Cup Problem. CoRR abs/1806.05938 (2018) - [i59]Pan Li, Niao He, Olgica Milenkovic:
Quadratic Decomposable Submodular Function Minimization. CoRR abs/1806.09842 (2018) - [i58]Pan Li, Gregory J. Puleo, Olgica Milenkovic:
Motif and Hypergraph Correlation Clustering. CoRR abs/1811.02089 (2018) - [i57]Subhadeep Paul, Olgica Milenkovic, Yuguo Chen:
Higher-Order Spectral Clustering under Superimposed Stochastic Block Model. CoRR abs/1812.06515 (2018) - [i56]Khodakhast Bibak, Olgica Milenkovic:
Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes. CoRR abs/1812.09627 (2018) - 2017
- [i55]Hoang Dau, Olgica Milenkovic:
Optimal Repair Schemes for Some Families of Full-Length Reed-Solomon Codes. CoRR abs/1701.04120 (2017) - [i54]Son Hoang Dau, Iwan M. Duursma, Han Mao Kiah, Olgica Milenkovic:
Repairing Reed-Solomon Codes With Two Erasures. CoRR abs/1701.07118 (2017) - [i53]Ryan Gabrys, Olgica Milenkovic:
The Hybrid k-Deck Problem: Reconstructing Sequences from Short and Long Traces. CoRR abs/1701.08111 (2017) - [i52]Pan Li, Olgica Milenkovic:
Multiclass MinMax Rank Aggregation. CoRR abs/1701.08305 (2017) - [i51]Pan Li, Arya Mazumdar, Olgica Milenkovic:
Efficient Rank Aggregation via Lehmer Codes. CoRR abs/1701.09083 (2017) - [i50]Hoang Dau, Olgica Milenkovic:
MaxMinSum Steiner Systems for Access-Balancing in Distributed Storage. CoRR abs/1708.04986 (2017) - [i49]Pan Li, Olgica Milenkovic:
Inhomogeneous Hypergraph Clustering with Applications. CoRR abs/1709.01249 (2017) - [i48]S. M. Hossein Tabatabaei Yazdi, Han Mao Kiah, Ryan Gabrys, Olgica Milenkovic:
Mutually Uncorrelated Primers for DNA-Based Data Storage. CoRR abs/1709.05214 (2017) - 2016
- [i47]Jack P. Hou, Amin Emad, Gregory J. Puleo, Jian Ma, Olgica Milenkovic:
A new correlation clustering method for cancer mutation analysis. CoRR abs/1601.06476 (2016) - [i46]Ryan Gabrys, Eitan Yaakobi, Olgica Milenkovic:
Codes in the Damerau Distance for DNA Storage. CoRR abs/1601.06885 (2016) - [i45]Ryan Gabrys, Olgica Milenkovic:
Balanced Permutation Codes. CoRR abs/1601.06887 (2016) - [i44]S. M. Hossein Tabatabaei Yazdi, Han Mao Kiah, Olgica Milenkovic:
Weakly Mutually Uncorrelated Codes. CoRR abs/1601.08176 (2016) - [i43]Vida Ravanmehr, Sadegh Bolouki, Gregory J. Puleo, Olgica Milenkovic:
Doubly Threshold Graphs for Social Network Modeling. CoRR abs/1603.09701 (2016) - [i42]Pan Li, Son Hoang Dau, Gregory J. Puleo, Olgica Milenkovic:
Motif Clustering and Overlapping Clustering for Social Network Analysis. CoRR abs/1612.00895 (2016) - [i41]Son Hoang Dau, Iwan M. Duursma, Han Mao Kiah, Olgica Milenkovic:
Repairing Reed-Solomon Codes With Multiple Erasures. CoRR abs/1612.01361 (2016) - 2015
- [i40]Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic:
Codes for DNA Sequence Profiles. CoRR abs/1502.00517 (2015) - [i39]S. M. Hossein Tabatabaei Yazdi, Yongbo Yuan, Jian Ma, Huimin Zhao, Olgica Milenkovic:
A Rewritable, Random-Access DNA-Based Storage System. CoRR abs/1505.02199 (2015) - [i38]Ryan Gabrys, Han Mao Kiah, Olgica Milenkovic:
Asymmetric Lee Distance Codes for DNA-Based Storage. CoRR abs/1506.00740 (2015) - [i37]Gregory J. Puleo, Olgica Milenkovic:
Community Detection via Minimax Correlation Clustering and Biclustering. CoRR abs/1506.08189 (2015) - [i36]S. M. Hossein Tabatabaei Yazdi, Han Mao Kiah, Eva Ruiz Garcia, Jian Ma, Huimin Zhao, Olgica Milenkovic:
DNA-Based Storage: Trends and Methods. CoRR abs/1507.01611 (2015) - [i35]Jeffrey G. Andrews, Alexandros G. Dimakis, Lara Dolecek, Michelle Effros, Muriel Médard, Olgica Milenkovic, Andrea Montanari, Sriram Vishwanath, Edmund M. Yeh, Randall Berry, Ken R. Duffy, Soheil Feizi, Saul Kato, Manolis Kellis, Stuart Licht, Jon Sorenson, Lav R. Varshney, Haris Vikalo:
A Perspective on Future Research Directions in Information Theory. CoRR abs/1507.05941 (2015) - 2014
- [i34]Lili Su, Olgica Milenkovic:
Synchronizing Rankings via Interactive Communication. CoRR abs/1401.8022 (2014) - [i33]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
String Reconstruction from Substring Compositions. CoRR abs/1403.2439 (2014) - [i32]Salim El Rouayheb, Sreechakra Goparaju, Han Mao Kiah, Olgica Milenkovic:
Synchronizing Edits in Distributed Storage Networks. CoRR abs/1409.1551 (2014) - [i31]Amin Emad, Olgica Milenkovic:
Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing with Nonuniform Thresholds. CoRR abs/1410.4986 (2014) - [i30]Amin Emad, Olgica Milenkovic:
Poisson Group Testing: A Probabilistic Model for Boolean Compressed Sensing. CoRR abs/1410.5373 (2014) - [i29]Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic:
Codes for DNA Storage Channels. CoRR abs/1410.8837 (2014) - [i28]Gregory J. Puleo, Olgica Milenkovic:
Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds. CoRR abs/1411.0547 (2014) - 2013
- [i27]Lili Su, Farzad Farnoud, Olgica Milenkovic:
Computing Similarity Distances Between Rankings. CoRR abs/1307.4339 (2013) - [i26]Farzad Farnoud, Olgica Milenkovic:
Multipermutation Codes in the Ulam Metric for Nonvolatile Memories. CoRR abs/1312.2163 (2013) - 2012
- [i25]Farzad Farnoud, Narayana P. Santhanam, Olgica Milenkovic:
Alternating Markov Chains for Distribution Estimation in the Presence of Errors. CoRR abs/1202.0925 (2012) - [i24]Farzad Farnoud, Vitaly Skachek, Olgica Milenkovic:
Rank Modulation for Translocation Error Correction. CoRR abs/1202.0932 (2012) - [i23]Amin Emad, Olgica Milenkovic:
Semi-Quantitative Group Testing. CoRR abs/1202.2887 (2012) - [i22]Farzad Farnoud, Behrouz Touri, Olgica Milenkovic:
Nonuniform Vote Aggregation Algorithms. CoRR abs/1206.5343 (2012) - [i21]Amin Emad, Olgica Milenkovic:
Semi-Quantitative Group Testing: a General Paradigm with Applications in Genotyping. CoRR abs/1210.2484 (2012) - [i20]Farzad Farnoud, Olgica Milenkovic, Behrouz Touri:
A Novel Distance-Based Approach to Constrained Rank Aggregation. CoRR abs/1212.1471 (2012) - [i19]Behrouz Touri, Farzad Farnoud, Angelia Nedic, Olgica Milenkovic:
A General Framework for Distributed Vote Aggregation. CoRR abs/1212.2607 (2012) - 2011
- [i18]Wei Dai, Olgica Milenkovic, Hoa Vinh Pham:
Structured sublinear compressive sensing via dense belief propagation. CoRR abs/1101.3348 (2011) - [i17]Amin Emad, Olgica Milenkovic:
Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields. CoRR abs/1103.4435 (2011) - [i16]Vitaly Skachek, Olgica Milenkovic, Angelia Nedic:
Hybrid Noncoherent Network Coding. CoRR abs/1107.4581 (2011) - [i15]Amin Emad, Jun Shen, Olgica Milenkovic:
Symmetric Group Testing and Superimposed Codes. CoRR abs/1108.2996 (2011) - 2010
- [i14]Wei Dai, Ely Kerman, Olgica Milenkovic:
A Geometric Approach to Low-Rank Matrix Completion. CoRR abs/1006.2086 (2010) - [i13]Wei Dai, Olgica Milenkovic, Ely Kerman:
Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion. CoRR abs/1006.2195 (2010) - [i12]Farzad Farnoud, Olgica Milenkovic:
Sorting of Permutations by Cost-Constrained Transpositions. CoRR abs/1007.4236 (2010) - 2009
- [i11]Wei Dai, Hoa Vinh Pham, Olgica Milenkovic:
Distortion-Rate Functions for Quantized Compressive Sensing. CoRR abs/0901.0749 (2009) - [i10]Thorsten Hehn, Johannes B. Huber, Olgica Milenkovic, Stefan Laendner:
Multiple-Bases Belief-Propagation Decoding of High-Density Cyclic Codes. CoRR abs/0905.0079 (2009) - [i9]Wei Dai, Olgica Milenkovic:
SET: an algorithm for consistent matrix completion. CoRR abs/0909.2705 (2009) - 2008
- [i8]Wei Dai, Olgica Milenkovic:
Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity. CoRR abs/0803.0811 (2008) - [i7]Wei Dai, Olgica Milenkovic:
Weighted Superimposed Codes and Constrained Integer Compressed Sensing. CoRR abs/0806.2682 (2008) - 2007
- [i6]Andrew McGregor, Olgica Milenkovic:
On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes. CoRR abs/0704.2258 (2007) - [i5]Thorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber:
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes. CoRR abs/0708.0905 (2007) - [i4]Stefan Laendner, Thorsten Hehn, Olgica Milenkovic, Johannes B. Huber:
Two Methods for Reducing the Error-Floor of LDPC Codes. CoRR abs/cs/0701006 (2007) - [i3]Thorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber:
Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes. CoRR abs/cs/0702050 (2007) - 2005
- [i2]Olgica Milenkovic, Navin Kashyap, David Leyba:
Shortened Array Codes of Large Girth. CoRR abs/cs/0504016 (2005) - [i1]Olgica Milenkovic, Navin Kashyap:
DNA Codes that Avoid Secondary Structures. CoRR abs/cs/0508055 (2005)
Coauthor Index
Eli Chien
aka: I (Eli) Chien
aka: I (Eli) Chien
Son Hoang Dau
aka: Hoang Dau
aka: Hoang Dau
Farzad Farnoud
aka: Farzad Farnoud Hassanzadeh
aka: Farzad Farnoud Hassanzadeh
Stefan Ländner
aka: Stefan Laendner
aka: Stefan Laendner
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-21 23:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
