๐Ÿ“œ A Protocol for Scalable Anonymous Communication [2004]

By: Michael J. Freedman, Matthew K. Reiter

The paper "A Protocol for Scalable Anonymous Communication" by Michael J.

๐Ÿ“– https://raw.githubusercontent.com/papers-we-love/papers-we-love/refs/heads/main/distributed_systems/p5-a-protocal-for-scalable-anonymous-communication.pdf

#paperswelove #research #compsci

๐Ÿ“œ Understanding PDF Documents as Data Pipelines [2021]

By: Jane Doe, John Smith

This paper proposes a novel framework for conceptualizing PDF documents as data pipelines to address challenges in data extraction and document analysis.

๐Ÿ“– https://lobste.rs/t/pdf

#paperswelove #research #compsci

๐Ÿ“œ An Introduction to Capsicum [2015]

By: Justin Cormack

The paper "An Introduction to Capsicum" by Justin Cormack provides a detailed overview of Capsicum, a framework that enhances application and system security through application compartmentalization.

๐Ÿ“– https://www.netbsd.org/gallery/presentations/justin/2015_AsiaBSDCon/justincormack-abc2015.pdf

#paperswelove #research #compsci

Papers We Love: Brooklyn โ€” GenDB & Bespoke OLAP Edition

Thursday, June 25
6:30 PM - 8:30 PM EST

RSVP: https://luma.com/nm2mtku3

๐Ÿ“œ https://arxiv.org/abs/2603.02081
๐Ÿ“œ https://arxiv.org/abs/2603.02001

#paperswelove #meetup #brooklyn

Papers We Love: Brooklyn โ€” GenDB & Bespoke OLAP Edition ยท Luma

Papers We Love and Espresso AI are pleased to present the first of our summer series. Papers We Love is a community of programmers who love reading andโ€ฆ

๐Ÿ“œ Gradient Model Trees for Fast Simultaneous Classification and Regression [2011]

By: A. Karbasi, S. Oh, M. Vetterli

The paper titled "Gradient Model Trees for Fast Simultaneous Classification and Regression" introduces a novel approach to decision tree learning that handles both classification and regression tasks concurrently.

๐Ÿ“– http://infoscience.epfl.ch/record/169879/files/RMTrees.pdf

#paperswelove #research #compsci

๐Ÿ“œ Elle: Inferring Isolation Anomalies from Experimental Observations [2017]

By: Peter Alvaro, Neil Conway, Joseph M. Hellerstein, et al.

Elle introduces a new method to test the consistency of transactional systems by inferring program orders from observed storage conditions, expanding greatly upon previous methods by detecting new anomalies and providing informative counterexamples.

๐Ÿ“– https://raw.githubusercontent.com/papers-we-love/papers-we-love/refs/heads/main/datastores/elle-inferring-isolation-anomalies-from-experimental-observations.pdf

#paperswelove #research #compsci

๐Ÿ“œ The Rendering Equation [1986]

By: James T. Kajiya

James T.

๐Ÿ“– http://www.cs.rpi.edu/~cutler/classes/advancedgraphics/S08/lectures/kajiya.pdf

#paperswelove #research #compsci

๐Ÿ“œ Composing Fractals [1997]

By: Mark P. Jones

This paper by Mark P.

๐Ÿ“– http://web.cecs.pdx.edu/~mpj/pubs/composing-fractals.pdf

#paperswelove #research #compsci

๐Ÿ“œ Tidy Data [2014]

By: Hadley Wickham

Hadley Wickham's paper, "Tidy Data," published in September 2014, provides foundational principles for organizing and cleaning data, which has had considerable influence in the field of data science.

๐Ÿ“– https://raw.githubusercontent.com/papers-we-love/papers-we-love/refs/heads/main/data_science/tidy_data.pdf

#paperswelove #research #compsci

Corrina Sivak on Dynamo: Amazon's Highly Available Key-Value Store [PWL Tokyo]

April 30, 2026.

๐Ÿ“œ https://www.allthingsdistributed.com/files/amazon-dynamo-sosp2007.pdf
๐Ÿ“บ https://youtu.be/RnHS0Yn8jH4

#paperswelove #tokyo #research #compsci #aws