We present polynomial time algorithms for the design of maximum rate linear multicast network codes by combining techniques from linear algebra, network flows, and (de)randomization.Expand

We introduce the skew algorithm for suffix array construction over integer alphabets that can be implemented to run in linear time using integer sorting as its only nontrivial subroutine.Expand

The single source shortest path problem for arbitrary directed graphs with n nodes, m edges and nonnegative edge weights can sequentially be solved using O(n.log n + log 2 n) time and O( n + m + d L.L) total average-case time, where L denotes the maximum shortest path weight from the source node s to any node reachable from s.Expand

We present the software library STXXL that is an implementation of the C++ standard template library (STL) for processing huge data sets that can fit only on hard disks.Expand

We develop an algorithmic approach---transit node routing---that allows us to reduce quickest-path queries in road networks to a small number of table lookups.Expand