On the public citation graph

Communication Efficient Algorithms for Top-k Selection Problems

https://doi.org/10.1109/ipdps.2016.45

0 signed · 37 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jpdc.1998.1429openalex-snapshot

Randomized Priority Queues for Fast Parallel Access

inferredcites →https://doi.org/10.1007/3-540-49543-6_13openalex-snapshot

“Balls into Bins” — A Simple and Tight Analysis

inferredcites →https://doi.org/10.1007/978-3-540-74466-5_72openalex-snapshot

MCSTL: The Multi-core Standard Template Library

inferredcites →https://doi.org/10.1007/978-3-642-25591-5_39openalex-snapshot

Sorting, Searching, and Simulation in the MapReduce Framework

inferredcites →https://doi.org/10.1007/bf00128644openalex-snapshot

Parallel heap: An optimal parallel priority queue

inferredcites →https://doi.org/10.1007/s00453-011-9584-4openalex-snapshot

Optimal Tracking of Distributed Heavy Hitters and Quantiles

inferredcites →https://doi.org/10.1016/0743-7315(91)90022-2openalex-snapshot

Merging multiple lists on hierarchical-memory multiprocessors

inferredcites →https://doi.org/10.1016/j.parco.2009.09.001openalex-snapshot

Two-tree algorithms for full bandwidth broadcast, reduction and scan

inferredcites →https://doi.org/10.1016/s0022-0000(03)00026-6openalex-snapshot

Optimal aggregation algorithms for middleware

inferredcites →https://doi.org/10.1017/cbo9780511813603openalex-snapshot

Probability and Computing

inferredcites →https://doi.org/10.1109/71.342126openalex-snapshot

CCL: a portable and tunable collective communication library for scalable parallel computers

inferredcites →https://doi.org/10.1109/bigdata.2013.6691549openalex-snapshot

Communication efficient algorithms for fundamental big data problems

inferredcites →https://doi.org/10.1109/ipdps.2013.121openalex-snapshot

Exascale computing - A fact or a fiction?

inferredcites →https://doi.org/10.1109/ipdps.2016.45openalex-snapshot

Communication Efficient Algorithms for Top-k Selection Problems

inferredcites →https://doi.org/10.1109/sfcs.1989.63509openalex-snapshot

On the network complexity of selection

inferredcites →https://doi.org/10.1145/1011767.1011798openalex-snapshot

Efficient top-K query calculation in distributed networks

inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot

Sorting networks and their applications

inferredcites →https://doi.org/10.1145/174130.174145openalex-snapshot

Randomized parallel algorithms for backtrack search and branch-and-bound computation

inferredcites →https://doi.org/10.1145/2213556.2213596openalex-snapshot

Randomized algorithms for tracking distributed count, frequencies, and ranks

inferredcites →https://doi.org/10.1145/2755573.2755595openalex-snapshot

Practical Massively Parallel Sorting

inferredcites →https://doi.org/10.1145/2858788.2688547openalex-snapshot

The lock-free k-LSM relaxed priority queue

inferredcites →https://doi.org/10.1145/360680.360691openalex-snapshot

Expected time bounds for selection

inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot

A Bridging Model for Parallel Computation

inferredcites →https://doi.org/10.1145/872757.872764openalex-snapshot

Distributed top-k monitoring

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-981-95-5716-5_35openalex-snapshot

Probabilistic Optimization of Top-k Aggregation in Distributed Environments

inferred← citeshttps://doi.org/10.1007/s00607-026-01724-yopenalex-snapshot

Fast and accurate distributed top-k aggregation

inferred← citeshttps://doi.org/10.1016/j.parco.2019.102588openalex-snapshot

Parallel selection on GPUs

inferred← citeshttps://doi.org/10.1109/bigdata50022.2020.9378039openalex-snapshot

Connecting MapReduce Computations to Realistic Machine Models

inferred← citeshttps://doi.org/10.1109/icpp.2016.49openalex-snapshot

DC-Top-k: A Novel Top-k Selecting Algorithm and Its Parallelization

inferred← citeshttps://doi.org/10.1109/ipdps.2018.00074openalex-snapshot

Communication Efficient Checking of Big Data Operations

inferred← citeshttps://doi.org/10.1109/ipdpsw.2019.00088openalex-snapshot

Approximate and Exact Selection on GPUs

inferred← citeshttps://doi.org/10.1109/tac.2025.3541117openalex-snapshot

Fast Networked Data Selection via Distributed Smoothed Quantile Estimation

inferred← citeshttps://doi.org/10.1145/2755573.2755595openalex-snapshot

Practical Massively Parallel Sorting

inferred← citeshttps://doi.org/10.1145/2755573.2755616openalex-snapshot

MultiQueues: Simple Relaxed Concurrent Priority Queues

inferred← citeshttps://doi.org/10.1145/3549934openalex-snapshot

Parallel Weighted Random Sampling

inferred← citeshttps://doi.org/10.1145/3771738openalex-snapshot

The MultiQueue: A Simple and Fast Relaxed Concurrent Priority Queue

showing the first 12 of 13 · page through all 13

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.