While targeted at GPUs, these algo- rithms should also be well-suited for other manycore pro- cessors. 1. Introduction Sorting is a computational building block of fundamental importance and is one of the most widely studied algorith- mic problems. Many algorithms rely on the availability of ...
empirical search to determine the best form of the algorithm and the use of characteristics of the input data to select the best algo-rithm at run time Our runtime selection process makes use of the number of records to sort and a characteristic of the distribution of the keys,called ...
demonstratedemonstrateexperimentallyexperimentallyexperimentallythatthatthatourourouralgorithmalgorithmalgorithmhashashasfavourablefavourablefavourable performanceperformanceperformancecomparedcomparedcomparedtototootherotherotherapproaches,approaches,approaches,andandandarguearguearguethatthatthatourourouralgo-algo-algo- rithmrithm...
reasonable time if the graphs under consideration are not too large. That is the reason that researchers began to think about OBDD based symbolic graph algorithms, e.g., symbolic topological sorting =-=[17]-=-, symbolic computation of strongly connected components [6] and so on. Of course,...
The author would like to thank Peyman Afshani and Seth Pettie for interesting discussions during the author’s visit to the center MADALGO in January 2014; Jouni Siren for detecting a central error in a previous version of this work; Gonzalo Navarro for suggesting the application to the boostin...