The following pages link to (Q4057549):
Displaying 50 items.
- A new external sorting algorithm with no additional disk space (Q1007610) (← links)
- Parallel merging with restriction (Q1009355) (← links)
- On the uniform convergence of interpolating polynomials (Q1015775) (← links)
- Restricted \(k\)-ary words and functional equations (Q1028452) (← links)
- Bounding restricted rotation distance (Q1029025) (← links)
- Embedding height balanced trees and Fibonacci trees in hypercubes (Q1031992) (← links)
- The bandpass problem: Combinatorial optimization and library of problems (Q1037450) (← links)
- A constant-time dynamic storage allocator for real-time systems (Q1039289) (← links)
- On bijections for pattern-avoiding permutations (Q1040843) (← links)
- A generalization of the 0-1 principle for sorting (Q1041721) (← links)
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis (Q1044673) (← links)
- On the average depth of asymmetric LC-tries (Q1044716) (← links)
- Almost avoiding permutations (Q1045202) (← links)
- Transposition of large rectangular matrices (Q1048521) (← links)
- On a problem of Oppenheim concerning ''Factorisatio Numerorum'' (Q1050397) (← links)
- Una struttura bidimensionale per la memorizzazione dei file trasposti (Q1052108) (← links)
- The average height of planted plane trees with M leaves (Q1052326) (← links)
- Optimal multiway search trees for variable size keys (Q1053461) (← links)
- Minimal and almost minimal perfect hash function search with application to natural language lexicon design (Q1055206) (← links)
- Approximate counting: a detailed analysis (Q1057061) (← links)
- Purely top-down updating algorithms for stratified search trees (Q1057067) (← links)
- Macro-operators: A weak method for learning (Q1057073) (← links)
- Solution of two sequencing problems (Q1057171) (← links)
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- Complexity lower bounds for machine computing models (Q1057651) (← links)
- The complexity of finding minimum-length generator sequences (Q1058290) (← links)
- The average height of the second highest leaf of a planted plane tree (Q1058519) (← links)
- A proof of Andrews' \(q\)-Dyson conjecture (Q1058634) (← links)
- A backtracking method for constructing perfect hash functions from a set of mapping functions (Q1059411) (← links)
- An ordered minimal perfect hashing scheme based upon Euler's theorem (Q1060014) (← links)
- Optimal solutions for a class of point retrieval problems (Q1062772) (← links)
- Geometry of a category of complexes and algebraic K-theory (Q1063906) (← links)
- Significant improvements to the Ford-Johnson algorithm for sorting (Q1064782) (← links)
- k-fold bitonic sort on a mesh-connected parallel computer (Q1065549) (← links)
- Possibilistic search trees (Q1065559) (← links)
- A Schensted algorithm for rim hook tableaux (Q1065797) (← links)
- A direct combinatorial proof of a positivity result (Q1065801) (← links)
- A bijective proof of Cassini's Fibonacci identity (Q1066146) (← links)
- Join during merge: an improved sort based algorithm (Q1066681) (← links)
- Binomial determinants, paths, and hook length formulae (Q1066901) (← links)
- Weighted inversion numbers, restricted growth functions, and standard Young tableaux (Q1066903) (← links)
- Database relations with null values (Q1067417) (← links)
- The analysis of simple list structures (Q1067775) (← links)
- General algorithms for the address calculation of lexicographically ordered tuples (Q1068557) (← links)
- Universal retrieval trees (Q1068838) (← links)
- Improved upper bounds on Shellsort (Q1069307) (← links)
- Probabilistic counting algorithms for data base applications (Q1069325) (← links)
- Finding extreme points in three dimensions and solving the post-office problem in the plane (Q1069424) (← links)
- Topological transformations as a tool in the design of systolic networks (Q1069704) (← links)
- Selection of the optimum uniform partition search (Q1069708) (← links)
