diff options
| author | M Joonas Pihlaja <jpihlaja@cc.helsinki.fi> | 2008-11-18 00:20:38 +0200 |
|---|---|---|
| committer | M Joonas Pihlaja <jpihlaja@cc.helsinki.fi> | 2008-11-18 00:20:38 +0200 |
| commit | b091c5bfcad170fd563699a1c8b11e7d25d159a2 (patch) | |
| tree | c962bd341dd68ed5648a1cf3be38958d87a030b5 /BIBLIOGRAPHY | |
| parent | 3a82f943988413e0d3fada9932bb385f4cbdb3c7 (diff) | |
BIBLIOGRAPHY: Cite Hars & Petruska's Pseudorandom Recursions paper.
Diffstat (limited to 'BIBLIOGRAPHY')
| -rw-r--r-- | BIBLIOGRAPHY | 15 |
1 files changed, 15 insertions, 0 deletions
diff --git a/BIBLIOGRAPHY b/BIBLIOGRAPHY index dacd5321d..90a6cef20 100644 --- a/BIBLIOGRAPHY +++ b/BIBLIOGRAPHY @@ -68,6 +68,21 @@ of Bentley-Ottmann: http://citeseer.ist.psu.edu/pugh90skip.html +The random number generator used in our skip list implementation is a +very small generator by Hars and Petruska. The generator is based on +an invertable function on Z_{2^32} with full period and is described +in + + Hars L. and Petruska G., + ``Pseudorandom Recursions: Small and Fast Pseurodandom + Number Generators for Embedded Applications'', + Hindawi Publishing Corporation + EURASIP Journal on Embedded Systems + Volume 2007, Article ID 98417, 13 pages + doi:10.1155/2007/98417 + + http://www.hindawi.com/getarticle.aspx?doi=10.1155/2007/98417&e=cta + From the result of the intersection-finding pass, we are currently computing a tessellation of trapezoids, (the exact manner is undergoing some work right now with some important speedup), but we |