@inproceedings{10.1007/978-3-642-82456-2_25,
    Abstract = {In Monte Carlo calculations, one often needs to generate a random quantity X that satisfies certain (cumulative) distribution function F(x), i.e. Pr{\{}X ≤ x{\}} = F(x). Numerous methods have been proposed for this purpose (see Ahrens and Dieter [1], Knuth [4]). An interesting question is: for a given F(x), how difficult is it to generate this distribution?},
    Address = {Berlin, Heidelberg},
    Author = {Yao, Andrew C.},
    BookTitle = {Combinatorial Algorithms on Words},
    Editor = {Apostolico, Alberto and Galil, Zvi},
    ISBN = {978-3-642-82456-2},
    Pages = {357--361},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Context-Free Grammars and Random Number Generation},
    Year = {1985},
    date-added = {2018-10-16 14:24:20 +0000},
    date-modified = {2018-10-16 14:24:20 +0000},
    doi = {10.1007/978-3-642-82456-2_25}
}

@inproceedings{10.1007/978-3-642-82456-2_25, Abstract = {In Monte Carlo calculations, one often needs to generate a random quantity X that satisfies certain (cumulative) distribution function F(x), i.e. Pr{{}X ≤ x{}} = F(x). Numerous methods have been proposed for this purpose (see Ahrens and Dieter [1], Knuth [4]). An interesting question is: for a given F(x), how difficult is it to generate this distribution?}, Address = {Berlin, Heidelberg}, Author = {Yao, Andrew C.}, BookTitle = {Combinatorial Algorithms on Words}, Editor = {Apostolico, Alberto and Galil, Zvi}, ISBN = {978-3-642-82456-2}, Pages = {357--361}, Publisher = {Springer Berlin Heidelberg}, Title = {Context-Free Grammars and Random Number Generation}, Year = {1985}, date-added = {2018-10-16 14:24:20 +0000}, date-modified = {2018-10-16 14:24:20 +0000}, doi = {10.1007/978-3-642-82456-2_25} }