All Stories

  1. BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees (Abstract)
  2. CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
  3. Streaming Sparse Graphs using Efficient Dynamic Sets
  4. Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  5. A Parallel Packed Memory Array to Store Dynamic Graphs
  6. High-Throughput Image Alignment for Connectomics using Frugal Snap Judgments
  7. Packed Compressed Sparse Row: A Dynamic Graph Representation
  8. Electricity Demand and Population Dynamics Prediction from Mobile Phone Metadata