The following pages link to (Q4057549):
Displaying 50 items.
- A generative model for rank data based on insertion sort algorithm (Q89742) (← links)
- Asymptotic equivalence between frequentist and Bayesian prediction limits for the Poisson distribution (Q109302) (← links)
- Model-based clustering of multivariate ordinal data relying on a stochastic binary search algorithm (Q132947) (← links)
- Dynamics of noncommutative solitons. I: Spectral theory and dispersive estimates (Q281249) (← links)
- Impossibility results for weak threshold networks (Q287142) (← links)
- An approximation algorithm for least median of squares regression (Q290249) (← links)
- Batcher's odd-even exchange revisited: a generating functions approach (Q290531) (← links)
- Towards a realistic analysis of the QuickSelect algorithm (Q290901) (← links)
- Waiting time distribution for the emergence of superpatterns (Q292369) (← links)
- A study on interleaving versus segmentation (Q293277) (← links)
- Optimal alphabetic trees for binary search (Q293336) (← links)
- Parallel dictionaries with local rules on AVL and brother trees (Q293415) (← links)
- Enumerating longest increasing subsequences and patience sorting (Q294846) (← links)
- Nearest neighbor Markov dynamics on Macdonald processes (Q304081) (← links)
- Pattern avoidance in poset permutations (Q304187) (← links)
- Approximate counting with \(m\) counters: a probabilistic analysis (Q307930) (← links)
- A unified approach to linear probing hashing with buckets (Q308951) (← links)
- An iterative aggregation and disaggregation method for the steady state solution of large scale continuous systems (Q311819) (← links)
- Random access to Fibonacci encoded files (Q313776) (← links)
- Annihilators of highest weight \(\mathfrak{sl}(\infty)\)-modules (Q326365) (← links)
- A structure-based chaotic hashing scheme (Q327795) (← links)
- Optimal-depth sorting networks (Q340576) (← links)
- The algorithm for identical object searching with bounded worst-case complexity and linear memory (Q341823) (← links)
- A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
- Permutations sortable by two stacks in series (Q343835) (← links)
- Merging almost sorted sequences yields a 24-sorter (Q344521) (← links)
- Depth in classical Coxeter groups (Q345151) (← links)
- Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm (Q350914) (← links)
- Efficient and robust associative memory from a generalized Bloom filter (Q353819) (← links)
- External-memory multimaps (Q378243) (← links)
- A probabilistic approach to consecutive pattern avoiding in permutations (Q385031) (← links)
- On the connected components of a random permutation graph with a given number of edges (Q388720) (← links)
- Non-uniqueness of minimal superpermutations (Q389216) (← links)
- Closest pair and the post office problem for stochastic points (Q390124) (← links)
- Further analysis of the remedian algorithm (Q391134) (← links)
- Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths (Q394358) (← links)
- A linear time algorithm for consecutive permutation pattern matching (Q396621) (← links)
- On the minimal Fourier degree of symmetric Boolean functions (Q397079) (← links)
- Higher-order time integration of Coulomb collisions in a plasma using Langevin equations (Q401573) (← links)
- Using functional equations to enumerate 1324-avoiding permutations (Q402577) (← links)
- Row-strict quasisymmetric Schur functions (Q404395) (← links)
- Pattern avoidance in ordered set partitions (Q404537) (← links)
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries (Q405180) (← links)
- Bruhat order on fixed-point-free involutions in the symmetric group (Q405213) (← links)
- A multiset hook length formula and some applications (Q409408) (← links)
- On demand string sorting over unbounded alphabets (Q418735) (← links)
- Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
- Monomial graphs and generalized quadrangles (Q439070) (← links)
- Multitriangulations, pseudotriangulations and primitive sorting networks (Q443914) (← links)
- Noncommutative Lévy processes for generalized (particularly anyon) statistics (Q443968) (← links)
