Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Renbing Xiong

dblp:45/446 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithms and data structures · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel algorithms		 0.011993
Parallel Median Splitting and k-Splitting with Application to Merging and Sorting · IEEE Trans. Parallel Distributed Syst. 1993
Algorithms and data structures › sequence algorithms › sorting
parallel sorting		 0.011993
Parallel Median Splitting and k-Splitting with Application to Merging and Sorting · IEEE Trans. Parallel Distributed Syst. 1993
Algorithms and data structures
sorting and merging		 0.011993
Parallel Median Splitting and k-Splitting with Application to Merging and Sorting · IEEE Trans. Parallel Distributed Syst. 1993
Parallel and multicore computing › parallel algorithms › parallel algorithm design
MIMD algorithms		 0.011993
Parallel Median Splitting and k-Splitting with Application to Merging and Sorting · IEEE Trans. Parallel Distributed Syst. 1993
Parallel and multicore computing
parallel programming models		 0.011993
Parallel Median Splitting and k-Splitting with Application to Merging and Sorting · IEEE Trans. Parallel Distributed Syst. 1993

Methods — techniques the papers use, named apart from their topics

median splitting · 0.0k-splitting · 0.0CREW/EREW parallel algorithms · 0.0
YearPublicationVenuePosition
1993 A Parallel Quicksort Algorithm
Theodore Brown, Renbing Xiong
 J. Parallel Distributed Comput.2
1993 Parallel Median Splitting and k-Splitting with Application to Merging and Sorting
abstract
Multiple-instruction multiple-data (MIMD) algorithms that use multiple processors to do median splitting, k-splitting and parallel splitting into t equal sections are presented. Both concurrent read, exclusive write (CREW) and exclusive read, exclusive write (EREW) versions of the algorithms are given. It is shown that a k-splitting problem can be easily converted into a median-splitting problem. Methods for finding multiple split points quickly and application of k-splitting to merging and sorting are discussed.>
Renbing Xiong, Theodore Brown
 IEEE Trans. Parallel Distributed Syst.1