Kalyan Perumalla, Narsingh Deo  Home/Search
Context Related
| gatech.edu/~kalyan...arrayppl95.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: gatech.edu/~kalyan...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Given a sequence Q of n numbers (positive and negative), the maximum subsequence of Q is the contiguous subsequence that has the maximum sum among all contiguous subsequences of Q. Given a two-dimensional array A of n \Theta n numbers (positive and negative), the maximum subarray of A is the contiguous subarray that has the maximum sum among all contiguous subarrays of A. We present two O(log n)-time parallel algorithms---one for finding the maximum subsequence sum of a given sequence,... (Update)
Context of citations to this paper: More
...x i (see, for example, the elegant one pass algorithm presented in [13] Parallel algorithms have also been found for the PRAM model. In [10] and [14] it is shown that the problem can be solved on the EREW PRAM with O(N= log N) processors in O(log N) time. An ERCW PRAM...
Cited by: More
Parallel Maximum Sum Algorithms on Interconnection Networks - Qiu, Akl (1999) (Correct)
Active bibliography (related documents): More All
0.3: The Derivation of a Hierarchy of Algorithms for Pattern Matching.. - Jeuring (1992) (Correct)
0.3: An Initial-Algebra Approach to Directed Acyclic Graphs - Gibbons (1995) (Correct)
0.0: Systematic Extraction and Implementation of Divide-and-Conquer.. - Gorlatch (1996) (Correct)
Similar documents based on text: More All
0.4: A Local and Dynamic Algorithm for Reconfiguring a Faulty.. - Middendorf, Schmeck (Correct)
0.3: Rectangular Tiling in Multi-Dimensional Arrays - Smith, Suri (1999) (Correct)
0.3: Distributed General Matrix Multiply and Add for a 2D Mesh.. - Kågström, Rännar (1995) (Correct)
BibTeX entry: (Update)
K. Perumalla and N. Deo, "Parallel Algorithms for Maximum Subsequence and Maximum Subarray," Parallel Processing Letters, Vol. 5, 1995, pp. 367-373. http://citeseer.ist.psu.edu/perumalla95parallel.html More
@article{ perumalla95parallel,
author = "K. Perumalla and N. Deo",
title = "Parallel algorithms for maximum subsequence and maximum subarray",
journal = "Parallel Processing Letters",
volume = "5",
number = "3",
pages = "367--373",
year = "1995",
url = "citeseer.ist.psu.edu/perumalla95parallel.html" }
Citations (may not include all citations):314 An Introduction to Parallel Algorithms (context) - J'aj'a - 1992
201 Parallel Prefix Computation (context) - Ladner, Fischer - 1980
78 Programming Pearls (context) - Bentley - 1989
30 Introduction to Algorithms (context) - Manber - 1989
18 Applications of a Strategy for Designing Divide-and-Conquer .. (context) - Smith - 1987
3 The Derivation of Hierarchies of Algorithms on Matrices (context) - Jeuring - 1991
1 ACM Tansactions on Programming Languages and Systems (context) - Bates, Constable et al. - 1985
Documents on the same site (http://www.cc.gatech.edu/~kalyan/publications.html):
A Debugging Environment for PVM - Perumalla, Vemulapati (1993) (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