There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on ...

László Babai describes his new algorithm at the University of Chicago on November 10. The algorithm solves the tricky graph isomorphism problem faster than ever before. Jeremy Kun By Andrew Grant ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Markus Kalisch, Peter Bühlmann, Robustification of the PC-Algorithm for Directed Acyclic Graphs, Journal of Computational and Graphical Statistics, Vol. 17, No. 4 (December 2008), pp. 773-789 ...

APL researchers have demonstrated that a quantum algorithm can be used to speed up an information analysis task that ...

Robert F. Ling, Comparison of Several Algorithms for Computing Sample Means and Variances, Journal of the American Statistical Association, Vol. 69, No. 348 (Dec., 1974), pp. 859-866 ...

“The new algorithm is a remarkable tour de force,” said Giuseppe Italiano, a computer scientist at Luiss University and a co-author of the 1996 paper describing what is now the second-fastest ...