Constructing disjoint paths on expander graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A random NC algorithm for depth first search
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Parallel and output sensitive algorithms for combinatorial and linear algebra problems
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Fast parallel matching in expander graphs
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Derandomization through approximation: an NC algorithm for minimum cuts
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of 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
A Las Vegas O(n2.38 algorithm for the cardinality of a maximum matching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Efficient Routing in Networks with Long Range Contacts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Cardinality constrained minimum cut problems: complexity and algorithms
Discrete Applied Mathematics
Online client-server load balancing without global information
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Processor efficient parallel matching
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
How (and why) to introduce Monte Carlo randomized algorithms into a basic algorithms course?
Journal of Computing Sciences in Colleges
Improved deterministic approximation algorithms for Max TSP
Information Processing Letters
Teaching the power of randomization using a simple game
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Approximating weighted matchings in parallel
Information Processing Letters
An algebraic algorithm for weighted linear matroid intersection
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Maximum weight bipartite matching in matrix multiplication time
Theoretical Computer Science
Improved deterministic approximation algorithms for Max TSP
Information Processing Letters
Algorithms and theory of computation handbook
Exponential space complexity for symbolic maximum flow algorithms in 0-1 networks
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
A new NC-algorithm for finding a perfect matching in d-regular bipartite graphs when d is small
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Weighted bipartite matching in matrix multiplication time
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the bipartite unique perfect matching problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Parallel algorithms for the assignment and minimum-cost flow problems
Operations Research Letters
Enriching introductory programming courses with non-intuitive probability experiments component
Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education
A combinatoric interpretation of dual variables for weighted matching and f-factors
Theoretical Computer Science
A fast parallel algorithm for minimum-cost small integral flows
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Log-Space Algorithms for Paths and Matchings in k-Trees
Theory of Computing Systems
| Hi-index | 0.00 |