Reif, J. H. (John H.)
Overview
Works:  105 works in 260 publications in 1 language and 2,642 library holdings 

Genres:  Conference papers and proceedings Handbooks and manuals Specifications 
Roles:  Author, Editor, Other 
Classifications:  QA76.58, 005.11 
Publication Timeline
.
Most widely held works by
J. H Reif
Synthesis of parallel algorithms by
J. H Reif(
Book
)
14 editions published between 1993 and 2000 in English and held by 343 WorldCat member libraries worldwide
Mathematics of Computing  Parallelism
14 editions published between 1993 and 2000 in English and held by 343 WorldCat member libraries worldwide
Mathematics of Computing  Parallelism
Handbook of parallel computing : models, algorithms and applications by
Sanguthevar Rajasekaran(
Book
)
21 editions published between 2007 and 2008 in English and held by 232 WorldCat member libraries worldwide
Parallel computing plays a vital role in solving complex computing problems. The Handbook of Parallel Computing; Models, Algorithms, and Applications provides comprehensive coverage on all aspects of parallel computing, focusing on the foundational principles and recent advances in the areas of models, algorithms, and applications. This book addresses applications to computational biology, homeland security, and simulations of parallelism such as fuel cells, biological cells, and coastal waves. It covers the parallel disk model, which has
21 editions published between 2007 and 2008 in English and held by 232 WorldCat member libraries worldwide
Parallel computing plays a vital role in solving complex computing problems. The Handbook of Parallel Computing; Models, Algorithms, and Applications provides comprehensive coverage on all aspects of parallel computing, focusing on the foundational principles and recent advances in the areas of models, algorithms, and applications. This book addresses applications to computational biology, homeland security, and simulations of parallelism such as fuel cells, biological cells, and coastal waves. It covers the parallel disk model, which has
DNA computing : 9th International Workshop on DNA Based Computers, DNA9, Madison, WI, USA, June 13, 2003 : revised papers by
Junghuei Chen(
Book
)
14 editions published between 2004 and 2005 in English and held by 194 WorldCat member libraries worldwide
This book constitutes the thoroughly refereed postproceedings of the 9th International Workshop on DNA Based Computers, DNA9, held in Madison, Wisconsin, USA in June 2003. The 22 revised full papers presented were carefully selected during two rounds of reviewing and improvement from initially 60 submissions. The papers are organized in topical sections on new experiments and tools, theory, computer simulation and sequence design, selfassembly and autonomous molecular computation, experimental solutions, and new computing models
14 editions published between 2004 and 2005 in English and held by 194 WorldCat member libraries worldwide
This book constitutes the thoroughly refereed postproceedings of the 9th International Workshop on DNA Based Computers, DNA9, held in Madison, Wisconsin, USA in June 2003. The 22 revised full papers presented were carefully selected during two rounds of reviewing and improvement from initially 60 submissions. The papers are organized in topical sections on new experiments and tools, theory, computer simulation and sequence design, selfassembly and autonomous molecular computation, experimental solutions, and new computing models
Parallel algorithm derivation and program transformation by
Robert A Paige(
Book
)
8 editions published in 1993 in English and held by 127 WorldCat member libraries worldwide
Transformational programming and parallel computation are two emerging fields that may ultimately depend on each other for success. Perhaps because ad hoc programming on sequential machines is so straightforward, sequential programming methodology has had little impact outside the academic community, and transformational methodology has had little impact at all. However, because ad hoc programming for parallel machines is so hard, and because progress in software construction has lagged behind architectural advances for such machines, there is a much greater need to develop parallel programming and transformational methodologies. Parallel Algorithm Derivation and Program Transformation stimulates the investigation of formal ways to overcome problems of parallel computation, with respect to both software development and algorithm design. It represents perspectives from two different communities: transformational programming and parallel algorithm design, to discuss programming, transformational, and compiler methodologies for parallel architectures, and algorithmic paradigms, techniques, and tools for parallel machine models. Parallel Algorithm Derivation and Program Transformation is an excellent reference for graduate students and researchers in parallel programming and transformational methodology. Each chapter contains a few initial sections in the style of a firstyear, graduate textbook with many illustrative examples. The book may also be used as the text for a graduate seminar course or as a reference book for courses in software engineering, parallel programming or formal methods in program development
8 editions published in 1993 in English and held by 127 WorldCat member libraries worldwide
Transformational programming and parallel computation are two emerging fields that may ultimately depend on each other for success. Perhaps because ad hoc programming on sequential machines is so straightforward, sequential programming methodology has had little impact outside the academic community, and transformational methodology has had little impact at all. However, because ad hoc programming for parallel machines is so hard, and because progress in software construction has lagged behind architectural advances for such machines, there is a much greater need to develop parallel programming and transformational methodologies. Parallel Algorithm Derivation and Program Transformation stimulates the investigation of formal ways to overcome problems of parallel computation, with respect to both software development and algorithm design. It represents perspectives from two different communities: transformational programming and parallel algorithm design, to discuss programming, transformational, and compiler methodologies for parallel architectures, and algorithmic paradigms, techniques, and tools for parallel machine models. Parallel Algorithm Derivation and Program Transformation is an excellent reference for graduate students and researchers in parallel programming and transformational methodology. Each chapter contains a few initial sections in the style of a firstyear, graduate textbook with many illustrative examples. The book may also be used as the text for a graduate seminar course or as a reference book for courses in software engineering, parallel programming or formal methods in program development
Parallel image compression : NASA SBIR phase 1 report by
J. H Reif(
Book
)
2 editions published in 1987 in English and held by 99 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 99 WorldCat member libraries worldwide
DCC '91 : Data Compression Conference by Data Compression Conference(
Book
)
5 editions published in 1991 in English and held by 76 WorldCat member libraries worldwide
5 editions published in 1991 in English and held by 76 WorldCat member libraries worldwide
Proceedings of the 34th Annual ACM Symposium on the Theory of Computing : Montreal, Quebec, Canada, May 1921, 2002 by ACM Symposium on Theory of Computing(
Book
)
3 editions published in 2002 in English and held by 28 WorldCat member libraries worldwide
3 editions published in 2002 in English and held by 28 WorldCat member libraries worldwide
Deriving efficient graph algorithms by
J. H Reif(
Book
)
8 editions published in 1982 in English and Undetermined and held by 10 WorldCat member libraries worldwide
Ten years ago Hopcroft and Tarjan discovered a class of very fast algorithms for solving graph problems such as biconnectivity and strong connectivity. While these depthfirstsearch algorithms are complex and can be difficult to understand, the problems they solve have simple combinatorial definitions that can themselves be considered algorithms, though the might be very inefficient or even infinitary. We demonstrate here how the efficient algorithms can be systematically derived using program transformation steps from the intuitive but preliminary definitions. There are several justifications for this work. First, we believe that the evolutionary approach used in this paper offers more natural explanations of the algorithms than the usual a posteriori proofs that appear in textbooks. Second, the derivations illustrate several highlevel principles of program derivation and suggest methods by which these principles can be realized by sequences of program transformation steps. Third, these examples illustrate how external domainspecific knowledge can enter into the program derivation process. This is the first occasion that such efficient graph algorithms have been systematically derived. (Author)
8 editions published in 1982 in English and Undetermined and held by 10 WorldCat member libraries worldwide
Ten years ago Hopcroft and Tarjan discovered a class of very fast algorithms for solving graph problems such as biconnectivity and strong connectivity. While these depthfirstsearch algorithms are complex and can be difficult to understand, the problems they solve have simple combinatorial definitions that can themselves be considered algorithms, though the might be very inefficient or even infinitary. We demonstrate here how the efficient algorithms can be systematically derived using program transformation steps from the intuitive but preliminary definitions. There are several justifications for this work. First, we believe that the evolutionary approach used in this paper offers more natural explanations of the algorithms than the usual a posteriori proofs that appear in textbooks. Second, the derivations illustrate several highlevel principles of program derivation and suggest methods by which these principles can be realized by sequences of program transformation steps. Third, these examples illustrate how external domainspecific knowledge can enter into the program derivation process. This is the first occasion that such efficient graph algorithms have been systematically derived. (Author)
The propositional dynamic logic of deterministic, wellstructured programs by
Joseph Y Halpern(
Book
)
2 editions published in 1981 in English and held by 8 WorldCat member libraries worldwide
2 editions published in 1981 in English and held by 8 WorldCat member libraries worldwide
A simple threedimensional realtime reliable cellular array by
Péter Gács(
Book
)
2 editions published between 1985 and 1987 in English and held by 6 WorldCat member libraries worldwide
2 editions published between 1985 and 1987 in English and held by 6 WorldCat member libraries worldwide
Special issue on STOC 2002 : [11 papers ... of the ThirtyFourth Annual ACM Symposium on Theory of Computing (STOC2002), held
in Montreal, Quebec, Canada, May 19  21, 2002] by
Symposium on Theory of Computing(
Book
)
2 editions published in 2003 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 2003 in English and held by 5 WorldCat member libraries worldwide
Shortest paths in Euclidean space with polyhedral obstacles by
J. H Reif(
Book
)
4 editions published between 1984 and 1985 in English and held by 5 WorldCat member libraries worldwide
This document considers the problem of finding a minimum length path between two points in Euclidean space which avoids a set (not necessarily convex) polyhedral obstacles; we let n denote the number of the obstacle edges and k denote the number of islands in the obstacle space. For two dimensions, an island is defined to be a maximal convex obstacle surface such that for any two points contained in the interior of the island, a minimal length path between these two points is strictly contained in the interior of the island; for example, a set of i disconnected convex polyhedra forms a set of i islands, however, a single nonconvex polyhedron will constitute more than one island. Keywords: Mover's problem; robotics motion planning
4 editions published between 1984 and 1985 in English and held by 5 WorldCat member libraries worldwide
This document considers the problem of finding a minimum length path between two points in Euclidean space which avoids a set (not necessarily convex) polyhedral obstacles; we let n denote the number of the obstacle edges and k denote the number of islands in the obstacle space. For two dimensions, an island is defined to be a maximal convex obstacle surface such that for any two points contained in the interior of the island, a minimal length path between these two points is strictly contained in the interior of the island; for example, a set of i disconnected convex polyhedra forms a set of i islands, however, a single nonconvex polyhedron will constitute more than one island. Keywords: Mover's problem; robotics motion planning
Theory of computing  STOC 2002 : proceedings by Annual ACM Symposium on Theory of Computing. STOC(
Book
)
1 edition published in 2002 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 2002 in English and held by 5 WorldCat member libraries worldwide
Efficient parallel solution of linear systems by
Victor Pan(
Book
)
4 editions published between 1984 and 1985 in English and held by 5 WorldCat member libraries worldwide
The most efficient known parallel algorithms for inversion of a nonsingular nxn matrix A or solving a linear system Ax=b over the rationals require O(log n) to the 2nd power time and M(n) square root of n processors (where M(n) is the number of processors required in order to multiply two nxn rational matrices in time O(log n)). Furthermore, all known polylog time algorithms for those problems are unstable: they require the calculations to be done with perfect precision; otherwise they give no results at all. This paper describes parallel algorithms that have good numerical stability and remain efficient as n grows large. Additional keywords: Iterations; Convergence; Newtons method; Computer architecture
4 editions published between 1984 and 1985 in English and held by 5 WorldCat member libraries worldwide
The most efficient known parallel algorithms for inversion of a nonsingular nxn matrix A or solving a linear system Ax=b over the rationals require O(log n) to the 2nd power time and M(n) square root of n processors (where M(n) is the number of processors required in order to multiply two nxn rational matrices in time O(log n)). Furthermore, all known polylog time algorithms for those problems are unstable: they require the calculations to be done with perfect precision; otherwise they give no results at all. This paper describes parallel algorithms that have good numerical stability and remain efficient as n grows large. Additional keywords: Iterations; Convergence; Newtons method; Computer architecture
Extension of the parallel nested dissection algorithm to the path algebra problems by
Victor Pan(
Book
)
3 editions published in 1985 in English and held by 4 WorldCat member libraries worldwide
The authors' recent parallel nested dissection algorithm for solving linear systems is extended in order to substantially accelerate several path algebra computations in both cases of a single source path and of all pair paths where the path problem is defined by a sparse matrix whose associated graph has a family of small separators. Keywords: computations. (Author)
3 editions published in 1985 in English and held by 4 WorldCat member libraries worldwide
The authors' recent parallel nested dissection algorithm for solving linear systems is extended in order to substantially accelerate several path algebra computations in both cases of a single source path and of all pair paths where the path problem is defined by a sparse matrix whose associated graph has a family of small separators. Keywords: computations. (Author)
DNAbased selfassembly and nanorobotics : on constructing complex, faulttolerant nanostructures and programmable nanorobotic
devices by
Sudheer Sahu(
Book
)
2 editions published in 2008 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 2008 in English and held by 4 WorldCat member libraries worldwide
O(log²n) time efficient parallel factorization of dense, sparse separable, and banded matrices by
J. H Reif(
Book
)
2 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide
Known polylog parallel algorithms for the solution of linear systems and related problems require computation of the characteristic polynomial or related forms, which are known to be highly unstable in practice. However, matrix factorizations of various types, bypassing computation of the characteristic polynomial, are used extensively in sequential numerical computations and are essential in many applications
2 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide
Known polylog parallel algorithms for the solution of linear systems and related problems require computation of the characteristic polynomial or related forms, which are known to be highly unstable in practice. However, matrix factorizations of various types, bypassing computation of the characteristic polynomial, are used extensively in sequential numerical computations and are essential in many applications
Analysis of communicating processes by
J. H Reif(
Book
)
5 editions published in 1978 in English and held by 4 WorldCat member libraries worldwide
5 editions published in 1978 in English and held by 4 WorldCat member libraries worldwide
Motion planning in the presence of moving obstacles by
J. H Reif(
Book
)
4 editions published in 1985 in English and held by 4 WorldCat member libraries worldwide
This paper investigates the computational complexity of planning the motion of a body B in 2D or 3D space, so as to avoid collision with moving obstacles of known, easily computed, trajectories. Dynamic movement problems are of fundamental importance to robotics, but their computational complexity has not previously been investigated. We provide evidence that the 3D dynamic movement problem is intractable even if B has only a constant number of degrees of freedom of movement. In particular, we prove the problem is PSPACEhard if B is given a velocity modulus bound on its movements and is NP hard even if B has no velocity modulus bound, where in both cases B has 6 degrees of freedom. To prove these results we use a unique method of simulation of a Turing machine which uses time to encode configurations (whereas previous lower bound proofs in robotics used the system position to encode configurations and so required unbounded number of degrees of freedom). We also investigate a natural class of dynamic problems which we call asteroid avoidance problems: B, the object we wish to move, is a convex polyhedron which is free to move by translation with bounded velocity modulus and the polyhedral obstacles have known translational trajectories but cannot rotate. This problem has many applications to robot, automobile, and aircraft collision avoidance
4 editions published in 1985 in English and held by 4 WorldCat member libraries worldwide
This paper investigates the computational complexity of planning the motion of a body B in 2D or 3D space, so as to avoid collision with moving obstacles of known, easily computed, trajectories. Dynamic movement problems are of fundamental importance to robotics, but their computational complexity has not previously been investigated. We provide evidence that the 3D dynamic movement problem is intractable even if B has only a constant number of degrees of freedom of movement. In particular, we prove the problem is PSPACEhard if B is given a velocity modulus bound on its movements and is NP hard even if B has no velocity modulus bound, where in both cases B has 6 degrees of freedom. To prove these results we use a unique method of simulation of a Turing machine which uses time to encode configurations (whereas previous lower bound proofs in robotics used the system position to encode configurations and so required unbounded number of degrees of freedom). We also investigate a natural class of dynamic problems which we call asteroid avoidance problems: B, the object we wish to move, is a convex polyhedron which is free to move by translation with bounded velocity modulus and the polyhedral obstacles have known translational trajectories but cannot rotate. This problem has many applications to robot, automobile, and aircraft collision avoidance
Implementation of Parallel Algorithms(
)
7 editions published between 1991 and 1993 in English and held by 0 WorldCat member libraries worldwide
The investigation was centered on how to map contextfree grammar recognition onto systolic arrays. We are currently in the final phases of the preparation of a technical report which will document this work. Current research efforts are to extend our method to other algorithms. A new method was developed for mapping algorithms into parallel architectures. This new method works very well for a class of dynamic programming problems, including CFG recognition
7 editions published between 1991 and 1993 in English and held by 0 WorldCat member libraries worldwide
The investigation was centered on how to map contextfree grammar recognition onto systolic arrays. We are currently in the final phases of the preparation of a technical report which will document this work. Current research efforts are to extend our method to other algorithms. A new method was developed for mapping algorithms into parallel architectures. This new method works very well for a class of dynamic programming problems, including CFG recognition
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Chen, Junghuei 1960 Author Editor
 Paige, Robert A. Other Author Editor
 Wachter, R. F. Other Editor
 Rajasekaran, Sanguthevar Author Editor
 United States National Aeronautics and Space Administration
 Storer, James A. (James Andrew) 1953 Editor
 IEEE Computer Society
 ACM Special Interest Group for Algorithms and Computation Theory
 HARVARD UNIV CAMBRIDGE MA AIKEN COMPUTATION LAB
 ACM Digital Library
Associated Subjects
Algorithms Artificial intelligence Bioinformatics Chemistry Computational complexity Computer algorithms Computer architecture Computer programming Computer programs Computer science Computer software Data compression (Computer science) Electronic data processing Electronic digital computers Geometry Graph theory Information storage and retrieval systems Iterative methods (Mathematics) Linear systems Logic, Symbolic and mathematical Matrices Molecular computers Motion Nanotechnology Parallel algorithms Parallel processing (Electronic computers) Parallel programming (Computer science) Predicate calculus Programming (Mathematics) Punched card systems Realtime data processing Robotics Robots Selforganizing systems Simulation methods Software engineering Turing machines
Alternative Names
Reif, J. H.
Reif, John.
Reif, John H.
Reif, John (John H.)
Languages
Covers