Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,951,171 papers from all fields of science
Search
Sign In
Create Free Account
List ranking
In parallel algorithms, the list ranking problem involves determining the position, or rank, of each item in a linked list. That is, the first item…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Linked list
Parallel algorithm
Prefix sum
Broader (1)
Parallel computing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Analysis of classic algorithms on highly-threaded many-core architectures
Lin Ma
,
R. Chamberlain
,
Kunal Agrawal
,
Chen Tian
,
Ziang Hu
Future generations computer systems
2017
Corpus ID: 3608803
2015
2015
PENERAPAN FUZZY C-MEANS DALAM SISTEM PENDUKUNG KEPUTUSAN UNTUK PENENTUAN PENERIMA BANTUAN LANGSUNG MASYARAKAT (BLM) PNPM-MPd(Studi Kasus : PNPM-MPd Kec. Ngadirojo Kab. Pacitan)
Aziz Ahmadi
,
S. Hartati
2015
Corpus ID: 109589755
PNPM Mandiri Perdesaan adalah program untuk mempercepat penanggulangan kemiskinan secara terpadu dan berkelanjutan. Bentuk…
Expand
Highly Cited
2004
Highly Cited
2004
Engineering an External Memory Minimum Spanning Tree Algorithm
Roman Dementiev
,
P. Sanders
,
Dominik Schultes
,
J. F. Sibeyn
IFIP TCS
2004
Corpus ID: 7032958
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than…
Expand
2000
2000
Portable list ranking: an experimental study
I. G. Lassous
,
J. Gustedt
JEAL
2000
Corpus ID: 2115912
We present and analyze two portable algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM). We…
Expand
2000
2000
Efficient List Ranking Algorithms on Reconfigurable Mesh
Sung-Ryul Kim
,
Kunsoo Park
International Computing and Combinatorics…
2000
Corpus ID: 29898159
List ranking is one of the fundamental techniques in parallel algorithm design. Hayashi, Nakano, and Olariu proposed a…
Expand
1997
1997
Better trade-offs for parallel list ranking
J. F. Sibeyn
ACM Symposium on Parallelism in Algorithms and…
1997
Corpus ID: 14479635
An earlier parallel list ranking algorithm performs well for problem sizes N that are extremely large in comparison to the number…
Expand
1997
1997
Practical Parallel List Ranking
J. F. Sibeyn
,
Frank Guillaume
,
T. Seidel
J. Parallel Distributed Comput.
1997
Corpus ID: 17423811
Parallel list ranking is a hard problem due to its extreme degree of irregularity. Also because of its linear sequential…
Expand
1996
1996
List Ranking on Interconnection Networks
J. F. Sibeyn
Euro-Par, Vol. I
1996
Corpus ID: 2573657
The list-ranking problem is considered for parallel computers which communicate through an interconnection network. Each PU holds…
Expand
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Robert H. B. Netzer
International Workshop on Languages and Compilers…
1993
Corpus ID: 10717466
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly…
Expand
1991
1991
A Unified Approach to Parallel Depth-First Traversals of General Trees
Calvin Ching-Yuen Chen
,
Sajal K. Das
,
S. Akl
Information Processing Letters
1991
Corpus ID: 7817950
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE