Deterministic parallel list ranking (Q808699)

From MaRDI portal

Revision as of 09:36, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Deterministic parallel list ranking	scientific article

Statements

scholarly article

0 references

Deterministic parallel list ranking (English)

0 references

zbMATH Open document ID

0 references

10.1007/BF01759076

0 references

Richard J. Anderson

0 references

Gary Lee Miller

0 references

0 references

publication date

1991

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

List traversal

0 references

list ranking

0 references

MaRDI profile type

MaRDI publication profile

0 references

Deterministic coin tossing with applications to optimal parallel list ranking

0 references

The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time

0 references

Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time

0 references

Faster optimal parallel prefix sums and list ranking

0 references

0 references

Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms

0 references

An Efficient Parallel Biconnectivity Algorithm

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:808699

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q808699&oldid=34857843"