All Stories

  1. Parallel k-Core Decomposition: Theory and Practice (Abstract)
  2. Parallel Contraction Hierarchies Can Be Efficient and Scalable (Abstract)
  3. Parallel Point-to-Point Shortest Paths and Batch Queries
  4. Parallel k -Core Decomposition: Theory and Practice
  5. Reproducibility Report for ACM SIGMOD 2024 Paper: 'On Efficient Large Sparse Matrix Chain Multiplication'
  6. Brief Announcement: PASGAL: Parallel And Scalable Graph Algorithm Library
  7. Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
  8. Parallel Integer Sort: Theory and Practice (Abstract)
  9. Efficient Parallel Output-Sensitive Edit Distance (Abstract)
  10. Parallel Integer Sort: Theory and Practice
  11. Provably Fast and Space-Efficient Parallel Biconnectivity (Abstract)
  12. Parallel Strong Connectivity Based on Faster Reachability (Abstract)
  13. High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems
  14. Parallel Strong Connectivity Based on Faster Reachability
  15. Provably Fast and Space-Efficient Parallel Biconnectivity
  16. Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths