☰

Olgica Milenkovic, Ph.D. - Publications

Affiliations: 
2002 University of Michigan, Ann Arbor, Ann Arbor, MI 
Area:
Electronics and Electrical Engineering, Computer Science, System Science Engineering
Tree Info Similar researchers PubMed Report error

88 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Yazdi SMHT, Gabrys R, Milenkovic O. Author Correction: Portable and Error-Free DNA-Based Data Storage. Scientific Reports. 10: 7026. PMID 32321929 DOI: 10.1038/S41598-020-60080-9  0.308
2020 Tabatabaei SK, Wang B, Athreya NBM, Enghiad B, Hernandez AG, Fields CJ, Leburton JP, Soloveichik D, Zhao H, Milenkovic O. DNA punch cards for storing data on native DNA sequences via enzymatic nicking. Nature Communications. 11: 1742. PMID 32269230 DOI: 10.1038/S41467-020-15588-Z  0.309
2020 Gabrys R, Dau HS, Colbourn CJ, Milenkovic O. Set-Codes with Small Intersections and Small Discrepancies Siam Journal On Discrete Mathematics. 34: 1148-1171. DOI: 10.1137/19M1241106  0.372
2020 Cheraghchi M, Gabrys R, Milenkovic O, Ribeiro J. Coded Trace Reconstruction Ieee Transactions On Information Theory. 1-1. DOI: 10.1109/Tit.2020.2996377  0.395
2020 Chee YM, Colbourn CJ, Dau H, Gabrys R, Ling ACH, Lusi D, Milenkovic O. Access balancing in storage systems by labeling partial Steiner systems Designs, Codes and Cryptography. 1-16. DOI: 10.1007/S10623-020-00786-Z  0.322
2019 Gabrys R, Milenkovic O. Unique Reconstruction of Coded Strings From Multiset Substring Spectra Ieee Transactions On Information Theory. 65: 7682-7696. DOI: 10.1109/Tit.2019.2935973  0.457
2019 Bibak K, Milenkovic O. Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes Ieee Transactions On Communications. 67: 1809-1816. DOI: 10.1109/Tcomm.2018.2886354  0.472
2018 Dau H, Milenkovic O. MaxMinSum Steiner Systems for Access Balancing in Distributed Storage Siam Journal On Discrete Mathematics. 32: 1644-1671. DOI: 10.1137/17M1143964  0.433
2018 Dau H, Duursma IM, Kiah HM, Milenkovic O. Repairing Reed-Solomon Codes With Multiple Erasures Ieee Transactions On Information Theory. 64: 6567-6582. DOI: 10.1109/Tit.2018.2827942  0.43
2018 Puleo GJ, Milenkovic O. Correlation Clustering and Biclustering With Locally Bounded Errors Ieee Transactions On Information Theory. 64: 4105-4119. DOI: 10.1109/Tit.2018.2819696  0.329
2018 Tabatabaei Yazdi SMH, Kiah HM, Gabrys R, Milenkovic O. Mutually Uncorrelated Primers for DNA-Based Data Storage Ieee Transactions On Information Theory. 64: 6283-6296. DOI: 10.1109/Tit.2018.2792488  0.414
2018 Gabrys R, Yaakobi E, Milenkovic O. Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction Ieee Transactions On Information Theory. 64: 2550-2570. DOI: 10.1109/Tit.2017.2778143  0.463
2018 Ravanmehr V, Puleo GJ, Bolouki S, Milenković O. Paired threshold graphs Discrete Applied Mathematics. 250: 291-308. DOI: 10.1016/J.Dam.2018.05.008  0.307
2017 Dau H, Milenkovic O. Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations. Ieee/Acm Transactions On Networking : a Joint Publication of the Ieee Communications Society, the Ieee Computer Society, and the Acm With Its Special Interest Group On Data Communication. 25: 3219-3234. PMID 30473608 DOI: 10.1109/Tnet.2017.2728638  0.313
2017 Ravanmehr V, Kim M, Wang Z, Milenkovic O. ChIPWig: A Random Access-Enabling Lossless and Lossy Compression Method for ChIP-seq Data. Bioinformatics (Oxford, England). PMID 29087447 DOI: 10.1093/Bioinformatics/Btx685  0.343
2017 Yazdi SMHT, Gabrys R, Milenkovic O. Portable and Error-Free DNA-Based Data Storage. Scientific Reports. 7: 5011. PMID 28694453 DOI: 10.1038/S41598-017-05188-1  0.365
2017 Gabrys R, Kiah HM, Milenkovic O. Asymmetric Lee Distance Codes for DNA-Based Storage Ieee Transactions On Information Theory. 63: 4982-4995. DOI: 10.1109/Tit.2017.2700847  0.481
2017 Farnoud (Hassanzadeh) F, Milenkovic O, Puleo GJ, Su L. Computing similarity distances between rankings Discrete Applied Mathematics. 232: 157-175. DOI: 10.1016/J.Dam.2017.07.038  0.323
2016 Laure C, Karamessini D, Milenkovic O, Charles L, Lutz JF. Coding in 2D: Using Intentional Dispersity to Enhance the Information Capacity of Sequence-Coded Polymer Barcodes. Angewandte Chemie (International Ed. in English). PMID 27484303 DOI: 10.1002/Anie.201605279  0.395
2016 Emad A, Milenkovic O. Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing with Nonuniform Thresholds Ieee Transactions On Information Theory. 62: 1674-1687. DOI: 10.1109/Tit.2016.2524002  0.443
2015 Wang Z, Weissman T, Milenkovic O. smallWig: Parallel Compression of RNA-seq WIG Files. Bioinformatics (Oxford, England). PMID 26424856 DOI: 10.1093/Bioinformatics/Btv561  0.381
2015 Tabatabaei Yazdi SM, Yuan Y, Ma J, Zhao H, Milenkovic O. A Rewritable, Random-Access DNA-Based Storage System. Scientific Reports. 5: 14138. PMID 26382652 DOI: 10.1038/Srep14138  0.363
2015 Acharya J, Das H, Milenkovic O, Orlitsky A, Pan S. String reconstruction from substring compositions Siam Journal On Discrete Mathematics. 29: 1340-1371. DOI: 10.1137/140962486  0.313
2015 Emad A, Milenkovic O. Poisson Group Testing: A Probabilistic Model for Boolean Compressed Sensing Ieee Transactions On Signal Processing. 63: 4396-4410. DOI: 10.1109/Tsp.2015.2446433  0.318
2015 El Rouayheb S, Goparaju S, Kiah HM, Milenkovic O. Synchronization and Deduplication in Coded Distributed Storage Networks Ieee/Acm Transactions On Networking. DOI: 10.1109/Tnet.2015.2502274  0.429
2015 Yazdi SMHT, Kiah HM, Garcia-Ruiz E, Ma J, Zhao H, Milenkovic O. DNA-Based Storage: Trends and Methods Ieee Transactions On Molecular, Biological and Multi-Scale Communications. 1: 230-248. DOI: 10.1109/Tmbmc.2016.2537305  0.373
2015 Kiah HM, Puleo GJ, Milenkovic O. Codes for DNA sequence profiles Ieee International Symposium On Information Theory - Proceedings. 2015: 814-818. DOI: 10.1109/Tit.2016.2555321  0.394
2015 Gabrys R, Kiah HM, Milenkovic O. Asymmetric Lee distance codes: New bounds and constructions 2015 Ieee Information Theory Workshop, Itw 2015. DOI: 10.1109/ITW.2015.7133171  0.357
2015 Gabrys R, Kiah HM, Milenkovic O. Asymmetric Lee distance codes for DNA-based storage Ieee International Symposium On Information Theory - Proceedings. 2015: 909-913. DOI: 10.1109/ISIT.2015.7282587  0.363
2014 Emad A, Milenkovic O. CaSPIAN: a causal compressive sensing algorithm for discovering directed interactions in gene networks. Plos One. 9: e90781. PMID 24622336 DOI: 10.1371/Journal.Pone.0090781  0.304
2014 Farnoud Hassanzadeh F, Milenkovic O. An axiomatic approach to constructing distances for rank comparison and aggregation Ieee Transactions On Information Theory. 60: 6417-6439. DOI: 10.1109/Tit.2014.2345760  0.315
2014 Emad A, Milenkovic O. Semiquantitative group testing Ieee Transactions On Information Theory. 60: 4614-4636. DOI: 10.1109/TIT.2014.2327630  0.332
2014 Farnoud Hassanzadeh F, Milenkovic O. Multipermutation codes in the Ulam metric for nonvolatile memories Ieee Journal On Selected Areas in Communications. 32: 919-932. DOI: 10.1109/Jsac.2014.140512  0.438
2014 Farnoud F, Milenkovic O. Multipermutation codes in the Ulam metric Ieee International Symposium On Information Theory - Proceedings. 2754-2758. DOI: 10.1109/ISIT.2014.6875335  0.372
2013 Farnoud FH, Skachek V, Milenkovic O. Error-correction in flash memories via codes in the ulam metric Ieee Transactions On Information Theory. 59: 3003-3020. DOI: 10.1109/Tit.2013.2239700  0.456
2012 Emad A, Milenkovic O. Semi-quantitative group testing Ieee International Symposium On Information Theory - Proceedings. 1847-1851. DOI: 10.1109/Tit.2014.2327630  0.42
2012 Skachek V, Milenkovic O, Nedić A. Hybrid noncoherent network coding 2012 International Symposium On Network Coding, Netcod 2012. 7-12. DOI: 10.1109/Tit.2013.2243899  0.45
2012 Dai W, Kerman E, Milenkovic O. A geometric approach to low-rank matrix completion Ieee Transactions On Information Theory. 58: 237-247. DOI: 10.1109/Tit.2011.2171521  0.31
2012 Farnoud F, Skachek V, Milenkovic O. Rank modulation for translocation error correction Ieee International Symposium On Information Theory - Proceedings. 2988-2992. DOI: 10.1109/ISIT.2012.6284108  0.356
2012 Dai W, Milenkovic O, Vin Pham H. Structured sublinear compressive sensing via belief propagation Physical Communication. 5: 76-90. DOI: 10.1016/J.Phycom.2011.10.006  0.388
2011 Dai W, Milenkovic O, Kerman E. Subspace evolution and transfer (SET) for low-rank Matrix completion Ieee Transactions On Signal Processing. 59: 3120-3132. DOI: 10.1109/Tsp.2011.2144977  0.316
2011 Dai W, Milenkovic O. Information theoretical and algorithmic approaches to quantized compressive sensing Ieee Transactions On Communications. 59: 1857-1866. DOI: 10.1109/Tcomm.2011.051711.100204  0.422
2010 McGregor A, Milenkovic O. On the Hardness of Approximating Stopping and Trapping Sets Ieee Transactions On Information Theory. 56: 1640-1650. DOI: 10.1109/Tit.2010.2040941  0.462
2010 Hehn T, Huber J, Milenkovic O, Laendner S. Multiple-bases belief-propagation decoding of high-density cyclic codes Ieee Transactions On Communications. 58: 1-8. DOI: 10.1109/Tcomm.2010.01.070468  0.481
2010 Laendner S, Milenkovic O, Huber JB. Characterization of small trapping sets in LDPC codes from Steiner triple systems 6th International Symposium On Turbo Codes and Iterative Information Processing, Istc 2010. 93-97. DOI: 10.1109/ISTC.2010.5613812  0.368
2009 Dingel J, Milenkovic O. List-decoding methods for inferring polynomials in finite dynamical gene network models. Bioinformatics (Oxford, England). 25: 1686-93. PMID 19401400 DOI: 10.1093/Bioinformatics/Btp281  0.304
2009 Dai W, Milenkovic O. Weighted superimposed codes and constrained integer compressed sensing Ieee Transactions On Information Theory. 55: 2215-2229. DOI: 10.1109/Tit.2009.2016024  0.468
2009 Dai W, Milenkovic O. Subspace pursuit for compressive sensing signal reconstruction Ieee Transactions On Information Theory. 55: 2230-2249. DOI: 10.1109/Tit.2009.2016006  0.333
2009 Laendner S, Hehn T, Milenkovic O, Huber JB. The trapping redundancy of linear block codes Ieee Transactions On Information Theory. 55: 53-63. DOI: 10.1109/Tit.2008.2008134  0.47
2008 Dai W, Milenkovic O. Iterative subspace pursuit decoding of weighted Euclidean superimposed codes 2008 5th International Symposium On Turbo Codes and Related Topics, Turbocoding. 402-407. DOI: 10.1109/TURBOCODING.2008.4658733  0.334
2008 Hehn T, Milenkovic O, Laendner S, Huber JB. Permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes Ieee Transactions On Information Theory. 54: 5308-5331. DOI: 10.1109/Tit.2008.2006456  0.484
2008 Dai W, Milenkovic O. Weighted Euclidean superimposed codes for integer compressed sensing 2008 Ieee Information Theory Workshop, Itw. 124-128. DOI: 10.1109/ITW.2008.4578635  0.37
2008 Dingel J, Milenkovic O. Coding-theoretic methods for reverse engineering of gene regulatory networks 2008 Ieee Information Theory Workshop, Itw. 114-118. DOI: 10.1109/ITW.2008.4578633  0.301
2008 Dingel J, Milenkovic O. A list-decoding approach for inferring the dynamics of gene regulatory networks Ieee International Symposium On Information Theory - Proceedings. 2282-2286. DOI: 10.1109/ISIT.2008.4595397  0.308
2008 Huang D, Milenkovic O. Superimposed coding for iterative detection of DNA microarray spot failures Gensips'08 - 6th Ieee International Workshop On Genomic Signal Processing and Statistics. DOI: 10.1109/GENSIPS.2008.4555682  0.307
2008 Dai W, Milenkovic O. Sparse weighted Euclidean superimposed coding for integer compressed sensing Ciss 2008, the 42nd Annual Conference On Information Sciences and Systems. 480-485. DOI: 10.1109/CISS.2008.4558574  0.403
2008 Dai W, Milenkovic O. Sparse weighted Euclidean superimposed coding for integer compressed sensing Ciss 2008, the 42nd Annual Conference On Information Sciences and Systems. 470-475. DOI: 10.1109/CISS.2008.4558572  0.403
2007 Milenkovic O, Soljanin E, Whiting P. Asymptotic spectra of trapping sets in regular and irregular LDPC code ensembles Ieee Transactions On Information Theory. 53: 39-55. DOI: 10.1109/Tit.2006.887060  0.469
2007 Laendner S, Milenkovic O. LDPC codes based on latin squares: Cycle structure, stopping set, and trapping set analysis Ieee Transactions On Communications. 55: 303-312. DOI: 10.1109/Tcomm.2006.888633  0.479
2007 McGregor A, Milenkovic O. On the hardness of approximating stopping and trapping sets in LDPC codes 2007 Ieee Information Theory Workshop, Itw 2007, Proceedings. 248-253. DOI: 10.1109/ITW.2007.4313082  0.346
2007 Hehn T, Huber JB, Laendner S, Milenkovic O. Multiple-bases Belief-Propagation for decoding of short block codes Ieee International Symposium On Information Theory - Proceedings. 311-315. DOI: 10.1109/ISIT.2007.4557244  0.371
2007 Hehn T, Milenkovic O, Laendner S, Huber JB. Permutation decoding and the stopping redundancy hierarchy of linear block codes Ieee International Symposium On Information Theory - Proceedings. 2926-2930. DOI: 10.1109/ISIT.2007.4557193  0.384
2007 Nagarajan V, Laendner S, Milenkovic O, Jayakumar N, Khatri SP. High-throughput VLSI implementations of iterative decoders and related code construction problems Journal of Vlsi Signal Processing Systems For Signal, Image, and Video Technology. 49: 185-206. DOI: 10.1007/s11265-007-0054-9  0.356
2006 Milenkovic O, Kashyap N, Leyba D. Shortened array codes of large girth Ieee Transactions On Information Theory. 52: 3707-3722. DOI: 10.1109/Tit.2006.878179  0.453
2006 Kumar V, Milenkovic O. On unequal error protection LDPC codes based on plotkin-type constructions Ieee Transactions On Communications. 54: 994-1005. DOI: 10.1109/Tcomm.2006.876842  0.457
2006 Milenkovic O, Soljanin E, Whiting P. Trapping sets in irregular LDPC code ensembles Ieee International Conference On Communications. 3: 1101-1106. DOI: 10.1109/ICC.2006.254894  0.379
2006 Laendner S, Hehn T, Milenkovic O, Huber JB. When does one redundant parity-check equation matter? Globecom - Ieee Global Telecommunications Conference. DOI: 10.1109/GLOCOM.2006.44  0.333
2006 Hehn T, Laendner S, Milenkovic O, Huber JB. The stopping redundancy hierarchy of cyclic codes 44th Annual Allerton Conference On Communication, Control, and Computing 2006. 3: 1271-1280.  0.375
2006 Milenkovic O, Kashyap N. On the design of codes for DNA computing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3969: 100-119.  0.306
2005 Ländner S, Milenkovic O. Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes 2005 International Conference On Wireless Networks, Communications and Mobile Computing. 1: 630-635. DOI: 10.1109/WIRLES.2005.1549481  0.411
2005 Kumar V, Milenkovic O. On graphical representations of algebraic codes suitable for iterative decoding Ieee Communications Letters. 9: 729-731. DOI: 10.1109/Lcomm.2005.1496597  0.476
2005 Djordjevic IB, Milenkovic O, Vasic B. Generalized low-density parity-check codes for optical communication systems Journal of Lightwave Technology. 23: 1939-1946. DOI: 10.1109/Jlt.2005.846892  0.423
2005 Milenkovic O. Support weight enumerators and coset weight distributions of isodual codes Designs, Codes, and Cryptography. 35: 81-109. DOI: 10.1007/S10623-003-6152-1  0.389
2005 Milenkovic O, Compton KJ. Average case analysis of Gosper's algorithm for a class of urn model inputs Algorithmica (New York). 43: 211-244. DOI: 10.1007/S00453-005-1173-Y  0.546
2005 Milenkovic O, Soljanin E, Whiting P. Asymptotic distributions of trapping sets in random regular LDPC code ensembles 43rd Annual Allerton Conference On Communication, Control and Computing 2005. 4: 1737-1746.  0.382
2004 Vasic B, Milenkovic O. Combinatorial constructions of low-density parity-check codes for iterative decoding Ieee Transactions On Information Theory. 50: 1156-1176. DOI: 10.1109/TIT.2004.828066  0.371
2004 Milenkovic O, Djordjevic IB, Vasic B. Block-circulant low-density parity-check codes for optical communication systems Ieee Journal On Selected Topics in Quantum Electronics. 10: 294-299. DOI: 10.1109/Jstqe.2004.827832  0.435
2004 Milenkovic O, Compton KJ. Probabilistic transforms for combinatorial urn models Combinatorics Probability and Computing. 13: 645-675. DOI: 10.1017/S0963548304006285  0.518
2004 Kumar V, Milenkovic O, Vasic B. Structured LDPC codes over GF(2m) and companion matrix based decoding Ieee International Symposium On Information Theory - Proceedings. 273.  0.357
2004 Milenkovic O, Vasic B. Information theory and coding problems in genetics 2004 Ieee Information Theory Workshop - Proceedings, Itw. 60-65.  0.3
2004 Milenkovic O, Laendner S. Analysis of the cycle-structure of LDPC codes based on Latin squares Ieee International Conference On Communications. 2: 777-781.  0.367
2003 Milenkovic O, Coffey ST, Compton KJ. The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes Ieee Transactions On Information Theory. 49: 740-746. DOI: 10.1109/Tit.2002.808115  0.358
2002 Milenkovic O, Compton K. A method for reducing the number of unknown coefficients of generalized Hamming weight enumerators Ieee International Symposium On Information Theory - Proceedings. 234.  0.563
2001 Milenkovic O. On the generalized Hamming weight enumerators and coset weight distributions of even isodual codes Ieee International Symposium On Information Theory - Proceedings. 62.  0.301
2000 Milenkovic O, Vasic B. Permutation (d, fc) codes: efficient enumerative coding and phrase length distribution shaping Ieee Transactions On Information Theory. 46: 2671-2675. DOI: 10.1109/18.887880  0.445
1998 Vasic B, McLaughlin S, Milenkovic O. Shannon capacity of M-ary redundant multitrack runlength limited codes Ieee Transactions On Information Theory. 44: 766-774. DOI: 10.1109/18.661518  0.346
1997 Vasić B, Milenković O, McLaughlin S. Power spectral density of multitrack (0,G/I) codes Electronics Letters. 33: 784. DOI: 10.1049/El:19970519  0.309
1996 Vasić B, Milenković O, McLaughlin S. Scrambling for nonequiprobable signalling Electronics Letters. 32: 1551. DOI: 10.1049/El:19961021  0.305
Show low-probability matches.