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 ...

If you’re under the impression that something as simple as sorting numbers is dull, think again. This visualization lets you see and hear fifteen different algorithms sift their way through a ...

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 ...

An empirical comparison of existing algorithms for the computer generation of exact D-optimal experimental designs is carried out. Among algorithms considered were those due to Wynn, Mitchell, Fedorov ...

A comparison and evaluation is made of recent proposals for multivariate matched sampling in observational studies, where the following three questions are answered: (1) Algorithms: In current ...