ACM Computing Surveys (CSUR)
Complexity of network synchronization
Journal of the ACM (JACM)
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A new graphy triconnectivity algorithm and its parallelization
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Fast parallel algorithms for chordal graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Parallel algorithms for minimum cuts and maximum flows in planar networks
Journal of the ACM (JACM)
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
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
New lower bounds for parallel computation
Journal of the ACM (JACM)
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Local reorientation, global order, and planar topology
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Scans as Primitive Parallel Operations
IEEE Transactions on Computers
High-probability parallel transitive closure algorithms
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Fast hashing on a PRAM—designing by expectation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A parallel randomized approximation scheme for shortest paths
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Parallel Algorithms for Geometric Connected Component Labeling on a Hypercube Multiprocessor
IEEE Transactions on Computers
A comparison of parallel algorithms for connected components
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Trade-offs between communication throughput and parallel time
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for parallel linear programming and other problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Parallelism in sequential functional languages
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Towards modeling the performance of a fast connected components algorithm on parallel machines
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Programming parallel algorithms
Communications of the ACM
An Efficient Parallel Recognition Algorithm For Bipartite-Permutation Graphs
IEEE Transactions on Parallel and Distributed Systems
From algorithm parallelism to instruction-level parallelism: an encode-decode chain using prefix-sum
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Fast deterministic processor allocation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Finding connected components in O(log n loglog n) time on the EREW PRAM
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An efficient parallel algorithm that finds independent sets of guaranteed size
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Deterministic distributed resource discovery (brief announcement)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Deterministic resource discovery in distributed networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Distributed MST for constant diameter graphs
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube
IEEE Transactions on Parallel and Distributed Systems
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
WaveCluster: a wavelet-based clustering approach for spatial data in very large databases
The VLDB Journal — The International Journal on Very Large Data Bases
Linear-time connected-component labeling based on sequential local operations
Computer Vision and Image Understanding
Systems programming in concurrent prolog
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An efficient network synchronization protocol
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The maximum flow problem: a real-time approach
Parallel Computing
A self-stabilizing algorithm for the maximum flow problem
Distributed Computing
Sequential and parallel algorithms for minimum flows
The Korean Journal of Computational & Applied Mathematics
An O(log n log log n) space algorithm for undirected st-connectivity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Asynchronous resource discovery in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the parallel computation of the biconnected and strongly connected co-components of graphs
Discrete Applied Mathematics
Fpga-based prototype of a pram-on-chip processor
Proceedings of the 5th conference on Computing frontiers
ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
Using simple abstraction to reinvent computing for parallelism
Communications of the ACM
Brief announcement: better speedups for parallel max-flow
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores
A-FAST: autonomous flow approach to scheduling tasks
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Lock-Free parallel algorithms: an experimental study
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Dinitz' algorithm: the original version and even's version
Theoretical Computer Science
A new Karzanov-type O(n3) max-flow algorithm
Mathematical and Computer Modelling: An International Journal
Finding maximum matching for bipartite graphs in parallel
Operations Research Letters
A simple version of Karzanov's blocking flow algorithm
Operations Research Letters
A simple version of Karzanov's blocking flow algorithm
Operations Research Letters
On distributed file tree walk of parallel file systems
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Techniques for designing efficient parallel graph algorithms for SMPs and multicore processors
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
CC-MR --- finding connected components in huge graphs with mapreduce
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Expressing graph algorithms using generalized active messages
Proceedings of the 27th international ACM conference on International conference on supercomputing
An overview of algorithms for network survivability
ISRN Communications and Networking
TurboGraph: a fast parallel graph engine handling billion-scale graphs in a single PC
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.04 |