The following pages link to Edward M. Reingold (Q215636):
Displaying 50 items.
- K-M-P string matching revisited (Q293129) (← links)
- Improved bounds for cops-and-robber pursuit (Q634246) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- Determining the majority (Q688232) (← links)
- Probabilistic analysis of a grouping algorithm (Q749213) (← links)
- Stochastic rearrangement rules for self-organizing data structures (Q922688) (← links)
- Bounds for cops and robber pursuit (Q991186) (← links)
- The worst-case chip problem (Q1029103) (← links)
- (Q1079342) (redirect page) (← links)
- Recurrence relations based on minimization and maximization (Q1079343) (← links)
- Aspects of insertion in random trees (Q1160488) (← links)
- The complexity of drawing trees nicely (Q1168727) (← links)
- Scheduling on a hypercube (Q1183498) (← links)
- Understanding the complexity of interpolation search (Q1245570) (← links)
- Efficient management of dynamic tables (Q1321831) (← links)
- Analysis of Boyer and Moore's \texttt{MJRTY} algorithm (Q2444743) (← links)
- (Q2757839) (← links)
- Indian Calendrical Calculations (Q3019152) (← links)
- Solution of a Divide-and-Conquer Maximin Recurrence (Q3034823) (← links)
- Calendrical Calculations (Q3130582) (← links)
- A Fibonacci Version of Kraft’s Inequality Applied to Discrete Unimodal Search (Q3137714) (← links)
- (Q3148836) (← links)
- (Q3153941) (← links)
- More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case (Q3204043) (← links)
- More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case (Q3204044) (← links)
- A nonrecursive list moving algorithm (Q3214381) (← links)
- A Naturally Occurring Function Continuous Only at Irrationals (Q3329675) (← links)
- (Q3773360) (← links)
- (Q3856143) (← links)
- On a Greedy Heuristic for Complete Matching (Q3922185) (← links)
- (Q3936208) (← links)
- Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching (Q3967061) (← links)
- The Travelling Salesman Problem and Minimum Matching in the Unit Square (Q3967062) (← links)
- Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching (Q3969884) (← links)
- “Lion and Man”: Upper and Lower Bounds (Q4024317) (← links)
- Backtrack programming techniques (Q4072832) (← links)
- Efficient generation of the binary reflected gray code and its applications (Q4099520) (← links)
- (Q4125767) (← links)
- (Q4131233) (← links)
- (Q4144192) (← links)
- (Q4144193) (← links)
- (Q4181975) (← links)
- (Q4252377) (← links)
- The Average-Case Complexity of Determining the Majority (Q4337428) (← links)
- (Q4367587) (← links)
- (Q4398762) (← links)
- (Q4398776) (← links)
- Quicksort with Unreliable Comparisons: A Probabilistic Analysis (Q4670351) (← links)
- Index assignment for multichannel communication under failure (Q4677587) (← links)
- Optimum lopsided binary trees (Q4710685) (← links)
