2026 David G. Andersen: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	72	1649	1600	848	818	158	26330

Research.com Recognitions

2011 - Fellow of Alfred P. Sloan Foundation

Overview

David G. Andersen is affiliated with Carnegie Mellon University in the United States. Their research primarily falls within the field of Computer Science, with a notable focus on subfields such as Computer Networks and Communications, Artificial Intelligence, Hardware and Architecture, Signal Processing, and Computational Theory and Mathematics.

Throughout their career, Andersen has contributed to several main research topics, including:

Caching and Content Delivery
Advanced Data Storage Technologies
Parallel Computing and Optimization Techniques
Network Packet Processing and Optimization
Internet Traffic Analysis and Secure E-voting
Data Management and Algorithms
Data Stream Mining Techniques

Among the recent papers published by Andersen or closely related to their work are:

Succinct Range Filters, 2020, ACM Transactions on Database Systems
Cuckoo index, 2020, Proceedings of the VLDB Endowment
Lightweight Preemptible Functions, 2022, OPAL (Open@LaTrobe) (La Trobe University)
Combining Machine Learning and Lifetime-Based Resource Management for Memory Allocation and Beyond, 2024, Communications of the ACM
Succinct range filters, 2021, Communications of the ACM

The venues where Andersen frequently publishes include:

Proceedings of the VLDB Endowment
Communications of the ACM
ACM Transactions on Database Systems
OPAL (Open@LaTrobe) (La Trobe University)
arXiv (Cornell University)

Frequent co-authors in Andersen's research work encompass:

Michael Kaminsky
Andrew Pavlo
Huanchen Zhang
Kimberly Keeton
Hyeontaek Lim

In recognition of their contributions, Andersen was named a Fellow of the Alfred P. Sloan Foundation in 2011.

Best Publications

Resilient overlay networks

David Andersen;Hari Balakrishnan;Frans Kaashoek;Robert Morris

3065
Citations
Resilient overlay networks

Unknown

2284
Citations
Scaling distributed machine learning with the parameter server

Mu Li;David G. Andersen;Jun Woo Park;Alexander J. Smola

1661
Citations
c-Through: part-time optics in data centers

Guohui Wang;David G. Andersen;Michael Kaminsky;Konstantina Papagiannaki

858
Citations
Don't settle for eventual: scalable causal consistency for wide-area storage with COPS

Wyatt Lloyd;Michael J. Freedman;Michael Kaminsky;David G. Andersen

858
Citations
FAWN: a fast array of wimpy nodes

David G. Andersen;Jason Franklin;Michael Kaminsky;Amar Phanishayee

849
Citations
Cuckoo Filter: Practically Better Than Bloom

Bin Fan;Dave G. Andersen;Michael Kaminsky;Michael D. Mitzenmacher

833
Citations
Communication Efficient Distributed Machine Learning with the Parameter Server

Mu Li;David G Andersen;Alex J Smola;Kai Yu

570
Citations
Safe and effective fine-grained TCP retransmissions for datacenter communication

Vijay Vasudevan;Amar Phanishayee;Hiral Shah;Elie Krevat

563
Citations
Using RDMA efficiently for key-value services

Anuj Kalia;Michael Kaminsky;David G. Andersen

554
Citations
MICA: a holistic approach to fast in-memory key-value storage

Hyeontaek Lim;Dongsu Han;David G. Andersen;Michael Kaminsky

540
Citations
SILT: a memory-efficient, high-performance key-value store

Hyeontaek Lim;Bin Fan;David G. Andersen;Michael Kaminsky

540
Citations
Accountable internet protocol (aip)

David G. Andersen;Hari Balakrishnan;Nick Feamster;Teemu Koponen

492
Citations
There is more consensus in Egalitarian parliaments

Iulian Moraru;David G. Andersen;Michael Kaminsky

447
Citations
MemC3: compact and concurrent MemCache with dumber caching and smarter hashing

Bin Fan;David G. Andersen;Michael Kaminsky

446
Citations
An empirical evaluation of entropy-based traffic anomaly detection

George Nychis;Vyas Sekar;David G. Andersen;Hyong Kim

445
Citations
The flask security architecture: system support for diverse security policies

Ray Spencer;Stephen Smalley;Peter Loscocco;Mike Hibler

425
Citations
Theoretical Approaches to Node Assignment

David G. Andersen

363
Citations
Measurement and analysis of TCP throughput collapse in cluster-based storage systems

Amar Phanishayee;Elie Krevat;Vijay Vasudevan;David G. Andersen

363
Citations
Stronger semantics for low-latency geo-replicated storage

Wyatt Lloyd;Michael J. Freedman;Michael Kaminsky;David G. Andersen

357
Citations
Resilient overlay networks

David Andersen;Hari Balakrishnan;Frans Kaashoek;Robert Morris

99
Citations

Frequent Co-Authors

Michael Kaminsky Carnegie Mellon University

Hari Balakrishnan MIT

Srinivasan Seshan Carnegie Mellon University

Vijay K. Vasudevan Google (United States)

Gregory R. Ganger Carnegie Mellon University

Andrew Pavlo Carnegie Mellon University

Michael J. Freedman Princeton University

Dongsu Han Korea Advanced Institute of Science and Technology

Michael Kozuch Intel (United States)

Adrian Perrig ETH Zurich

External Links

Personal website of David G. Andersen Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online associate degree programs offers a flexible starting point for students interested in computer science and related fields. These programs are ideal for those looking to balance studies with personal or work commitments, and many can be completed entirely online.

Cost is a key concern for many students. Fortunately, there are cheap online colleges that provide quality education without a huge financial burden. Choosing an affordable institution can make a significant difference in managing student debt.

Admissions requirements can also be a barrier. Students with less-than-perfect academic records should consider enrolling in a college that accepts low gpa. These schools offer second chances and support for motivated learners from all backgrounds.

As you plan your education and career, it’s helpful to explore your future prospects. For example, if you’re curious about where a science degree could lead, read about what can you get with an environmental science degree. This resource outlines diverse pathways, many of which can be applicable or similar to careers in computer science and technology.