Publications
Export 24 results:
Author [ Title] Type Year Filters: Keyword is Parallel algorithms [Clear All Filters]
1998. Critical path profiling of message passing and shared-memory programs. IEEE Transactions on Parallel and Distributed Systems. 9(10):1029-1040.
2001. Finding large independent sets of hypergraphs in parallel. Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures. :163-168.
2008. Fpga-based prototype of a pram-on-chip processor. Proceedings of the 5th conference on Computing frontiers. :55-66.
2000. Improved Algorithms via Approximations of Probability Distributions. Journal of Computer and System Sciences. 61(1):81-107.
1998. Improved bounds and algorithms for hypergraph two-coloring. 39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings. :684-693.
2009. Interactive direct volume rendering on desktop multicore processors. Concurrency and Computation: Practice and Experience. 21(17):2199-2212.
1998. A new deterministic parallel sorting algorithm with an experimental evaluation. Journal of Experimental Algorithmics (JEA). 3
1991. Parallel Algorithms for Channel Routing in the Knock-Knee Model. SIAM Journal on Computing. 20(2):228-245.
1995. Parallel algorithms for image histogramming and connected components with an experimental study (extended abstract). ACM SIGPLAN Notices. 30(8):123-133.
1994. On the parallel complexity of digraph reachability. Information Processing Letters. 52(5):239-241.
1988. Parallel set covering algorithms. Artificial Intelligence Applications, 1988., Proceedings of the Fourth Conference on. :274-279.
1992. Parallel sparse Cholesky factorization on a shared memory multiprocessor. Parallel Computing. 18(9):1009-1022.
1991. Parallel transitive closure computations using topological sort. , Proceedings of the First International Conference on Parallel and Distributed Information Systems, 1991. :122-129.
1991. A pipeline N-way join algorithm based on the 2-way semijoin program. IEEE Transactions on Knowledge and Data Engineering. 3(4):486-495.
2007. PRAM-on-chip: first commitment to silicon. Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures. :301-302.
1998. A Randomized Parallel Sorting Algorithm with an Experimental Study. Journal of Parallel and Distributed Computing. 52(1):1-23.
1994. A SIMD solution to the sequence comparison problem on the MGAP. International Conference on Application Specific Array Processors, 1994. Proceedings. :336-345.
1999. Simple: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs). Journal of Parallel and Distributed Computing. 58(1):92-108.
1995. Splitters and near-optimal derandomization. , 36th Annual Symposium on Foundations of Computer Science, 1995. Proceedings. :182-191.
1994. Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima. SIAM Journal on Computing. 23(3):449-465.
1991. Towards a theory of nearly constant time parallel algorithms. Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on. :698-710.
2002. Two techniques for reconciling algorithm parallelism with memory constraints. Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures. :95-98.