Imagen de Portada

A Scalable and Unified Framework to Weighted Rank Aggregation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Carmel, Amir, Das, Debarati, Nguyen, Tien-Long
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Scalable Fault-Tolerant MapReduce
por: Hespe, Demian, et al.
Publicado: (2024)

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

Weighted Matching in a Poly-Streaming Model
por: Ullah, Ahammed, et al.
Publicado: (2025)

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

PASGAL: Parallel And Scalable Graph Algorithm Library
por: Dong, Xiaojun, et al.
Publicado: (2024)

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

Distributed Reductions for the Maximum Weight Independent Set Problem
por: Borowitz, Jannick, et al.
Publicado: (2025)

Fully Scalable MPC Algorithms for Euclidean k-Center
por: Czumaj, Artur, et al.
Publicado: (2025)

Fully Scalable MPC Algorithms for Clustering in High Dimension
por: Czumaj, Artur, et al.
Publicado: (2023)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
por: Assadi, Sepehr
Publicado: (2023)

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
por: Manoharan, Vignesh, et al.
Publicado: (2023)

Enhancing Scalability and Performance in Influence Maximization with Optimized Parallel Processing
por: Wu, Hanjiang, et al.
Publicado: (2024)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
por: Gil, Yuval
Publicado: (2024)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
por: Ashvinkumar, Vikrant, et al.
Publicado: (2023)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
por: Chang, Yi-Jun, et al.
Publicado: (2023)

Meta-Theorems for Cuttable Distributed Problems
por: Bonamy, Marthe, et al.
Publicado: (2026)

Zarr-Based Chunk-Level Cumulative Sums in Reduced Dimensions
por: Zhang, Hailiang, et al.
Publicado: (2025)

Orientation does not help with 3-coloring a grid in online-LOCAL
por: Boudier, Thomas, et al.
Publicado: (2025)

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

Optimal Distributed Replacement Paths
por: Chang, Yi-Jun, et al.
Publicado: (2025)

Towards Scalable and Practical Batch-Dynamic Connectivity
por: De Man, Quinten, et al.
Publicado: (2024)

A Simple Distributed Deterministic Planar Separator
por: Abd-Elhaleem, Yaseen, et al.
Publicado: (2026)

A Simple and Robust Protocol for Distributed Counting
por: Cohen, Edith, et al.
Publicado: (2025)

A Hybrid Vectorized Merge Sort on ARM NEON
por: Zhou, Jincheng, et al.
Publicado: (2024)

A Fault-Tolerant Version of Safra's Termination Detection Algorithm
por: Fokkink, Wan, et al.
Publicado: (2026)

A Distributed Conductance Tester Without Global Information Collection
por: Batu, Tugkan, et al.
Publicado: (2023)

A Parallel Scan Algorithm in the Tensor Core Unit Model
por: Zouzias, Anastasios, et al.
Publicado: (2024)

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

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
por: Li, Qian, et al.
Publicado: (2024)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
por: Cambus, Mélanie, et al.
Publicado: (2022)

Can Like Attract Like? A Study of Homonymous Gathering in Networks
por: Devismes, Stéphane, et al.
Publicado: (2025)

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
por: Sahu, Abhijeet, et al.
Publicado: (2026)

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

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
por: Hsieh, Chou-Ying, et al.
Publicado: (2024)

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

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

BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
por: Coluzzi, Massimo, et al.
Publicado: (2024)

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

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