We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities in m 1+o(1) time. Our ...

We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted functions. We assume ...

Abstract: This paper compares the properties of infinitely recurring sequences and terminating sequences generated by arithmetic division with the properties of linear feedback shift registers. The ...

We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, Maximum Flow and Minimum-Cost Flow in ...