Pages that link to "Item:Q1201808"

The following pages link to Birthday paradox, coupon collectors, caching algorithms and self- organizing search (Q1201808):

Displaying 50 items.

• Laplacian versus adjacency matrix in quantum walk search (Q332103) (← links)
• Non-redundant random generation algorithms for weighted context-free grammars (Q391421) (← links)
• A non-uniform birthday problem with applications to discrete logarithms (Q427899) (← links)
• Limits and rates of convergence for the distribution of search cost under the move-to-front rule (Q671429) (← links)
• Least-recently-used caching with dependent requests (Q703555) (← links)
• On the resilience of Even-Mansour to invariant permutations (Q831175) (← links)
• Some upper and lower bounds on the coupon collector problem (Q859873) (← links)
• A quantitative study of pure parallel processes (Q907263) (← links)
• The limiting move-to-front search-cost in law of large numbers asymptotic regimes (Q968782) (← links)
• Asymptotics for the random coupon collector problem (Q1298487) (← links)
• Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities (Q1305419) (← links)
• Occupancy urn models in the analysis of algorithms (Q1347968) (← links)
• Measures of distinctness for random partitions and compositions of an integer (Q1373445) (← links)
• On determining the congruence of point sets in \(d\) dimensions (Q1384212) (← links)
• On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors (Q1717538) (← links)
• On Ramanujan's \(Q\)-function (Q1894389) (← links)
• General asymptotic estimates for the coupon collector problem (Q1919429) (← links)
• Monte Carlo cubature construction (Q2044144) (← links)
• A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space (Q2120961) (← links)
• \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm (Q2141175) (← links)
• Divisibility properties of random samples of integers (Q2220962) (← links)
• Running time analysis of broadcast consensus protocols (Q2233402) (← links)
• Uniform versus Zipf distribution in a mixing collection process (Q2273725) (← links)
• Data collection in population protocols with non-uniformly random scheduler (Q2285150) (← links)
• Mixing times for a constrained Ising process on the two-dimensional torus at low density (Q2337837) (← links)
• Application of Smirnov words to waiting time distributions of runs (Q2401440) (← links)
• Local limit theorems for finite and infinite urn models (Q2427055) (← links)
• Limiting search cost distribution for the move-to-front rule with random request probabilities (Q2480054) (← links)
• Analytic combinatorics for computing seeding probabilities (Q2633234) (← links)
• Finding shuffle words that represent optimal scheduling of shared memory access (Q2855755) (← links)
• The coupon collector's problem revisited: asymptotics of the variance (Q2879912) (← links)
• The Chebotarev Invariant of a Finite Group (Q2883922) (← links)
• Information Transmission under Random Emission Constraints (Q2929855) (← links)
• New Results on a Generalized Coupon Collector Problem Using Markov Chains (Q2949845) (← links)
• Minimum Expected *-Cast Time in DTNs (Q3006019) (← links)
• A fluid limit for a cache algorithm with general request processes (Q3059697) (← links)
• Optimization results for a generalized coupon collector problem (Q3188594) (← links)
• The self-power map and collecting all residue classes (Q3450042) (← links)
• Stopping Rules in Balanced Allocation Problems: Exact and Asymptotic Distributions (Q3527717) (← links)
• A Collector's Problem with Renewal Arrival Processes (Q3535624) (← links)
• Methods for Studying Generalized Birthday and Coupon Collection Problems (Q3625311) (← links)
• The move-to-partner rule for self-organizing task allocation on a linear array (Q4532399) (← links)
• SIZE-BIASED PERMUTATION OF DIRICHLET PARTITIONS AND SEARCH-COST DISTRIBUTION (Q4673902) (← links)
• Sampling Formulae Arising from Random Dirichlet Populations (Q4681063) (← links)
• The general birthday problem (Q4697810) (← links)
• On the distribution of the search cost for the move-to-front rule with random weights (Q4819452) (← links)
• ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns (Q4969622) (← links)
• Speed and concentration of the covering time for structured coupon collectors (Q5005019) (← links)
• Maximum of exponential random variables, Hurwitz's zeta function, and the partition function (Q5022612) (← links)
• Data Collection in Population Protocols with Non-uniformly Random Scheduler (Q5056046) (← links)