Alexandros G. Dimakis

        Assistant Professor
        Colleen and Roberto Padovani Early Career Chair in Electrical Engineering
        Department of Electrical Engineering - Systems
        University of Southern California
        dimakis at usc [dot] edu
        (213)740-9264
        532 EEB, 3740 McClintock Ave., (Mail Code 2560)
        University of Southern California
        Los Angeles, CA 90089-2560       googlemap exact location


Publications | Resume| Bio Sketch | Teaching | Erasure Coding for Storage Wiki

I am interested in communications, signal processing and networking. In particular, network coding for distributed storage, message passing algorithms and distributed inference, sparse graph codes and convex relaxations.

TPCs: ISIT 2013, MobiHoc 2012, Infocom 2012, ICC 2012, Globecom 2011 Data Storage Track Chair (CFP ), Netcod 2011, CAMSAP 2011, SmartGridComm (Architectures and Models for the Smart Grid), DCOSS 2011.
Google Scholar Profile


What's new:

  • Appointed Colleen and Roberto Padovani Early Career Chair in Electrical Engineering. Support gratefully acknowledged.

  • Our paper "Network Coding for Distributed Storage Systems" received the
    2010 IEEE ComSoc Data Storage Committee best paper award

  • New papers (Infocom 2012)
    FemtoCaching: Wireless Video Content Delivery through Distributed Caching Helpers
    N. Golrezaei, K. Shanmugam, A.G. Dimakis, A.F. Molisch and G. Caire.


    Simple Regenerating Codes: Network Coding for Cloud Storage
    Dimitris S. Papailiopoulos, Jianqiang Luo, Alexandros G. Dimakis, Cheng Huang, Jin Li

  • First Workshop on Network Coding and Data Storage

  • Keynote speaker, IEEE Int. Sympsium on Network Coding (NetCod)

  • New paper, Allerton 2011
    Repair Optimal Erasure Codes through Hadamard Designs

  • New papers, ISIT 2011
    Explicit Matrices for Sparse Approximation
    Distributed Storage Allocations for Optimal Delay
    Distributed Storage Codes through Hadamard Designs

  • Received the NSF Career award, support gratefully acknowledged.

  • Survey paper A Survey on Network Codes for Distributed Storage will appear in the Proceedings of the IEEE.

  • New paper uploaded: Interference Alignment as a Rank Constrained Rank Minimization, Globecom 2010.
    See the Interference alignment project homepage that includes full Matlab code. Also the IA paper repository .

  • Keynote at the IEEE International Symposium on Network Coding (NetCod 2010): Network coding for distributed storage systems. [powerpoint slides] Video from Microsoft research seminar (needs Windows media components for mac Quicktime)

  • Survey paper on Gossip Algorithms Proceedings of the IEEE, November 2010. See also: [arXiv]

  • The Coding for Distributed Storage Wiki: StorageWiki

    Publications: [all publications] by year, or selected publications by topic:
        Network Coding for Distributed Storage
        Compressed Sensing
        Gossip and Distributed Algorithms
        Coding Theory, LDPC Codes and Linear Programming decoding
        Game theory
        Renewable energy

    Teaching and Service:


    Fall 2011: EE599 Distributed Storage Theory Class Google Site

    Fall 2011: Communications, Networks and Systems [CommNetS] Seminar (with Rahul Jain).

    Spring 2011: Communications, Networks and Systems [CommNetS] Seminar (with Rahul Jain).

    Fall 2010: EE 464, Probability Theory

    Fall 2009: Message passing algorithms (special topics) EE 599









    I was involved in the local organization of the 2010 School of Information Theory
    See the school Poster. Deadline: April 30

    Students:

      Megasthenis Asteris
      Negin Golrezaei
      Dimitris Papailiopoulos
      Maheswaran Sathiamoorthy
      Arash Saber Terhani

    Brief Bio:


    I received my PhD at the Wireless Foundations lab in the EECS department, UC Berkeley
    and my undergraduate studies in Electrical and Computer Engineering department
    National Technical University of Athens in 2003.
    During the summer of 2006 I was with the labs of Martin Vetterli and Patrick Thiran at Ecole Polytechnique Federale de Lausanne
    During the summer of 2007 I was with the Communication and Collaboration Systems group at Microsoft Research and worked with Yunnan Wu on coding for storage in Data Centers.
    During 2008 I was a postdoctoral scholar at the Center for the Mathematics of Information at Caltech.

    Research Publications









        [all publications] by year, or selected publications by topic:


    Network Coding for Distributed Storage

  • "A Survey on Network Codes for Distributed Storage" (new)
    A. G. Dimakis, K. Ramchandran, Y. Wu, C. Suh,
    Proceedings of the IEEE, March 2011, Vol 99, No 3.

  • "Network Coding for Distributed Storage Systems" (updated)
    A. G. Dimakis, P. B. Godfrey, Y. Wu, M. Wainwright and K. Ramchandran,
    IEEE Transactions on Information Theory, Vol. 56, Issue 9, Sept. 2010.

    • (Preliminary versions appeared in Infocom 2007 and Allerton 2007)

  • Video of seminar on distributed storage.
    (Windows media components for mac)) and [Slides] Summarizes on-going work on network coding for distributed storage, the interference alignment technique and regenerating codes. See also the Repair Problem on the Distributed Storage Wiki

  • D. Leong, A. G. Dimakis, T. Ho, Distributed Storage Allocations
    Submitted for journal publication. (for preliminary work see also:)
  • Distributed Storage Allocation basics on the StorageWiki.

  • Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits
    Theodoros K. Dikaliotis, Alexandros G. Dimakis, and Tracey Ho
    Proceedings of the IEEE International Symposium on Information Theory (ISIT 2010).


    Gossip and Message Passing Algorithms

  • Gossip Algorithms for Distributed Signal Processing
    A. G. Dimakis, S. Kar, J. M.F. Moura, M. G. Rabbat, A. Scaglione
    , Proceedings of the IEEE, Vol. 98, no. 11, pp. 1847-1864, November, 2010.

  • The Impact of Mobility on Gossip Algorithms,
    A.D. Sarwate and A.G. Dimakis,
    IEEE Transactions on Information Theory, to appear.
    (preliminary version Infocom 2009)

  • Order-Optimal Consensus through Randomized Path Averaging
    F. Benezit, A. G. Dimakis, P. Thiran and M. Vetterli.
    IEEE Transactions on Information Theory, Volume 56, Issue 10, Oct. 2010.

  • Geographic Gossip : Efficient Averaging for Sensor Networks
    A. G. Dimakis, A.D. Sarwate, and M.J. Wainwright.
    IEEE Transactions on Signal Processing, 56 (3), March 2008.
    • [slides]

  • Robust Message Passing for Statistical Inference in Sensor Networks
    J. Schiff, D. Antonelli, A.G. Dimakis, D. Chu, and M.J. Wainwright
    Proc. of ACM/IEEE Symp. on Information Processing in Sensor Networks (IPSN '07), Cambridge, MA, April 2007.
    Compressed sensing

  • LDPC Codes for Compressed Sensing
    A.G. Dimakis, R. Smarandache, P. Vontobel,
    IEEE Transactions on Information Theory, To appear.
    [slides]

  • Sparse Recovery of Positive Signals with Minimal Expansion
    M.Amin Khajehnejad, A. G. Dimakis, W. Xu, B. Hassibi
    IEEE Transactions on Signal Processing, 2010, Vol. 59 (1), pp. 196-208
    [slides]

  • Sparse Recovery for Discrete Tomography,
    Y. Lin, A. Ortega, A. G. Dimakis
    IEEE Int. Conf. on Image Processing (ICIP), Sept. 2010.
    • Coding Theory and Convex Optimization

    "Probabilistic Analysis of Linear Programming decoding"
    C. Daskalakis, A. G. Dimakis, R. M. Karp and M. J. Wainwright,
    IEEE Transactions on Information Theory, Volume 54, Issue 8, Aug. 2008,

    (preliminary version ACM-SIAM SODA 2007)
    [slides]

  • "Guessing Facets: Polytope Structure and Improved LP Decoder"
    A. G. Dimakis, A. A. Gohari and M. Wainwright,
    IEEE Transactions on Information Theory, Volume 55, Issue 8, Aug. 2009,

    • (preliminary versionISIT 2006).
    [slides]


    Game Theory and Applied Probabiilty

  • "Connectivity and Equilibrium in Random Games"
    C. Daskalakis, A. G. Dimakis and E. Mossel
    Annals of Applied Probability, 21(3):987-1016, 2011

    • We study how the structure of the interaction graph affects the Nash equilibria of the resulting game.

    Renewable energy and scheduling

  • "Efficient Algorithms for Renewable Energy Allocation to Delay Tolerant Consumers"
    M. J. Neely, A. S. Tehrani, A. G. Dimakis
    First IEEE International Conference on Smart Grid Communication, 2010.

    • (Copyright belongs to the publisher in most cases. The author/authors assert copyright in all other cases.)

    Links

    Artistic attempts

    Long time ago, I was the webmaster at the NTUA IEEE student branch .

    Fun upper bounds: My Erdos Number is less than or equal to 3: (Paul Erdos-> Noga Alon-> Richard Karp-> myself)
    No known finite upper bounds on my Bacon number exist.