Saved in:
| Main Author: | Singh, Ajay |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.02457 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
DGAP: Efficient Dynamic Graph Analysis on Persistent Memory
by: Islam, Abdullah Al Raqibul, et al.
Published: (2024)
by: Islam, Abdullah Al Raqibul, et al.
Published: (2024)
No Cords Attached: Coordination-Free Concurrent Lock-Free Queues
by: Motiwala, Yusuf
Published: (2025)
by: Motiwala, Yusuf
Published: (2025)
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
by: Williams, Marvin, et al.
Published: (2025)
by: Williams, Marvin, et al.
Published: (2025)
VMT19937: A SIMD-Friendly Pseudo Random Number Generator based on Mersenne Twister 19937
by: Cannizzo, Fabio
Published: (2023)
by: Cannizzo, Fabio
Published: (2023)
TC-MIS: Maximal Independent Set on Tensor-cores
by: Nijhara, Prajjwal, et al.
Published: (2026)
by: Nijhara, Prajjwal, et al.
Published: (2026)
QR factorization of ill-conditioned tall-and-skinny matrices on distributed-memory systems
by: Mijić, Nenad, et al.
Published: (2024)
by: Mijić, Nenad, et al.
Published: (2024)
Concurrent Deterministic Skiplist and Other Data Structures
by: Sasidharan, Aparna
Published: (2023)
by: Sasidharan, Aparna
Published: (2023)
Accelerating Sparse Tensor Decomposition Using Adaptive Linearized Representation
by: Laukemann, Jan, et al.
Published: (2024)
by: Laukemann, Jan, et al.
Published: (2024)
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
by: Wheatman, Brian, et al.
Published: (2023)
by: Wheatman, Brian, et al.
Published: (2023)
Setchain Algorithms for Blockchain Scalability
by: Karmegam, Arivarasan, et al.
Published: (2025)
by: Karmegam, Arivarasan, et al.
Published: (2025)
Parallel $k$d-tree with Batch Updates
by: Men, Ziyang, et al.
Published: (2024)
by: Men, Ziyang, et al.
Published: (2024)
Restructuring expression dags for efficient parallelization
by: Wilhelm, Martin
Published: (2018)
by: Wilhelm, Martin
Published: (2018)
On Optimizing Locality of Graph Transposition on Modern Architectures
by: Esfahani, Mohsen Koohi, et al.
Published: (2025)
by: Esfahani, Mohsen Koohi, et al.
Published: (2025)
Relaxing Concurrent Data-structure Semantics for Increasing Performance: A Multi-structure 2D Design Framework
by: Rukundo, Adones, et al.
Published: (2019)
by: Rukundo, Adones, et al.
Published: (2019)
GPU Acceleration of Sparse Fully Homomorphic Encrypted DNNs
by: D'Agata, Lara, et al.
Published: (2026)
by: D'Agata, Lara, et al.
Published: (2026)
OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths
by: Gold, Leo, et al.
Published: (2024)
by: Gold, Leo, et al.
Published: (2024)
Publish on Ping: A Better Way to Publish Reservations in Memory Reclamation for Concurrent Data Structures
by: Singh, Ajay, et al.
Published: (2025)
by: Singh, Ajay, et al.
Published: (2025)
Bounded Memory in Distributed Networks
by: Basat, Ran Ben, et al.
Published: (2025)
by: Basat, Ran Ben, et al.
Published: (2025)
Shared-Memory Hierarchical Process Mapping
by: Schulz, Christian, et al.
Published: (2025)
by: Schulz, Christian, et al.
Published: (2025)
Memory Bounds for Concurrent Bounded Queues
by: Aksenov, Vitaly, et al.
Published: (2021)
by: Aksenov, Vitaly, et al.
Published: (2021)
Skip Hash: A Fast Ordered Map Via Software Transactional Memory
by: Rodriguez, Matthew, et al.
Published: (2024)
by: Rodriguez, Matthew, et al.
Published: (2024)
BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
by: Coluzzi, Massimo, et al.
Published: (2024)
by: Coluzzi, Massimo, et al.
Published: (2024)
Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)
by: Blin, Lelia, et al.
Published: (2026)
Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices
by: Ganbarov, Ali, et al.
Published: (2024)
by: Ganbarov, Ali, et al.
Published: (2024)
Techniques for Authenticating Quantile Digests
by: Scala, Alessandro
Published: (2024)
by: Scala, Alessandro
Published: (2024)
Agent-based Leader Election, MST, and Beyond
by: Kshemkalyani, Ajay D., et al.
Published: (2024)
by: Kshemkalyani, Ajay D., et al.
Published: (2024)
Distributed-Memory Parallel Algorithms for Fixed-Radius Near Neighbor Graph Construction
by: Raulet, Gabriel, et al.
Published: (2025)
by: Raulet, Gabriel, et al.
Published: (2025)
Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)
by: Kannappan, Shruthi, et al.
Published: (2025)
Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)
by: Jakob, Manuel, et al.
Published: (2025)
Perfect Matching with Few Link Activations
by: Mirault, Hugo, et al.
Published: (2025)
by: Mirault, Hugo, et al.
Published: (2025)
Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
by: Ghaffari, Mohsen, et al.
Published: (2025)
by: Ghaffari, Mohsen, et al.
Published: (2025)
Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
by: Feist, Dankrad, et al.
Published: (2025)
by: Feist, Dankrad, et al.
Published: (2025)
Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)
by: Li, Fuhuan, et al.
Published: (2025)
New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
by: Gil, Yuval, et al.
Published: (2025)
by: Gil, Yuval, et al.
Published: (2025)
WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
by: McCoy, Hunter, et al.
Published: (2025)
by: McCoy, Hunter, et al.
Published: (2025)
Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
by: Baumecker, Malte, et al.
Published: (2025)
by: Baumecker, Malte, et al.
Published: (2025)
HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
by: Dindoost, Mohammad, et al.
Published: (2025)
by: Dindoost, Mohammad, et al.
Published: (2025)
Improved Byzantine Agreement under an Adaptive Adversary
by: Dufoulon, Fabien, et al.
Published: (2025)
by: Dufoulon, Fabien, et al.
Published: (2025)
A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
by: Mordacchini, Matteo, et al.
Published: (2025)
by: Mordacchini, Matteo, et al.
Published: (2025)
Constrained Cuts, Flows, and Lattice-Linearity
by: Streit, Robert, et al.
Published: (2025)
by: Streit, Robert, et al.
Published: (2025)
Similar Items
-
DGAP: Efficient Dynamic Graph Analysis on Persistent Memory
by: Islam, Abdullah Al Raqibul, et al.
Published: (2024) -
No Cords Attached: Coordination-Free Concurrent Lock-Free Queues
by: Motiwala, Yusuf
Published: (2025) -
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
by: Williams, Marvin, et al.
Published: (2025) -
VMT19937: A SIMD-Friendly Pseudo Random Number Generator based on Mersenne Twister 19937
by: Cannizzo, Fabio
Published: (2023) -
TC-MIS: Maximal Independent Set on Tensor-cores
by: Nijhara, Prajjwal, et al.
Published: (2026)