نتائج البحث

Parallel lightweight wavelet tree, suffix array and FM-index construction

• Authors : Julian Labeit; Julian Shun; Guy E. Blelloch

Subjects: Compressed suffix array; Analysis of parallel algorithms; Cost efficiency

• Source: DCC

تفاصيل العنوان

Some Sequential Algorithms are Almost Always Parallel

• Authors : Guy E. Blelloch

Subjects: Analysis of parallel algorithms; Theoretical computer science; Linear programming

• Source: SPAAPODC

تفاصيل العنوان

Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers

• Authors : Yuan Tang; Harsha Vardhan Simhadri; David Dinh

Subjects: FOS: Computer and information sciences; G.4; Analysis of parallel algorithms

• Source: SPAA

تفاصيل العنوان

Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis

• Authors : Kristopher Jetviroj; Michael T. Goodrich; William E. Devanny

Subjects: Discrete mathematics; FOS: Computer and information sciences; Analysis of parallel algorithms

• Source: SPAA

تفاصيل العنوان

Parallel computation on interval graphs: algorithms and experiments

• Authors : K. Marcus; Afonso Ferreira; I. Guérin Lassous

Subjects: Connected component; Clique; Analysis of parallel algorithms

• Source: Concurrency and Computation: Practice and Experience. 14:885-910

تفاصيل العنوان

A Comparative Review of Component Tree Computation Algorithms

• Authors : Edwin Carlinet; Thierry Géraud;

Subjects: Fractal tree index; Theoretical computer science; Source code

• Source: IEEE Transactions on Image ProcessingIEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2014, 23 (9), pp.3885-3895. ⟨10.1109/TIP.2014.2336551⟩

تفاصيل العنوان

Are lock-free concurrent algorithms practically wait-free?

• Authors : Dan Alistarh; Nir Shavit; Keren Censor-Hillel ...

Subjects: FOS: Computer and information sciences; Analysis of parallel algorithms; Theoretical computer science

• Source: STOCarXivJournal of the ACM

تفاصيل العنوان

Network-Oblivious Algorithms

• Authors : Michele Scquizzato; Gianfranco Bilardi; Andrea Pietracaprina

Subjects: FOS: Computer and information sciences; Theoretical computer science; Computer science

• Source: Bilardi, G, Pietracaprina, A, Pucci, G, Scquizzato, M & Silvestri, F 2016, ' Network-Oblivious Algorithms ', Journal of the ACM, vol. 63, no. 1, 3 .

تفاصيل العنوان

Communication Steps for Parallel Query Processing

• Authors : Dan Suciu; Paraschos Koutris; Paul Beame

Subjects: FOS: Computer and information sciences; Hypergraph; Theoretical computer science

• Source: PODS

تفاصيل العنوان

Communication Lower Bounds and Optimal Algorithms for Programs that Reference Arrays - Part 1

• Authors : Nicholas Knight; Thomas Scanlon; James Demmel

Subjects: Discrete mathematics; Analysis of parallel algorithms; 010102 general mathematics

تفاصيل العنوان