Sledovať
Michael A. Bender
Michael A. Bender
Stony Brook University
Overená e-mailová adresa na: cs.stonybrook.edu - Domovská stránka
Názov
Citované v
Citované v
Rok
The LCA problem revisited
MA Bender, M Farach-Colton
LATIN 2000: Theoretical Informatics: 4th Latin American Symposium, Punta del …, 2000
10612000
Flow and Stretch Metrics for Scheduling Continuous Job Streams.
MA Bender, S Chakrabarti, S Muthukrishnan
SODA 98, 270-279, 1998
3811998
Lowest common ancestors in trees and directed acyclic graphs
MA Bender, M Farach-Colton, G Pemmasani, S Skiena, P Sumazin
Journal of Algorithms 57 (2), 75-94, 2005
368*2005
The power of a pebble: Exploring and mapping directed graphs
MA Bender, A Fernández, D Ron, A Sahai, S Vadhan
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
3311998
Don't thrash: How to cache your hash on flash
MA Bender, M Farach-Colton, R Johnson, BC Kuszmaul, D Medjedovic, ...
3rd Workshop on Hot Topics in Storage and File Systems (HotStorage 11), 2011
2902011
Cache-oblivious B-trees
MA Bender, ED Demaine, M Farach-Colton
Proceedings 41st Annual Symposium on Foundations of Computer Science, 399-409, 2000
2852000
High-performance streaming dictionary
MA Bender, M Farach-Colton, YR Fogel, Z Kasheff, BC Kuszmaul, ...
US Patent 8,996,563, 2015
2582015
The power of team exploration: Two robots can learn unlabeled directed graphs
MA Bender, DK Slonim
Proceedings 35th Annual Symposium on Foundations of Computer Science, 75-85, 1994
2421994
Two simplified algorithms for maintaining order in a list
MA Bender, R Cole, ED Demaine, M Farach-Colton, J Zito
European symposium on algorithms, 152-164, 2002
2222002
The level ancestor problem simplified
MA Bender, M Farach-Colton
Theoretical Computer Science 321 (1), 5-12, 2004
2172004
Cache-oblivious streaming B-trees
MA Bender, M Farach-Colton, JT Fineman, YR Fogel, BC Kuszmaul, ...
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007
2112007
A general-purpose counting filter: Making every bit count
P Pandey, MA Bender, R Johnson, R Patro
Proceedings of the 2017 ACM international conference on Management of Data …, 2017
1962017
Cache-oblivious B-trees
MA Bender, ED Demaine, M Farach-Colton
SIAM Journal on Computing 35 (2), 341-358, 2005
1812005
TEASAR: tree-structure extraction algorithm for accurate and robust skeletons
M Sato, I Bitter, MA Bender, AE Kaufman, M Nakajima
Proceedings the Eighth Pacific Conference on Computer Graphics and …, 2000
1782000
{BetrFS}: A {Right-Optimized}{Write-Optimized} file system
W Jannen, J Yuan, Y Zhan, A Akshintala, J Esmet, Y Jiao, A Mittal, ...
13th USENIX Conference on File and Storage Technologies (FAST 15), 301-315, 2015
1662015
Cache-oblivious priority queue and graph algorithm applications
L Arge, MA Bender, ED Demaine, B Holland-Minkley, JI Munro
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
1602002
Optimal covering tours with turn costs
EM Arkin, MA Bender, ED Demaine, SP Fekete, JSB Mitchell, S Sethia
SIAM Journal on Computing 35 (3), 531-566, 2005
1542005
Algorithms for rapidly dispersing robot swarms in unknown environments
TR Hsiang, EM Arkin, MA Bender, SP Fekete, JSB Mitchell
Algorithmic Foundations of Robotics V, 77-93, 2004
1532004
Adversarial contention resolution for simple channels
MA Bender, M Farach-Colton, S He, BC Kuszmaul, CE Leiserson
Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005
1442005
Concurrent cache-oblivious B-trees
MA Bender, JT Fineman, S Gilbert, BC Kuszmaul
Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005
1302005
Systém momentálne nemôže vykonať operáciu. Skúste to neskôr.
Články 1–20