:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Dutta, Ayan, Dasgupta, Prithviraj, Nelson, Carl
Formato:	Preprint
Publicado:	2016
Materias:	Robotics Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/1602.03104
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
por: Flin, Maxime, et al.
Publicado: (2024)

Distributed Stochastic Graph Algorithms
por: Censor-Hillel, Keren, et al.
Publicado: (2026)

Distributed Graph Algorithms with Predictions
por: Boyar, Joan, et al.
Publicado: (2025)

Location-Aware Dispersion on Anonymous Graphs
por: Himani, et al.
Publicado: (2026)

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

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

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
por: Bonamy, Marthe, et al.
Publicado: (2025)

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

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

Dispersion is (Almost) Optimal under (A)synchrony
por: Kshemkalyani, Ajay D., et al.
Publicado: (2025)

DAG-Inducing Problems and Algorithms
por: Gupta, Arya Tanmay, et al.
Publicado: (2023)

Eventually Lattice-Linear Algorithms
por: Gupta, Arya Tanmay, et al.
Publicado: (2023)

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

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

Agentic Distributed Computing
por: Kshemkalyani, Ajay D., et al.
Publicado: (2025)

Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents
por: Chand, Prabhat Kumar, et al.
Publicado: (2025)

Optimal Dispersion Under Asynchrony
por: Pattanayak, Debasish, 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)

Parallel Algorithms for Hierarchical Nucleus Decomposition
por: Shi, Jessica, et al.
Publicado: (2023)

Encoding Schemes for Parallel In-Place Algorithms
por: Hutton, Chase, et al.
Publicado: (2025)

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
por: Akker, Erik van den, et al.
Publicado: (2024)

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

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

Massively Parallel Algorithms for Approximate Shortest Paths
por: Dory, Michal, et al.
Publicado: (2024)

Decentralized Distributed Graph Coloring: Cluster Graphs
por: Flin, Maxime, et al.
Publicado: (2024)

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

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

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

Almost Optimal Algorithms for Token Collision in Anonymous Networks
por: Bai, Sirui, et al.
Publicado: (2024)

Parallel Algorithms for the One Sided Crossing Minimization Problem
por: Popa, Bogdan-Ioan, 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)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
por: De Man, Quinten, et al.
Publicado: (2025)

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

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
por: Dhulipala, Laxman, et al.
Publicado: (2024)

Distributed Maximum Flow in Planar Graphs
por: Abd-Elhaleem, Yaseen, et al.
Publicado: (2024)

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

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