Data structures and network algorithms
Data structures and network algorithms
Can a maximum flow be computed in o(nm) time?
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Verification and sensitivity analysis of minimum spanning trees in linear time
SIAM Journal on Computing
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
Random sampling in cut, flow, and network design problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Finding minimum spanning forests in logarithmic time and linear work using random sampling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Average case analysis of dynamic graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Matroid decomposition methods for the set maxima problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the Analysis of On-Line Database Reorganization
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Dynamic Reorganization of Object Databases
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Filtering: a method for solving graph problems in MapReduce
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Geometric minimum spanning trees with GEOFILTERKRUSKAL*
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
| Hi-index | 0.00 |