Skip to main navigation
Skip to search
Skip to main content
NYU Scholars Home
Help & FAQ
Home
Profiles
Research units
Research output
Search by expertise, name or affiliation
On probabilistic networks for selection, merging, and sorting
T. Leighton, Y. Ma, T. Suel
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On probabilistic networks for selection, merging, and sorting'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Success Probability
100%
Probabilistic Networks
100%
Tight Bounds
66%
Probabilistic Sorting
33%
Probabilistic Merging
33%
Merging Network
33%
K-selection
33%
High Probability
33%
Log-log
33%
Random Inputs
33%
Selection Network
33%
Lower Order Terms
33%
Comparator Networks
33%
Sorting Networks
33%
Computer Science
Probabilistic Network
100%
Success Probability
100%
Small Positive Constant
66%
Constant Factor
33%
Comparator
33%
Mathematics
Probability Theory
100%
Positive Constant
50%
Correct Result
25%
Random Input
25%
Sorting Networks
25%
Comparator
25%
Constant Factor
25%
Permutation
25%
Lower Order Term
25%