Children as young as 4 years old are capable of finding efficient solutions to complex problems, such as independently inventing sorting algorithms developed by computer scientists. The scientists ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

GPU-based sorting algorithms have emerged as a crucial area of research due to their ability to harness the immense parallel processing power inherent in modern graphics processing units. By ...

The University Research Computing Facility (URCF) is pleased to announce our Summer 2025 workshop series. The URCF provides support for computational research at Drexel. These workshops are open to ...

Abstract: This research work introduces a clustering-based in-place sorting algorithm, cluster sort. It is designed in such a way that it improves sorting efficiency by using data locality. It works ...

The original version of this story appeared in Quanta Magazine. Computer scientists often deal with abstract problems that are hard to comprehend, but an exciting new algorithm matters to anyone who ...

The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal. Computer scientists often ...

Abstract: In the realm of computer science, sorting algorithms play a pivotal role in optimising data organisation and retrieval processes across various applications. This paper presents a ...