Yijie Han Department of Computer Science University of Kentucky Lexington, KY ...  Home/Search
Context
Related
| umkc.edu/~hanyij/research/book.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umkc.edu/~hanyij/research...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction With the advance of computer technology it is now possible to build parallel computers with thousands even millions of processors. These parallel computers are capable of executing many computer instructions simultaneously. Thus the study of parallelism of problems to be solved by parallel computers and the design of parallel algorithms become an important research topic. Problems for which trivial sequential algorithms exist are sometimes intriguing problems to be solved in... (Update)
Similar documents based on text: More All
0.2: Derandomization by Exploiting Redundancy - And Mutual Independence (Correct)
0.2: Krylov Type Subspace Methods for Matrix Polynomials - Hoffnung, Li, Ye (2002) (Correct)
0.2: Efficient Parallel Algorithms for Computing All Pair Shortest .. - Han, Pan, Reif (1997) (Correct)
BibTeX entry: (Update)
@misc{ department-parallel,
author = "Yijie Han Department",
title = "Parallel Derandomization Techniques",
url = "citeseer.ist.psu.edu/701523.html" }
Citations (may not include all citations):308 Matrix multiplication via arithmetic progressions (context) - Coppersmith, Winograd - 1987
218 Probabilistic construction of deterministic algorithms: appr.. (context) - Raghavan - 1988
218 Parallelism in random access machines (context) - Fortune, Wyllie - 1978
199 A simple parallel algorithm for the maximal independent set .. (context) - Luby - 1986
168 A taxonomy of problems with fast parallel algorithms (context) - Cook - 1985
139 Ten Lectures on the Probabilistic Method (context) - Spencer - 1987
122 Parallel tree contraction and its application (context) - Miller, Reif - 1985
102 A fast and simple randomized parallel algorithm for the maxi.. (context) - Alon, Babai et al. - 1986
71 A fast parallel algorithm for the maximal independent set pr.. (context) - Karp, Wigderson - 1985
53 The probabilistic method yields deterministic parallel algor.. - Motwani, Naor et al. - 1989
41 Removing randomness in parallel computation without a proces.. - Luby
41 Removing randomness in parallel computation without a proces.. - Luby - 1988
37 a set of almost deterministic k-independent random variables (context) - Joffe - 1974
34 A new parallel algorithm for the maximal independent set pro.. - Goldberg, Spencer - 1989
26 An improved parallel algorithm for maximal matching (context) - Israeli, Shiloach - 1986
20 Efficient NC algorithms for set cover with applications to l.. (context) - Berger, Rompel et al. - 1989
16 Deterministic CFL's are accepted simultaneously in polynomia.. (context) - Cook - 1979
16 Constructing a maximal independent set in parallel - Goldberg, Spencer - 1989
13 on Foundations of Computer Science (context) - Cole, sort et al. - 1986
7 th ACM Symp (context) - Ajtai, Koml'os et al. - 1983
4 Derandomization by exploiting redundancy and mutual independ.. (context) - Han, Igarashi - 1990
4 Fast parallel approximations of the maximum weighted cut pro.. (context) - Pantziou, Spirakis et al. - 1989
3 parallel algorithm PROFITCOST problem - algorithm, PROFIT et al. - 1991
3 Parallel algorithms for computing linked list prefix - Han - 1989
3 Workshop on Algorithms and Data Structures (context) - Han, derandomization et al. - 1991
2 on Foundations of Computer Science (context) - Berger, Rompel et al. - 1989
1 ACM Symposium on Parallel Algorithms and Architectures (context) - Han, list et al. - 1989
Documents on the same site (http://www.sice.umkc.edu/~hanyij/research/index.htm): More
Matching Partition a Linked List and Its Optimization - Han (1989) (Correct)
Time Lower Bounds for Sorting on Multi-Dimensional.. - Han, Igarashi (1990) (Correct)
An Optimal Linked List Prefix Algorithm on a Local Memory Computer - Han (1991) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC