Results 241 to 250 of about 216,568 (279)
Some of the next articles are maybe not open access.
1993
Abstract In this section we will discuss one of the first parallel sorting algorithms to be developed. DEFINillON 3.1. A sequence of numbers will be called bitonic if either of the following two conditions is satisfied: It starts out being monotonically increasing up to some point and then becomes monotonically decreasing.
openaire +1 more source
Abstract In this section we will discuss one of the first parallel sorting algorithms to be developed. DEFINillON 3.1. A sequence of numbers will be called bitonic if either of the following two conditions is satisfied: It starts out being monotonically increasing up to some point and then becomes monotonically decreasing.
openaire +1 more source
2011
This chapter presents two sorting algorithms – Mergesort and Quicksort – that work quickly even for a large number of objects. The author explains the algorithms, compares them theoretically, and suggests how they can be coded.
openaire +1 more source
This chapter presents two sorting algorithms – Mergesort and Quicksort – that work quickly even for a large number of objects. The author explains the algorithms, compares them theoretically, and suggests how they can be coded.
openaire +1 more source
Incomplete lineage sorting and phenotypic evolution in marsupials
Cell, 2022Shaohong Feng +2 more
exaly
Endosomal sorting and signalling: an emerging role for sorting nexins
Nature Reviews Molecular Cell Biology, 2008Peter J Cullen
exaly
Receptor downregulation and multivesicular-body sorting
Nature Reviews Molecular Cell Biology, 2002David Katzmann +2 more
exaly