The following pages link to Samuel McCauley (Q489764):
Displaying 15 items.
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- Support optimality and adaptive cuckoo filters (Q832904) (← links)
- Efficient rational proofs with strong utility-gap guarantees (Q1617659) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- Scheduling parallel jobs online with convex and concave parallelizability (Q1743115) (← links)
- Scheduling Parallel Jobs Online with Convex and Concave Parallelizability (Q2789001) (← links)
- Rational Proofs with Multiple Provers (Q2800569) (← links)
- The I/O Complexity of Computing Prime Tables (Q2802940) (← links)
- The Range 1 Query (R1Q) Problem (Q2920450) (← links)
- Run Generation Revisited: What Goes Up May or May Not Come Down (Q3459907) (← links)
- (Q5075766) (← links)
- (Q5282805) (← links)
- Cache-Adaptive Algorithms (Q5384033) (← links)
- Telescoping Filter: A Practical Adaptive Filter. (Q6075953) (← links)
- Minimizing I/Os in Out-of-Core Task Tree Scheduling (Q6169958) (← links)
