Sergey Agievich  Home/Search
Context
Related
| combinatorics.org/Volume_...v10i1r21.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: combinatorics.org/Volu...v10i1toc (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Let m + n particles be thrown randomly, independently of each other into N cells, using the following two-stage procedure. 1. The rst m particles are allocated equiprobably, that is, the probability of a particle falling into any particular cell is 1=N . Let the ith cell contain m i particles on completion. Then associate with this cell the probability a i = m i =m and withdraw the particles. 2. The other n particles are then allocated polynomially, that is, the probability of a particle... (Update)
Active bibliography (related documents): More All
1.3: Two-stage allocations and the double Q-function - Agievich (2003) (Correct)
0.2: Stream Cipher Design Based on Jumping Finite State Machines - Jansen (2005) (Correct)
0.2: Exponential S-boxes - Agievich, Afonenko (2004) (Correct)
Similar documents based on text: More All
0.4: On the Affine Classification of Cubic Bent Functions - Agievich (2005) (Correct)
0.1: Transport: Monitoring and Control - June Unu Iist (Correct)
0.1: Optimization of Incompletely Specified MVL.. - Zaitseva.. (1996) (Correct)
BibTeX entry: (Update)
@misc{ agievich-twostage,
author = "Sergey Agievich",
title = "Two-stage allocations and the double Q-function",
url = "citeseer.ist.psu.edu/agievich03twostage.html" }
Citations (may not include all citations):2003 The art of computer programming (context) - Knuth - 1973
1749 An introduction to probability theory and its applications (context) - Feller - 1968
151 Singularity analysis of generating functions (context) - Flajolet, Odlyzko - 1990 DBLP
110 Ramanujan's notebooks (context) - Berndt - 1989
65 Asymptotic enumeration methods - Odlyzko - 1995 ACM
61 Asymptotic methods in analysis (context) - de Bruijn - 1958
58 Random allocations (context) - Kolchin, Sevast'yanov et al. - 1978
4 Handbook of applied cryptology (context) - Menezes, van Oorschot et al. - 1997
2 Computational and Applied Mathematics (context) - Flajolet, Grabner et al. - 1995 ACM
2 Approximations connected with e (context) - Watson, by - 1929
Documents on the same site (http://www.combinatorics.org/Volume_10/v10i1toc.html): More
A Note on Graph Coloring Extensions and List-Colorings - Axenovich (2003) (Correct)
Packing 10 or 11 Unit Squares in a Square - Stromquist (2003) (Correct)
Global Defensive Alliances in Graphs - Haynes, Hedetniemi, Henning (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC