The following pages link to L. Alonso (Q199221):
Displaying 23 items.
- (Q293154) (redirect page) (← links)
- Uniform generation of a Schröder tree (Q293156) (← links)
- Improved bounds for cops-and-robber pursuit (Q634246) (← links)
- A linear-time algorithm for the generation of trees (Q675311) (← links)
- Determining the majority (Q688232) (← links)
- Bounds for cops and robber pursuit (Q991186) (← links)
- The worst-case chip problem (Q1029103) (← links)
- Uniform generation of a Motzkin word (Q1341731) (← links)
- A parallel algorithm for the generation of a permutation and applications (Q1351208) (← links)
- The three dimensional polyominoes of minimal area (Q1379171) (← links)
- Analysis of Boyer and Moore's \texttt{MJRTY} algorithm (Q2444743) (← links)
- Behavior of the Laplacian of Gaussian extrema (Q2573048) (← links)
- “Lion and Man”: Upper and Lower Bounds (Q4024317) (← links)
- (Q4260368) (← links)
- The Average-Case Complexity of Determining the Majority (Q4337428) (← links)
- Quicksort with Unreliable Comparisons: A Probabilistic Analysis (Q4670351) (← links)
- Multidimensional Divide-and-Conquer Maximin Recurrences (Q4847365) (← links)
- The average complexity of a coin-weighing problem (Q4894598) (← links)
- Determining plurality (Q4962729) (← links)
- Average-case lower bounds for the plurality problem (Q4962730) (← links)
- Average-case analysis of some plurality algorithms (Q4962783) (← links)
- (Q5471353) (← links)
- On the tree inclusion problem (Q5941745) (← links)
