The following pages link to (Q4057549):
Displaying 50 items.
- Exact average message complexity values for distributed election on bidirectional rings of processors (Q910221) (← links)
- Finding nearest neighbors with Voronoi tessellations (Q910225) (← links)
- Analysis of the standard deletion algorithms in exact fit domain binary search trees (Q911249) (← links)
- Performance evaluation of shared and separate inverted files (Q911252) (← links)
- Slow optimally balanced search strategies vs. cached fast uniformly balanced search strategies (Q911291) (← links)
- Stable in situ sorting and minimum data movement (Q911311) (← links)
- Deterministic optimal and expedient move-to-rear list organizing strategies (Q914378) (← links)
- Efficient binary space partitions for hidden-surface removal and solid modeling (Q914380) (← links)
- Task scheduling for parallel sparse Cholesky factorization (Q915427) (← links)
- Constant time sorting on a processor array with a reconfigurable bus system (Q915452) (← links)
- The complexity of a simple stochastic OR-tree model in which ``directional search'' is bad (Q915453) (← links)
- Parallel general prefix computations with geometric, algebraic, and other applications (Q916378) (← links)
- Symmetric functions and P-recursiveness (Q916659) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Worst-case analysis of a generalized heapsort algorithm (Q917307) (← links)
- A single surface contact algorithm for the post-buckling analysis of shell structures (Q920683) (← links)
- A locally refined rectangular grid finite element method: Application to computational fluid dynamics and computational physics (Q922106) (← links)
- Stochastic rearrangement rules for self-organizing data structures (Q922688) (← links)
- On the height of digital trees and related problems (Q922689) (← links)
- Weighted dual functions for Bernstein basis satisfying boundary constraints (Q928065) (← links)
- Improved bounds on sorting by length-weighted reversals (Q931719) (← links)
- Simultaneous matchings: Hardness and approximation (Q931730) (← links)
- Weighted height of random trees (Q934911) (← links)
- Protocol completion incentive problems in cryptographic Vickrey auctions (Q934962) (← links)
- Trees, functional equations, and combinatorial Hopf algebras (Q942137) (← links)
- Collision probability for an occupancy problem (Q947202) (← links)
- Applications of the complexity space to the general probabilistic divide and conquer algorithms (Q947570) (← links)
- An Ansatz for the asymptotics of hypergeometric multisums (Q950417) (← links)
- Estimating all possible SUR models with permuted exogenous data matrices derived from a VAR process (Q956526) (← links)
- Chamfer metrics, the medial axis and mathematical morphology. (Q960491) (← links)
- Should one always use repeated squaring for modular exponentiation? (Q963373) (← links)
- On the modeling of pedestrian motion (Q967812) (← links)
- Largest empty circle centered on a query line (Q972354) (← links)
- Deletions in random binary search trees: a story of errors (Q972839) (← links)
- The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2 (Q976157) (← links)
- Growth diagrams for the Schubert multiplication (Q986120) (← links)
- An efficient counting network (Q986532) (← links)
- The enumeration of permutations sortable by pop stacks in parallel (Q987841) (← links)
- Rotation distance is fixed-parameter tractable (Q989526) (← links)
- Another look at bijections for pattern-avoiding permutations (Q990769) (← links)
- Designing competitions between teams of individuals (Q991017) (← links)
- On the learnability of majority rule (Q996375) (← links)
- Efficient algorithms for finding a longest common increasing subsequence (Q996830) (← links)
- The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance (Q997423) (← links)
- Young-Fibonacci insertion, tableauhedron and Kostka numbers (Q1003630) (← links)
- Order statistics and estimating cardinalities of massive data sets (Q1003691) (← links)
- Optimality in external memory hashing (Q1006387) (← links)
- On embedding subclasses of height-balanced trees in hypercubes (Q1006750) (← links)
- Optimal search for rationals (Q1007565) (← links)
- Cuckoo hashing: Further analysis (Q1007604) (← links)
