Invited Papers


S. Aviran and O. Milenkovic, ISIT 2012 Tutorial on Molecular Biology

O. Milenkovic, “Information-Theoretic Methods for Reverse Engineering of Gene Regulatory Networks,” (Tutorial), GENSIPS’2009, May 2009.

Invited Conference Papers

66. O. Milenkovic, “TBD,” Algebraic Geometry for Coding Theory and CryptographyWorkshop, IPAM,

65. O. Milenkovic, “Correlation Clustering and Rank Aggregation Revisited,” Information Theory
Workshop (ITW), Jeju, Korea, 2015.

64. O. Milenkovic (with G. Puleo, A. Emad, and J. Ma), “Functional Correlation Clustering,” Simons
Institute, Workshop on Big Data, March 2015.

63. O. Milenkovic (with G. Puleo, H. Kiah, J. Ma, H. Zhao, Y. Yian), “DNA Based Storage,” Simons
Institute, Workshop on Coding Theory, February 2015.

62. G. Puleo and O. Milenkovic, “Correlation Clustering, Coping with Big Data Workshop, University
College London, January 2015.

61. R. Gabrys, H. Kiah, and O. Milenkovic, “Delsarte Bounds for the Asymmetric Lee Distance,” ITW, Jerusalem,
April 2014.

60. O. Milenkovic, “Rank Aggregation and Correlation Clustering,” Simons Institute Workshop on
Machine Learning, March 2015.

59. O. Milenkovic, “Coding for DNA-Based Storage,” Simons Institute Workshop on Coding Theory,
February 2015.

58. M. Kim, F. Farnoud, and O. Milenkovic, “Hybrid Rank Aggregation for Gene Prioritization,” Invited,
Asilomar Conference, 2014.

57. L. Su, O. Milenkovic, “Synchronizing Rankings over Noisy Channels,” Invited, Asilomar Conference,

56. S. El Rouayheb, S. Goparaju, H. M. Kiah and O. Milenkovic, “Efficient Synchronization of Files in
Distributed Storage Systems,” Invited, Asilomar Conference, 2014.

52. L. Su and O. Milenkovic, “Synchronizing Rankings via iterative Communication,” International Symposium on Communications, Control, and Signal Processing, Athens, 2014.

51. A. Emad and O. Milenkovic, “Semi-quantitative group testing,” International Zurich Seminar, Switzerland, February 2014.

50. O. Milenkovic, “Permutation Codes in the Ulam Metric,” Trends in Coding Theory, Switzerland, November 2012.

49. O. Milenkovic, “Iterative Algorithms for Vote Aggregation,” (Plenary talk), International Symposium on Turbo Codes and Iterative Information Processing, Sweden, 2012.

48. F. Farnoud, B. Touri, and O. Milenkovic, “Algorithmic Solutions to Rank Aggregation,” SPCOM, Bangalore, India, 2012.

47. A. Emad and O. Milenkovic, “Semi-quantitative Group Testing,” Group Testing Designs, Algorithms, and Applications in BiologyWorkshop, IMA Center, 2012.

46. F. Farnoud, V. Skachek, and O. Milenkovic, “Rank Modulation Codes for Translocation Errors”, ITA 2012.

45. F. Farnoud, Behrouz Touri, and O. Milenkovic, “TBA” SPCOM 2012, India.

44. M. Deng, A. Emad and O. Milenkovic, “Discovering Gene Network Topology via Compressive Sensing,” SPS Workshop, Ann Arbor, August 2012.

43. V. Skachek, O. Milenkovic, and A. Nedich, “Hybrid Network Coding,” , AMS Meeting, Boston, January 2012.

42. A. Emad and O. Milenkovic, “Quantized Group Testing,” AMS Meeting, Boston, January 2012.

41. A. Emad and O. Milenkovic, “Group Testing and Compressive Sensing,” , SPSWorkshop, Campinas, Brazil, 2011.

40. F. Farnoud and O. Milenkovic,“Polarization Coding for Parallel Channels,” ITAWorkshop, San Diego, February 2011.

39. J. Acharya, H. Das, O. Milenkovic, A. Orlitsky, and S. Pan,“Reconstructing Sequences from Traces,” Algebraic Geometry with a view towards applications Workshop (Solving Polynomial Equations), the Mittag-Leffler Institute, Stockholm, February 2011.

38. O. Milenkovic, Search MethodologiesWorkshop, Bielefeld Center for Interdisciplinary Research, October 2010.

37. F. Farnoud, Olgica Milenkovic, and Navin Kashyap, “A Graphical Model for Computing the Minimum Cost Transposition Distance,” Proceedings of the ITW 2010, Dublin, Ireland, September 2010.

36. V. P. Hoa, W. Dai, and O. Milenkovic, Performance bounds of list colluder identification algorithms via compressive sensing, ITA Workshop, San Diego, 2010.

35. W. Dai and O. Milenkovic, Consistent matrix completion and optimization on manifolds, ITAWorkshop, San Diego, 2010.

34. O. Milenkovic, Approximate inference in presence of experimental errors,Workshop on Genomic Error Correction, Cergy-Pontoise, France, 2009.

33. O. Milenkovic, Compressive Sensing in Neuroscience and Molecular Biology, Engineering Principles in Biological Systems, Welcome Trust Conference Center, Hinxton, Cambridge, UK, October 2009.

32. O. Milenkovic, Information-Theoretic Methods for Reverse Engineering of the Topology and Dynamics of Gene Regulatory Networks, Algebraic Methods in Systems Biology and Statistics Transition Workshop, Statistical and Applied Mathematical Sciences Institute (SAMSI), Duke University, NC 2009.

31. O. Milenkovic, TBA, Permanents and Modeling Probability Distributions, American Institute of Mathematics (AIM), Palo Alto, CA September 2009.

30. O. Milenkovic, Sub-linear compressive sensing and support weight enumerators of codes: a matroid theory approach, Applications of Matroid Theory and Combinatorial Optimization to Information and Coding Theory Workshop, Banff International Research Station for Mathematical Innovation and Discovery (BIRS), August 2009.

29. O. Milenkovic, Iterative algorithms for low-rank matrix completion, Dagstuhl Workshop on Search Methodologies, July 2009, Germany.

28. N. P. Santhanam, J. Dingel, and O. Milenkovic, Information Theoretic Modeling of Gene Interaction, ITW’2009, Volos, Greece.

27. O. Milenkovic, “Information-Theoretic Methods for Reverse Engineering of Gene Regulatory Networks,” (Tutorial), GENSIPS’2009, May 2009.

26. W. Dai and O. Milenkovic, Weighted Superimposed Codes and Constrained Integer Compressed Sensing, DIMACS/DyDAn Workshop on Streaming, Coding, and Compressive Sensing: Unifying Theory and Common Applications to Sparse Signal/Data Analysis and Processing, March 2009.

25. F. Farnoud, O. Milenkovic, N. P. Santhanam, “Unraveling Sticky Channels,” ITAWorkshop, 2009 San Diego, CA February, 2009.

24. W. Dai, V. Pham Hoa, and O. Milenkovic, “Sub-linear Compressive Sensing Reconstruction via List Belief-Propagation Decoding,” ITA Workshop, 2009 San Diego, CA February 2009.

23. W. Dai, H. Vinh Pham, and O. Milenkovic, “Distortion-Rate Functions for Quantized Compressive Sensing,” ITA Workshop, 2009 San Diego, CA February 2009.

22. H. Das, O. Milenkovic, and A. Orlitsky, “Order from Disorder,” ITA Workshop Open Problem Session, 2009 San Diego, CA, February 2009.

21. O. Milenkovic, ”Sparse Information Processing in Life Sciences,” Beyond Shannon’s Information Theory Workshop Venice, Italy December 2008.

20. W. Dai and O. Milenkovic, “Low Complexity Comressive Sensing Reconstruction Algorithms,” Special Session “Algorithmic Probability and Combinatorics,” American Mathematical Society (AMS) Meeting, October 4-5, Vancouver, Canada.

19. O. Milenkovic, “Group Testing for DNA Microarray Designs,” Schloss Dagstuhl Seminar on Group Testing in the Life Sciences, July 2008.

18. J. Dingel, O. Milenkovic, and A. Ashikhmin, “List Decoding of Reed-Muller Codes with Applications in Bioinformatics,” Mathematical Theory of Networks and Systems, July 2008.

17. J. Dingel and O. Milenkovic, ”Reverse Engineering of Gene Regulatory Networks via Iterative List Decoding,” Proceedings of the ITW’08, Porto, Portugal, 2008.

16. W. Dai, N. Kiyavash, and O. Milenkovic, “Spherical Codes for Sparse Digital Fingerprinting,” Spring Central Meeting of the American Mathematical Society, AMS’08, Special Session on Algebraic Aspects of Coding Theory, Bloomington, IN, April 2008.

15. W. Dai and O. Milenkovic, “Constrained Compressed Sensing via Superimposed Coding,” presented at the Third Information Theory and Applications Workshop, ITA’08, San Diego, CA, 2008.

14. J. Dingel and O. Milenkovic, ”Reverse Engineering of Gene Regulatory Networks via Iterative List Decoding,” presented at the Third Information Theory and ApplicationsWorksho, ITA’08, San Diego, CA, 2008.

13. W. Dai and O. Milenkovic, “Coding-Theoretic Problems in Genetics: Superimposed Codes for Compressed Sensing DNA Microarrays,” OberwolfachWorkshop on Coding Theory, December 2007.

12. O. Milenkovic, E. Soljanin, and P. Whiting, “Asymptotic Enumeration of Trapping Sets in Random Tanner Graph Ensembles,” Regional American Mathematical Society Meeting, Special Session on Algorithmic Probability and Combinatorics, AMS’07, Chicago, October 2007.

11. O. Milenkovic, R. Baraniuk, T. Simunic-Rosing, “Compressed Sensing Meets Bioinformatics: A New DNA Microarray Architecture,” Information Theory and Applications Workshop, San Diego, January, 2007.

10. O. Milenkovic, “On the Generalized Reversal Distance,” American Mathematical Society Meeting, New Orleans, January 2007.

9. O. Milenkovic and E. Soljanin, “Enumerating RNA Secondary Structures: A Constrained Coding Approach,” Asilomar Conference on Signals, Systems and Communication, October 2006.

8. O. Milenkovic, “Enumerating RNA Motifs,” Allerton Conference on Communication, Control and Computing, September 2006.

7. O. Milenkovic, “Error and Quality Control Coding for DNA Microarrays,” Information Theory Workshop organized as part of the Inauguration Ceremony of the Jacobs School of Engineering Center for Information Theory and its Applications, San Diego, February 2006.

6. O. Milenkovic, “Constrained and Error-Control Coding for DNA Computers,”Workshop on Statistical Physics and Coding, Santa Fe, January 2005 (joint work with N. Kashyap).

5. O. Milenkovic, “Problems in Combinatorial and Number Theory Arising in the Construction of LDPC Codes,”  American Mathematical Society Meeting, Evanston, Illinois, October 2004.

4. O. Milenkovic and B. Vasic, “How DNA Stores Information and Efficient DNA Storage,” DIMACS Workshop on Theoretical Advances In Information Recording, March 2004.

3. O. Milenkovic and K. Compton, “Average Case Analysis of Gosper’s Algorithm,” American Mathematical Society Meeting, Bloomington, Indiana, April 2003.

2. K. Compton and O. Milenkovic, “Probabilistic transforms in the analysis of algorithms,” Eight Seminar on Analysis of Algorithms, Strobl, Austria, June 2002.

1. K. Compton and O. Milenkovic, “An Analysis Inspired by Gosper’s Algorithm,” Seventh Seminar on Analysis of Algorithms, Tatihou, France, July 2001.

In Archive