This Q&A is part of a weekly series of posts highlighting common questions encountered by technophiles and answered by users at Stack Exchange, a free, community-powered network of 100+ Q&A sites.

This is a preview. Log in through your library . Abstract We investigate the tail behaviour of the steady-state distribution of a stochastic recursion that generalises Lindley's recursion. This ...

We consider a multivariate distributional recursion of sum type, as arises in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's ...

Hi,<BR><BR>I'm currently coding a function in Java that will find the number of possible combinations for a string. I've run into a problem in to a problem with regards to both speed and memory usage.