The following pages link to Find (Q33419):
Displayed 50 items.
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm (Q261384) (← links)
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme (Q308946) (← links)
- Fast parallel GPU-sorting using a hybrid algorithm (Q436896) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Discrete rigid registration: a local graph-search approach (Q528343) (← links)
- The analysis of range quickselect and related problems (Q650886) (← links)
- Selection from read-only memory and sorting with minimum data movement (Q671520) (← links)
- Multiple Quickselect -- Hoare's Find algorithm for several elements (Q672250) (← links)
- Exponential bounds for the running time of a selection algorithm (Q760796) (← links)
- On quickselect, partial sorting and multiple Quickselect (Q845716) (← links)
- Formal proof of a program: find (Q858911) (← links)
- An \(O(mn)\) algorithm for the anti-cent-dian problem (Q864778) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Randomized algorithm for the sum selection problem (Q884471) (← links)
- Weighted median algorithms for \(L_ 1\) approximation (Q917229) (← links)
- Distributional analysis of swaps in quick select (Q964394) (← links)
- On sorting, heaps, and minimum spanning trees (Q973020) (← links)
- Moves and displacements of particular elements in quicksort (Q1019745) (← links)
- Analysis of the performance of the parallel quicksort method (Q1070824) (← links)
- A calculus of refinements for program derivations (Q1111362) (← links)
- Selection by distributive partitioning (Q1144936) (← links)
- A logical basis for programming methodology (Q1157140) (← links)
- Hierarchical development of programming languages (Q1161053) (← links)
- Sorting numbers in linear expected time and optimal extra space (Q1167543) (← links)
- Reasoning about programs (Q1212353) (← links)
- The analysis of Quicksort programs (Q1225454) (← links)
- The use of Hoare's method of program verification for the Quicksort algorithm (Q1239604) (← links)
- On proving the termination of algorithms by machine (Q1341666) (← links)
- The validity of return address schemes (Q1394113) (← links)
- Time bounds for selection (Q1394121) (← links)
- Analysis of multiple quickselect variants. (Q1401319) (← links)
- QuickHeapsort, an efficient mix of classical sorting algorithms (Q1608335) (← links)
- Fast highly efficient and robust one-step \(M\)-estimators of scale based on \(Q_n\) (Q1623635) (← links)
- Computing and estimating the volume of the solution space of SMT(LA) constraints (Q1659994) (← links)
- Mixed Poisson approximation of node depth distributions in random binary search trees (Q1774220) (← links)
- Linear sorting with O(log n) processors (Q1838307) (← links)
- Automatic program verification. I: A logical basis and its implementation (Q1843170) (← links)
- A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks (Q1885943) (← links)
- Distributional convergence for the number of symbol comparisons used by QuickSort (Q1950265) (← links)
- The \(m\)-version of binary search trees: an average case analysis (Q1952717) (← links)
- Analysis of the expected number of bit comparisons required by quickselect (Q1957651) (← links)
- Non-asymptotic distributional bounds for the Dickman approximation of the running time of the Quickselect algorithm (Q1994506) (← links)
- Turing's 1949 paper in context (Q2011633) (← links)
- EGC: entropy-based gradient compression for distributed deep learning (Q2056378) (← links)
- Hierarchical compressed sensing (Q2106467) (← links)
- Better size estimation for sparse matrix products (Q2249750) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- QuickXsort: a fast sorting scheme in theory and practice (Q2292860) (← links)
- A selectable sloppy heap (Q2312418) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)