and Mutual Independence Yijie Han Yoshihide Igarashi University of Kentucky...  Home/Search
Context
Related
| umkc.edu/~hanyij/researc...derandbit.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: We present schemes for derandomizing parallel algorithms by exploiting redundancy of a shrinking sample space and the mutual independence of random variables. Our design uses n mutually independent random variables built on a sample space with exponential number of points. Our scheme yields an O(logn) time parallel algorithm for the PROFIT/COST problem using no more than linear number of processors. (Update)
Active bibliography (related documents): More All
0.5: Parallel Derandomization Techniques - Yijie Han Department (Correct)
0.5: A Fast Derandomization Scheme and Its Applications - Yijie Han Department (1996) (Correct)
0.3: Parallel PROFIT/COST Algorithms through Fast Derandomization - Han (Correct)
Similar documents based on text: More All
0.4: Time Lower Bounds for Sorting on Multi-Dimensional.. - Han, Igarashi (1990) (Correct)
0.4: Broadcasting in Faulty Binary Jumping Networks - Yijie Han Yoshihide (Correct)
0.4: Indexing Functions and Time Lower Bounds for Sorting on .. - Han, Igarashi.. (1992) (Correct)
BibTeX entry: (Update)
@misc{ independence-derandomization,
author = "And Mutual Independence",
title = "Derandomization by Exploiting Redundancy",
url = "citeseer.ist.psu.edu/701762.html" }
Citations (may not include all citations):227 Parallel merge sort (context) - Cole - 1986
218 Probabilistic construction of deterministic algorithms: appr.. (context) - Raghavan - 1988
199 A simple parallel algorithm for the maximal independent set .. (context) - Luby - 1986
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
42 wise independence in NC (context) - Berger, Rompel et al. - 1989
41 Removing randomness in parallel computation without a proces.. - Luby - 1988
38 merging and sorting on parallel models of computation (context) - Borodin, Hopcroft - 1982
37 a set of almost deterministic k-independent random variables (context) - Joffe - 1974
31 On parallel searching (context) - Snir - 1985
20 Efficient NC algorithms for set cover with applications to l.. (context) - Berger, Rompel et al. - 1989
7 th ACM Symp (context) - Ajtai, Koml'os et al. - 1983
5 Pairwise statistical independence (context) - Lancaster - 1965
5 Theory of Probability (context) - Bernstein - 1945
4 Fast parallel approximations of the maximum weighted cut pro.. (context) - Pantziou, Spirakis 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