ACM transactions on algorithms.

Available for University of the Philippines Diliman via ACM Digital Library . Click here to access

Computer science community portal [electronic resource]

احصل على النص الكامل

A new general derandomization method. حسب Andreev, Alexander E.

Time-work tradeoffs for parallel algorithms. حسب Spencer, Thomas H.

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. حسب Holm, Jacob

A combinatorial strongly polynomial algorithm for minimizing submodular functions. حسب Iwata, Satoru

A new approach to dynamic all pairs shortest paths. حسب Demetrescu, Camil

Compact oracles for reachability and approximate distances in planar diagraphs. حسب Thorup, M.

A unified approach to approximating resource allocation and scheduling. حسب Bar-Noy, Amotz