Invited Talks

Universities/Labs

O. Milenkovic, TBA, Tutorial, North American School on Information Theory, 2018.

O. Milenkovic, TBA, LAWC (Latin American Week on Coding and Information), July 2018.

O. Milenkovic, TBA, SPAWC, Keynote, June 2018.

O. Milenkovic, TBA, Tutorial, European School on Information Theory, May 2018.

O. Milenkovic, Access-Balanced Distributed Storage Codes via MaxMin Sum Steiner Triple Systems, Munich Workshop on Coding and Applications, 2017.

O. Milenkovic, Portable and Random-Access DNA-Based Storage Systems, The 7th Annual Henry Taub TCE Conference on Coding for Storage and Information Systems, Technion, 2017 (Taub distin- guished lecture).

O. Milenkovic, “DNA-Based Data Storage,” IST Young Scientist Symposium, 2017 (Keynote).

O. Milenkovic,“DNA-BasedDataStorage,”TCEConferenceonCodingforStorageandInformation Systems, 2017 (Keynote).

O. Milenkovic, Coding for DNA-Based Data Storage, Rutgers University, 2016.

O. Milenkovic, Community Detection via Correlation and Overlapping Correlation Clustering, EPFL,
2016.

O. Milenkovic, Community Detection via Correlation and Overlapping Correlation Clustering, Cergy Pontoise, 2016.

O. Milenkovic, Motif Correlation Clustering, NEXUS Central Workshop, Institute Henri Poincare, 2016.

O. Milenkovic, Coding for DNA-Based Storage, IARPA/SRC Workshop on DNA-based Massive In- formation Storage, 2016 (plenary lecture).

Bell Labs Shannon Centennial, 2016

LIDS MIT Student Conference, Plenary Speaker, 2016

Coding Techniques for Emerging DNA-Based Storage Systems, Harvard University, November 2015

Coding Techniques for Emerging DNA-Based Storage Systems, Caltech Communication Seminar, November 2015

Functional Correlation Clustering with Applications to Cancer Genomics, Boston University, August 2015

Functional Correlation Clustering with Applications to Cancer Genomics, Distinguished Lecturer Seminar, University of Pennsylvania, March 2015

Random Access, Rewritable DNA-Based Storage, University of Minnesota, January 2015

Novel Distance Measures for Vote Aggregation, University of Maryland, October 2012

A Mathematical History of Democracy, Georgia Tech, May 2012

Distance measures for permutations with applications in rank aggregation, University of Texas, Austin, December 2011

Distance measures for permutations, Rutgers University, November, 2011

Low-rank completion with applications in Bioinformatics, Telecom, Paris, July 2011

Low-rank completion with applications in Bioinformatics, University of Maryland, April 2011

Low-rank completion with applications in Bioinformatics and Imaging, Johns Hopkins, March 2011

Sorting Permutations by Cost-Constrained Compositions, Harvard, March 2011

Sorting Permutations by Cost-Constrained Compositions, MIT, November 2010

Reconstructing Strings using Multiset Traces, UCLA, October 2010

Low-Rank Matrix Completion for Inferring Protein-Protein Interactions, King’s College London, September 2010

Sorting by Cost-Constrained Transpositions, University of Bristol, UK, August, 2010

Sorting by Cost-Constrained Transpositions, University of California, San Diego, July 2010

Low-Rank Matrix Completion for Inferring Protein-Protein Interactions, University of California, Berkeley, April, 2010

Engineering Principles in Biological Systems Workshop, Welcome Trust Institute, Hinxton, UK, 2010

Low-Rank Matrix Completion, EPFL, July 2009

On the interplay between coding theory and compressed sensing, Applied Mathematics Seminar, Princeton University, March 2009

Good-Turing Estimation in the Presence of Repetition Errors, Mathematical Biology Seminar, UIUC, February 2009

Rate-Distortion Functions for Compressive Sensing, DSP Seminar, February 2009

On the Interplay between Coding Theory and Compressive Sensing, University College Cork, Electrical Engineering Department, Ireland, January 2009

Hardness of Approximation and New Automorphism Group Decoding Algorithms, Computer Science Theory Seminar, UIUC, November 2008

Superimposed Coding for Integer Compressed Sensing, Operations Research Department, UIUC, September 2008.

An Algebraic Approach to Reverse Engineering of Gene Regulatory Networks, Department of Mathematics Seminar, Georgia Tech, June 2008

Superimposed Codes in Bioinformatics, Technisches Universitaet, Munchen, May 2008

On the Interplay between Coding Theory and Compressive Sensing, DPS Seminar, March 2008

The Stopping Redundancy Hierarchy and Automorphism Group Decoding of Cyclic Codes, ECE Seminar, University of California, Irvine, April 2007

Coding Theoretic Problems in Genetic Data Acquisition, Modelling and Analysis, ECE Seminar, University of Illinois, Urbana-Champaign, April 2007

Average Case Analysis of Gosper’s Algorithm for Indefinite Summation of Hypergeometric Terms, STAR Theoretical Computer Science Seminar, University of California, San Diego, March 2007

Probabilistic Transforms for Combinatorial Urn Models, University of Southern California, Los Angeles, March 2007

Compressed Sensing DNA Microarrays, University of Washington, Seattle, March 2007

Iterative Automorphism Group Decoding on Redundant Tanner Graphs, Hewlett Packard Research Labs, December 2006

Probabilistic Transforms for Analyzing Binning Schemes, University of California, Berkeley, December 2006 (a joint work with K. Compton, University of Michigan, Ann Arbor)

Error-Control and Constrained Coding Solutions for DNA Microarrays and Aptamer Array Designs, University of Southern California ECE Seminar, November 2006

Enumerating RNA Shape Motifs, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, October 2006

The Three Faces of Hybridization, Engineering Department Colloquium, University of Erlangen, June 2006

Two Problems in Analysis of Algorithms, Department of Mathematics Seminar, Queen’s University, March 2006

Linear Programming Decoding, Code Polytopes and Minimal Codewords, Kempner Colloquium, Department of Mathematics, University of Colorado, Boulder, November 2005

Minimal Codewords, Code Polytopes and the Complexity of LP Decoding, Los Alamos National Laboratory, November 2005

Gosper’s Algorithm and Probabilistic Analysis of Urn Models, Murray Hill Mathematics

Research Colloquium and Seminar, Bell Labs, Lucent Technologies, June 2005

On the Analysis and Application of LDPC Codes, Colorado Center for Information Storage Seminar, Boulder, March 2005

Error-Control and Constrained Coding for DNA Computers, ECE Department Seminar, University of Colorado, Boulder, March 2005

Constrained and Error-Control Coding for DNA Computers, Communications and Signal Processing Laboratory Seminar, University of Maryland, Washington D.C., March 2005

Applications of Information Theory in Genetics, Program in Applied Mathematics Colloquium, University of Arizona, Tucson, November 19, 2004

On the Information Storage Mechanism of DNA, ECE Department Seminar, University of Colorado, Boulder, April 2004

 

In Archive