Pages that link to "Item:Q1236529"

The following pages link to On the sequential and random selection of subspaces over a finite field (Q1236529):

Displaying 9 items.

• Bijective methods in the theory of finite vector spaces (Q794645) (← links)
• Fair and distributed peer-to-peer allocation of a common, refillable resource (Q897403) (← links)
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects (Q1236548) (← links)
• Some applications of algorithms for constructing subspaces over a finite field (Q1812672) (← links)
• The nearest neighbor random walk on subspaces of a vector space and rate of convergence (Q1890740) (← links)
• Upper and lower estimates for the number of some \(k\)-dimensional subspaces of a given weight over a finite field (Q2247806) (← links)
• Application of a fast simulation method to the estimation of the number of some \(k\)-dimensional subspaces over a finite space (Q2452822) (← links)
• Combinatorial identities by way of Wilf's multigraph model (Q2644160) (← links)
• The Subgroup Algorithm for Generating Uniform Random Variables (Q3415825) (← links)