scientific article; zbMATH DE number 1444289

MaRDI QIDQ4953331zbMATH OpenFDO

Authors Xiaotie Deng, P. Dymond

Publication date 22 June 2000

zbMATH Keywords

interprocessor communication

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Recommendations

• A simple randomized parallel algorithm for list-ranking
• Deterministic coin tossing with applications to optimal parallel list ranking
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• scientific article; zbMATH DE number 4064468
• Deterministic parallel list ranking
• On the complexity of list ranking in the parallel external memory model
• Faster optimal parallel prefix sums and list ranking

Cited in

(8)

• Tight bounds on parallel list marking
• List-ranking on interconnection networks.
• Graph algorithms with small communication costs
• scientific article; zbMATH DE number 1696642 (Why is no real title available?)
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• Portable list ranking
• Randomized parallel list ranking for distributed memory multiprocesors
• A simple randomized parallel algorithm for list-ranking

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953331)