Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk  Home/Search
Context Related
| tcs.muluebeck.de/Forschung/A9505.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: itheoi.muluebeck...Publikationen (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It was shown some years ago that the computation time for many important Boolean functions of n arguments on concurrent-read exclusive-write parallel random-access machines (CREW PRAMs) of unlimited size is at least '(n) 0:72 log 2 n. On the other hand, it is known that every Boolean function of n arguments can be computed in '(n) + 1 steps on a CREW PRAM with n \Delta 2 n\Gamma1 processors and memory cells. In the case of the OR of n bits, n processors and cells are sufficient. In this... (Update)
Context of citations to this paper: More
.... This parameter is of interest because it can be used to obtain lower bounds for the CREW PRAM complexity of Boolean functions (see [10, 11, 21, 26]) that is the complexity on a parallel random access machine with an unlimited number of all powerful processors, such that...
.... B(x) This parameter is of interest because it can be used to obtain lower bounds for the CREW PRAM complexity of B , see [7, 8, 9, 21, 27]. That is. the complexity on a parallel random access machine with an unlimited number of all powerful processors such that simultaneous...
Cited by: More
Timings for Associative Operations on the MASC Model - Jin, Baker, Batcher (2001) (Correct)
On the Complexity of Some Arithmetic Problems over F2[T] - Allender, Bernasconi, Damm, .. (Correct)
On Polynomial Representations of Boolean Functions Related to.. - Shparlinski (1998) (Correct)
Active bibliography (related documents): More All
1.7: Complexity of Boolean Functions on PRAMs - Lower Bound Techniques - Kutylowski (Correct)
0.5: The Complexity of Computation on the Parallel Random Access Machine - Fich (1993) (Correct)
0.4: Lower Bounds for Randomized Exclusive Write PRAMs - MacKenzie (1995) (Correct)
Similar documents based on text: More All
0.3: On the Power of Reading and Writing Simultaneously in.. - Niedermeier, Rossmanith (Correct)
0.2: Improved Optimal Shared Memory Simulations, and the.. - Czumaj, der Heide.. (Correct)
0.2: Parallel Integer Sorting Is More Efficient Than Parallel.. - Han, Shen (1999) (Correct)
Related documents from co-citation: More All
6: The complexity of computation on the Parallel Random Access Machine - Fich - 1993
5: Number theoretic methods in cryptography: Complexity lower bounds (context) - Shparlinski - 1999
5: The Complexity of Boolean Functions - - 1987
BibTeX entry: (Update)
M. Dietzfelbinger, M. Kuty/lowski, and R. Reischuk, Feasible time-optimal algorithms for Boolean functions on exclusive-write PRAMs, SIAM J. Comput., to appear. http://citeseer.ist.psu.edu/dietzfelbinger94feasible.html More
@article{ dietzfelbinger96feasible,
author = "Martin Dietzfelbinger and Miros{\l}aw Kuty{\l}owski and R{\"u}diger Reischuk",
title = "Feasible Time-Optimal Algorithms for {Boolean} Functions on Exclusive-Write Parallel Random-Access Machines",
journal = "SIAM Journal on Computing",
volume = "25",
number = "6",
pages = "1196--1230",
year = "1996",
url = "citeseer.ist.psu.edu/dietzfelbinger94feasible.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1991
268 Parallel algorithms for shared-memory machines (context) - Karp, Ramachandran
227 Parallel Merge Sort (context) - Cole - 1988
202 The Complexity of Boolean Functions - Wegener - 1987
201 Parallel prefix computation (context) - Ladner, Fischer - 1980
201 Parallel prefix computation (context) - Ladner, Fischer - 1980
189 Algebraic methods in the theory of lower bounds for Boolean .. (context) - Smolensky - 1987
174 The parallel evaluation of general arithmetic expressions (context) - Brent - 1974
141 Synthesis of Parallel Algorithms (context) - Reif - 1993
110 parallel steps (context) - Ajtai, Koml'os et al. - 1983
100 Optimal bounds for decision problems on the CRCW PRAM (context) - Beame, Hastad - 1989
94 Upper and lower time bounds for parallel random access machi.. (context) - Cook, Dwork et al. - 1986
70 A suggestion for a fast multiplier (context) - Wallace - 1964
59 Harmonic analysis of polynomial threshold functions (context) - Bruck - 1990
57 the degree of boolean functions as real polynomials - Nisan, Szegedy - 1992
44 CREW PRAMs and decision trees (context) - Nisan - 1989
39 Improved sorting networks with O (context) - Paterson - 1990
38 Simulation of parallel random access machines by circuits (context) - Stockmeyer, Vishkin - 1984
31 On parallel searching (context) - Snir - 1985
24 Unbounded fan-in circuits and associative functions (context) - Chandra, Fortune et al. - 1983
18 Trade-offs between depth and width in parallel computation (context) - Vishkin, Wigderson - 1985
14 New bounds for parallel prefix circuits (context) - Fich - 1983
13 Algebraic Methods in Lower bounds for Computational Models w.. (context) - Szegedy - 1989
13 Improved upper and lower time bounds for parallel random acc.. (context) - Parberry, Yan - 1991
12 Unambiguity of Circuits (context) - Lange - 1993
9 Information broadcasting by Exclusive-Read PRAMs - Beame, Kik et al. - 1994
8 Exact time bounds for computing Boolean functions on PRAMs w.. (context) - Dietzfelbinger, Kuty et al. - 1990
6 Time complexity of Boolean functions on CREW PRAMs (context) - Kuty - 1991
5 Properties of complexity measures for PRAMs and WRAMs (context) - Bublitz, urfeld et al. - 1986
3 Parallel random access machines with bounded memory wordsize (context) - Bellantoni - 1991
3 Exact lower bounds for computing Boolean functions on CREW P.. (context) - Dietzfelbinger, Kuty et al. - 1994
2 Towards understanding exclusive write (context) - Fich, Wigderson - 1989
1 Evaluating formulas on parallel machines without simultaneou.. (context) - Kuty, Reischuk - 1990
1 Fast algorithms for threshold functions on CREW PRAMs (context) - Kuty - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.itheoi.mu-luebeck.de/Publikationen.html): More
Optimization of Unary Costs - Jakoby, Schindelhauer (1997) (Correct)
The Complexity World below Logarithmic Space - Liskiewicz, Reischuk (1994) (Correct)
Computational Error Complexity Classes - Schindelhauer, Jakoby (1997) (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