Search Results - "The 31st ACM Symposium on Parallelism in Algorithms and Architectures" :: K.UTB vyhledávací portál

Loading…

Massively Parallel Computation via Remote Memory Access

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures (01.09.2021)

Get full text

Journal Article

Loading…

Delay-Free Concurrency on Faulty Persistent Memory

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

Parallel Batch-Dynamic Graph Connectivity

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

Massively Parallel Computation via Remote Memory Access

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

Near Optimal Coflow Scheduling in Networks

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

Theoretically-Efficient and Practical Parallel In-Place Radix Sorting

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures (17.06.2019)

Get full text

Conference Proceeding

Loading…

Blockchain Abstract Data Type

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

Dynamic Algorithms for the Massively Parallel Computation Model

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

Best-of-Three Voting on Dense Graphs

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

Multiversion Concurrency with Bounded Delay and Precise Garbage Collection

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

Distributed Transactional Systems Cannot Be Fast

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

Reduced I/O Latency with Futures (Brief Announcement)

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

Writeback-Aware Caching (Brief Announcement)

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Loading…

Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement)

Published in The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Get full text

Conference Proceeding

Refine Results

Format

Subject Area

Topic

Language

Year of Publication

Database