Travelled to:1 × Canada
1 × Germany
1 × Spain
1 × Switzerland
4 × USA
Collaborated with:H.Hu B.C.Kuszmaul D.Ron M.Farach-Colton Y.Aumann R.Cole R.Raman S.P.Fekete J.T.Fineman S.Gilbert L.Arge E.D.Demaine B.Holland-Minkley J.I.Munro A.Fernández A.Sahai S.P.Vadhan R.Johnson R.Kraner D.Medjedovic P.Montes P.Shetty R.P.Spillane E.Zadok
Talks about:oblivi (5) cach (4) graph (3) algorithm (2) effici (2) direct (2) tree (2) sublinear (1) exponenti (1) consensus (1)
Person: Michael A. Bender
DBLP: Bender:Michael_A=
Contributed to:
2014
201220102006
2002
2002200019981996Wrote 10 papers:
- PODS-2014-BenderFFFG
- Cost-oblivious storage reallocation (MAB, MFC, SPF, JTF, SG), pp. 278–288.
- VLDB-2012-BenderFJKKMMSSZ #how
- Don’t Thrash: How to Cache Your Hash on Flash (MAB, MFC, RJ, RK, BCK, DM, PM, PS, RPS, EZ), pp. 1627–1637.
- PODS-2010-BenderHK #performance
- Performance guarantees for B-trees with different-sized atomic keys (MAB, HH, BCK), pp. 305–316.
- PODS-2006-BenderFK #string
- Cache-oblivious string B-trees (MAB, MFC, BCK), pp. 233–242.
- PODS-2006-BenderH #adaptation #array
- An adaptive packed-memory array (MAB, HH), pp. 20–29.
- ICALP-2002-BenderCR #algorithm #exponential #performance
- Exponential Structures for Efficient Cache-Oblivious Algorithms (MAB, RC, RR), pp. 195–207.
- STOC-2002-ArgeBDHM #algorithm #graph #queue
- Cache-oblivious priority queue and graph algorithm applications (LA, MAB, EDD, BHM, JIM), pp. 268–276.
- ICALP-2000-BenderR #graph #sublinear #testing
- Testing Acyclicity of Directed Graphs in Sublinear Time (MAB, DR), pp. 809–820.
- STOC-1998-BenderFRSV #graph #power of
- The Power of a Pebble: Exploring and Mapping Directed Graphs (MAB, AF, DR, AS, SPV), pp. 269–278.
- ICALP-1996-AumannB #performance
- Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler (YA, MAB), pp. 622–633.