Imagen de Portada

Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Prokopenko, Andrey, Lebrun-Grandié, Damien
Formato:	Preprint
Publicado:	2024
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

The ArborX library: version 2.0
por: Prokopenko, Andrey, et al.
Publicado: (2025)

Optimal local certification on graphs of bounded pathwidth
por: Baterisna, Dan Alden, et al.
Publicado: (2025)

Near-optimal population protocols on bounded-degree trees
por: Rybicki, Joel, et al.
Publicado: (2026)

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

Fast algorithms for Vizing's theorem on bounded degree graphs
por: Bernshteyn, Anton, et al.
Publicado: (2023)

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

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

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

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

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

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
por: Liu, Quanquan C., et al.
Publicado: (2024)

Hash & Adjust: Competitive Demand-Aware Consistent Hashing
por: Pourdamghani, Arash, et al.
Publicado: (2024)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
por: Ghaffari, Mohsen, et al.
Publicado: (2024)

Parallel Integer Sort: Theory and Practice
por: Dong, Xiaojun, et al.
Publicado: (2024)

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

Low-Distortion Clustering in Bounded Growth Graphs
por: Chang, Yi-Jun, et al.
Publicado: (2024)

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

Cuckoo Heavy Keeper and the balancing act of maintaining heavy hitters in stream processing
por: Ngo, Vinh Quang, et al.
Publicado: (2024)

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

Dynamic Maximal Matching in Clique Networks
por: Li, Minming, et al.
Publicado: (2024)

Massively Parallel Ruling Set Made Deterministic
por: Giliberti, Jeff, 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)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
por: Sanders, Peter, et al.
Publicado: (2024)

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

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

Deterministic Expander Routing: Faster and More Versatile
por: Chang, Yi-Jun, et al.
Publicado: (2024)

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

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

History Trees and Their Applications
por: Viglietta, Giovanni
Publicado: (2024)

Adaptive Massively Parallel Coloring in Sparse Graphs
por: Latypov, Rustam, et al.
Publicado: (2024)

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

Distributed Download from an External Data Source in Faulty Majority Settings
por: Augustine, John, et al.
Publicado: (2024)

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

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

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

Global certification via perfect hashing
por: Bousquet, Nicolas, et al.
Publicado: (2024)

Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
por: Liu, Quanquan C., et al.
Publicado: (2024)

Content-Oblivious Leader Election on Rings
por: Frei, Fabian, et al.
Publicado: (2024)

Online Load and Graph Balancing for Random Order Inputs
por: Im, Sungjin, et al.
Publicado: (2024)

Sorting in One and Two Rounds using $t$-Comparators
por: Gelles, Ran, et al.
Publicado: (2024)