John H. Reif  Home/Search
Context Related
| duke.edu/~reif/paper/rank.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: duke.edu/~reif/vita/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper gives output sensitive parallel algorithms whose performance (Update)
Cited by: More
Efficient Parallel Factorization and Solution of Structured and.. - Reif (2000) (Correct)
Active bibliography (related documents): More All
1.0: Randomized ... Algorithms for Problems in Matching Theory - Cheriyan (Correct)
0.6: Efficient Parallel Computations for Singular Band Matrices - Eberly (Correct)
0.5: The stability of inversion formulas for Toeplitz matrices - Gutknecht, Hochbruck (1995) (Correct)
Similar documents based on text: More All
0.3: Parallel Output-Sensitive Algorithms for Combinatorial and Linear.. - Reif (2001) (Correct)
0.1: Toward Autonomous Robots: Robust, Adaptive and Dynamic Motion - Reif (Correct)
0.1: Lower Bounds for Multiplayer Non-Cooperative Games of.. - Gary Peterson Computer (Correct)
BibTeX entry: (Update)
J.H.Reif, Parallel Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems, to appear in Journal of Computer and System Sciences, 2000. http://citeseer.ist.psu.edu/article/reif00parallel.html More
@article{ reif01parallel,
author = "John H. Reif",
title = "Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems",
journal = "Journal of Computer and System Sciences",
volume = "62",
number = "3",
pages = "398-412",
year = "2001",
url = "citeseer.ist.psu.edu/article/reif00parallel.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
314 An Introduction to Parallel Algorithms (context) - J'aJ'a - 1992
309 Partitioning sparse matrices with eigenvectors of graphs (context) - Pothen, Simon et al. - 1990
308 Matrix multiplication via arithmetic progressions (context) - Coppersmith, Winograd - 1990
201 Parallel prefix Computation (context) - Ladner - 1980
149 Fast probabilistic algorithms for verification of polynomial.. (context) - Schwartz - 1980
141 Synthesis of Parallel Algorithms (context) - Reif - 1993
106 Matching is as easy as matrix inversion (context) - Mulmuley, Vazirani et al. - 1987
78 Probabilistic algorithms for sparse polynomials (context) - Zippel - 1991
73 Fast solution of Toeplitz systems of equations and computati.. (context) - Brent, Gustavson et al. - 1980
72 Displacement ranks of matrices and linear equations (context) - Kailath, Kung et al. - 1979
54 Fast parallel matrix and GCD computations (context) - Borodin, von zur et al. - 1982
53 A fast parallel algorithm to compute the rank of a matrix ov.. (context) - Mulmuley - 1987
52 On fast multiplication of polynomials over arbitrary rings - Cantor, Kaltofen - 1991
47 Superfast solution of real positive definite Toeplitz system.. (context) - Ammar, Gragg - 1988
45 Asymptotically fast solution of Toeplitz and related systems.. (context) - Bitmead, Anderson - 1980
41 On Wiedemann's method of solving sparse linear systems (context) - Kaltofen, Saunders - 1991
40 Processor efficient parallel solution of linear systems over.. (context) - Kaltofen, Pan - 1991
40 Processor-efficient parallel solution of linear systems II T.. (context) - Kaltofen, Pan - 1992
33 On Euclid's Algorithm and the Theory of Subresultants (context) - Brown, Traub - 1971
15 Inverses of Toeplitz operators (context) - Kailath, Viera et al. - 1978
11 Divide-and-conquer solution of least-squares problems for ma.. (context) - Chun, Kailath
8 Some polynomial and Toeplitz matrix computations (context) - Pan, Reif - 1987
7 Levinson and fast Choleski algorithms for Toeplitz and almos.. (context) - Musicus - 1981
7 Improved processor bounds for combinatorial problems in RNC (context) - Galil, Pan - 1988
7 Gammoids and transversal matroids (context) - Ingleton, Piff - 1973
6 Fast algorithms for bipartite network flow (context) - Gusfield, Martel et al. - 1987
6 Maximum Matchings in General Graphs through Randomization (context) - Rabin, Vazirani - 1989
5 Efficient parallel independent subsets and matrix factorizat.. - Eberly - 1991
3 personal communication (context) - Eberly - 1999
3 Lov'asz minimum digraphs and finding minimum separators (context) - Cheriyan, Laplacians - 1993
3 Fundamentals of Computing Theory (context) - Lov'asz, determinants et al. - 1979
3 Generalized Gohberg-Semencul formulas for matrix inversion (context) - Kailath, Chun - 1989
3 On efficient band matrix arithmetic (context) - Eberly - 1992
2 Improved algorithms for bipartite network flow problems (context) - Ahuja, Orlin et al. - 1990
1 Finding minimum digraph X-Y separators and minimum bipartite.. (context) - Cheriyan - 1993
1 New effective methods for computations with structured matri.. (context) - Pan
1 Computing a perfect matching is in random NC (context) - Karp, Upfal et al. - 1986
1 The two-processor scheduling problem is in R-NC (context) - Vazirani, Vazirani - 1985
1 Efficient Parallel Factorization and Solution of Structured .. - Reif - 2000
Documents on the same site (http://www.cs.duke.edu/~reif/vita/papers.html): More
Efficient Parallel Computation of the Characteristic Polynomial of .. - Reif (1999) (Correct)
Nonuniform Discretization For Kinodynamic Motion Planning And.. - Reif, Wang (2000) (Correct)
Efficient Approximate Solution of Sparse Linear Systems - Reif (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