Limits on the power of concurrent-write parallel machines
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
An O(ln n) parallel algorithm for the subset sum problem
ACM SIGACT News
New lower bounds for parallel computation
Journal of the ACM (JACM)
PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms
IEEE Transactions on Computers
Towards understanding exclusive read
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Parallel RAMs with bounded memory wordsize
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
On the number of rounds necessary to disseminate information
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Highly parallelizable problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Optimal separations between concurrent-write parallel machines
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Lower bounds for parallel computation on linked structures
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAM
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Exact time bounds for computing boolean functions on PRAMs without simultaneous writes
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
The computational complexity of universal hashing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Combining tentative and definite executions for very fast dependable parallel computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A constant-time optimal parallel string-matching algorithm
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast connected components algorithms for the EREW PRAM
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel two dimensional pattern matching
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Contention in shared memory algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Are wait-free algorithms fast?
Journal of the ACM (JACM)
An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Optimal parallel string algorithms: sorting, merging and computing the minimum
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A constant-time optimal parallel string-matching algorithm
Journal of the ACM (JACM)
Parallel sorting with limited bandwidth
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Lower bounds for randomized exclusive write PRAMs
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Work-time-optimal parallel algorithms for string problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications
IEEE Transactions on Parallel and Distributed Systems
Time-Optimal Domain-Specific Querying on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
Modeling parallel bandwidth: local vs. global restrictions
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Pointer jumping requires concurrent read
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Contention in shared memory algorithms
Journal of the ACM (JACM)
Optimal Parallel Algorithms for Finding Proximate Points, with Applications
IEEE Transactions on Parallel and Distributed Systems
A theorem on sensitivity and applications in private computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
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
On the parallel time complexity of undirected connectivity and minimum spanning trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Parallel RAMs with owned global memory and deterministic context-free language recognition
Journal of the ACM (JACM)
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM (JACM)
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
Improving the efficiency of parallel minimum spanning tree algorithms
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate Compaction and Padded-Sorting on Exclusive Write PRAMs
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A Parallel Algorithm for Weighted Distance Transforms
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Communication Complexity for Asynchronous Systems of Finite Devices
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A time-optimal solution for the path cover problem on cographs
Theoretical Computer Science
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Gossiping and broadcasting versus computing functions in networks
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions
Information and Computation
Partially effective randomization in simulations between arbitrary and common PRAMs
Journal of Parallel and Distributed Computing
On the message complexity of binary byzantine agreement under crash failures
Distributed Computing
ACM Transactions on Algorithms (TALG)
Fundamental parallel algorithms for private-cache chip multiprocessors
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Incomparability in parallel computation
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Concurrent counting is harder than queuing
Theoretical Computer Science
Concurrent counting is harder than queuing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Laced Boolean functions and subset sum problems in finite fields
Discrete Applied Mathematics
An improved lower bound on the sensitivity complexity of graph properties
Theoretical Computer Science
Note: Block sensitivity of minterm-transitive functions
Theoretical Computer Science
An optimal hidden-surface algorithm and its parallelization
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Minterm-transitive functions with asymptotically smallest block sensitivity
Information Processing Letters
More efficient parallel integer sorting
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
On distributed file tree walk of parallel file systems
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
On the sensitivity complexity of bipartite graph properties
Theoretical Computer Science
Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up
Theory of Computing Systems
Lower Bounds for Randomized Exclusive Write PRAMs
Theory of Computing Systems
| Hi-index | 0.01 |