12. Bibliography

And91

Arne Andersson. A note on searching in a binary search tree. Software: Practice and Experience, 21(10):1125–1128, 1991. doi:https://doi.org/10.1002/spe.4380211009.

Arn10

Jrg Arndt. Matters Computational: Ideas, Algorithms, Source Code. Springer-Verlag, Berlin, Heidelberg, 1st edition, 2010. ISBN 3642147631. URL: https://www.jjj.de/fxt/fxtbook.pdf.

AJugeNP18

Nicolas Auger, Vincent Jugé, Cyril Nicaud, and Carine Pivoteau. On the Worst-Case Complexity of TimSort. In Yossi Azar, Hannah Bast, and Grzegorz Herman, editors, 26th Annual European Symposium on Algorithms (ESA 2018), volume 112 of Leibniz International Proceedings in Informatics (LIPIcs), 4:1–4:13. Dagstuhl, Germany, 2018. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. URL: http://drops.dagstuhl.de/opus/volltexte/2018/9467, doi:10.4230/LIPIcs.ESA.2018.4.

BS14

Alan F. Beardon and Ian Short. A geometric representation of continued fractions. The American Mathematical Monthly, 121(5):391–402, 2014. URL: http://www.jstor.org/stable/10.4169/amer.math.monthly.121.05.391.

BScharliD03

Andrew P. Black, Nathanael Schärli, and Stéphane Ducasse. Applying traits to the smalltalk collection classes. SIGPLAN Not., 38(11):47–64, oct 2003. doi:10.1145/949343.949311.

BM58

G. E. P. Box and Mervin E. Muller. A Note on the Generation of Random Normal Deviates. The Annals of Mathematical Statistics, 29(2):610 – 611, 1958. doi:10.1214/aoms/1177706645.

CDW09

Damien Cassou, Stéphane Ducasse, and Roel Wuyts. Traits at work: the design of a new trait-based stream library. Computer Languages, Systems & Structures, 35(1):2–20, 2009. ESUG 2007 International Conference on Dynamic Languages (ESUG/ICDL 2007). doi:https://doi.org/10.1016/j.cl.2008.05.004.

com

Pharo community. Traits. URL: https://github.com/pharo-open-documentation/pharo-wiki/blob/master/General/Traits.md.

CGG06

Pierluigi Crescenzi, Giorgio Gambosi, and Roberto Grossi. Strutture di dati e algoritmi. Progettazione, analisi e visualizzazione, 1st edition. Pearson, 2006. ISBN 8871922735.

CGGR12

Pierluigi Crescenzi, Giorgio Gambosi, Roberto Grossi, and Gianluca Rossi. Strutture di dati e algoritmi. Progettazione, analisi e visualizzazione, 2nd edition. Pearson, 2012. ISBN 8871927818.

DPV06

Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh Vazirani. Algorithms. McGraw-Hill, Inc., USA, 1 edition, 2006. ISBN 0073523402.

DNScharli+06

Stéphane Ducasse, Oscar Nierstrasz, Nathanael Schärli, Roel Wuyts, and Andrew P. Black. Traits: a mechanism for fine-grained reuse. ACM Trans. Program. Lang. Syst., 28(2):331–388, mar 2006. doi:10.1145/1119479.1119483.

Est60

Gerald Estrin. Organization of computer systems: the fixed plus variable structure computer. In Papers Presented at the May 3-5, 1960, Western Joint IRE-AIEE-ACM Computer Conference, 33–40. New York, NY, USA, 1960. Association for Computing Machinery. doi:10.1145/1460361.1460365.

Fay89

Temple H. Fay. The butterfly curve. The American Mathematical Monthly, 96(5):442–443, 1989. URL: http://www.jstor.org/stable/2325155.

For38

L. R. Ford. Fractions. The American Mathematical Monthly, 45(9):586–601, 1938. URL: http://www.jstor.org/stable/2302799.

Fun21

Stanley P. Y. Fung. Is this the simplest (and most surprising) sorting algorithm ever? 2021. doi:10.48550/ARXIV.2110.01111.

Gra53

F. Gray. Pulse code communication. 1953. US Patent 2,632,058. URL: http://www.google.com/patents/US2632058.

KO63

Anatolij A. Karatsuba and Yu. Ofman. Multiplication of multidigit numbers on automata. Soviet physics. Doklady, 7:595–596, 1963.

KT05

Jon Kleinberg and Eva Tardos. Algorithm Design. Addison-Wesley Longman Publishing Co., Inc., USA, 2005. ISBN 0321295358.

Knu97

Donald E. Knuth. The Art of Computer Programming, Volume 1 (3rd Ed.): Fundamental Algorithms. Addison Wesley Longman Publishing Co., Inc., USA, 1997. ISBN 0201896834.

McI93

Peter McIlroy. Optimistic sorting and information theoretic complexity. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '93, 467–474. USA, 1993. Society for Industrial and Applied Mathematics.

Oka98

Chris Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998. doi:10.1017/CBO9780511530104.

PM88

S. K. Park and K. W. Miller. Random number generators: good ones are hard to find. Commun. ACM, 31(10):1192–1201, October 1988. doi:10.1145/63039.63042.

Pei75

A. Pein. Die semicubische oder Neil'sche parabel. Druck von W. Stumpf, 1875.

ScharliDNB03

Nathanael Schärli, Stéphane Ducasse, Oscar Nierstrasz, and Andrew P. Black. Traits: composable units of behaviour. In Luca Cardelli, editor, ECOOP 2003 – Object-Oriented Programming, 248–274. Berlin, Heidelberg, 2003. Springer Berlin Heidelberg.

Sloa

Neil J. A. Sloane. Binary reflected gray code. URL: https://oeis.org/A014550.

Slob

Neil J. A. Sloane. Catalan numbers. URL: https://oeis.org/A000108.

Sloc

Neil J. A. Sloane. Exponent of highest power of 2 dividing n, a.k.a. the binary carry sequence, the ruler sequence, or the 2-adic valuation of n. URL: https://oeis.org/A007814.

Slod

Neil J. A. Sloane. Fibonacci numbers beginning at 0. URL: https://oeis.org/A000045.

Sloe

Neil J. A. Sloane. Lucas numbers beginning at 2. URL: https://oeis.org/A000032.

VC

Sven VC. Speeding up factorial computation by changing the order of multiplications. URL: https://medium.com/concerning-pharo/speeding-up-factorial-computation-by-changing-the-order-of-multiplications-f4da3a5576da.

Wei12

Martin H. Weissman. Fractions and semiotics. 2012. URL: https://illustratedtheoryofnumbers.wordpress.com/2012/07/31/fractions-and-semiotics/.

Wika

Wikipedia. Butterfly curve. URL: https://en.wikipedia.org/wiki/Butterfly_curve_(transcendental).

Wikb

Wikipedia. Karatsuba algorithm. URL: https://en.wikipedia.org/wiki/Karatsuba_algorithm.