The following pages link to (Q4057549):
Displaying 50 items.
- Discrete logarithm problem using index calculus method (Q445390) (← links)
- On the complexity of min-max sorting networks (Q454886) (← links)
- Descent sets on 321-avoiding involutions and hook decompositions of partitions (Q458291) (← links)
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- On the sub-permutations of pattern avoiding permutations (Q465287) (← links)
- On a subposet of the Tamari lattice (Q466873) (← links)
- An infinite family of inv-Wilf-equivalent permutation pairs (Q472398) (← links)
- Cache-oblivious hashing (Q472489) (← links)
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Bivariate Gončarov polynomials and integer sequences (Q477132) (← links)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
- Large deviations for permutations avoiding monotone patterns (Q504968) (← links)
- Efficient processing of substring match queries with inverted variable-length gram indexes (Q508702) (← links)
- Pattern avoidance and Young tableaux (Q510311) (← links)
- Enumerating matroids of fixed rank (Q510313) (← links)
- Stockmeyer's tower (Q526310) (← links)
- On the Liouville integrability of the periodic Kostant-Toda flow on matrix loops of level \(k\) (Q529636) (← links)
- Metamodeling semantics of multiple inheritance (Q532422) (← links)
- An asymptotic version of a theorem of Knuth (Q544135) (← links)
- Gcd of multivariate polynomials via Newton polytopes (Q545987) (← links)
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- Faster query algorithms for the text fingerprinting problem (Q549671) (← links)
- The algebra of binary search trees (Q557924) (← links)
- Refined complexity analysis for heap operations (Q578912) (← links)
- A note on detecting simple redundancies in linear systems (Q579125) (← links)
- On adaptive sampling (Q582040) (← links)
- Unification in commutative theories (Q582071) (← links)
- Improved sorting networks with O(log N) depth (Q582098) (← links)
- Optimal merging and sorting on the EREW PRAM (Q582111) (← links)
- Adaptive remeshing for transient problems (Q582155) (← links)
- A dynamic location problem for graphs (Q583245) (← links)
- The real zeros of the Bernoulli polynomials (Q583521) (← links)
- Generating alternating permutations lexicographically (Q583885) (← links)
- Analysis of recursive batched interpolation search (Q583891) (← links)
- Tableaux and matrix correspondences (Q595665) (← links)
- Bijections for refined restricted permutations (Q598452) (← links)
- On the number of range queries in k-space (Q598818) (← links)
- Sorting with networks of data structures (Q602673) (← links)
- Free quasi-symmetric functions and descent algebras for wreath products, and noncommutative multi-symmetric functions (Q607021) (← links)
- A family of proportionate normalized subband adaptive filter algorithms (Q630911) (← links)
- Fibonacci numbers and orthogonal polynomials (Q642654) (← links)
- Integer merging on EREW PRAM (Q644851) (← links)
- On the Lipschitz constant of the RSK correspondence (Q645961) (← links)
- Unfair permutations (Q648984) (← links)
- Simulation and estimation of extreme quantiles and extreme probabilities (Q649122) (← links)
- On the tractability of the Brownian bridge algorithm (Q652449) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- Permutations generated by stacks and deques (Q659569) (← links)