Arya Mazumdar (Invited Talks)
Invited Talks at Conferences/Workshops
IEEE Information Theory Workshop (ITW), Jeju Island, Korea, Oct 12, 2015.
Communication Theory Workshop (CTW), Dana Point, CA, “Recent Results in Local Repair,” May 13, 2015.
Information Theory Workshop (ITW), Jerusalem, “Associative Memory via Linear Neural Network,” Apr 30, 2015.
Between Shannon and Hamming: Network Information Theory and Combinatorics, Banff Workshop, “Memoryless Adversary,” Mar 2, 2015.
Simons Institute Workshop on Coding, “A Student's View of Locally Repairable Codes,” Feb 12, 2015.
ITA 2015, “Locality of SecretSharing Schemes,” Feb 6, 2015.
Allerton 2014, “Achievable Schemes and Limits for Local Recovery on a Graph,” Oct 2, 2014.
Allerton 2014, “Group testing with Unreliable Elements and Rule Learning,” Oct 1, 2014.
CTW 2014, Curacao, “Local processing in distributed storage systems,” May 28, 2014.
CISS 2014, Princeton, “On cooperative local repair for distributed storage,” Mar 20, 2014.
CISS 2014, Princeton, “Smooth compression of rankings,” Mar 19, 2014.
Zurich Seminar, “Noisy Boolean compressed sensing and errorcorrecting codes,” Feb 28, 2014.
ITA 2014, “On a duality between recoverable distributed storage and index coding,” Feb 13, 2014.
ITA 2013, “Local recovery properties of capacity achieving codes,” Feb 15, 2013.
ITA 2012, “Explicit group testing scheme that identifies almost all defective configurations,” Feb 10, 2012.
Allerton 2011, “Sparserecovery properties of statistical RIP matrices,” Sep 30, 2011.
Allerton 2010, “On the capacity of highdensity magnetic recording on a 1D granular medium,” Sep 28, 2010.
Invited Talks at Universities/Labs
University of California, San Diego, Theory of codes for network and inference problems, Nov 6, 2015.
University of California, Santa Barbara, Theory of codes for network and inference problems, Nov 4, 2015.
University of California, Berkeley, Graph capacity, broadcast rate and local repair, Sep 28, 2015.
University of Maryland, Can we do Local Repair over a Network?, Apr 13, 2015.
University of Massachusetts, Amherst, Networks of Reliable Distributed Storage, Apr 3, 2015.
University of Minnesota, CS Colloquium (Nov 3, 2014), ECE Colloquium (Sep 11, 2014), “Storage Capacity of Repairable Networks.”
Dartmouth College, CS Colloquium, Coding theory of nextgen storage and beyond, Apr 28, 2014.
Virginia Tech, ECE Seminar, “Communication methods in storage systems,” Apr 5, 2014.
Communications/ICWS Seminar, University of Illinois, Urbana, Errorreducing codes, Oct 14, 2013.
Johns Hopkins University, “Reliability in memory: the spectrum of codes,” Mar 5.
University of Minnesota, Twin Cities, “Reliability in memory: the spectrum of codes,” Apr 2, 2012.
Rutgers, State University of New Jersey, Reliability in memory: the spectrum of codes, Mar 29, 2012.
SUNY Buffalo, “Reliability in memory: the spectrum of codes,” Mar 14, 2012,
CISE Seminar, Boston University, Error correction codes for Flash memory: rank modulation, Feb 17, 2012.
Massachusetts Institute of Technology (MIT), “Constructions of sampling matrices for compressed sensing,” Apr 15, 2011.
Bell Labs, Murray Hill, NJ, "General construction of compressed sensing matrices, Apr 14, 2011.
Princeton University, EE Department, “General construction of compressed sensing matrices,” Apr 13, 2011.
University of Southern California, EE Department, Sensing compressed signal, codes on graphs and reliability in memory, Jan 21, 2011.
Duke University, ECE Seminar Series, “Codes in Permutation,” Nov 17, 2010.
LinkAMedia Devices, ‘‘Error correcting codes for magnetic recording," Oct 26, 2010.
IBM Watson Research Center, NY, “Rank modulation codes: error correction for Flash memory,” Sep 27, 2010.
NEC Labs, Princeton, “Sampling matrices from coding theory,” May 4, 2010.
AT&T Shannon Labs, Florham Park, NJ, “Linear balancing sets,” Jul 24, 2009.
Bell Labs, Murray Hill, NJ, “Error correcting capabilities of codes on graphs,” Jun 25, 2009.
HewlettPackard Labs, Palo Alto, CA, “Design of efficient encoding and decoding algorithms for balanced codes,” Aug 26, 2008.
