John H. Reif

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Stephen R. Tate

> Home > Persons > John H. Reif

Publications

1997
[j61]
- view
  authority control:
- export record
  dblp key:
  - journals/jal/ReifT97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/ReifT97
John H. Reif, Stephen R. Tate:
On Dynamic Algorithms for Algebraic Problems. J. Algorithms 22(2): 347-371 (1997)
1996
[j58]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/KaoRT96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/KaoRT96
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)
1994
[c78]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/ReifT94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ReifT94
John H. Reif, Stephen R. Tate:
Dynamic Algebraic Algorithms. SODA 1994: 290-301
[c77]
- view
  authority control:
- export record
  dblp key:
  - conf/spaa/ReifT94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spaa/ReifT94
John H. Reif, Stephen R. Tate:
Dynamic Parallel Tree Contraction (Extended Abstract). SPAA 1994: 114-121
1993
[j45]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ReifT93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ReifT93
John H. Reif, Stephen R. Tate:
Continuous Alternation: The Complexity of Pursuit in Continuous Domains. Algorithmica 10(2-4): 156-181 (1993)
[c72]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/ReifT93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/ReifT93
John H. Reif, Stephen R. Tate:
The Complexity of N-body Simulation. ICALP 1993: 162-176
[c71]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/KaoRT93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/KaoRT93
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
1992
[j38]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/ReifT92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/ReifT92
John H. Reif, Stephen R. Tate:
On Threshold Circuits and Polynomial Computation. SIAM J. Comput. 21(5): 896-908 (1992)
[c67]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/PanRT92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/PanRT92
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
1990
[j29]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/ReifT90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/ReifT90
John H. Reif, Stephen R. Tate:
Optimal Size Integer Division Circuits. SIAM J. Comput. 19(5): 912-924 (1990)
1989
[c46]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/ReifT89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/ReifT89
John H. Reif, Stephen R. Tate:
Optimal Size Integer Division Circuits. STOC 1989: 264-273

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.