The following pages link to Michael A. Bender (Q489761):
Displayed 50 items.
- (Q234026) (redirect page) (← links)
- Performance guarantees for the TSP with a parameterized triangle inequality (Q294711) (← links)
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- The level ancestor problem simplified (Q596133) (← links)
- Optimal sparse matrix dense vector multiplication in the I/O-model (Q613122) (← links)
- Optimal cache-oblivious mesh layouts (Q633762) (← links)
- The cost of cache-oblivious searching (Q639274) (← links)
- Parallel interval order recognition and construction of interval representations (Q673637) (← links)
- Reallocation problems in scheduling (Q747625) (← links)
- Scheduling algorithms for procrastinators (Q835586) (← links)
- The freeze-tag problem: How to wake up a swarm of robots (Q850797) (← links)
- INSERTION SORT is \(O(n \log n)\) (Q864951) (← links)
- The minimum backlog problem (Q888427) (← links)
- Improved bounds on sorting by length-weighted reversals (Q931719) (← links)
- Efficient execution of nondeterministic parallel programs on asynchronous systems (Q1383149) (← links)
- The lazy bureaucrat scheduling problem (Q1398377) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- When can you fold a map? (Q1883580) (← links)
- Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler (Q1953239) (← links)
- Batched predecessor and sorting with size-priced information in external memory (Q2081613) (← links)
- The worst page-replacement policy (Q2272194) (← links)
- Communication-aware processor allocation for supercomputers: Finding point sets of small average distance (Q2480901) (← links)
- (Q2721970) (← links)
- (Q2754198) (← links)
- (Q2768284) (← links)
- (Q2768390) (← links)
- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines (Q2775886) (← links)
- The I/O Complexity of Computing Prime Tables (Q2802940) (← links)
- The Range 1 Query (R1Q) Problem (Q2920450) (← links)
- The Batched Predecessor Problem in External Memory (Q2921398) (← links)
- (Q3024765) (← links)
- (Q3024770) (← links)
- (Q3044351) (← links)
- Analysis of Heuristics for the Freeze-Tag Problem (Q3046501) (← links)
- A locality-preserving cache-oblivious dynamic dictionary (Q3159485) (← links)
- Maintaining Arrays of Contiguous Objects (Q3183593) (← links)
- Run Generation Revisited: What Goes Up May or May Not Come Down (Q3459907) (← links)
- Sum-of-squares heuristics for bin packing and memory allocation (Q3507786) (← links)
- Optimal shape of a blob (Q3529827) (← links)
- The Snowblower Problem (Q3564308) (← links)
- Cache-oblivious priority queue and graph algorithm applications (Q3579229) (← links)
- (Q3840373) (← links)
- (Q4411353) (← links)
- (Q4411355) (← links)
- (Q4411356) (← links)
- What is the optimal shape of a city? (Q4470675) (← links)
- (Q4508365) (← links)
- Testing properties of directed graphs: acyclicity and connectivity* (Q4543627) (← links)
- How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness (Q4575625) (← links)
- File Maintenance: When in Doubt, Change the Layout! (Q4575841) (← links)