Resultados da pesquisa - "Mathematics of computing."

DESI methods for stiff initial-value problems. Por Butcher, J. C.

Sparsification-a technique for speeding up dynamic graph algorithms. Por Eppstein, David

Asymmetric k-center is log* n-hard to approximate. Por Chuzhoy, Julia

Mathematical Programming [ejournal].

Available for University of the Philippines Diliman via Springerlink. Click here to access

Transforming cabbage into turnip polynomial algorithm for sorting signed permutations by reversals. Por Hannenhalli, Sridhar

Applying classification techniques to remotely-collected program execution data. Por Haran, Murali

Polynomial-time data reduction for dominating set. Por Alber, Jochen

Smoothed analysis of algorithms Why the simplex algorithm usually takes polynomial time. Por Spielman, Daniel A.

Fractional Calculus for Scientists and Engineers Por Ortigueira, Manuel Duarte

Available for University of the Philippines Diliman via SpringerLink. Click here to access

Edge-disjoint routing in plane switch graphs in linear time. Por Hochstein, J.M