The following pages link to (Q4855565):
Displaying 50 items.
- Numerical solution of dual-phase-lagging heat conduction model for analyzing overshooting phenomenon (Q273382) (← links)
- Towards a realistic analysis of the QuickSelect algorithm (Q290901) (← links)
- On rotations in fringe-balanced binary trees (Q293176) (← links)
- An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication (Q293191) (← links)
- Exact solution of a minimal recurrence (Q294799) (← links)
- A linear-time algorithm for the orbit problem over cyclic groups (Q303693) (← links)
- A unified approach to linear probing hashing with buckets (Q308951) (← links)
- Retracted: Strong limiting behavior in binary search trees (Q395794) (← links)
- A slicing tree representation and QCP-model-based heuristic algorithm for the unequal-area block facility layout problem (Q474693) (← links)
- Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern (Q544885) (← links)
- Post-processing hierarchical community structures: quality improvements and multi-scale view (Q627194) (← links)
- The analysis of range quickselect and related problems (Q650886) (← links)
- Enumeration results for alternating tree families (Q709246) (← links)
- Rooted tree statistics from Matula numbers (Q713328) (← links)
- Average complexity of Moore's and Hopcroft's algorithms (Q764328) (← links)
- A metric index for approximate string matching (Q818138) (← links)
- Counting the number of spanning trees in a class of double fixed-step loop networks (Q847313) (← links)
- The number of distinct values in a geometrically distributed sample (Q852697) (← links)
- Lagrange inversion: when and how (Q867149) (← links)
- Approximating Boolean functions by OBDDs (Q867861) (← links)
- The left-right-imbalance of binary search trees (Q868958) (← links)
- Binary words excluding a pattern and proper Riordan arrays (Q870961) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Introduction to partially ordered patterns (Q881572) (← links)
- Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees (Q906406) (← links)
- Trees with exponentially growing costs (Q924721) (← links)
- Management and analysis of DNA microarray data by using weighted trees (Q925235) (← links)
- Analytical study of a stochastic plant growth model: application to the GreenLab model (Q929761) (← links)
- Analytic and combinatoric aspects of Hurwitz polyzetas (Q933161) (← links)
- Weighted height of random trees (Q934911) (← links)
- Combinatorial analysis of tetris-like games (Q941345) (← links)
- The number of convex permutominoes (Q948075) (← links)
- Riordan matrices and higher-dimensional lattice walks (Q972838) (← links)
- Chain hexagonal cacti: matchings and independent sets (Q973140) (← links)
- On the silhouette of binary search trees (Q983879) (← links)
- Binary trees with choosable edge lengths (Q989581) (← links)
- Enumeration and random generation of accessible automata (Q995562) (← links)
- The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance (Q997423) (← links)
- The average position of the \(d\)th maximum in a sample of geometric random variables (Q1012211) (← links)
- Moves and displacements of particular elements in quicksort (Q1019745) (← links)
- On asymptotic extrapolation (Q1023265) (← links)
- Noncommutative algebra, multiple harmonic sums and applications in discrete probability (Q1025389) (← links)
- On the variance of the number of occupied boxes (Q1031734) (← links)
- Repeated patterns in genetic programming (Q1035713) (← links)
- The relevant prefixes of coloured Motzkin walks: an average case analysis (Q1041231) (← links)
- The average diameter of general tree structures (Q1125035) (← links)
- Dyck path enumeration (Q1300974) (← links)
- Analytic combinatorics of non-crossing configurations (Q1300975) (← links)
- Asymptotic estimation of the average number of terminal states in DAWGs (Q1304477) (← links)
- An analytic approach for the analysis of rotations in fringe-balanced binary search trees (Q1305200) (← links)
