The following pages link to (Q4057549):
Displaying 50 items.
- Upper bounds for sorting integers on random access machines (Q789897) (← links)
- Asymptotic estimates for the higher moments of the expected behavior of straight insertion sort (Q790618) (← links)
- A bijection proving orthogonality of the characters of \(S_ n\) (Q790811) (← links)
- The \(r\)-Stirling numbers (Q790812) (← links)
- Adaptive mesh refinement for hyperbolic partial differential equations (Q792075) (← links)
- An 0(n log n) algorithm for the convex bipartite matching problem (Q792885) (← links)
- New trie data structures which support very fast search operations (Q794438) (← links)
- A simple version of Karzanov's blocking flow algorithm (Q795064) (← links)
- Minimizing access pointers into trees and arrays (Q795505) (← links)
- A new parallel sorting algorithm based upon min-mid-max operations (Q795507) (← links)
- On binary tree encodements (Q795519) (← links)
- Some average performance measures for the B-tree (Q797287) (← links)
- A compact hash function for paths in PERT networks (Q797503) (← links)
- Some combinatorial and algebraic properties of Coxeter complexes and Tits buildings (Q798337) (← links)
- Hook flag characters and their combinatorics (Q798762) (← links)
- Multi-version concurrency control scheme for a database system (Q799131) (← links)
- An analytical comparison of two string searching algorithms (Q800732) (← links)
- Asymptotic results on the maximal deviation of simple random walks (Q801404) (← links)
- On search by address computation (Q802312) (← links)
- The recursive structure of some ordering problems (Q802870) (← links)
- Efficient sorting during repetitive statistical computations: Algorithms and an application (Q804105) (← links)
- On parallel integer sorting (Q805234) (← links)
- Construction of three-dimensional Delaunay triangulations using local transformations (Q807005) (← links)
- Modular tree transducers (Q807012) (← links)
- An information and preference theory approach to a discrete resource allocation problem (Q807607) (← links)
- Parallel comparison algorithms for approximation problems (Q808727) (← links)
- Hybrid tableaux and the Littlewood-Richardson rule (Q809103) (← links)
- Catalan numbers and branched coverings by the Riemann sphere (Q809157) (← links)
- The number of part sizes of a given multiplicity in a random Carlitz composition (Q817245) (← links)
- Old and young leaves on plane trees (Q820084) (← links)
- Dynamic dictionaries for multisets and counting filters with constant time operations (Q832853) (← links)
- A fast algorithm for computing a longest common increasing subsequence (Q835045) (← links)
- New permutation coding and equidistribution of set-valued statistics (Q837165) (← links)
- Knuth relations for the hyperoctahedral groups (Q842857) (← links)
- On the cost of searching signature trees (Q845663) (← links)
- A variant of the Ford-Johnson algorithm that is more space efficient (Q846008) (← links)
- Expressible sharing for functional circuit description (Q848741) (← links)
- Phase transition in a generalized Eden growth model on a tree (Q858046) (← links)
- The left-right-imbalance of binary search trees (Q868958) (← links)
- A complexity O(1) priority queue for event driven molecular dynamics simulations (Q870573) (← links)
- An improved earliness--tardiness timing algorithm (Q878565) (← links)
- Quasi-optimal energy-efficient leader election algorithms in radio networks (Q879595) (← links)
- Inversion formulae on permutations avoiding 321 (Q895062) (← links)
- Functional graphs of polynomials over finite fields (Q895996) (← links)
- Smoothed heights of tries and patricia tries (Q896160) (← links)
- Sorting nine inputs requires twenty-five comparisons (Q899586) (← links)
- A general theory of Wilf-equivalence for Catalan structures (Q907236) (← links)
- A data structure useful for finding Hamiltonian cycles (Q909446) (← links)
- Modeling the dynamics of social systems (Q909603) (← links)
- Distributing a \(B^+\)-tree in a loosely coupled environment (Q910190) (← links)
