John H. Reif
Download 433.18 Kb.
|
| 49:3, December, 1994, pp. 517-561. [PostScript] [PDF]
Sanguthevar Rajasekaran and John H. Reif, Nested Annealing: A Provable Improvement to Simulated Annealing. Presented at Workshop on Applications of Combinatorics and Graph Theory to Computer Science, Institute for Mathematics and its Applications, University of Minnesota, December 1987. Presented at the 15th International Colloquium on Automata, Languages and Programming, Tampere, Finland, July 1988; Lecture Notes in Computer Science, Vol. 317, 1988, pp. 455-472. Published in Journal of Theoretical Computer Science, 99(1):157-176, 1 June 1992. [PDF] Victor Y. Pan and John H. Reif, Some Polynomial and Toeplitz Matrix Computations. 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, October 1987, (IEEE Computer Society Press) pp. 173-184. [PDF] James A. Storer and John H. Reif, Real-time Compression of Video on a Grid-connected Parallel Computer. 3rd International Conference on Supercomputing, Boston, MA, May 1988. [PDF] Edward W. Davis and John H. Reif, Architecture and Operation of the BLITZEN Processing Element. 3rd International Conference on Computing on Supercomputing, Boston, MA, May 1988. Also revised as Donald W. Blevins, Edward W. Davis, and John H. Reif, Processing Element and Custom Chip Architecture for the BLITZEN Massively Parallel Processor, MCNC Technical Report TR87-22, October 1987, revised June 1988. [PDF] John H. Reif and Sandeep Sen, An Efficient Output-Sensitive Hidden-Surface Removal Algorithm and its Parallelization. 4th Annual ACM Symposium on Computational Geometry, Urbana, IL, June 1988, pp. 193-200. Published as An Efficient Output-Sensitive Hidden-Surface Removal Algorithm for Polyhedral Terrains, Journal of Mathematical and Computer Modeling, Vol. 21, No. 5, pp. 89-104, 1995. [PDF] or [PDF] Lars S. Nyland and John H. Reif, An Algebraic Technique for Generating Optimal CMOS Circuitry in Linear Time, Computers and Mathematics with Applications Vol 31, No. 1, Jan. 1996, pp.85-108. [PDF] Donald W. Blevins, Edward W. Davis, Richard A. Heaton and John H. Reif, BLITZEN: A Highly Integrated Massively Parallel Machine. 2nd Symposium on Frontiers of Massively Parallel Computation, Fairfax, VA, October 1988. Published in Journal of Parallel and Distributed Computing, Vol. 8, February 1990, pp. 150-160. [PDF] John H. Reif and Steve R. Tate, Optimal Size Integer Division Circuits. 21st Annual ACM Symposium on Theory of Computing, Seattle, WA, May 1989, pp. 264-273. Presented at meeting on Efficient Algorithms, Mathematisches Forschungsinstitut, W. Germany, September 1989. Published in SIAM Journal on Computing, Vol. 19, No. 5, October 1990, pp. 912-924. [PDF] or [PostScript] [PDF] or [PostScript] John H. Reif and Sandeep Sen, Polling: A New Randomized Sampling Technique for Computational Geometry, 21st Annual ACM Symposium on Theory of Computing, Seattle, WA, May 1989, pp. 394-404. [PDF] Revised as Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems, Published in SIAM Journal on Computing, Vol. 21, No. 3, June 1992, pp. 466-485. [PDF] or [PDF] (see also Erratum: Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems. SIAM Journal on Computing, 23(2):447-448, April 1994. [PDF]) John H. Reif and A. Tyagi, Energy Complexity of Optical Computations, 2nd IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, December 1990, pp. 14-21. Revised for Journal Publication in International Journal of Unconventional Computing, 2016, Vol. 12 Issue 5/6, pp. 393-412. [PDF] [PDF] John H. Reif, Optical expanders give constant time holographic routing using O(N log N) switches, 1988 [PDF]. Full paper appeared as E.S. Maniloff, K. Johnson, and John H. Reif, Holographic Routing Network for Parallel Processing Machines Holographic Optics II: Principals and Applications, G. Michael Morris; Ed. SPIE Proceedings Series, Vol. 1136, EPS/EUROPTICA/SPIE International Congress on Optical Science and Engineering, Paris, France, April 1989, pp. 283-289. [PDF] John H. Reif, Doug Tygar, and Akitoshi Yoshida, The Computability and Complexity of Optical Beam Tracing. 31st Annual IEEE Symposium on Foundations of Computer Science, St. Louis, MO, October 1990, pp. 106-114. Published as The Computability and Complexity of Ray Tracing in Discrete & Computational Geometry, 11: pp. 265-287 (December 1994). [PDF] Selman Azhar, Andrew McLennan and John H. Reif, Computation of Equilibria in Noncooperative Games, Duke University Technical Report CS-1991-36. Proc. Workshop for Computable Economics, Dec. 1992. Published in Computers & Mathematics with Applications, Volume 50, Issues 5-6, September 2005, pp. 823-854. [PDF] R. Paturi, Sanguthevar Rajasekaran, and John H. Reif, Efficient and Robust Learning Using Statistical Bootstrap, Proceedings of the 2nd Annual Workshop on Computational Learning Theory, Santa Cruz, CA, August 1989. [PostScript] [PDF] Published as The Light Bulb Problem, Information and Computation, 117(2):187-192, March 1995. [PDF] John H. Reif and Sandeep Sen, Randomized Parallel Algorithms. IBM Workshop on Capabilities and Limitations of Parallel Computing, San Jose, CA, December 1988. Information Processing 89, G. Ritter, ed., Elsevier Science Publishers, North Holland, 1989, pp. 455-458. [PDF] A Case for Randomized Parallel Algorithms in Opportunities and Constraints of Parallel Computing, J.L.C. Sanz (ed.), Springer-Verlag New York, 1989, pp. 101-105. Also presented as Randomization in Parallel Algorithms and its Impact on Computational Geometry, in Optimal Algorithms;Lecture Notes in Computer Science, Vol. 401, 1989, pp. 1-8. [PDF] Also presented as C. Pandurangan, Sanguthevar Rajasekaran, John H. Reif, Sandeep Sen, Studies on Sequential and Parallel Randomized Algorithms, Indo-US Workshop on Cooperative Research in Computer Science, Bangalore, India, August 4-6, 1992. [PDF] Victor Y. Pan and John H. Reif, On the Bit-Complexity of Discrete Approximations to PDEs. International Colloquium on Automata, Languages, and Programming(ICALP 90), Warwich, England, Springer Lecture Notes in Computer Science 443, pp. 612-625, July 1990. [PDF] Published as The Bit-Complexity of Discrete Solutions of Partial Differential Equations: Compact Multigrid, Computers and Mathematics with Applications, Vol. 20, No. 2, 1990, pp. 9-16. [PDF]. John H. Reif and A. Tyagi, Efficient Algorithms for Optical Computing with the DFT Primitive, Presented at 10th Conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, India, Lecture Notes in Computer Science, pp. 149-160 (December 1990). Published as Efficient Algorithms for Optical Computing with the discrete Fourier transform (DFT) primitive, Journal of Applied Optics, Vol. 36, 1997, pp. 7327-7340. [PDF] or [PostScript] [PDF] John Canny, A. Rege, and John H. Reif, An Exact Algorithm for Kinodynamic Planning in the Plane. 6th Annual ACM Symposium on Computational Geometry, Berkeley, CA, June 1990, pp. 271-280. [PDF] Published in Discrete and Computational Geometry, Vol. 6, 1991, pp. 461-484. [PDF] John H. Reif and Sandeep Sen, Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications. 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, Crete, Greece, July 1990, pp. 327-337. Published in SIAM Journal of Computing 23:3, June, 1994, pp.633-651. [PDF] John H. Reif, Efficient Parallel Algorithms: Theory and Practice. SIAM 35th Anniversary Meeting, Denver, CO, October 1987. XI World Computer Congress, IFIP 89, San Francisco, CA, 1989. Hristo Djidjev and John H. Reif, An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs. 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, May 1991, pp. 337-347. [PDF] Hillel Gazit and John H. Reif, A Randomized Parallel Algorithm for Planar Graph Isomorphism. 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, Crete, Greece, July 1990, pp. 210-219. Published in Journal of Algorithms, Vol. 28, No. 2, pp. 290-314, August 1998. [PostScript] [PDF] Victor Y. Pan and John H. Reif, The Parallel Computation of Minimum Cost Paths in Graphs by Stream Contraction, Information Processing Letters, Vol. 40, October 25,1991, pp. 79-83. [PDF] John H. Reif and Steve R. Tate, Approximate Kinodynamic Planning Using L2-norm Dynamic Bounds. Duke University Technical Report CS-1990-13, 1989. Published in Computers and Mathematics with Applications, Vol. 27, No.5, pp.29-44, March 1994. [PostScript] [PDF] Royals, M., Tassos Markas, N. Kanopoulos, John H. Reif and James A. Storer, On the Design and Implementation of a Lossless Data Compression and Decompression Chip, IEEE Journal of Solid State Circuits (JSSC), Vol. 28, No. 9, pp. 948-953, Sep. 1993. [PDF] Micheal Karr, S. Krishnan, John H. Reif, Derivation of the Ellipsoid Algorithm, Duke University Technical Report CS-1991-17, (1990). [PDF] John H. Reif and A. Tyagi, An Optical Delay Line Memory Model with Efficient Algorithms. Advanced Research in VLSI Conference, MIT Press, Santa Cruz, CA, March 1991. Published in Optical Engineering, 36(09), pp. 2521-2535, Sept. (1997). [PostScript] [PDF] Selman Azhar and John H. Reif, Crypto-Complexity Based Models of Efficiency in Capital Markets, 1994. [PDF] John H. Reif and Steve R. Tate, Continuous Alternation: The Complexity of Pursuit in Continuous Domains, Special Issue on Computational Robotics: the Geometric Theory of Manipulation, Planning and Control, Algorithmica, Vol. 10, pp. 151-181, 1993. [PostScript] [PDF] John H. Reif and Akitoshi Yoshida, Optical Expanders with Applications in Optical Computing, Journal of Applied Optics, 32, 1993, pp. 159-165. [PDF] or [PostScript] [PDF] James A. Storer and John H. Reif, Low-Cost Prevention of Error Propagation for Data Compression with Dynamic Dictionaries, Proceedings: IEEE Data Compression Conference (DCC'97) Snowbird, UT, IEEE Computer Society Press, James A. Storer, Martin Cohn (Eds.), March 1997, pp. 171-180. Published as Error Resilient Optimal Data Compression, SIAM Journal of Computing (SICOMP), Vol 26, Num 4, July 1997, pp. 934-939. [PostScript] [PDF] Peter H. Mills, Lars S. Nyland, J.F. Prins, John H. Reif and Robert A. Wagner, Prototyping Parallel and Distributed Programs in Proteus. 3rd IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, pp. 10-19, IEEE, 1991. [PostScript] [PDF] James A. Storer, Tassos Markas and John H. Reif, A Massively Parallel VLSI Compression System using a Compact Dictionary. IEEE Workshops on VLSI & Signal Processing, 1990, San Diego, CA. Published as A Massively Parallel VLSI Design for Data Compression Using a Compact Dictionary, VLSI Signal Processing, No. 4, 1990 (edited by H.S. Moscovitz and K. Yao and R. Jain), Chapter 32, IEEE Press, 1990, New York, NY, pp. 329-338. [PDF] S. Krishnan and John H. Reif, Towards Randomized Strongly Polynomial Algorithms for Linear Programming, Duke University Technical Report CS-1991-18. [PDF] Victor Y. Pan and John H. Reif, Decreasing the Precision of Linear Algebra Computations by Using Compact Multigrid and Backward Interval Analysis. 4th SIAM Conference in Applied Linear Algebra, Minneapolis, MN, September 1991. Published as Compact Multigrid, SIAM Journal of Scientific and Statistical Computing, Vol. 13, No. 1, pp. 119-127, (1992). [PDF] Tassos Markas and John H. Reif, Fast Computations of Vector Quantization Algorithms. NASA Technical Report TR-91-58, 1991. Tassos Markas and John H. Reif, Image Compression Methods with Distortion Controlled Capabilities. IEEE Data Compression Conference (DCC 91), Snowbird, UT, IEEE Computer Society Press, April 1991, pp. 93-102. Published as Quad Tree Structures for Image Compression Applications, special issue of Journal of Information Processing and Management, 1992, pp. 707-721. [PDF] Joseph Cheriyan and John H. Reif, Algebraic Methods for Testing the k-Vertex Connectivity of Directed Graphs, 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, Orlando, Florida, 1992, pp. 203-210. [PDF] Published as Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity, in Combinatorica 14(4) pp. 435-451, 1994. [PDF] John H. Reif and Akitoshi Yoshida, Optical Techniques for Image Compression. 2nd Annual IEEE Data Compression Conference (DCC 92), Snowbird, UT, IEEE Computer Society Press, James A. Storer, Martin Cohn (Eds.), March 1992, pp. 32-41. Also in Image and Text Compression, edited by James A. Storer, Kluwer Academic Publishers, 1992. Published as "Optical Computing Techniques for Image/Video Compression," in Proceedings of the IEEE, 82:6, June 1994, pp. 948-954. [PDF] John H. Reif and Hongyan Wang, On Line Navigation Through Regions of Variable Densities. ARO Computational Geometry Workshop, Raleigh, North Carolina, October, 1993. Rewritten as On-Line Navigation Through Weighted Regions. [PostScript] [PDF] Ming Kao, John H. Reif, and Steve R. Tate, Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem, Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'93), Austin, TX, Jan 1993, pp.441-447. Published in Information and Computation, Vol 131, No. 1 (1996), p 63-80. [PostScript] [PDF] John H. Reif, O(log2 n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices. 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'94), Cape May, NJ, June 1994, pp. 114-121. [PostScript] [PDF] John H. Reif, An O(n log^3 n) Algorithm for the Real Root Problem. 34th Annual IEEE Conference on Foundations of Computer Science (FOCS '93) Proceedings, November 1993, Palo Alto, CA, pp. 626-635. Revised as An Efficient Algorithm for the Real Root and Symmetric Tridiagonal Eigenvalue Problems, 1994. [PostScript] [PDF] and [PostscriptFigures] Tassos Markas and John H. Reif, Memory-Shared Parallel Architectures for Vector Quantization Algorithms, 1992. Picture Coding Symposium, Lusanne Switzerland, March, 1993. Peter H. Mills, Lars S. Nyland, Jan Prins, and John H. Reif, Prototyping N-body Simulation in Proteus, Sixth International Parallel Processing Symposium, IEEE, Beverly Hills, CA, pp. 476-482, 1992. [PostScript] [PDF] Deganit Armon and John H. Reif, Space and time efficient implementations of parallel nested dissection, 4th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, CA, July 1992. Submitted for journal publication as Space and Time Efficient Implementations of a Parallel Direct Solver using Nested Dissection. [PDF] Peter H. Mills, Lars S. Nyland, Jan Prins, and John H. Reif, Prototyping High-Performance Parallel Computing Applications in Proteus. DARPA Software Technology Conference, May, 1992. [PostScript] [PDF] Victor Y. Pan, John H. Reif, Steve R. Tate. The Power of Combining the Techniques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms, 32th Annual IEEE Symposium on Foundations of Computer Science (FOCS'92), Pittsburgh, PA, Oct. 1992, pp. 703-713. Rewritten as John H. Reif and Steve R. Tate, "N-body simulation I: Fast algorithms for potential field evaluation and Trummer's problem". Tech. Report. #N-96-002, Univ. of North Texas, Dept. of Computer Science (1996). [PostScript] [PDF] William L. Hightower, Jan Prins, and John H. Reif, Implementations of Randomized Sorting on Large Parallel Machines. 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'92), San Diego, CA, pp. 158-167, July 1992. [PDF] Yijie Han, Victor Y. Pan, and John H. Reif, Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs. University of Kentucky Technical Report 204-92. 4th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, CA, July 1992, pp. 353-362. Published in Algorithmica, Vol 17, pp. 399-415, 1997. [PDF] John H. Reif and Hongyan Wang, Social Potential Fields: A Distributed Behavioral Control for Autonomous Robots, Workshop on Algorithmic Foundations of Robotics (WAFR'94), San Francisco, California, February, 1994; The Algorithmic Foundations of Robotics, A.K.Peters, Boston, MA. 1995, pp. 431-459. Published in Robotics and Autonomous Systems, Vol. 27, no.3, pp.171-194, (May 1999). [PostScript] [PDF] John H. Reif and Steve R. Tate, Dynamic Algebraic Algorithms, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'94), TX, Jan. 1994. pp.290-301. Published as On Dynamic Algorithms for Algebraic Problems, Journal of Algorithms, Volume 22, Number 2, pp. 347-371, February 1997. [PostScript] [PDF] John H. Reif and Steve R. Tate, Dynamic Parallel Tree Contraction, 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'94), Cape May, NJ, June 1994. pp.114-121. Revised version submitted for journal publication. [PDF] Deganit Armon and John H. Reif, A Dynamic Separator Algorithm with Applications to Computational Geometry and Nested Dissection, 3rd Annual Workshop on Algorithms and Data Structures (WADS '93), Montreal, Quebec, Canada, August, 1993, pp. 107-118. [PDF] Selman Azhar, Greg J. Badros, Arman Glodjo, Ming Kao, and John H. Reif, Data Compression Techniques for Stock Market Prediction, Proceedings: IEEE Data Compression Conference (DCC'94), Snowbird, UT, IEEE Computer Society Press, James A. Storer, Martin Cohn (Eds.), March 1994, pp. 72-82. [PDF] Joseph Cheriyan and John H. Reif, Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems, 1992. 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'93), Velon, Germany, July 1993, p.50-56. Published as John H. Reif, Parallel Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems, Journal of Computer and System Sciences, Vol. 62, May 2001, pp. 398-412. [PostScript] [PDF] Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung, Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. Proceedings of the 22nd Annual Colloquium on Automata, Languages and Programming (ICALP'95), Szeged, Hungary, July 1995, pp. 159-170. [PDF] Steve R. Tate and John H. Reif, The Complexity of N-body Simulation, Proceedings of the 20th Annual Colloquium on Automata, Languages and Programming (ICALP'93), Lund, Sweden, July, 1993, pp. 162-176. [PostScript] [PDF] Tassos Markas and John H. Reif, Multispectral Image Compression Algorithms, Proceedings: IEEE Data Compression Conference (DCC'93), Snowbird, UT, IEEE Computer Society Press, James A. Storer, Martin Cohn (Eds.), pp. 391-400, March 1993. [PDF] Peter H. Mills, Jan Prins, and John H. Reif, Rate Control as a Language Construct for Parallel and Distributed Programming, Proc. IEEE Workshop on Parallel and Distributed Real-Time Systems (IPPS'93), pp. 164-170, 1993. [PostScript] [PDF] Richard Barakat and John H. Reif, Diffraction Realization of an Optical Expander, (1993). [PDF] Lars S. Nyland, Jan F. Prins, and John H. Reif, A Data Parallel Implementation of the Adaptive Fast Multipole Algorithm. Dartmouth Institute for Advanced Graduate Studies (DAGS '93), Hanover, NH, June, 1993, pp. 111-123. [PostScript] [PDF] Sefeng Chen and John H. Reif, Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs, 34th Annual IEEE Conference on Foundations of Computer Science (FOCS '93) Proceedings, November 1993, Palo Alto, CA, pp. 104-112. [PDF] Andrew Neff and John H. Reif, An O(n^{1+epsilon} log b) Algorithm for the Complex Roots Problem. 35th Annual IEEE Conference on Foundations of Computer Science (FOCS '94) Proceedings, Santa Fe, NM, November 1994. pp. 540-547. Improved Paper Published as An Efficient Algorithm for the Complex Roots Problem, Journal of Complexity, 12(2) pp. 81-115, (June 1996). [PostScript] [PDF] Andrew Goldberg, Jan Prins, Rickard Faith, Zhiyong Li, Peter H. Mills, Lars S. Nyland, Daniel Palmer, John H. Reif, James Riely, and Stephen Westfold, The Proteus System for the Development of Parallel Applications. Prototyping and Software Development (Malcolm C. Harrison, ed.), Chapter 6, pp. 151-190, Digital Book, 1996. [PostScript] [PDF] Peter H. Mills, Lars S. Nyland, J.F. Prins, and John H. Reif, Software Issues in High-Performance Computing and a Framework for the Development of HPC Applications. In Developing a Computer Science Agenda for High Performance Computing (U. Vishkin, ed.) pp. 110-117, ACM, 1994. [PostScript] [PDF] Andrew Goldberg, Peter H. Mills, Lars S. Nyland, Jan F. Prins, John H. Reif, and J. Riely, Specification and Development of Parallel Algorithms with the Proteus System, Specification of Parallel Algorithms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS Press, Vol. 18, 1994, pp. 383-399. [PostScript] [PDF] Victor Y. Pan and John H. Reif, Generalized Compact Multi-grid, Computers Math Applications, Volume 25, Number 9, pp. 3-5, May 1993. [PDF] John H. Reif and James A. Storer, 3-Dimensional Shortest Paths in the Presence of Polygonal Obstacles. 13th Symposium on Mathematical Foundations of Computer Science, (Edited by Michal Chytil, Ladislav Janiga, Václav Koubek) Czechoslovakia, August 29-September 2, 1988, pp. 85-92. Published as A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions. Journal of the ACM(JACM), Vol. 41, No. 5, Sept. 1994, pp. 1013-1019. [PDF] Sefeng Chen and John H. Reif, Fast Pattern Matching for Entropy Bounded Text. Proceedings: IEEE Data Compression Conference (DCC'95) Snowbird, UT, IEEE Computer Society Press, James A. Storer, Martin Cohn (Eds.), March 1995, pp. 282-301. [PDF] John H. Reif, Efficient Parallel Solution of Sparse Eigenvalue and Eigenvector Problems, Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS'95) Milwaukee, WI, October 23-25, 1995, pp. 123-132. Published as Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix, Algorithmica, 29: 487-510 (2001). [PDF] Akitoshi Yoshida, Jannick P. Rolland and John H. Reif, Design and Applications of a High Resolution Insert Head-Mounted Display. IEEE Virtual Reality Annual International Symposium (VRAIS'95), Research Triangle Park, NC, March 11-15, 1995, pp. 84-93. [PostScript] [PDF] Also, Jannick P. Rolland and Akitoshi Yoshida, and John H. Reif, Optical design and analysis of a head-mounted display with a high-resolution insert, (Novel Optical Systems Design and Optimization, Jose M. Sasian; Ed.,), Proc. SPIE Vol. 2537, pp. 71-82, Aug. 1995. Published as Jannick P. Rolland, Akitoshi Yoshida, Larry D. Davis, and John H. Reif, High resolution inset head-mounted display, Applied Optics: Optical Technology and Biomedical Optics, 37(19), 4183-4193 (1998). [PDF] Sandeep K. S. Gupta, Zhiyong Li, and John H. Reif, Generating Efficient Programs for Two-Level Memories from Tensor-Products. Proceedings of the 7th IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems Washington DC, October 1995, pp. 510-513. [PostScript] [PDF] John H. Reif, Parallel Biomolecular Computation: Models and Simulations. Proceedings: 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'95) Santa Barbara, CA, July 1995, pp. 213-223. Published in Algorithmica, special issue on Computational Biology, Vol. 25, No. 2, 142-176, 1999. [PDF] [PostScript] and [PostScriptFigures] John H. Reif, Work Efficient Parallel Solution of Toeplitz Systems and Polynomial GCD. Proc. of the 27th ACM Symposium on Theory of Computing (STOC 95), Las Vegas, NV, May 29-June 1, 1995, pp. 751-761. Revised as Efficient Parallel Factorization and Solution of Structured and Unstructured Linear Systems, Journal of Computer and System Sciences, Vol. 71, Issue 1 (July 2005), pp. 86 - 143. [PDF] [PDF] Sandeep K. S. Gupta, Zhiyong Li, and John H. Reif, Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms using Block-Cyclic Data Distributions. Proceedings of the 1996 International Conference on Parallel Processing, Bloomingdale, IL, Vol. II, pp. 142-149, (August 1996). Published in IEEE Transactions on Parallel and Distributed Systems, Vol. 10, No. 3, March 1999, pp. 297-315. [PDF] or [PDF] Lars S. Nyland, Jan Prins, Andrew Goldberg, Peter H. Mills, John H. Reif, and Robert Wagner. A Refinement Methodology for Developing Data-Parallel Applications, Second International Euro-Par Conference (Euro-Par'96 Parallel Processing), Lyon, France, Springer Lecture Notes in Computer Science, pp.145-150, 1996. [PDF] Sefeng Chen and John H. Reif, Compression of Trees and Digraphs, Abstract, Proceedings: IEEE Data Compression Conference (DCC'96), Snowbird, UT, James A. Storer, Martin Cohn (Eds.), IEEE Computer Society Press, March 1996. [PDF] John H. Reif and Hongyan Wang, Nonuniform Discretization for Kinodynamic motion planning and its applications, Workshop on Foundations of Robotics, Toulouse, France, July 1996, pp. 97-112. Published in SIAM Journal of Computing (SICOMP), Volume 30, No. 1, pp. 161-190, (2000). [PostScript] [PDF] Zhiyong Li, Peter H. Mills, and John H. Reif, Models and Resource Metrics for Parallel and Distributed Computation, Proc. 28th Annual Hawaii International Conference on System Sciences (HICSS-28 Parallel Algorithms Software Technology Track), Wailea, Maui, Hawaii, pp. 133-143, January 3-6, 1995. Published in Parallel Algorithms and Applications, Vol. 8, pp. 35-59, 1996. [PostScript] [PDF] Erol Gelenbe, Nestor Schmajuk, John Staddon, and John H. Reif, Autonomous Search and the Search for Robots and Mines: A Survey, Robotics and Autonomous Systems, Vol. 22, pp. 23-33. (November 1997). [PostScript] [PDF] John H. Reif, Approximate Complex Polynomial Evaluation in Near Constant Work Per Point. Proc. 29th ACM Symposium on Theory of Computing (STOC97), El Paso, Texas, pp. 30-39 (May 4-6, 1997). Published in SIAM Journal of Computing (SICOMP), Vol. 28, Number 6, pp. 2059-2089, 1999. [PostScript] [PDF] John H. Reif, Efficient Approximate Solution of Sparse Linear Systems, Published in Computers and Mathematics with Applications, Vol. 36, No. 9, Nov. 1998, pp. 37-58. [PostScript] [PDF] (Also, see errata, Computers and Mathematics with Applications, Vol. 38, No. 9, 1999, pp. 141-141. [PDF]) John H. Reif and Steve R. Tate, Fast spatial decomposition and closest pair computation for limited precision input, Journal of Algorithmica, Volume 28, Number 3, pp. 271-287 (2000). [PDF] or [PostScript] [PDF] Sefeng Chen and John H. Reif, Fast and Compact Fast and Compact Volume Rendering in the Compressed Transform, Proceedings: IEEE Data Compression Conference (DCC'97) Snowbird, UT, James A. Storer, Martin Cohn (Eds.), IEEE Computer Society Press, March 1997, pp. 271-280. [PDF] John H. Reif and Doreen Yen, Derivation of Parallel Graph Connectivity Algorithms via Stream Contraction, Duke University Technical Report, 1989. [PDF] John H. Reif, Local Parallel Biomolecular Computation, Proc. DNA-Based Computers, III: University of Pennsylvania, June 23-26, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, H. Rubin and D. H. Wood, editors. American Mathematical Society, Providence, RI, vol. 48, 1999, pp. 217-254. [PDF] Revised as invited paper of special issue "Biomolecular Computing - From Theory to Practical Applications" of Directory: ~reif -> vita ~reif -> CS294-2: Quantum Computation Spring 2007 ~reif -> Springer Science+Business Media New York 2017 ~reif -> Mechanical Computation: The Computational Complexity of Physical Computing Devices Chapter, Encyclopedia of Complexity and Systems Science vita -> Papers by Reif on Program Logics (6 papers) ~reif -> R. Landauer, "Irreversibility and heat generation in the computing process", ibm j. Res. Dev. 5, 183 (1961) ~reif -> 1 John h reif2 and Thomas h laBean Download 433.18 Kb. Share with your friends:
|