1993•Lecture notes in computer scienceOpen access

Approximate and exact deterministic parallel selection

Shiva Chaudhuri, Torben Hagerup, Rajeev Raman

Open full text 32 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 32 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Log-log plot, Speedup, Binary logarithm, Combinatorics, Selection (genetic algorithm), Rank (graph theory), Running time, Time complexity

Back to paper search Browse research topics Original source

Approximate and exact deterministic parallel selection — Research Paper | ScholarLens