Travelled to:1 × Canada
1 × Finland
1 × Spain
1 × Switzerland
6 × USA
Collaborated with:B.Heeringa ∅ N.Immerman F.T.Leighton J.Edmonds J.Matousek E.Halperin R.M.Karp V.V.Vazirani F.E.Fich L.A.Goldberg M.Paterson A.Chandra P.Goyal P.J.Shenoy S.Chakrabarti M.Mitzenmacher L.E.Rasmussen H.Räcke N.Sivadasan C.Sohler B.Vöcking
Talks about:packet (3) probabilist (2) schedul (2) random (2) optim (2) bound (2) size (2) peer (2) mark (2) multiprocessor (1)
Person: Micah Adler
DBLP: Adler:Micah
Contributed to:
2005
2004200320022002
20012000
200020001995Wrote 10 papers:
- STOC-2005-AdlerEM #probability #towards
- Towards asymptotic optimality in probabilistic packet marking (MA, JE, JM), pp. 450–459.
- ICALP-2004-HeeringaA #design #problem
- Optimal Website Design with the Constrained Subtree Selection Problem (BH, MA), pp. 757–769.
- STOC-2003-AdlerHKV #network #peer-to-peer #probability #process
- A stochastic process on the hypercube with applications to peer-to-peer networks (MA, EH, RMK, VVV), pp. 575–584.
- ICALP-2002-AdlerRSSV #graph #random
- Randomized Pursuit-Evasion in Graphs (MA, HR, NS, CS, BV), pp. 901–912.
- STOC-2002-Adler #probability #trade-off
- Tradeoffs in probabilistic packet marking for IP traceback (MA), pp. 407–418.
- LICS-2001-AdlerI #bound #exclamation
- An n! Lower Bound on Formula Size (MA, NI), pp. 197–206.
- ICALP-2000-AdlerFGP #bound
- Tight Size Bounds for Packet Headers in Narrow Meshes (MA, FEF, LAG, MP), pp. 756–767.
- OSDI-2000-ChandraAGS #algorithm #cpu #multi #scheduling #symmetry
- Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors (AC, MA, PG, PJS), pp. 45–58.
- STOC-2000-AdlerL #multi #performance #using
- Compression using efficient multicasting (MA, FTL), pp. 153–162.
- STOC-1995-AdlerCMR #parallel #random
- Parallel randomized load balancing (MA, SC, MM, LER), pp. 238–247.