:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Gomes, Pedro Silva, Rodrigues, Miguel Boaventura, Baquero, Carlos
Formato:	Preprint
Publicado:	2025
Materias:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms H.0; E.4; D.4
Acceso en línea:	https://arxiv.org/abs/2505.01144
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Rateless Bloom Filters: Set Reconciliation for Divergent Replicas with Variable-Sized Elements
por: Gomes, Pedro Silva, et al.
Publicado: (2025)

Efficient Parallel Multi-Hop Reasoning: A Scalable Approach for Knowledge Graph Analysis
por: Tithi, Jesmin Jahan, et al.
Publicado: (2024)

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

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers
por: Adams, Philip, et al.
Publicado: (2025)

Distributed Delta-Coloring under Bandwidth Limitations
por: Maus, Yannic, et al.
Publicado: (2024)

Optimal Secure Coded Distributed Computation over all Fields
por: Soto, Pedro
Publicado: (2025)

Distributed Lovász Local Lemma under Bandwidth Limitations
por: Halldórsson, Magnús M., et al.
Publicado: (2024)

The World's Fastest Matching Engine Algorithm
por: Yoon, Jake
Publicado: (2026)

Techniques for Authenticating Quantile Digests
por: Scala, Alessandro
Publicado: (2024)

The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
por: Almeida, Paulo Sérgio, et al.
Publicado: (2024)

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
por: Censor-Hillel, Keren, et al.
Publicado: (2023)

Pattern matching algorithms in Blockchain for network fees reduction
por: Susik, Robert, et al.
Publicado: (2022)

Auditable Shared Objects: From Registers to Synchronization Primitives
por: Attiya, Hagit, et al.
Publicado: (2025)

Construction of a Byzantine Linearizable SWMR Atomic Register from SWSR Atomic Registers
por: Kshemkalyani, Ajay D., et al.
Publicado: (2024)

Relaxation for Efficient Asynchronous Queues
por: Baldwin, Samuel, et al.
Publicado: (2025)

Computing in a Faulty Congested Clique
por: Censor-Hillel, Keren, et al.
Publicado: (2025)

Round and Communication Efficient Graph Coloring
por: Chang, Yi-Jun, et al.
Publicado: (2024)

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

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

Efficient Enumeration of Large Maximal k-Plexes
por: Cheng, Qihao, et al.
Publicado: (2024)

Parallel Contraction Hierarchies Can Be Efficient and Scalable
por: Wan, Zijin, et al.
Publicado: (2024)

Parallel and (Nearly) Work-Efficient Dynamic Programming
por: Ding, Xiangyun, et al.
Publicado: (2024)

Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
por: Censor-Hillel, Keren, et al.
Publicado: (2025)

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

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

Energy-Efficient Maximal Independent Sets in Radio Networks
por: Banasik, Dominick, et al.
Publicado: (2025)

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

Efficient calculation of available space for multi-NUMA virtual machines
por: Gudkov, Andrei, et al.
Publicado: (2026)

Efficient Distributed Data Structures for Future Many-core Architectures
por: Fatourou, Panagiota, et al.
Publicado: (2024)

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
por: Chang, Yi-Jun
Publicado: (2023)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
por: Chang, Yi-Jun, et al.
Publicado: (2026)

ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting
por: Shovan, S. M., et al.
Publicado: (2025)

MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads
por: Manor, Daniel, et al.
Publicado: (2025)

Regular mixed-radix DFT matrix factorization for in-place FFT accelerators
por: Salishev, Sergey
Publicado: (2025)

A Reexamination of the Communication Bandwidth Cost Analysis of A Parallel Recursive Algorithm for Solving Triangular Systems of Linear Equations
por: Tang, Yuan
Publicado: (2024)

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

DiaQ: Efficient State-Vector Quantum Simulation
por: Chundury, Srikar, et al.
Publicado: (2024)

Quality Control in Open-Ended Crowdsourcing: A Survey
por: Chai, Lei, et al.
Publicado: (2024)

Building the Palmetto API: Adding granular permissions and caching to the Slurm REST API without sacrificing compatibility
por: Godfrey, Ben, et al.
Publicado: (2026)

How to Relax Instantly: Elastic Relaxation of Concurrent Data Structures
por: von Geijer, Kåre, et al.
Publicado: (2024)