Copertina

Fast multiplication by two's complement addition of numbers represented as a set of polynomial radix 2 indexes, stored as an integer list for massively parallel computation

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Stocks, Mark
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Mathematical Software Distributed, Parallel, and Cluster Computing Data Structures and Algorithms Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A parallel algorithm for the odd two-face shortest k-disjoint path problem
di: Chakraborty, Srijan, et al.
Pubblicazione: (2025)

Distributed Computing From First Principles
di: Odoh, Kenneth
Pubblicazione: (2025)

Proven Distributed Memory Parallelization of Particle Methods
di: Pahlke, Johannes, et al.
Pubblicazione: (2024)

Binsparse: A Specification for Cross-Platform Storage of Sparse Matrices and Tensors
di: Brock, Benjamin, et al.
Pubblicazione: (2025)

Fast Deterministic Distributed Degree Splitting
di: Maus, Yannic, et al.
Pubblicazione: (2026)

Fast Broadcast in Highly Connected Networks
di: Chandra, Shashwat, et al.
Pubblicazione: (2024)

Fast Concurrent Primitives Despite Contention
di: Bender, Michael A., et al.
Pubblicazione: (2026)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
di: Wang, Letong, et al.
Pubblicazione: (2023)

Fast Spanning Tree Sampling in Broadcast Congested Clique
di: Anari, Nima, et al.
Pubblicazione: (2026)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
di: Mordacchini, Matteo, et al.
Pubblicazione: (2025)

Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
di: Polyanskii, Nikita, et al.
Pubblicazione: (2024)

Skip Hash: A Fast Ordered Map Via Software Transactional Memory
di: Rodriguez, Matthew, et al.
Pubblicazione: (2024)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
di: Feist, Dankrad, et al.
Pubblicazione: (2025)

Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
di: Williams, Marvin, et al.
Pubblicazione: (2025)

Restructuring expression dags for efficient parallelization
di: Wilhelm, Martin
Pubblicazione: (2018)

Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation
di: Izumi, Taisuke, et al.
Pubblicazione: (2025)

Efficient Dynamic MaxFlow Computation on GPUs
di: Kannappan, Shruthi, et al.
Pubblicazione: (2025)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
di: Blin, Lelia, et al.
Pubblicazione: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
di: Jakob, Manuel, et al.
Pubblicazione: (2025)

Perfect Matching with Few Link Activations
di: Mirault, Hugo, et al.
Pubblicazione: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
di: Ghaffari, Mohsen, et al.
Pubblicazione: (2025)

Designing Parallel Algorithms for Community Detection using Arachne
di: Li, Fuhuan, et al.
Pubblicazione: (2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
di: Gil, Yuval, et al.
Pubblicazione: (2025)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
di: Chang, Yi-Jun, et al.
Pubblicazione: (2022)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
di: McCoy, Hunter, et al.
Pubblicazione: (2025)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
di: Bui, Hong Duc, et al.
Pubblicazione: (2024)

A Scalable and Unified Framework to Weighted Rank Aggregation
di: Carmel, Amir, et al.
Pubblicazione: (2026)

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
di: Dang'ana, Michael
Pubblicazione: (2026)

Distributed Santa Claus via Global Rounding
di: de Vos, Tijn, et al.
Pubblicazione: (2026)

On Distributed Computation of the Minimum Triangle Edge Transversal
di: Censor-Hillel, Keren, et al.
Pubblicazione: (2024)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
di: Baumecker, Malte, et al.
Pubblicazione: (2025)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
di: Yang, Mingqi
Pubblicazione: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
di: Wang, Letong, et al.
Pubblicazione: (2024)

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
di: Dindoost, Mohammad, et al.
Pubblicazione: (2025)

Improved Byzantine Agreement under an Adaptive Adversary
di: Dufoulon, Fabien, et al.
Pubblicazione: (2025)

Constrained Cuts, Flows, and Lattice-Linearity
di: Streit, Robert, et al.
Pubblicazione: (2025)

Time-Optimal and Energy-Efficient Deterministic Consensus
di: Meir, Shachar, et al.
Pubblicazione: (2025)

Two Efficient Message-passing Exclusive Scan Algorithms
di: Träff, Jesper Larsson
Pubblicazione: (2026)

BLEST: Blazingly Efficient BFS using Tensor Cores
di: Elbek, Deniz, et al.
Pubblicazione: (2025)

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
di: Flin, Maxime, et al.
Pubblicazione: (2026)