The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
John H. Reif: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Ben-Or, Dexter Kozen, John H. Reif
    The Complexity of Elementary Algebra and Geometry. [Citation Graph (5, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:32, n:2, pp:251-264 [Journal]
  2. Gary L. Miller, John H. Reif
    Parallel Tree Contraction and Its Application [Citation Graph (1, 0)][DBLP]
    FOCS, 1985, pp:478-489 [Conf]
  3. John H. Reif
    An Optimal Parallel Algorithm for Integer Sorting [Citation Graph (1, 0)][DBLP]
    FOCS, 1985, pp:496-504 [Conf]
  4. Michael Ben-Or, Dexter Kozen, John H. Reif
    The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:457-464 [Conf]
  5. John H. Reif, Stephen R. Tate
    On Threshold Circuits and Polynomial Computation. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:896-908 [Journal]
  6. Victor Y. Pan, John H. Reif
    Fast and Efficient Parallel Linear Programming and Linear Least Squares Computations. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:283-295 [Conf]
  7. Ashish Gehani, Thomas H. LaBean, John H. Reif
    DNA-based Cryptography. [Citation Graph (0, 0)][DBLP]
    Aspects of Molecular Computing, 2004, pp:167-188 [Conf]
  8. John H. Reif, William L. Scherlis
    Deriving Effcient Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    Verification: Theory and Practice, 2003, pp:645-681 [Conf]
  9. Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif
    The Light Bulb Problem. [Citation Graph (0, 0)][DBLP]
    COLT, 1989, pp:261-268 [Conf]
  10. John F. Canny, Ashutosh Rege, John H. Reif
    An Exact Algorithm for Kinodynamic Planning in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:271-280 [Conf]
  11. John H. Reif, Sandeep Sen
    An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:193-200 [Conf]
  12. John H. Reif, J. D. Tygar
    Efficient Parallel Pseudo-Random Number Generation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:433-446 [Conf]
  13. S. Azhar, Greg J. Badros, A. Glodjo, Ming-Yang Kao, John H. Reif
    Data Compression Techniques for Stock Market Prediction. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1994, pp:72-82 [Conf]
  14. Shenfeng Chen, John H. Reif
    Fast Pattern Matching for Entropy Bounded Text. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1995, pp:282-291 [Conf]
  15. Shenfeng Chen, John H. Reif
    Efficient Lossless Compression of Trees and Graphs. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1996, pp:428- [Conf]
  16. Sefeng Chen, John H. Reif
    Fast and Compact Volume Rendering in the Compressed Transform Domain. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1997, pp:271-280 [Conf]
  17. Tassos Markas, John H. Reif
    Image Compression Methods with Distortion Controlled Capabilities. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1991, pp:93-102 [Conf]
  18. Tassos Markas, John H. Reif
    Multispectral Image Compression Algorithms. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1993, pp:391-400 [Conf]
  19. John H. Reif, James A. Storer
    Optimal Lossless Compression of a Class of Dynamic Sources. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1998, pp:501-510 [Conf]
  20. John H. Reif, Akitoshi Yoshida
    Optical Techniques for Image Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1992, pp:32-41 [Conf]
  21. James A. Storer, John H. Reif
    Low-Cost Prevention of Error Propagation for Data Compression with Dynamic Dictionaries. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1997, pp:171-180 [Conf]
  22. John H. Reif
    The Design of Autonomous DNA Nanomechanical Devices: Walking and Rolling DNA. [Citation Graph (0, 0)][DBLP]
    DNA, 2002, pp:22-37 [Conf]
  23. John H. Reif, Thomas H. LaBean
    Computationally Inspired Biotechnologies: Improved DNA Synthesis and Associative Search Using Error-Correcting Codes and Vector-Quantization. [Citation Graph (0, 0)][DBLP]
    DNA Computing, 2000, pp:145-172 [Conf]
  24. John H. Reif, Thomas H. LaBean, Michael Pirrung, Vipul S. Rana, Bo Guo, Carl Kingsford, Gene S. Wickham
    Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability. [Citation Graph (0, 0)][DBLP]
    DNA, 2001, pp:231-247 [Conf]
  25. John H. Reif, Thomas H. LaBean, Nadrian C. Seeman
    Challenges and Applications for Self-Assembled DNA Nanostructures. [Citation Graph (0, 0)][DBLP]
    DNA Computing, 2000, pp:173-198 [Conf]
  26. John H. Reif, Sudheer Sahu, Peng Yin
    Compact Error-Resilient Computational DNA Tiling Assemblies. [Citation Graph (0, 0)][DBLP]
    DNA, 2004, pp:293-307 [Conf]
  27. Dage Liu, John H. Reif, Thomas H. LaBean
    DNA Nanotubes: Construction and Characterization of Filaments Composed of TX-tile Lattice. [Citation Graph (0, 0)][DBLP]
    DNA, 2002, pp:10-21 [Conf]
  28. Peng Yin, Andrew J. Turberfield, John H. Reif
    Designs of Autonomous Unidirectional Walking DNA Devices. [Citation Graph (0, 0)][DBLP]
    DNA, 2004, pp:410-425 [Conf]
  29. Peng Yin, Andrew J. Turberfield, Sudheer Sahu, John H. Reif
    Design of an Autonomous DNA Nanomechanical Device Capable of Universal Computation and Universal Translational Motion. [Citation Graph (0, 0)][DBLP]
    DNA, 2004, pp:426-444 [Conf]
  30. Peng Yin, Sudheer Sahu, Andrew J. Turberfield, John H. Reif
    Design of Autonomous DNA Cellular Automata. [Citation Graph (0, 0)][DBLP]
    DNA, 2005, pp:399-416 [Conf]
  31. Urmi Majumder, Sudheer Sahu, Thomas H. LaBean, John H. Reif
    Design and Simulation of Self-repairing DNA Lattices. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:195-214 [Conf]
  32. Sudheer Sahu, John H. Reif
    Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:223-238 [Conf]
  33. Sudheer Sahu, Bei Wang, John H. Reif
    A Framework for Modeling DNA Based Molecular Systems. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:250-265 [Conf]
  34. John H. Reif, Sudheer Sahu, Peng Yin
    Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems. [Citation Graph (0, 0)][DBLP]
    DNA, 2005, pp:257-274 [Conf]
  35. Sudheer Sahu, Peng Yin, John H. Reif
    A Self-assembly Model of Time-Dependent Glue Strength. [Citation Graph (0, 0)][DBLP]
    DNA, 2005, pp:290-304 [Conf]
  36. Lars S. Nyland, Jan Prins, Allen Goldberg, Peter Mills, John H. Reif, Robert A. Wagner
    A Refinement Methodology for Developing Data-Parallel Applications. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:145-150 [Conf]
  37. Sanguthevar Rajasekaran, John H. Reif
    Ranomized Parallel Computation. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:364-376 [Conf]
  38. John H. Reif
    Probabilistic algorithms in group theory. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:341-350 [Conf]
  39. John H. Reif, Zheng Sun
    On Boundaries of Highly Visible Spaces and Applications. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:271-283 [Conf]
  40. Zheng Sun, John H. Reif
    Adaptive and Compact Discretization for Weighted Region Optimal Path Finding. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:258-270 [Conf]
  41. Shenfeng Chen, John H. Reif
    Using Difficulty of Prediction to Decrease Computation: Fast Sort, Priority Queue and Convex Hull on Entropy Bounded Inputs [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:104-112 [Conf]
  42. John F. Canny, Bruce Randall Donald, John H. Reif, Patrick G. Xavier
    On the Complexity of Kinodynamic Planning [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:306-316 [Conf]
  43. John F. Canny, John H. Reif
    New Lower Bound Techniques for Robot Motion Planning Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:49-60 [Conf]
  44. Joseph Y. Halpern, John H. Reif
    The Propositional Dynamic Logic of Deterministic, Well-Structured Programs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:322-334 [Conf]
  45. Philip N. Klein, John H. Reif
    An Efficient Parallel Algorithm for Planarity [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:465-477 [Conf]
  46. Victor Y. Pan, John H. Reif
    Some Polynomial and Toeplitz Matrix Computations [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:173-184 [Conf]
  47. Victor Y. Pan, John H. Reif, Stephen R. Tate
    The Power of Combining the Techiques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:703-713 [Conf]
  48. C. Andrew Neff, John H. Reif
    An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:540-547 [Conf]
  49. Gary L. Peterson, John H. Reif
    Multiple-Person Alternation [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:348-363 [Conf]
  50. Vijaya Ramachandran, John H. Reif
    An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:282-287 [Conf]
  51. John H. Reif
    Complexity of the Mover's Problem and Generalizations (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:421-427 [Conf]
  52. John H. Reif
    Parallel Time O(log N) Acceptance of Deterministic CFLs [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:290-296 [Conf]
  53. John H. Reif
    Logarithmic Depth Circuits for Algebraic Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:138-145 [Conf]
  54. John H. Reif
    An O(n log ^3 n) Algorithm for the Real Root Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:626-635 [Conf]
  55. John H. Reif
    Efficient Parallel Solution of Sparse Eigenvalue and Eigenvector Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:123-132 [Conf]
  56. John H. Reif, Micha Sharir
    Motion Planning in the Presence of Moving Obstacles [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:144-154 [Conf]
  57. John H. Reif, J. D. Tygar, Akitoshi Yoshida
    The Computability and Complexity of Optical Beam Tracing [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:106-114 [Conf]
  58. Victor Y. Pan, John H. Reif
    Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:470-487 [Conf]
  59. John H. Reif
    Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:102-121 [Conf]
  60. John H. Reif, Akhilesh Tyagi
    Efficient Parallel Algorithms for Optical Computing with the DFT Primitive. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:149-160 [Conf]
  61. Zhiyong Li, Peter Mills, John H. Reif
    Models and resource metrics for parallel and distributed computation. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1995, pp:51-60 [Conf]
  62. Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung
    Stocastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:159-170 [Conf]
  63. Victor Y. Pan, John H. Reif
    On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:612-625 [Conf]
  64. Sanguthevar Rajasekaran, John H. Reif
    Nested Annealing: A Provable Improvement to Simulated Annealing. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:455-472 [Conf]
  65. John H. Reif
    Molecular Assembly and Computation: From Theory to Experimental Demonstrations. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:1-21 [Conf]
  66. John H. Reif
    Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:56-67 [Conf]
  67. John H. Reif
    On the Power of Probabilistic Choice in Synchronous Parallel Computations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:442-450 [Conf]
  68. John H. Reif, A. Prasad Sistla
    A Multiprocess Network Logic with Temporal and Spatial Modalities. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:629-639 [Conf]
  69. John H. Reif, Paul G. Spirakis
    Probabilistic Bidding Gives Optimal Distributed Resource Allocation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:391-402 [Conf]
  70. John H. Reif, Stephen R. Tate
    The Complexity of N-body Simulation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:162-176 [Conf]
  71. Zhiyong Li, John H. Reif, Sandeep K. Gupta
    Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data Distributions. [Citation Graph (0, 0)][DBLP]
    ICPP, Vol. 2, 1996, pp:142-149 [Conf]
  72. John H. Reif, Sandeep Sen
    Optimal Randomized Parallel Algorithms for Computational Geometry. [Citation Graph (0, 0)][DBLP]
    ICPP, 1987, pp:270-277 [Conf]
  73. David Hsu, Tingting Jiang, John H. Reif, Zheng Sun
    The bridge test for sampling narrow passages with probabilistic roadmap planners. [Citation Graph (0, 0)][DBLP]
    ICRA, 2003, pp:4420-4426 [Conf]
  74. John H. Reif, Thomas H. LaBean, Nadrian C. Seeman
    Programmable Assembly at the Molecular Scale: Self-Assembly of DNA Lattices (Invited Paper). [Citation Graph (0, 0)][DBLP]
    ICRA, 2001, pp:966-971 [Conf]
  75. Zheng Sun, John H. Reif
    On energy-minimizing paths on terrains for a mobile robot. [Citation Graph (0, 0)][DBLP]
    ICRA, 2003, pp:3782-3788 [Conf]
  76. John H. Reif, Sandeep Sen
    Randomized Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1989, pp:455-458 [Conf]
  77. Alfred Brenner, Richard F. Freund, R. Stockton Gaines, Rob Kelly, Louis Lome, Richard McAndrew, Alexandru Nicolau, Janak H. Patel, Thomas Probert, John H. Reif, Jorge L. C. Sanz, Howard Jay Siegel, Jon A. Webb
    How Do We Make Parallel Processing a Reality? Bridging the Gap Between Theory and Practice. [Citation Graph (0, 0)][DBLP]
    IPPS, 1991, pp:648-653 [Conf]
  78. Peter Mills, Lars S. Nyland, Jan Prins, John H. Reif
    Prototyping N-Body Simulation in Proteus. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:476-482 [Conf]
  79. John H. Reif
    Models and Resource Metrics for Parallel and Distributed Computation. [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:404- [Conf]
  80. Zheng Sun, John H. Reif
    BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:160-171 [Conf]
  81. John H. Reif, William L. Scherlis
    Deriving Efficient Graph Algorithms (Summary). [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1983, pp:421-441 [Conf]
  82. John H. Reif, James A. Storer
    3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:85-92 [Conf]
  83. John H. Reif, Sandeep Sen
    Randomization in Parallel Algorithms and its Impact on Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:1-8 [Conf]
  84. Sandeep K. S. Gupta, Zhiyong Li, John H. Reif
    Generating Efficient Programs for Two-Level Memories from Tensor-products. [Citation Graph (0, 0)][DBLP]
    Parallel and Distributed Computing and Systems, 1995, pp:510-513 [Conf]
  85. John H. Reif, Paul G. Spirakis
    Real Time Resource Allocation in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    PODC, 1982, pp:84-94 [Conf]
  86. John H. Reif
    Symbolic Programming Analysis in Almost Linear Time. [Citation Graph (0, 0)][DBLP]
    POPL, 1978, pp:76-83 [Conf]
  87. John H. Reif
    Data Flow Analysis of Communicating Processes. [Citation Graph (0, 0)][DBLP]
    POPL, 1979, pp:257-268 [Conf]
  88. John H. Reif, Harry R. Lewis
    Symbolic Evaluation and the Global Value Graph. [Citation Graph (0, 0)][DBLP]
    POPL, 1977, pp:104-118 [Conf]
  89. John H. Reif, Gary L. Peterson
    A Dynamic Logic of Multiprocessing with Incomplete Information. [Citation Graph (0, 0)][DBLP]
    POPL, 1980, pp:193-202 [Conf]
  90. John H. Reif, Paul G. Spirakis
    Unbounded Speed Variability in Distributed Communication Systems. [Citation Graph (0, 0)][DBLP]
    POPL, 1982, pp:46-56 [Conf]
  91. Joseph Cheriyan, John H. Reif
    Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:335-344 [Conf]
  92. Ming-Yang Kao, John H. Reif, Stephen R. Tate
    Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:441-447 [Conf]
  93. John H. Reif, Stephen R. Tate
    Dynamic Algebraic Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:290-301 [Conf]
  94. Deganit Armon, John H. Reif
    Space and Time Efficient Implementations of Parallel Nested Dissection. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:344-352 [Conf]
  95. Joseph Cheriyan, John H. Reif
    Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:50-56 [Conf]
  96. Hillel Gazit, John H. Reif
    A Randomized Parallel Algorithm for Planar Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:210-219 [Conf]
  97. Yijie Han, Victor Y. Pan, John H. Reif
    Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:353-362 [Conf]
  98. William L. Hightower, Jan Prins, John H. Reif
    Implementations of Randomized Sorting on Large Parallel Machines. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:158-167 [Conf]
  99. John H. Reif
    O(log² n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices. [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:278-289 [Conf]
  100. John H. Reif
    Parallel Molecular Computation. [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:213-223 [Conf]
  101. John H. Reif, Sandeep Sen
    Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:327-339 [Conf]
  102. John H. Reif, Stephen R. Tate
    Dynamic Parallel Tree Contraction (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:114-121 [Conf]
  103. Akhilesh Tyagi, John H. Reif
    Energy complexity of optical computations. [Citation Graph (0, 0)][DBLP]
    SPDP, 1990, pp:14-21 [Conf]
  104. Hristo Djidjev, John H. Reif
    An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:337-347 [Conf]
  105. I. S. Filotti, Gary L. Miller, John H. Reif
    On Determining the Genus of a Graph in O(v^O(g)) Steps [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:27-37 [Conf]
  106. Péter Gács, John H. Reif
    A Simple Three-Dimensional Real-Time Reliable Cellular Array [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:388-395 [Conf]
  107. Victor Y. Pan, John H. Reif
    Efficient Parallel Solution of Linear Systems [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:143-152 [Conf]
  108. John H. Reif
    Universal Games of Incomplete Information [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:288-308 [Conf]
  109. John H. Reif
    Logics for Probabilistic Programming (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:8-13 [Conf]
  110. John H. Reif
    Symmetric Complementation [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:201-214 [Conf]
  111. John H. Reif
    Work efficient parallel solution of Toeplitz systems and polynomial GCD. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:751-761 [Conf]
  112. John H. Reif
    Approximate Complex Polynomial Evaluation in Near Constant Work Per Point. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:30-39 [Conf]
  113. John H. Reif, Paul G. Spirakis
    Random Matroids [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:385-397 [Conf]
  114. John H. Reif, Paul G. Spirakis
    Distributed Algorithms for Synchronizing Interprocess Communication within Real Time [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:133-145 [Conf]
  115. John H. Reif, Sandeep Sen
    Polling: A New Randomized Sampling Technique for Computational Geometry [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:394-404 [Conf]
  116. John H. Reif, Stephen R. Tate
    Optimal Size Integer Division Circuits [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:264-273 [Conf]
  117. John H. Reif, Leslie G. Valiant
    A Logarithmic Time Sort for Linear Size Networks [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:10-16 [Conf]
  118. Richard E. Ladner, John H. Reif
    The Logic of Distributed Protocols. [Citation Graph (0, 0)][DBLP]
    TARK, 1986, pp:207-222 [Conf]
  119. John H. Reif, Thomas H. LaBean, Sudheer Sahu, Hao Yan, Peng Yin
    Design, Simulation, and Experimental Demonstration of Self-assembled DNA Nanostructures and Motors. [Citation Graph (0, 0)][DBLP]
    UPP, 2004, pp:173-187 [Conf]
  120. Deganit Armon, John H. Reif
    A Dynamic Separator Algorithm. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:107-118 [Conf]
  121. John H. Reif, Zheng Sun
    Movement Planning in the Presence of Flows. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:450-461 [Conf]
  122. John H. Reif, Scott A. Smolka
    The Complexity of Reachability in Distributed Communicating Processes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1988, v:25, n:3, pp:333-354 [Journal]
  123. Yijie Han, Victor Y. Pan, John H. Reif
    Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:399-415 [Journal]
  124. John H. Reif
    Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:3, pp:271-287 [Journal]
  125. John H. Reif
    Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:3, pp:487-510 [Journal]
  126. John H. Reif
    Parallel Biomolecular Computation: Models and Simulations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:2-3, pp:142-175 [Journal]
  127. John H. Reif, Zheng Sun
    Movement Planning in the Presence of Flows. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:2, pp:127-153 [Journal]
  128. John H. Reif, Sandeep Sen
    Optimal Randomized Parallel Algorithms for Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:1, pp:91-117 [Journal]
  129. John H. Reif, Paul G. Spirakis
    Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:5&6, pp:597-630 [Journal]
  130. John H. Reif, Stephen R. Tate
    Continuous Alternation: The Complexity of Pursuit in Continuous Domains. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:2-4, pp:156-181 [Journal]
  131. Joseph Cheriyan, John H. Reif
    Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:4, pp:435-451 [Journal]
  132. John F. Canny, Ashutosh Rege, John H. Reif
    An Exact Algorithm for Kinodynamic Planning in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:461-484 [Journal]
  133. John H. Reif, J. D. Tygar, Akitoshi Yoshida
    Computability and Complexity of Ray Tracing. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:265-287 [Journal]
  134. Steven Homer, John H. Reif
    Arithmetic Theories for Computational Complexity Problems [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:69, n:1-3, pp:1-11 [Journal]
  135. Ming-Yang Kao, John H. Reif, Stephen R. Tate
    Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:131, n:1, pp:63-79 [Journal]
  136. Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif
    The Light Bulb Problem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:117, n:2, pp:187-192 [Journal]
  137. John H. Reif
    On the Impossibility of Interaction-Free Quantum Sensing for Small I/O Bandwidth. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:163, n:1, pp:103-122 [Journal]
  138. Dan E. Willard, John H. Reif
    Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:81, n:3, pp:364-379 [Journal]
  139. Victor Y. Pan, John H. Reif
    The Parallel Computation of Minimum Cost Paths in Graphs by Stream Contraction. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:2, pp:79-83 [Journal]
  140. John H. Reif
    Depth-First Search is Inherently Sequential. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:5, pp:229-234 [Journal]
  141. John H. Reif
    A Topological Approach to Dynamic Graph Connectivity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:1, pp:65-70 [Journal]
  142. Tassos Markas, John H. Reif
    Quad Tree Structures for Image Compression Applications. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Manage., 1992, v:28, n:6, pp:707-722 [Journal]
  143. John H. Reif, James A. Storer
    Optimal encoding of non-stationary sources. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:135, n:1-2, pp:87-105 [Journal]
  144. Bruce Randall Donald, Patrick G. Xavier, John F. Canny, John H. Reif
    Kinodynamic Motion Planning. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:5, pp:1048-1066 [Journal]
  145. John H. Reif
    Symmetric Complementation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:2, pp:401-421 [Journal]
  146. John H. Reif, Micha Sharir
    Motion Planning in the Presence of Moving Obstacles. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:4, pp:764-790 [Journal]
  147. John H. Reif, James A. Storer
    A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:5, pp:1013-1019 [Journal]
  148. John H. Reif, Leslie G. Valiant
    A logarithmic time sort for linear size networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:1, pp:60-76 [Journal]
  149. James A. Storer, John H. Reif
    Shortest Paths in the Plane with Polygonal Obstacles. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:5, pp:982-1012 [Journal]
  150. Hillel Gazit, John H. Reif
    A Randomized Parallel Algorithm for Planar Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:2, pp:290-314 [Journal]
  151. John H. Reif, Stephen R. Tate
    On Dynamic Algorithms for Algebraic Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:2, pp:347-371 [Journal]
  152. Zheng Sun, John H. Reif
    On finding approximate optimal paths in weighted regions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:58, n:1, pp:1-32 [Journal]
  153. C. Andrew Neff, John H. Reif
    An Efficient Algorithm for the Complex Roots Problem. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1996, v:12, n:2, pp:81-115 [Journal]
  154. Péter Gács, John H. Reif
    A Simple Three-Dimensional Real-Time Reliable Cellular Array. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:36, n:2, pp:125-147 [Journal]
  155. Philip N. Klein, John H. Reif
    An Efficient Parallel Algorithm for Planarity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:37, n:2, pp:190-246 [Journal]
  156. Victor Y. Pan, John H. Reif
    Fast and Efficient Solution of Path Algebra Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:38, n:3, pp:494-510 [Journal]
  157. Vijaya Ramachandran, John H. Reif
    Planarity Testing in Parallel. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:3, pp:517-561 [Journal]
  158. John H. Reif
    Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:3, pp:398-412 [Journal]
  159. John H. Reif
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:211- [Journal]
  160. John H. Reif
    Efficient parallel factorization and solution of structured and unstructured linear systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:1, pp:86-143 [Journal]
  161. John H. Reif
    The Complexity of Two-Player Games of Incomplete Information. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:29, n:2, pp:274-301 [Journal]
  162. John H. Reif, Harry R. Lewis
    Efficient Symbolic Analysis of Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:32, n:3, pp:280-314 [Journal]
  163. John H. Reif, A. Prasad Sistla
    A Multiprocess Network Logic with Temporal and Spatial Modalities. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:30, n:1, pp:41-53 [Journal]
  164. Donald W. Blevins, Edward W. Davis, Robert A. Heaton, John H. Reif
    BLITZEN: A Highly Integrated Massively Parallel Machine. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1990, v:8, n:2, pp:150-160 [Journal]
  165. James A. Storer, John H. Reif
    A Parallel Architecture for High-Speed Data Compression. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:13, n:2, pp:222-227 [Journal]
  166. John H. Reif
    The design of autonomous DNA nano-mechanical devices: Walking and rolling DNA. [Citation Graph (0, 0)][DBLP]
    Natural Computing, 2003, v:2, n:4, pp:439-461 [Journal]
  167. John H. Reif
    The Emerging Discipline of Biomolecular Computation in the US. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 2002, v:20, n:3, pp:217-236 [Journal]
  168. Erol Gelenbe, Nestor A. Schmajuk, John Staddon, John H. Reif
    Autonomous search by robots and animals: A survey. [Citation Graph (0, 0)][DBLP]
    Robotics and Autonomous Systems, 1997, v:22, n:1, pp:23-34 [Journal]
  169. John H. Reif, Hongyan Wang
    Social potential fields: A distributed behavioral control for autonomous robots. [Citation Graph (0, 0)][DBLP]
    Robotics and Autonomous Systems, 1999, v:27, n:3, pp:171-194 [Journal]
  170. Philip N. Klein, John H. Reif
    Parallel Time O(log n) Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:3, pp:463-485 [Journal]
  171. Gary L. Miller, John H. Reif
    Parallel Tree Contraction, Part 2: Further Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:6, pp:1128-1147 [Journal]
  172. Victor Y. Pan, John H. Reif
    Fast and Efficient Parallel Solution of Sparse Linear Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1227-1250 [Journal]
  173. John H. Reif, Sandeep Sen
    Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:3, pp:633-651 [Journal]
  174. John H. Reif, Robert Endre Tarjan
    Symbolic Program Analysis in Almost-Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:1, pp:81-93 [Journal]
  175. John H. Reif, J. D. Tygar
    Efficient Parallel Pseudorandom Number Generation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:2, pp:404-411 [Journal]
  176. John H. Reif, Stephen R. Tate
    Optimal Size Integer Division Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:5, pp:912-924 [Journal]
  177. John H. Reif, Hongyan Wang
    Nonuniform Discretization for Kinodynamic Motion Planning and its Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:1, pp:161-190 [Journal]
  178. John H. Reif, Zheng Sun
    On Frictional Mechanical Systems and Their Computational Power. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1449-1474 [Journal]
  179. John H. Reif
    Approximate Complex Polynomial Evaluation in Near Constant Work Per Point. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2059-2089 [Journal]
  180. John H. Reif, Paul G. Spirakis
    Unbounded Speed Variability in Distributed Communications Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:75-92 [Journal]
  181. Sanguthevar Rajasekaran, John H. Reif
    Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:594-607 [Journal]
  182. John H. Reif, Sandeep Sen
    Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:3, pp:466-485 [Journal]
  183. John H. Reif
    Code Motion. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:2, pp:375-395 [Journal]
  184. John H. Reif
    Minimum s-t Cut of a Planar Undirected Network in O(n log²(n)) Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:1, pp:71-81 [Journal]
  185. John H. Reif
    On Synchronous Parallel Computations with Independent Probabilistic Choice. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:46-56 [Journal]
  186. John H. Reif
    Logarithmic Depth Circuits for Algebraic Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:231-242 [Journal]
  187. John H. Reif, Sandeep Sen
    Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:447-448 [Journal]
  188. James A. Storer, John H. Reif
    Error-Resilient Optimal Data Compression. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:934-949 [Journal]
  189. Joseph Y. Halpern, John H. Reif
    The Propositional Dynamic Logic of Deterministic, Well-Structured Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:127-165 [Journal]
  190. Sanguthevar Rajasekaran, John H. Reif
    Nested Annealing: A Provable Improvement to Simulated Annealing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:99, n:1, pp:157-176 [Journal]
  191. John H. Reif, Zheng Sun
    On boundaries of highly visible spaces and applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:354, n:3, pp:379-390 [Journal]
  192. John H. Reif, Paul G. Spirakis
    Real-Time Synchronization of Interprocess Communications. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1984, v:6, n:2, pp:215-238 [Journal]
  193. Zhiyong Li, John H. Reif, Sandeep K. S. Gupta
    Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data Distributions. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:3, pp:297-315 [Journal]
  194. John H. Reif, Thomas H. LaBean
    Autonomous Programmable Biomolecular Devices Using Self-assembled DNA Nanostructures. [Citation Graph (0, 0)][DBLP]
    WoLLIC, 2007, pp:297-306 [Conf]
  195. John H. Reif, Thomas H. LaBean
    Autonomous programmable biomolecular devices using self-assembled DNA nanostructures. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 2007, v:50, n:9, pp:46-53 [Journal]
  196. John H. Reif, Paul G. Spirakis
    k-connectivity in random undirected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:181-191 [Journal]
  197. John H. Reif, Sukhendu Chakraborty
    Efficient and exact quantum compression. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:7, pp:967-981 [Journal]

  198. Design of a Biomolecular Device That Executes Process Algebra. [Citation Graph (, )][DBLP]


  199. Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications. [Citation Graph (, )][DBLP]


  200. Autonomous Programmable Nanorobotic Devices Using DNAzymes. [Citation Graph (, )][DBLP]


  201. Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular Computation. [Citation Graph (, )][DBLP]


  202. The Tile Complexity of Linear Assemblies. [Citation Graph (, )][DBLP]


  203. Super-Resolution Video Analysis for Forensic Investigations. [Citation Graph (, )][DBLP]


  204. Prototyping parallel and distributed programs in Proteus. [Citation Graph (, )][DBLP]


  205. A Framework for Designing Novel Magnetic Tiles Capable of Complex Self-assemblies. [Citation Graph (, )][DBLP]


  206. Optimal Kinodynamic Motion Planning for 2D Reconfiguration of Self-Reconfigurable Robots. [Citation Graph (, )][DBLP]


  207. Compact Error-Resilient Computational DNA Tilings. [Citation Graph (, )][DBLP]


  208. Asymptotically Optimal Kinodynamic Motion Planning for Self-reconfigurable Robots. [Citation Graph (, )][DBLP]


  209. Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly. [Citation Graph (, )][DBLP]


Search in 0.147secs, Finished in 0.159secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002