Travelled to:1 × Australia
1 × China
1 × Germany
1 × Switzerland
1 × United Kingdom
2 × France
4 × USA
Collaborated with:M.T.Goodrich S.Albers M.Luby M.A.Shokrollahi D.A.Spielman P.Li A.Shrivastava A.Z.Broder M.Charikar A.M.Frieze M.Adler S.Chakrabarti L.E.Rasmussen J.Pachocki R.Peng C.E.Tsourakakis S.C.Xu V.Stemann M.Dietzfelbinger A.Goerdt A.Montanari R.Pagh M.Rink F.Chierichetti R.Kumar S.Lattanzi A.Panconesi P.Raghavan A.Kirsch A.Pietracaprina G.Pucci E.Upfal F.Vandin R.Cole B.M.Maggs F.M.a.d.Heide A.W.Richa K.Schröder R.K.Sitaraman B.Vöcking
Talks about:network (3) random (3) code (3) parallel (2) compress (2) applic (2) larg (2) data (2) low (2) interconnect (1)
Person: Michael Mitzenmacher
DBLP: Mitzenmacher:Michael
Facilitated 1 volumes:
EdContributed to:
2015
2014
2012201120102009
20091998199719961995Wrote 13 papers:
- KDD-2015-MitzenmacherPPT #clique #detection #network #scalability
- Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling (MM, JP, RP, CET, SCX), pp. 815–824.
- ICML-c2-2014-0001MS #random
- Coding for Random Projections (PL, MM, AS), pp. 676–684.
- ICALP-v2-2012-GoodrichM #parallel
- Anonymous Card Shuffling and Its Applications to Parallel Mixnets (MTG, MM), pp. 549–560.
- ICALP-v2-2011-GoodrichM #outsourcing #privacy #ram #simulation
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation (MTG, MM), pp. 576–587.
- ICALP-v1-2010-DietzfelbingerGMMPR #satisfiability
- Tight Thresholds for Cuckoo Hashing via XORSAT (MD, AG, MM, AM, RP, MR), pp. 213–225.
- KDD-2009-ChierichettiKLMPR #network #on the #social
- On compressing social networks (FC, RK, SL, MM, AP, PR), pp. 219–228.
- PODS-2009-KirschMPPUV #approach #identification #performance #statistics
- An efficient rigorous approach for identifying statistically significant frequent itemsets (AK, MM, AP, GP, EU, FV), pp. 117–126.
- STOC-1998-BroderCFM #independence #permutation
- Min-Wise Independent Permutations (AZB, MC, AMF, MM), pp. 327–336.
- STOC-1998-ColeMHMRSSV #multi #network #protocol #random
- Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks (RC, BMM, FMadH, MM, AWR, KS, RKS, BV), pp. 378–388.
- STOC-1998-LubyMSS #analysis #design #graph #using
- Analysis of Low Density Codes and Improved Designs Using Irregular Graphs (ML, MM, MAS, DAS), pp. 249–258.
- STOC-1997-LubyMSSS
- Practical Loss-Resilient Codes (ML, MM, MAS, DAS, VS), pp. 150–159.
- ICALP-1996-AlbersM #algorithm #analysis
- Average Case Analyses of List Update Algorithms, with Applications to Data Compression (SA, MM), pp. 514–525.
- STOC-1995-AdlerCMR #parallel #random
- Parallel randomized load balancing (MA, SC, MM, LER), pp. 238–247.