Остановите войну!
for scientists:
default search action
John H. Reif
- > Home > Persons > John H. Reif
Publications
- 1999
- [j64]Zhiyong Li, John H. Reif, Sandeep K. S. Gupta:
Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data Distributions. IEEE Trans. Parallel Distributed Syst. 10(3): 297-315 (1999) - 1998
- [j63]Hillel Gazit, John H. Reif:
A Randomized Parallel Algorithm for Planar Graph Isomorphism. J. Algorithms 28(2): 290-314 (1998) - 1997
- [j62]Yijie Han, Victor Y. Pan, John H. Reif:
Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs. Algorithmica 17(4): 399-415 (1997) - [j61]John H. Reif, Stephen R. Tate:
On Dynamic Algorithms for Algebraic Problems. J. Algorithms 22(2): 347-371 (1997) - 1996
- [j58]Ming-Yang Kao, John H. Reif, Stephen R. Tate:
Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. Inf. Comput. 131(1): 63-79 (1996) - [j57]C. Andrew Neff, John H. Reif:
An Efficient Algorithm for the Complex Roots Problem. J. Complex. 12(2): 81-115 (1996) - [j56]Zhiyong Li, Peter Mills, John H. Reif:
Models and Resource Metrics for Parallel and Distributed Computation. Parallel Algorithms Appl. 8(1): 35-59 (1996) - [c92]Lars S. Nyland, Jan F. Prins, Allen Goldberg, Peter Mills, John H. Reif, Robert A. Wagner:
A Refinement Methodology for Developing Data-Parallel Applications. Euro-Par, Vol. I 1996: 145-150 - [c91]Zhiyong Li, John H. Reif, Sandeep K. S. Gupta:
Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data Distributions. ICPP, Vol. 2 1996: 142-149 - 1995
- [c88]Zhiyong Li, Peter Mills, John H. Reif:
Models and resource metrics for parallel and distributed computation. HICSS (2) 1995: 51-60 - [c87]Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung:
Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. ICALP 1995: 159-170 - [c86]Sandeep K. S. Gupta, Zhiyong Li, John H. Reif:
Generating Efficient Programs for Two-Level Memories from Tensor-products. Parallel and Distributed Computing and Systems 1995: 510-513 - 1994
- [j54]Joseph Cheriyan, John H. Reif:
Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. Comb. 14(4): 435-451 (1994) - [j52]John H. Reif, Micha Sharir:
Motion Planning in the Presence of Moving Obstacles. J. ACM 41(4): 764-790 (1994) - [j49]Vijaya Ramachandran, John H. Reif:
Planarity Testing in Parallel. J. Comput. Syst. Sci. 49(3): 517-561 (1994) - [c82]Salman Azhar, Greg J. Badros, Arman Glodjo, Ming-Yang Kao, John H. Reif:
Data Compression Techniques for Stock Market Prediction. Data Compression Conference 1994: 72-82 - [c81]Allen Goldberg, Peter Mills, Lars S. Nyland, Jan F. Prins, John H. Reif, James Riely:
Specification and Development of Parallel Algorithms with the Proteus System. Specification of Parallel Algorithms 1994: 383-399 - [c80]C. Andrew Neff, John H. Reif:
An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem. FOCS 1994: 540-547 - [c78]John H. Reif, Stephen R. Tate:
Dynamic Algebraic Algorithms. SODA 1994: 290-301 - [c77]John H. Reif, Stephen R. Tate:
Dynamic Parallel Tree Contraction (Extended Abstract). SPAA 1994: 114-121 - 1993
- [j45]John H. Reif, Stephen R. Tate:
Continuous Alternation: The Complexity of Pursuit in Continuous Domains. Algorithmica 10(2-4): 156-181 (1993) - [j43]Victor Y. Pan, John H. Reif:
Fast and Efficient Parallel Solution of Sparse Linear Systems. SIAM J. Comput. 22(6): 1227-1250 (1993) - [c72]John H. Reif, Stephen R. Tate:
The Complexity of N-body Simulation. ICALP 1993: 162-176 - [c71]Ming-Yang Kao, John H. Reif, Stephen R. Tate:
Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. SODA 1993: 441-447 - [c70]Joseph Cheriyan, John H. Reif:
Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems. SPAA 1993: 50-56 - 1992
- [j41]John H. Reif, Paul G. Spirakis:
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems. Algorithmica 7(5&6): 597-630 (1992) - [j38]John H. Reif, Stephen R. Tate:
On Threshold Circuits and Polynomial Computation. SIAM J. Comput. 21(5): 896-908 (1992) - [j37]Victor Y. Pan, John H. Reif:
Compact Multigrid. SIAM J. Sci. Comput. 13(1): 119-127 (1992) - [c67]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. FOCS 1992: 703-713 - [c66]Peter Mills, Lars S. Nyland, Jan F. Prins, John H. Reif:
Prototyping N-Body Simulation in Proteus. IPPS 1992: 476-482 - [c65]Joseph Cheriyan, John H. Reif:
Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. SODA 1992: 335-344 - [c64]William L. Hightower, Jan F. Prins, John H. Reif:
Implementations of Randomized Sorting on Large Parallel Machines. SPAA 1992: 158-167 - [c62]Yijie Han, Victor Y. Pan, John H. Reif:
Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs. SPAA 1992: 353-362 - 1991
- [j34]Victor Y. Pan, John H. Reif:
The Parallel Computation of Minimum Cost Paths in Graphs by Stream Contraction. Inf. Process. Lett. 40(2): 79-83 (1991) - [j32]Gary L. Miller, John H. Reif:
Parallel Tree Contraction, Part 2: Further Applications. SIAM J. Comput. 20(6): 1128-1147 (1991) - [c59]Peter Mills, Lars S. Nyland, Jan F. Prins, John H. Reif, Robert A. Wagner:
Prototyping parallel and distributed programs in Proteus. SPDP 1991: 26-34 - 1990
- [j31]John H. Reif, Scott A. Smolka:
Data flow analysis of distributed communicating processes. Int. J. Parallel Program. 19(1): 1-30 (1990) - [j29]John H. Reif, Stephen R. Tate:
Optimal Size Integer Division Circuits. SIAM J. Comput. 19(5): 912-924 (1990) - [c54]Victor Y. Pan, John H. Reif:
On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid. ICALP 1990: 612-625 - [c53]Hillel Gazit, John H. Reif:
A Randomized Parallel Algorithm for Planar Graph Isomorphism. SPAA 1990: 210-219 - 1989
- [j28]Gary L. Miller, John H. Reif:
Parallel Tree Contraction Part 1: Fundamentals. Adv. Comput. Res. 5: 47-72 (1989) - [j26]Victor Y. Pan, John H. Reif:
Fast and Efficient Solution of Path Algebra Problems. J. Comput. Syst. Sci. 38(3): 494-510 (1989) - [c49]Vijaya Ramachandran, John H. Reif:
An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract). FOCS 1989: 282-287 - [c46]John H. Reif, Stephen R. Tate:
Optimal Size Integer Division Circuits. STOC 1989: 264-273 - 1988
- [j24]John H. Reif, Scott A. Smolka:
The Complexity of Reachability in Distributed Communicating Processes. Acta Informatica 25(3): 333-354 (1988) - [j22]Philip N. Klein, John H. Reif:
An Efficient Parallel Algorithm for Planarity. J. Comput. Syst. Sci. 37(2): 190-246 (1988) - [j20]Philip N. Klein, John H. Reif:
Parallel Time O(log n) Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM. SIAM J. Comput. 17(3): 463-485 (1988) - 1987
- [j18]John H. Reif, Leslie G. Valiant:
A logarithmic time sort for linear size networks. J. ACM 34(1): 60-76 (1987) - [c37]Victor Y. Pan, John H. Reif:
Some Polynomial and Toeplitz Matrix Computations. FOCS 1987: 173-184 - 1986
- [c35]Victor Y. Pan, John H. Reif:
Fast and Efficient Parallel Linear Programming and Linear Least Squares Computations. Aegean Workshop on Computing 1986: 283-295 - [c34]Philip N. Klein, John H. Reif:
An Efficient Parallel Algorithm for Planarity. FOCS 1986: 465-477 - [c33]Victor Y. Pan, John H. Reif:
Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems. FSTTCS 1986: 470-487 - 1985
- [j12]John H. Reif, Paul G. Spirakis:
k-connectivity in random undirected graphs. Discret. Math. 54(2): 181-191 (1985) - [j9]John H. Reif, Paul G. Spirakis:
Unbounded Speed Variability in Distributed Communications Systems. SIAM J. Comput. 14(1): 75-92 (1985) - [c29]John H. Reif, Micha Sharir:
Motion Planning in the Presence of Moving Obstacles. FOCS 1985: 144-154 - [c28]Gary L. Miller, John H. Reif:
Parallel Tree Contraction and Its Application. FOCS 1985: 478-489 - [c26]Victor Y. Pan, John H. Reif:
Efficient Parallel Solution of Linear Systems. STOC 1985: 143-152 - 1984
- [j5]John H. Reif, Paul G. Spirakis:
Real-Time Synchronization of Interprocess Communications. ACM Trans. Program. Lang. Syst. 6(2): 215-238 (1984) - [c24]John H. Reif, Paul G. Spirakis:
Probabilistic Bidding Gives Optimal Distributed Resource Allocation. ICALP 1984: 391-402 - 1983
- [c19]John H. Reif, Leslie G. Valiant:
A Logarithmic Time Sort for Linear Size Networks. STOC 1983: 10-16 - 1982
- [j2]John H. Reif, Robert Endre Tarjan:
Symbolic Program Analysis in Almost-Linear Time. SIAM J. Comput. 11(1): 81-93 (1982) - [c16]John H. Reif, Paul G. Spirakis:
Real Time Resource Allocation in Distributed Systems. PODC 1982: 84-94 - [c15]John H. Reif, Paul G. Spirakis:
Unbounded Speed Variability in Distributed Communication Systems. POPL 1982: 46-56 - 1981
- [c11]John H. Reif, Paul G. Spirakis:
Distributed Algorithms for Synchronizing Interprocess Communication within Real Time. STOC 1981: 133-145 - 1980
- [c8]John H. Reif, Paul G. Spirakis:
Random Matroids. STOC 1980: 385-397 - 1979
- [c4]I. S. Filotti, Gary L. Miller, John H. Reif:
On Determining the Genus of a Graph in O(v^O(g)) Steps. STOC 1979: 27-37
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-11-22 20:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint