Michael A. Bender

Citado por

	Todos	Desde 2020
Citações	10382	3431
Índice h	54	31
Índice i10	132	85

780

390

195

585

2000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202537 60 157 187 266 290 324 354 326 356 351 364 377 337 465 414 442 502 548 562 624 652 653 621 775 104

Acesso público

Ver tudo

77 artigos

1 artigo

disponível

não disponível

Com base em autorizações de financiamento

Coautores

Martin Farach-ColtonShustek Professor of Computer Science, New York UniversityEmail confirmado em nyu.edu
Rob JohnsonVMware ResearchEmail confirmado em vmware.com
Bradley KuszmaulMIT CSAILEmail confirmado em mit.edu
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyEmail confirmado em mit.edu
Donald E. PorterProfessor of Computer Science, University of North Carolina at Chapel HillEmail confirmado em cs.unc.edu
Seth GilbertNational University of SingaporeEmail confirmado em comp.nus.edu.sg
Alex ConwayCornell TechEmail confirmado em ajhconway.com
Cynthia PhillipsLaboratory Fellow, Sandia National Laboratories, Albuquerque, NMEmail confirmado em sandia.gov
Esther ArkinProfessor of Applied Mathematics and Statistics, Stony Brook UniversityEmail confirmado em stonybrook.edu
Joseph S. B. MitchellDistinguished Professor, Applied Mathematics and Computer Science, Stony Brook UniversityEmail confirmado em stonybrook.edu
William JannenAssistant Professor of Computer Science, Williams CollegeEmail confirmado em williams.edu
Yang ZhanPhD student, University of North Carolina at Chapel HillEmail confirmado em cs.unc.edu
Sándor P. FeketeTechnische Universität Braunschweig, L3S Research CenterEmail confirmado em tu-bs.de
Steven SkienaProfessor of Computer Science, Stony Brook UniversityEmail confirmado em cs.stonybrook.edu
Samuel McCauleyWilliams CollegeEmail confirmado em cs.williams.edu
Shikha SinghWilliams CollegeEmail confirmado em cs.williams.edu
Jonathan W. BerryDistinguished Member of Technical Staff, Sandia National LaboratoriesEmail confirmado em sandia.gov
Charles E. LeisersonMITEmail confirmado em mit.edu
Rob PatroAssociate Professor, Department of Computer Science, University of MarylandEmail confirmado em cs.umd.edu
Maxwell YoungMississippi State UniversityEmail confirmado em cse.msstate.edu

Seguir

Michael A. Bender

Stony Brook University

Email confirmado em cs.stonybrook.edu - Página inicial

Algorithms Data Structures Databases Big Data Parallel Computing


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
The LCA problem revisited MA Bender, M Farach-Colton LATIN 2000: Theoretical Informatics: 4th Latin American Symposium, Punta del …, 2000	1086	2000
Flow and Stretch Metrics for Scheduling Continuous Job Streams. MA Bender, S Chakrabarti, S Muthukrishnan SODA 98, 270-279, 1998	385	1998
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	371*	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	332	1998
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	298	2011
Cache-oblivious B-trees MA Bender, ED Demaine, M Farach-Colton Proceedings 41st Annual Symposium on Foundations of Computer Science, 399-409, 2000	289	2000
High-performance streaming dictionary MA Bender, M Farach-Colton, YR Fogel, Z Kasheff, BC Kuszmaul, ... US Patent 8,996,563, 2015	263	2015
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	246	1994
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	231	2002
The level ancestor problem simplified MA Bender, M Farach-Colton Theoretical Computer Science 321 (1), 5-12, 2004	221	2004
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	216	2007
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	208	2017
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	189	2000
Cache-oblivious B-trees MA Bender, ED Demaine, M Farach-Colton SIAM Journal on Computing 35 (2), 341-358, 2005	185	2005
{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	177	2015
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	159	2002
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	157	2004
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	156	2005
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	147	2005
Concurrent cache-oblivious B-trees MA Bender, JT Fineman, S Gilbert, BC Kuszmaul Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005	130	2005

O sistema não pode efectuar a operação agora. Tente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações unidas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores