The following pages link to Stephen R. Tate (Q675057):
Displaying 23 items.
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem (Q675058) (← links)
- Continuous alternation: the complexity of pursuit in continuous domains (Q686740) (← links)
- Online matching with blocked input (Q1178205) (← links)
- (Q1324340) (redirect page) (← links)
- Approximate kinodynamic planning using \(L_ 2\)-norm dynamic bounds (Q1324341) (← links)
- Fast spatial decomposition and closest pair computation for limited precision input (Q1587778) (← links)
- On Dynamic Algorithms for Algebraic Problems (Q3128199) (← links)
- (Q3128888) (← links)
- (Q3140448) (← links)
- The risk profile problem for stock portfolio optimization (extended abstract) (Q3191989) (← links)
- Optimal Size Integer Division Circuits (Q3495657) (← links)
- Traceable Signature: Better Efficiency and Beyond (Q3600105) (← links)
- On Threshold Circuits and Polynomial Computation (Q4015974) (← links)
- (Q4228445) (← links)
- (Q4252417) (← links)
- On-Line Difference Maximization (Q4255809) (← links)
- (Q4459808) (← links)
- The complexity of N-body simulation (Q4630258) (← links)
- Designing proxies for stock market indices is computationally hard<sup>*</sup> (Q4646493) (← links)
- Online/Offline Signature Schemes for Devices with Limited Computing Capabilities (Q5458947) (← links)
- Information Security (Q5492777) (← links)
- (Q5501794) (← links)
- A Direct Anonymous Attestation Scheme for Embedded Devices (Q5756520) (← links)
