Rakesh Kumar Sinha  Home/Search
Context Related
| washington.edu/tr/...CSE950802.PS.Z 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: washington.edu/resea...trbyname (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Some Topics in Parallel Computation and Branching Programs by Rakesh Kumar Sinha Chairperson of the Supervisory Committee: Professor Paul Beame Department of Computer Science and Engineering There are two parts of this thesis: the first part gives two constructions of branching programs; the second part contains three results on models of parallel machines. The branching program model has turned out to be very useful for understanding the computational behavior of problems. In addition,... (Update)
Context of citations to this paper: More
...programs. It is also possible to define a more general form of chain MA programs that corresponds to non oblivious branching programs [Sin95] Connections p 1 2 box p box 3 p box p box k Figure 2: chain p 1 ; p 2 ; p k The size of any chain MA program is...
Cited by: More
Efficient Oblivious Branching Programs for Threshold and .. - Kumar, Jayram.. (1994) (Correct)
Similar documents (at the sentence level):
6.1%: Separating the Power of EREW and CREW PRAMs with Small.. - Beame, Fich, Sinha (Correct)
Active bibliography (related documents): More All
0.9: Time-Space Tradeoff Lower Bounds for Randomized.. - Beame, Saks, Sun, Vee (Correct)
0.9: Time-Space Tradeoffs for Branching Programs - Beame, Saks, al. (1998) (Correct)
0.8: Lower Bounds for Deterministic and Nondeterministic Branching.. - Razborov (1991) (Correct)
Similar documents based on text: More All
1.3: Study of Human Motion Control with a Physiology Based Robotic Arm.. - Chou (1996) (Correct)
0.1: Functions That Have Read-Twice Constant Width Branching.. - Fischer, Newman, Sgal (2003) (Correct)
0.1: REVIEW OF HARDWARE pRAMs - Clarkson Ng Christodoulou (1993) (Correct)
BibTeX entry: (Update)
Rakesh K. Sinha. Some topics in parallel computation and branching programs (Ph.D. Thesis). University of Washington CSE Technical Report UW-CSE-95-08-02. http://citeseer.ist.psu.edu/sinha95some.html More
@misc{ sinha-some,
author = "R. Sinha",
title = "Some topics in parallel computation and branching programs",
text = "Rakesh K. Sinha. Some topics in parallel computation and branching programs
(Ph.D. Thesis). University of Washington CSE Technical Report UW-CSE-95-08-02.",
url = "citeseer.ist.psu.edu/sinha95some.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
510 Symbolic Boolean manipulation with ordered binary decision d.. - Bryant - 1992
439 An Introduction to the Theory of Numbers (context) - Hardy, Wright - 1979
286 The Connection Machine (context) - Hillis - 1985
206 Vector Models for Data-Parallel Computing (context) - Blelloch - 1990
200 Data parallel algorithms (context) - Hillis, Steele - 1986
196 How to emulate shared memory (context) - Ranade - 1987
189 Algebraic methods in the theory of lower bounds for Boolean .. (context) - Smolensky - 1987
178 Symbolic model checking for sequential circuit verification - Burch, Clarke et al. - 1994
166 Some complexity questions related to distributive computing (context) - Yao - 1979
115 Scans as primitive parallel operations - Blelloch - 1989
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
88 Approximate formulas for some functions of prime numbers (context) - Rosser, Schoenfeld - 1962
87 Verification of arithmetic functions with binary moment diag.. - Bryant, Chen - 1994
84 Universal packet routing algorithms (context) - Leighton, Maggs et al. - 1988
83 Basic techniques for the efficient co-ordination of very lar.. - Gottlieb, Lubachevsky et al. - 1983
75 and the polynomial-time hierarchy (context) - Furst, Saxe et al. - 1981
74 Design of a massively parallel processor (context) - Batcher - 1980
73 The MasPar MP-1 architecture (context) - Blank - 1990
70 A complexity theory of efficient parallel algorithms (context) - Kruskal, Rudolph et al. - 1988
69 On span programs (context) - Karchmer, Wigderson - 1993
68 On lower bounds for read-k times branching programs (context) - Borodin, Razborov et al. - 1993
64 Parallel computations on reconfigurable meshes (context) - Miller, Kumar et al. - 1993
62 Lower bounds for deterministic and nondeterministic branchin.. - Razborov - 1991
60 On uniformity within NC (context) - Barrington, Immerman et al. - 1990
58 Lower bounds by probabilistic arguments (context) - Yao - 1983
57 Efficient synchronization in multiprocessors with shared mem.. - Kruskal, Rudolph et al. - 1986
56 Relations between concurrent-write models of parallel comput.. (context) - Fich, Ragde et al. - 1988
53 SIAM Journal on Computing (context) - Baker, Gill et al. - 1975
53 The Fluent abstract machine (context) - Ranade, Bhatt et al. - 1988
48 Array processor with multiple broadcasting (context) - Kumar, Raghavendra - 1987
47 Annals of Pure and Applied Logic (context) - Ajtai, finite - 1983
45 An Introduction to Parallel Algorithms (context) - J'aJ'a - 1992
44 CREW PRAMs and decision trees (context) - Nisan - 1991
43 Bounded-width polynomial-size branching programs recognize e.. (context) - Barrington - 1989
38 Simulation of parallel random access machines by circuits (context) - Stockmeyer, Vishkin - 1984
37 Multi-party protocols (context) - Chandra, Furst et al. - 1983
37 The computational complexity of universal hashing - Mansour, Nisan et al. - 1990
32 Machine models and simulations (context) - Boas - 1990
31 Parallel computation with threshold functions (context) - Parberry, Schnitger - 1988
29 Square meshes are not always optimal (context) - Bar-Noy, Peleg - 1991
29 A time-space tradeoff for sorting on a general sequential mo.. (context) - Borodin, Cook - 1982
28 Mesh computer algorithms for computational geometry (context) - Miller, Stout - 1989
26 The complexity of computation on the parallel random access .. - Fich - 1993
26 Reconfigurable Massively Parallel Computers (context) - Li, Stout - 1991
24 Optimal separations between concurrent-write parallel machin.. (context) - Boppana - 1989
23 Meanders and their applications in lower bounds arguments (context) - Alon, Maass - 1988
23 Trade-offs between communication throughput and parallel tim.. - Mansour, Nisan et al. - 1994
21 Meshes with multiple buses (context) - Stout - 1986
21 The recognition problem for the set of perfect squares (context) - Cobham - 1966
19 A time-space tradeoff for sorting on non-oblivious machines - Borodin, Fischer et al. - 1981
18 Trade-offs between depth and width in parallel computation (context) - Vishkin, Wigderson - 1985
17 getting closer to the barrier (context) - Borodin, tradeoffs - 1993
15 Scan primitives for vector computers - Chatterjee, Blelloch et al. - 1990
13 Communication Complexity: A New Approach to Circuit Depth (context) - Karchmer - 1989
13 SIAM Journal on Computing (context) - Snir, searching - 1985
13 Lower bounds to the complexity of symmetric Boolean function.. (context) - Babai, Pudl'ak et al. - 1990
13 Lower bounds on the size of switching-and-rectifier networks.. (context) - Razborov - 1990
13 Parallel computation and conflicts in memory access (context) - Kucera - 1982
13 Towards understanding exclusive read (context) - Fich, Wigderson - 1990
12 Superlinear lower bounds for bounded-width branching program.. - Barrington, Straubing - 1991
11 A separation between reconfigurable mesh models - MacKenzie - 1993
11 Towards optimal simulations of formulas by boundedwidth prog.. (context) - Cleve - 1991
9 Lower bounds for threshold and symmetric functions in parall.. - Azar - 1992
8 a Boolean function (context) - Neciporuk - 1966
8 A sub-logarithmic time sorting algorithm on a reconfigurable.. (context) - Nakano, Masuzawa et al. - 1991
8 Lower Bounds in Parallel Machine Computation (context) - Beame - 1986
8 Friedhelm Meyer auf der Heide (context) - Borodin, Fich - 1987
8 A Boolean function requiring 3n network size (context) - Blum - 1984
7 Symbolic Machine Instructions Reference Manual (context) - Inc, Heights - 1988
7 A general time-space tradeoff for finding unique elements (context) - Beame - 1991
7 Bounds for width two branching programs (context) - Borodin, Dolev et al. - 1986
5 A lower bound on the complexity of branching programs (context) - Pudl'ak - 1984
5 Space complexity of computations (context) - Pudl'ak, Z'ak - 1983
5 Efficient simulations between concurrent-read concurrent-wri.. (context) - Chlebus, Diks et al. - 1988
4 Lower bounds for the size of circuits with bounded depth wit.. (context) - Razborov - 1987
4 Subquadratic simulations of circuits by branching programs (context) - Cai, Lipton - 1989
4 Time--space tradeoffs for algebraic problems on general sequ.. (context) - Abrahamson - 1991
4 A time-space tradeoff for Boolean matrix multiplication (context) - Abrahamson - 1990
4 An efficient algorithm for summing up binary values on a rec.. (context) - Nakano - 1993
3 The Complexity of Boolean Functions (context) - Wegner - 1987
3 Parallel random access machines with bounded memory wordsize (context) - Bellantoni - 1991
3 The NYU Ultracomputer --- designing an MIMD parallel machine (context) - Gottlieb, Grishman et al. - 1983
2 the problem of realization of symmetric Boolean functions by.. (context) - Lupanov - 1965
2 Efficient oblivious branching programs for threshold functio.. - Sinha, Thathachar - 1994
2 Time-space tradeoffs for set operations - Patt-Shamir, Peleg - 1993
2 Separating the polynomial hierarchy by oracles: Part (context) - Yao - 1985
2 Exact time bounds for computing Boolean functions on PRAMs w.. (context) - Dietzfelbinger, Kuty et al. - 1994
2 The complexity of Boolean functions on CREW PRAMs (context) - Kuty - 1991
2 On separating the EREW and CREW PRAM models (context) - Gafni, Naor et al. - 1989
1 Complexity of sub-bus computation (context) - Condon, Ladner et al.
1 Friedhelm Meyer auf der Heide (context) - Fich - 1985
1 Time-Space Tradeoffs for Straight-Line and Branching Program.. (context) - Tompa - 1978
1 Lower bounds with small domain size on concurrent write para.. (context) - Edmonds - 1991
1 Separating the power of EREW and CREW PRAMs with small commu.. - Beame, Fich et al.
1 Threshold circuits of bounded depth (context) - Hajnal, Maass et al. - 1993
Documents on the same site (http://bauhaus.cs.washington.edu/research/tr/tr-by-name.html): More
Fast Median Filtering Algorithms for Mesh Computers - Tanimoto (1995) (Correct)
A New Data Structure For Fast Approximate Matching - Berman (1994) (Correct)
Privacy Interfaces for Information Management - Lau, Etzioni, Weld (1999) (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