Reif, J. H. (John H.)
Overview
Works:  145 works in 246 publications in 2 languages and 2,817 library holdings 

Genres:  Conference proceedings Handbooks, manuals, etc Specifications 
Roles:  Author, Editor 
Classifications:  QA76.642, 621.391 
Publication Timeline
.
Most widely held works by
J. H Reif
DNA computing 9th International Workshop on DNA Based Computers, DNA9, Madison, WI, USA, June 13, 2003 : revised papers
by
Junghuei Chen(
)
7 editions published in 2004 in English and held by 570 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
7 editions published in 2004 in English and held by 570 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(
)
5 editions published in 1993 in English and held by 564 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
5 editions published in 1993 in English and held by 564 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
VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, Corfu, Greece, June 28July 1, 1988 : proceedings
by
J. H Reif(
Book
)
17 editions published in 1988 in 3 languages and held by 385 WorldCat member libraries worldwide
From the Foreword: "The papers in this volume were presented at the Aegean Workshop on Computing: VLSI Algorithms and Architectures (AWOC 88), organized by the Computer Technology Institute in Patras in cooperation with ACM, EATCS, IEEE and the General Secretariat of Research and Technology (Ministry of Industry, Energy & technology of Greece). They were selected from 119 abstracts submitted in response to the program committee's call for papers and to additional invitations from John Reif. AWOC 88 took place in Corfu, Greece, June 28July 1, 1988. AWOC 88 is the third meeting in the International Workshop on Parallel Computing & VLSI series; the first meeting took place in Amalfi, Italy, 1984, and the second at Loutraki, Greece, 1986."
17 editions published in 1988 in 3 languages and held by 385 WorldCat member libraries worldwide
From the Foreword: "The papers in this volume were presented at the Aegean Workshop on Computing: VLSI Algorithms and Architectures (AWOC 88), organized by the Computer Technology Institute in Patras in cooperation with ACM, EATCS, IEEE and the General Secretariat of Research and Technology (Ministry of Industry, Energy & technology of Greece). They were selected from 119 abstracts submitted in response to the program committee's call for papers and to additional invitations from John Reif. AWOC 88 took place in Corfu, Greece, June 28July 1, 1988. AWOC 88 is the third meeting in the International Workshop on Parallel Computing & VLSI series; the first meeting took place in Amalfi, Italy, 1984, and the second at Loutraki, Greece, 1986."
Synthesis of parallel algorithms
(
Book
)
9 editions published in 1993 in English and held by 349 WorldCat member libraries worldwide
Mathematics of Computing  Parallelism
9 editions published in 1993 in English and held by 349 WorldCat member libraries worldwide
Mathematics of Computing  Parallelism
Handbook of parallel computing : models, algorithms and applications
by
Sanguthevar Rajasekaran(
Book
)
16 editions published between 2007 and 2008 in English and held by 273 WorldCat member libraries worldwide
Funded by DSU Title III 20072012
16 editions published between 2007 and 2008 in English and held by 273 WorldCat member libraries worldwide
Funded by DSU Title III 20072012
Parallel image compression NASA SBIR phase 1 report
by
J. H Reif(
)
3 editions published in 1987 in English and held by 269 WorldCat member libraries worldwide
3 editions published in 1987 in English and held by 269 WorldCat member libraries worldwide
DCC '91 : Data Compression Conference
by Data Compression Conference(
Book
)
4 editions published in 1991 in English and held by 114 WorldCat member libraries worldwide
4 editions published in 1991 in English and held by 114 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(
)
3 editions published in 2002 in English and held by 57 WorldCat member libraries worldwide
3 editions published in 2002 in English and held by 57 WorldCat member libraries worldwide
Deriving efficient graph algorithms
by
J. H Reif(
Book
)
5 editions published in 1982 in English and Undetermined and held by 9 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)
5 editions published in 1982 in English and Undetermined and held by 9 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)
VLSI algorithms and architectures : proceedings
(
Book
)
1 edition published in 1988 in English and held by 8 WorldCat member libraries worldwide
1 edition published in 1988 in English and held by 8 WorldCat member libraries worldwide
The propositional dynamic logic of deterministic, wellstructured programs
by
Joseph Y Halpern(
Book
)
1 edition published in 1981 in English and held by 8 WorldCat member libraries worldwide
1 edition published in 1981 in English and held by 8 WorldCat member libraries worldwide
Implementation of Parallel Algorithms
(
)
7 editions published between 1991 and 1993 in English and held by 7 WorldCat member libraries worldwide
Work is progressing in the design of a new, general intermediate representation for parallel code. We wish to provide a single compilation target that is executable on a wide variety of parallel machines and vector processors. The representation we are designing is an extension of VCODE, due to Blelloch at CMU, which is particularly suitable as a target only for dataparallel language. VCODE provides a rich set of vector operations, including powerful segmented prefix computations and permutation operations, which run efficiently on a wide range of architectures. However, VCODE provides only sequential control, which limits its application strictly to dataparallel programming. We have extended VCODE to form a new language called AVCODE which has operations for process creation, communication, and synchronization. AVCODE provides an avenue for efficiently targeting a parallel language to a number of different hardware systems through a single intermediate language
7 editions published between 1991 and 1993 in English and held by 7 WorldCat member libraries worldwide
Work is progressing in the design of a new, general intermediate representation for parallel code. We wish to provide a single compilation target that is executable on a wide variety of parallel machines and vector processors. The representation we are designing is an extension of VCODE, due to Blelloch at CMU, which is particularly suitable as a target only for dataparallel language. VCODE provides a rich set of vector operations, including powerful segmented prefix computations and permutation operations, which run efficiently on a wide range of architectures. However, VCODE provides only sequential control, which limits its application strictly to dataparallel programming. We have extended VCODE to form a new language called AVCODE which has operations for process creation, communication, and synchronization. AVCODE provides an avenue for efficiently targeting a parallel language to a number of different hardware systems through a single intermediate language
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
Proceedings of the thiryfourth annual ACM symposium on Theory of computing
by
J. H Reif(
)
2 editions published in 2002 in English and held by 6 WorldCat member libraries worldwide
2 editions published in 2002 in English and held by 6 WorldCat member libraries worldwide
Theory of computing  STOC 2002 : proceedings
by 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
)
3 editions published between 1984 and 1985 in English and held by 4 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
3 editions published between 1984 and 1985 in English and held by 4 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
O(log²n) time efficient parallel factorization of dense, sparse separable, and banded matrices
by
J. H Reif(
Book
)
1 edition published in 1994 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1994 in English and held by 4 WorldCat member libraries worldwide
Shortest paths in Euclidean space with polyhedral obstacles
by
J. H Reif(
Book
)
3 editions published between 1984 and 1985 in English and held by 4 WorldCat member libraries worldwide
3 editions published between 1984 and 1985 in English and held by 4 WorldCat member libraries worldwide
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
A logarithmic time sort for linear size networks
by
J. H Reif(
Book
)
4 editions published in 1982 in English and held by 3 WorldCat member libraries worldwide
We give a randomized algorithm that sorts on an N node network with constant valence in O(log N) time. More particularly the algorithm sorts N items on an N code cubeconnected cycles graph and for some constant k for all large enough alpha it terminates within K alpha log N time with probability at least 1n/alpha
4 editions published in 1982 in English and held by 3 WorldCat member libraries worldwide
We give a randomized algorithm that sorts on an N node network with constant valence in O(log N) time. More particularly the algorithm sorts N items on an N code cubeconnected cycles graph and for some constant k for all large enough alpha it terminates within K alpha log N time with probability at least 1n/alpha
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Chen, Junghuei 1960 Author Editor
 Paige, Robert A. Author Editor
 Wachter, R. F. 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 Electronics Engineering Geometry Graph theory Information storage and retrieval systems Integrated circuitsVery large scale integration Iterative methods (Mathematics) Linear systems Logic, Symbolic and mathematical Matrices Molecular computers 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