Peter Rossmanith  Home/Search
Context Related
| flop.informatik.tumuenchen...orow.ps.Z wwwbrauer.informatik.tumue...orow.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: papa.informatik.tumue...rossmani (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We analyze the owner concept for PRAMs. In OROW-PRAMs each memory cell has one distinct processor that is the only one allowed to write into this memory cell and one distinct processor that is the only one allowed to read from it. By symmetric pointer doubling, a new proof technique for OROW-PRAMs, it is shown that list ranking can be done in O(log n) time by an OROWPRAM and that LOGSPACE ` OROW-TIME(log n). Then we prove that OROW-PRAMs are a fairly robust model and recognize the same class of ... (Update)
Context of citations to this paper: More
.... (for k 1) CRCW k = AC k [59] NC k OROW k CROW k SAC k [54; 64] CROW 1 = LOGDCFL [24] and DSPACE(logn) OROW 1 [54]: In CRCW PRAM s, global memory behaves like a shared memory, since each processor can access each cell of global memory. In the most restricted...
.... Here, parallel machine models seem helpful, leading to two intermediate classes: the parallel pointer machine [7, 16] and the OROW PRAM [23]. As a consequence of our main result we get OROW algorithms for the elements of RUSPACE(logn) taking time O(log 2 n= log log n) We...
Cited by: More
Uniform Circuits and Exclusive Read PRAMs - Preliminary Version January (Correct)
Parallel Communicating Grammar Systems with Terminal Transmission - Fernau (2000) (Correct)
RUSPACE(log n) \subseteq DSPACE(log² n/log log n) - Allender, Lange (Correct)
Active bibliography (related documents): More All
1.2: The Owner Concept for PRAMs - Peter Rossmanith Technische (1991) (Correct)
0.2: Feasible Time-Optimal Algorithms for Boolean.. - Dietzfelbinger.. (1994) (Correct)
0.2: Data-Independence of Read, Write, and Control Structures in .. - Lange, Niedermeier (1998) (Correct)
Similar documents based on text: More All
0.3: On Optimal Orow-Pram Algorithms For Computing Recursively .. - Niedermeier, Rossmanith (1995) (Correct)
0.2: Unambiguous Auxiliary Pushdown Automata And.. - Niedermeier, Rossmanith (1995) (Correct)
0.2: Parallel Algorithms for k-tree Recognition and its Applications - Adhar, Peng (Correct)
Related documents from co-citation: More All
8: the tape complexity of deterministic context-free languages (context) - Sudborough - 1978
8: Parallel RAMs with owned global memory and deterministic context-free language r.. - Dymond, Ruzzo - 1986
6: Parallelism in random access machines (context) - Fortune, Wyllie - 1978
BibTeX entry: (Update)
P. Rossmanith. The Owner Concept for PRAMs. In Proceedings, 8th Annual Symposium of Theoretical Aspects of Computer Science, STACS 91, Lecture Notes in Computer Science 480, pages 172--193, 1991. http://citeseer.ist.psu.edu/article/rossmanith91owner.html More
@inproceedings{ rossmanith91owner,
author = "Peter Rossmanith",
title = "The Owner Concept for {PRAMs}",
booktitle = "Symposium on Theoretical Aspects of Computer Science",
pages = "172-183",
year = "1991",
url = "citeseer.ist.psu.edu/article/rossmanith91owner.html" }
Citations (may not include all citations):218 Parallelism in random access machines (context) - Fortune, Willie - 1978
201 Parallel prefix computation (context) - Ladner, Fischer - 1980
168 A taxonomy of problems with fast parallel algorithms (context) - Cook - 1985
125 On uniform circuit complexity (context) - Ruzzo - 1981
124 Journal of the ACM (context) - Chandra, Kozen et al. - 1981
122 Parallel tree contraction and its applications (context) - Miller, Reif - 1985
102 A survey of parallel algorithms for shared-memory machines (context) - Karp, Ramachandran - 1987
94 Upper and lower time bounds for parallel random access machi.. (context) - Cook, Dwork et al. - 1986
70 A simple parallel tree contraction algorithm (context) - Abrahamson, Dadoun et al. - 1989
51 the tape complexity of deterministic context-free languages (context) - Sudborough - 1978
49 Tree-size bounded alternation (context) - Ruzzo - 1980
47 The Complexity of Parallel Computations (context) - Wyllie - 1981
46 A fast parallel algorithm for routing in permutation network.. (context) - Lev, Pippenger et al. - 1981
44 Optimal parallel evaluation of tree-structured computations .. (context) - Kosaraju, Delcher - 1987
41 Properties that characterize LOGCFL (context) - Venkateswaran - 1987
40 Faster optimal parallel prefix sums and list ranking (context) - Cole, Vishkin - 1989
38 Simulation of parallel random access machines by circuits (context) - Stockmeyer, Vishkin - 1984
38 Finding biconnected components and computing tree functions .. (context) - Tarjan, Vishkin - 1985
32 Optimal tree contraction in EREW model (context) - Gazit, Miller et al. - 1987
31 On parallel searching (context) - Snir - 1982
23 Parallel RAMs with owned global memory and deterministic lan.. - Dymond, Ruzzo - 1986
21 IEEE Transactions on Computers (context) - Kruskal, Rudolph et al.
19 An optimal parallel algorithm for dynamic expression evaluat.. (context) - Gibbons, Rytter - 1986
14 New bounds for parallel prefix circuits (context) - Fich - 1983
12 Unambiguity of circuits (context) - Lange - 1990
9 Parallel general prefix computations with geometric (context) - Springsteel, Stojmenovic - 1989
2 Methodological parallel evaluation of expression trees (context) - Cole, Vishkin - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://papa.informatik.tu-muenchen.de/gruppen/theorie/publications/rossmani.html): More
Unambiguous Simulations of Auxiliary Pushdown Automata and .. - Niedermeier, Rossmanith (1992) (Correct)
Faster Sorting and Routing on Grids with Diagonals - Kunde, Niedermeier, Rossmanith (1994) (Correct)
Observations On Log(n) Time Parallel Recognition Of.. - Rossmanith, Rytter (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