Random number generators: good ones are hard to find

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Random number generators: good ones are hard to find

Full text

Pdf (1.15 MB)

Source

Communications of the ACM archive
Volume 31 , Issue 10 (October 1988) table of contents

Pages: 1192 - 1201

Year of Publication: 1988

ISSN:0001-0782

Authors

S. K. Park
K. W. Miller

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 88, Downloads (12 Months): 795, Citation Count: 93

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/63039.63042 What is a DOI?

ABSTRACT

Practical and theoretical issues are presented concerning the design, implementation, and use of a good, minimal standard random number generator that will port to virtually all systems.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Paul Bratley , Bennett L Fox , Linus E Schrage, A guide to simulation (2nd ed.), Springer-Verlag New York, Inc., New York, NY, 1986
	2	William G. Bulgren, Discrete System Simulation, Prentice Hall PTR, Upper Saddle River, NJ, 1982
	3	W. F. Clocksin , Christopher S. Mellish, Programming in Prolog (3rd ed.), Springer-Verlag New York, Inc., New York, NY, 1987
	4	R. R. Coveyou , R. D. Macpherson, Fourier Analysis of Uniform Random Number Generators, Journal of the ACM (JACM), v.14 n.1, p.100-119, Jan. 1967 [doi>10.1145/321371.321379]
	5	William J. Collins, Intermediate Pascal Programming: A Case Study Approach, McGraw-Hill, Inc., New York, NY, 1985
	6	Doug Cooper , Michael J. Clancy, Oh! Pascal!, W. W. Norton & Co., Inc., New York, NY, 1985
	7	George S. Fishman, Principles of Discrete Event Simulation, John Wiley & Sons, Inc., New York, NY, 1978
	8	Fishman, G.S., and Moore, L.R. A statistical evaluation of multiplicative congruential random number generators with modulus 23~ - 1. J. Am. Stat. Assoc. 77, 377 {Mar. 1982), 129-136.
	9	George A Fishman , Louis R Moore, III, An exhaustive analysis of multiplicative congruential random number generators with modulus 2³¹-1, SIAM Journal on Scientific and Statistical Computing, v.7 n.1, p.24-45, Jan. 1986 [doi>10.1137/0907002]
	10	Richard P. Gabriel, Performance and evaluation of LISP systems, Massachusetts Institute of Technology, Cambridge, MA, 1985
	11	Gilbert, J.R. The University of Sheffield Pascal System for Prime Computers. University of Sheffield, Sheffield, England, 1987, p. 10.
	12	Bryon S. Gottfried, Theory and problems of programming with C, McGraw-Hill, Inc., New York, NY, 1990
	13	Peter Grogono, Programming in Pascal: Computer Science, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1984
	14	Hoaglin, D.C. Theoretical properties of congruential randomnumber generators: An empirical view. Memo NS-340. Dept. of Statistics, Harvard University, Cambridge, Mass., 1976.
	15	Hull, T.T., and Dobell, A.R. Random number generators. SIAM Rev. 4 (July 1962), 230-254.
	16	David W. Hutchinson, A new uniform pseudorandom number generator, Communications of the ACM, v.9 n.6, p.432-433, June 1966 [doi>10.1145/365696.365712]
	17	IMSL Stat/Library User's Manual. IMSL, Houston, Tex., 1987, pp. 947-951.
	18	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	19	J Konvalina , S Wileman, Programming with Pascal, McGraw-Hill, Inc., New York, NY, 1986
	20	Richard Lamb, Pascal: structure and style, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1986
	21	Edward L Lamie, Pascal programming, John Wiley & Sons, Inc., New York, NY, 1986
	22	Averill M. Law , W. David Kelton, Simulation Modeling and Analysis, McGraw-Hill Higher Education, 1997
	23	Stephen S. Lavenberg, Computer Performance Modeling Handbook, Academic Press, Inc., Orlando, FL, 1983
	24	P. L'Ecuyer, Efficient and portable combined random number generators, Communications of the ACM, v.31 n.6, p.742-751, June 1988 [doi>10.1145/62959.62969]
	25	Sanford Leestma , Larry Nyhoff, Pascal: programming and problem solving (2nd ed.), Macmillan Publishing Co., Inc., Indianapolis, IN, 1987
	26	Lehmer, D.H. Mathematical methods in large-scale computing units. Annu. Comput. Lab. Harvard Univ. 26 (1951), 141-146.
	27	Lewis, P.A., Goodman, A.S., and Miller, J.M. A pseudo-random number generator for the System/360. IBM Syst. J. 8, 2 (1969), 136-146.
	28	M. Donald MacLaren , George Marsaglia, Uniform Random Number Generators, Journal of the ACM (JACM), v.12 n.1, p.83-89, Jan. 1965 [doi>10.1145/321250.321257]
	29	MacModuta-2 System Reference Manual. Modula Corporation, 1985, p. 41.
	30	Marsaglia, G. Random numbers fall mainly in the planes. Natl. Acad. Sci. Prec. 61 (Sept. 1968), 25-28.
	31	George Marsaglia , T. A. Bray, One-line random number generators and their use in combinations, Communications of the ACM, v.11 n.11, p.757-759, Nov. 68 [doi>10.1145/364139.364158]
	32	Maryanski, F. Digital Computer Simulation. Hayden, Rochelle Park, N.J., 1980, pp. 224-230.
	33	Moffat, D.V. Common Algorithms in Pascal. Prentice-Hall, Englewood Cliffs, N.J., 1984, pp. 201-203.
	34	Motluzzo, J.C., and Buckely, F. Discrete Mathematics. Wadsworth, Belmont, Calif., 1986, pp. 219-221.
	35	Larry R. Nyhoff , Sanford Lee, FORTRAN 77 for Engineers and Scientists, Prentice Hall Professional Technical Reference, 1992
	36	James A. Payne, Introduction to Simulation: Programming Techniques and Methods Analysis, McGraw-Hill, Inc., New York, NY, 1982
	37	W. H. Payne , J. R. Rabung , T. P. Bogyo, Coding the Lehmer pseudo-random number generator, Communications of the ACM, v.12 n.2, p.85-86, Feb. 1969 [doi>10.1145/362848.362860]
	38	SAS User's Guide: Basics, Version 5 Edition. SAS Institute Inc., Cary, N.C., 1985, pp. 278-280.
	39	Sauer, C.H., and Chandy, K.M. Computer Systems Performance Modeling. Prentice-Hall, Englewood Cliffs, N.J., 1981, pp. 195-199.
	40	Walter J Savitch, Pascal, an introduction to the art and science of programming, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1986
	41	Linus Schrage, A More Portable Fortran Random Number Generator, ACM Transactions on Mathematical Software (TOMS), v.5 n.2, p.132-138, June 1979 [doi>10.1145/355826.355828]
	42	SLAM I1 Installation and Operations Guide, Version 3.2. Pritsker and Associates, West Lafayette, Ind., 1986, pp. 3.4-3.9.
	43	Marilyn Z. Smith, FORTRAN 77: A Problem-Solving Approach, Houghton Mifflin Co., Boston, MA, 1984
	44	Subroutines Reference Guide. 3rd Ed. Prime Computer, Natick, Mass., 1984, p. 12.45.
	45	System/360 Scientific Subroutine Package, Version IlL Programmer's Manual. IBM, White Plains, New York, 1968, p. 77.
	46	Turbo Pascal, Version 3.0. Borland International, Scotts Valley, Calif., 1986.
	47	Wichmann, B.A., and Hill, I.D. An efficient and portable pseudorandom number generator. Appl. Stat, 31 (1982), 188-190.

CITED BY 93

	Ashok Rathi , Huizhu Lu , G. E. Hedrick, Performance comparison of extendible hashing and linear hashing techniques, Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems, p.178-185, March 28-30, 1990, Crystal City, Virginia, United States
	Karl Entacher, Bad subsequences of well-known linear congruential pseudorandom number generators, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.8 n.1, p.61-70, Jan. 1998
	C. D. Kemp, The construction of fast portable multiplicative congruential random number generators, Communications of the ACM, v.39 n.12es, Dec. 1996
	CORPORATE Tech Correspondence, Technical correspondence, Communications of the ACM, v.32 n.8, p.1014-1024, Aug. 1989
	David G. Thaler , Chinya V. Ravishankar, Using name-based mappings to increase hit rates, IEEE/ACM Transactions on Networking (TON), v.6 n.1, p.1-14, Feb. 1998
	Pierre L'Ecuyer, Random numbers for simulation, Communications of the ACM, v.33 n.10, p.85-97, Oct. 1990
	Wolfgang Hörmann, A note on the quality of random variates generated by the ratio of uniforms method, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.4 n.1, p.96-106, Jan. 1994
	Edward A. Fox , Lenwood S. Heath , Qi Fan Chen , Amjad M. Daoud, Practical minimal perfect hash functions for large databases, Communications of the ACM, v.35 n.1, p.105-121, Jan. 1992
	Diane Crawford, Technical correspondence, Communications of the ACM, v.36 n.7, p.105, July 1993
	Daniel V. Pryor , Steven A. Cuccaro , Michael Mascagni , M. L. Robinson, Implementation of a portable and reproducible parallel pseudorandom number generator, Proceedings of the 1994 conference on Supercomputing, p.311-319, December 1994, Washington, D.C., United States
	R. G. G. Cattell , J. Skeen, Object operations benchmark, ACM Transactions on Database Systems (TODS), v.17 n.1, p.1-31, March 1992
	Lih-Yuan Deng , E. Olusegun George , Yu-Chao Chu, On improving pseudo-random number generators, Proceedings of the 23rd conference on Winter simulation, p.1035-1042, December 08-11, 1991, Phoenix, Arizona, United States
	Mor Harchol-Balter , Paul E. Black, Queueing analysis of oblivious packet-routing networks, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.583-592, January 23-25, 1994, Arlington, Virginia, United States
	Paul D. Coddington , Sung-Hoon Ko, Techniques for empirical testing of parallel random number generators, Proceedings of the 12th international conference on Supercomputing, p.282-288, July 1998, Melbourne, Australia
	Charles Herring , Julian I. Palmore, Random number generators are chaotic, Communications of the ACM, v.38 n.1, p.121-122, Jan. 1995
	M. C. Murphy , D. Rotem, Multiprocessor Join Scheduling, IEEE Transactions on Knowledge and Data Engineering, v.5 n.2, p.322-338, April 1993
	Jack P. C. Kleijnen , Bert Bettonvil , Willem J. H. Van Groenendaal, Validation of trace-driven simulation models: regression analysis revisited, Proceedings of the 28th conference on Winter simulation, p.352-359, December 08-11, 1996, Coronado, California, United States
	CORPORATE Tech Correspondence, Technical correspondence, Communications of the ACM, v.32 n.8, p.1014-1024, Aug. 1989
	CORPORATE Tech Correspondence, Technical correspondence, Communications of the ACM, v.32 n.8, p.1014-1024, Aug. 1989
	Peter Hellekalek, Inversive pseudorandom number generators: concepts, results and links, Proceedings of the 27th conference on Winter simulation, p.255-262, December 03-06, 1995, Arlington, Virginia, United States
	David F. Carta, Two fast implementations of the “minimal standard” random number generator, Communications of the ACM, v.33 n.1, p.87-88, Jan. 1990
	Robert Rönngren , Rassul Ayani, A comparative study of parallel and sequential priority queue algorithms, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.7 n.2, p.157-209, April 1997
	Adam Rifkin, The utility of foresight in single server scheduling, Proceedings of the 30th annual Southeast regional conference, April 08-10, 1992, Raleigh, North Carolina
	W. Hörmann , G. Derflinger, A portable random number generator well suited for the rejection method, ACM Transactions on Mathematical Software (TOMS), v.19 n.4, p.489-495, Dec. 1993
	Barry Shackleford , Motoo Tanaka , Richard J. Carter , Greg Snider, FPGA implementation of neighborhood-of-four cellular automata random number generators, Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays, February 24-26, 2002, Monterey, California, USA
	D. E. Ross, Pseudo-random number generators for a calculator, Communications of the ACM, v.38 n.1, p.122-124, Jan. 1995
	Andrew Lim , Siu-Wing Cheng , Ching-Ting Wu, Performance oriented rectilinear Steiner trees, Proceedings of the 30th international conference on Design automation, p.171-176, June 14-18, 1993, Dallas, Texas, United States
	Srinivas Aluru, Parallel additive lagged Fibonacci random number generators, Proceedings of the 10th international conference on Supercomputing, p.102-108, May 25-28, 1996, Philadelphia, Pennsylvania, United States
	Martina F. Schollmeyer , William H. Tranter, Noise generators for the simulation of digital communication systems, Proceedings of the 24th annual symposium on Simulation, p.264-275, April 1991, New Orleans, Louisiana, United States
	Kevin J. Lang, Random DFA's can be approximately learned from sparse uniform examples, Proceedings of the fifth annual workshop on Computational learning theory, p.45-52, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
	Michael Mascagni , Ashok Srinivasan, Algorithm 806: SPRNG: a scalable library for pseudorandom number generation, ACM Transactions on Mathematical Software (TOMS), v.26 n.3, p.436-461, Sept. 2000
	Nir Shavit , Asaph Zemach, Diffracting trees (preliminary version), Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, p.167-176, June 27-29, 1994, Cape May, New Jersey, United States
	Josef Leydold, Automatic sampling with the ratio-of-uniforms method, ACM Transactions on Mathematical Software (TOMS), v.26 n.1, p.78-98, March 2000
	Geon Ho Choe , Dong Han Kim, The first return time test of pseudorandom numbers, Journal of Computational and Applied Mathematics, v.143 n.2, p.263-274, 15 June 2002
	Krzysztof Pawlikowski, Steady-state simulation of queueing processes: survey of problems and solutions, ACM Computing Surveys (CSUR), v.22 n.2, p.123-170, June 1990
	Nir Shavit , Eli Upfal , Asaph Zemach, A steady state analysis of diffracting trees (extended abstract), Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures, p.33-41, June 24-26, 1996, Padua, Italy
	Pierre L'Ecuyer , François Blouin , Raymond Couture, A search for good multiple recursive random number generators, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.3 n.2, p.87-98, April 1993
	Pei-Chi Wu, Multiplicative, congruential random-number generators with multiplier ± 2^k1 ± 2^k2 and modulus 2^p - 1, ACM Transactions on Mathematical Software (TOMS), v.23 n.2, p.255-265, June 1997
	Hannes Leeb , Stefan Wegenkittl, Inversive and linear congruential pseudorandom number generators in empirical tests, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.7 n.2, p.272-286, April 1997
	Sergio Sánchez , Regino Criado , Carlos Vega, A generator of pseudo-random numbers sequences with maximum period, Proceedings of the international conference on Computational methods in sciences and engineering, p.561-566, September 12-16, 2003, Kastoria, Greece
	Daniel V. Pryor , Steven A. Cuccaro , Michael Mascagni , M. L. Robinson, Implementation of a portable and reproducible parallel pseudorandom number generator, Proceedings of the 1994 ACM/IEEE conference on Supercomputing, November 14-18, 1994, Washington, D.C.
	C. C. Michael , G. McGraw , M. A. Schatz, Generating Software Test Data by Evolution, IEEE Transactions on Software Engineering, v.27 n.12, p.1085-1110, December 2001
	Shalabh Bhatnagar , Michael C. Fu , Steven I. Marcus , I-Jeng Wang, Two-timescale simultaneous perturbation stochastic approximation using deterministic perturbation sequences, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.13 n.2, p.180-209, April 2003
	Diane L. Evans , Lawrence M. Leemis, Input modeling using a computer algebra system, Proceedings of the 32nd conference on Winter simulation, December 10-13, 2000, Orlando, Florida
	Luca Benini , Angelo Galati , Alberto Macii , Enrico Macii , Massimo Poncino, Energy-efficient data scrambling on memory-processor interfaces, Proceedings of the 2003 international symposium on Low power electronics and design, August 25-27, 2003, Seoul, Korea
	Jim Doll , David L. Freeman, Monte Carlo Methods in Chemistry, IEEE Computational Science & Engineering, v.1 n.1, p.22-32, March 1994
	Barry Wilkinson, Comments on 'Design and Analysis of Arbitration Protocols' by F. El Guibaly, IEEE Transactions on Computers, v.41 n.3, p.348-351, March 1992
	J. S. Warford, Good pedagogical random number generators, ACM SIGCSE Bulletin, v.24 n.1, p.142-146, March 1992
	Ashok Rathi , Huizhu Lu , G. E. Hedrick, Performance comparison of extendible hashing and linear hashing techniques, ACM SIGSMALL/PC Notes, v.17 n.2, p.19-26, Summer 1991
	Rick Siow Mong Goh , Ian Li-Jin Thng, Twol-amalgamated priority queues, Journal of Experimental Algorithmics (JEA), v.9 n.es, 2004
	A. Mateos , S. Rios-Insua , L. Prieto, Computational Study of the Relationships Between Feasible and Efficient Sets and an Approximation, Computational Optimization and Applications, v.14 n.2, p.241-260, Sept. 1999
	Wai Teng Tang , Rick Siow Mong Goh , Ian Li-Jin Thng, Ladder queue: An O(1) priority queue structure for large-scale discrete event simulation, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.15 n.3, p.175-204, July 2005
	Martin Kulldorff , Toshiro Tango , Peter J. Park, Power comparisons for disease clustering tests, Computational Statistics & Data Analysis, v.42 n.4, p.665-684, 28 April 2003
	Chung-Chih Li , Hema Sagar R. Kandati , Bo Sun, Security evaluation of email encryption using random noise generated by LCG, Journal of Computing Sciences in Colleges, v.20 n.4, p.294-301, April 2005
	Joseph M. Saur, A short note on results of testing two random number generators, ACM SIGSIM Simulation Digest, v.20 n.3, p.50-52, Fall 1989
	Chris Noble , Steve Sugden, Stochastic recurrences of Jackpot Keno, Computational Statistics & Data Analysis, v.40 n.1, p.189-205, 28 July 2002
	F. Thomson Leighton , Bruce M. Maggs, Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks, IEEE Transactions on Computers, v.41 n.5, p.578-587, May 1992
	Michael Mascagni , Hongmei Chi, Parallel linear congruential generators with Sophie-Germain moduli, Parallel Computing, v.30 n.11, p.1217-1231, November 2004
	Kanda Runapongsa , Jignesh M. Patel , H. V. Jagadish , Yun Chen , Shurug Al-Khalifa, The Michigan benchmark: towards XML query performance diagnostics, Information Systems, v.31 n.2, p.73-97, April 2006
	Jeffrey M. Voas, PIE: A Dynamic Failure-Based Technique, IEEE Transactions on Software Engineering, v.18 n.8, p.717-727, August 1992
	Lakshmi N. Chakrapani , Bilge E. S. Akgul , Suresh Cheemalavagu , Pinar Korkmaz , Krishna V. Palem , Balasubramanian Seshasayee, Ultra-efficient (embedded) SOC architectures based on probabilistic CMOS (PCMOS) technology, Proceedings of the conference on Design, automation and test in Europe: Proceedings, March 06-10, 2006, Munich, Germany
	James L. Noyes, A first course in computational science: (why a math book isn't enough), ACM SIGCSE Bulletin, v.34 n.1, March 2002
	Krzysztof Pawlikowski , Wolfgang Kreutzer, Tools for teaching simulation: integrating modelling and data analysis in teaching discrete event simulation, Proceedings of the 32nd conference on Winter simulation, December 10-13, 2000, Orlando, Florida
	Fernando C. Gomes , Cláudio N. Meneses , Panos M. Pardalos , Gerardo Valdisio R. Viana, Experimental analysis of approximation algorithms for the vertex cover and set covering problems, Computers and Operations Research, v.33 n.12, p.3520-3534, December 2006
	A. Ismael Vaz , Luís N. Vicente, A particle swarm pattern search method for bound constrained global optimization, Journal of Global Optimization, v.39 n.2, p.197-219, October 2007
	Javier Larrosa , Gabriel Valiente, Constraint satisfaction algorithms for graph pattern matching, Mathematical Structures in Computer Science, v.12 n.4, p.403-422, August 2002
	Lakshmi N. Chakrapani , Pinar Korkmaz , Bilge E. S. Akgul , Krishna V. Palem, Probabilistic system-on-a-chip architectures, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.12 n.3, p.1-28, August 2007
	Stephen J. Sullivan , Benjamin G. Zorn, Numerical analysis using nonprocedural paradigms, ACM Transactions on Mathematical Software (TOMS), v.21 n.3, p.267-298, Sept. 1995
	Carl A. Waldspurger , William E. Weihl, Lottery scheduling: flexible proportional-share resource management, Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation, p.1-es, November 14-17, 1994, Monterey, California
	George Takhtamyshev , Bart Vandewoestyne , Ronald Cools, Quasi-random integration in high dimensions, Mathematics and Computers in Simulation, v.73 n.5, p.309-319, January, 2007
	David Dice, Implementing fast java^TM monitors with relaxed-locks, Proceedings of the Java^TM Virtual Machine Research and Technology Symposium on Java^TM Virtual Machine Research and Technology Symposium, p.13-13, April 23-24, 2001, Monterey, California
	Tao Meng , Hong-Fei Yan, On the peninsula phenomenon in web graph and its implications on web search, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.51 n.1, p.177-189, 17 January 2007
	Douglas W. Jones , Tom C. Bowersox, Secure data export and auditing using data diodes, Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop, p.4-4, August 01, 2006, Vancouver, B.C., Canada
	Yu Yu , Jussipekka Leiwo , Benjamin Premkumar, Private stateful circuits secure against probing attacks, Proceedings of the 2nd ACM symposium on Information, computer and communications security, March 20-22, 2007, Singapore
	Harsha K. Rajasimha , David C. Samuels , Richard E. Nance, A simulation methodology in modeling cell divisions with stochastic effects, Proceedings of the 36th conference on Winter simulation, December 05-08, 2004, Washington, D.C.
	Matthew J. Duggan , John H. Drew , Lawrence M. Leemis, A test of randomness based on the distance between consecutive random number pairs, Proceedings of the 37th conference on Winter simulation, December 04-07, 2005, Orlando, Florida
	Laszlo Hars , Gyorgy Petruska, Pseudorandom recursions: small and fast pseudorandom number generators for embedded applications, EURASIP Journal on Embedded Systems, v.2007 n.1, p.5-5, January 2007
	Cláudio N. Meneses , Zhaosong Lu , Carlos A. S. Oliveira , Panos M. Pardalos, Optimal Solutions for the Closest-String Problem via Integer Programming, INFORMS Journal on Computing, v.16 n.4, p.419-429, Fall 2004
	Jeffrey M. Voas, Discovering Unanticipated Software Output Modes, Annals of Software Engineering, v.11 n.1, p.79-88, November 2001
	M. C. Murphy , D. Rotem, Effective resource utilization for multiprocessor join execution, Proceedings of the 15th international conference on Very large data bases, p.67-76, July 1989, Amsterdam, The Netherlands
	Faisel Saeed , K. M. George , M. H. Samadzadeh, Implementation of classical mutual exclusion algorithms in Ada, ACM SIGAda Ada Letters, v.XII n.1, p.73-84, Jan./Feb. 1992
	Simon Peyton Jones, Bibliography, Journal of Functional Programming, v.13 n.1, p.241-255, January 2003
	C. Herring , J. I. Palmore, Random number generators are chaotic, ACM SIGPLAN Notices, v.24 n.11, p.76-79, Nov. 1989
	Lucia Lo Bello , Kanghee Kim, Overrun handling approaches for overload-prone soft real-time systems, Advances in Engineering Software, v.38 n.11-12, p.780-794, November, 2007
	Kevin Richardson , John A. Hamilton, Jr. , Martin C. Carlisle, A performance analysis of the spring protocol through simulation, Proceedings of the 2007 spring simulation multiconference, p.356-361, March 25-29, 2007, Norfolk, Virginia
	Barry Lawson , Lawrence Leemis, Simulation 101 software: workshop and beyond, Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come, December 09-12, 2007, Washington D.C.
	Fernando C. Gomes , Cláudio N. Meneses , Panos M. Pardalos , Gerardo Valdisio R. Viana, A parallel multistart algorithm for the closest string problem, Computers and Operations Research, v.35 n.11, p.3636-3643, November, 2008
	Kevin M. Finnigin , Barry E. Mullins , Richard A. Raines , Henry B. Potoczny, Cryptanalysis of an elliptic curve cryptosystem for wireless sensor networks, International Journal of Security and Networks, v.2 n.3/4, p.260-271, April 2007
	Takuya Yamano , Kodai Sato , Taisei Kaizoji , Jan-Michael Rost , Lukáš Pichl, Symbolic analysis of indicator time series by quantitative sequence alignment, Computational Statistics & Data Analysis, v.53 n.2, p.486-495, December, 2008
	Petr Savicky , Marko Robnik-Sikonja, LEARNING RANDOM NUMBERS: A MATLAB ANOMALY, Applied Artificial Intelligence, v.22 n.3, p.254-265, March 2008
	Fei Xu , Kevin Beyer , Vuk Ercegovac , Peter J. Haas , Eugene J. Shekita, E = MC³: managing uncertain enterprise data in a cluster-computing environment, Proceedings of the 35th SIGMOD international conference on Management of data, June 29-July 02, 2009, Providence, Rhode Island, USA
	G. V. R. Viana , F. A. C. Gomes , C. E. Ferreira , C. N. Meneses, Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem, International Journal of Bioinformatics Research and Applications, v.5 n.2, p.163-177, March 2009
	W. B. Langdon, A fast high quality pseudo random number generator for nVidia CUDA, Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference, July 08-12, 2009, Montreal, Québec, Canada