Danny Hendler
Computer Networks and Communications · 2004–2010
A researcher in the Science corpus: 2 papers; trusts 3 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 7 citations into it
Whom Danny Hendler trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- William W. Pugh
- Maurice Herlihy
- Emery D. Berger
- Nir Shavit
- Charles E. Leiserson
- Changkyu Kim
- Leslie Lamport
- Eddie Kohler
- R. Rivest
- Kathryn S. McKinley
Papers from Danny Hendler's perspective
Ordered by how strongly the researchers Danny Hendler trusts endorse each paper. Same corpus, a different order for every researcher.
- FAST: fast architecture sensitive tree search on modern CPUs and GPUs (SIGMOD Conference)
- Cache craftiness for fast multicore key-value storage (European Conference on Computer Systems)
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs (IEEE transactions on computers)
- Introduction to Algorithms, 2nd edition.
- READ-COPY UPDATE: USING EXECUTION HISTORY TO SOLVE CONCURRENCY PROBLEMS
- Hoard: a scalable memory allocator for multithreaded applications
- Introduction to Algorithms, third edition
- The art of multiprocessor programming by Maurice Herlihy and Nir Shavit (SOEN)
- Workload analysis of a large-scale key-value store (Measurement and Modeling of Computer Systems)
- Skip lists: a probabilistic alternative to balanced trees
Their papers
- Flat combining and the synchronization-parallelism tradeoff (2010) — 354 citations
- A scalable lock-free stack algorithm (2004) — 303 citations