My first Magazine pemrograman-kompetitif-dasar | Page 158

Bibliografi
1 Ashar
Fuadi.
What is competitive programming?
https://www.quora.com/
What-is-competitive-programming-2/answer/Ashar-Fuadi. Diakses: 2017-12-25.
2 Ioi
2017 contest rules. http://ioi2017.org/contest/rules/. Diakses: 2017-12-24.
3 World
4 Steven
finals rules. https://icpc.baylor.edu/worldfinals/rules. Diakses: 2017-12-24.
Halim and Felix Halim. Competitive Programming. 3rd Edition. 2013.
5 Brilliant.org.
Extended euclidian algorithm.
https://brilliant.org/wiki/
extended-euclidean-algorithm/. Diakses: 2018-01-12.
6 M
Perz. Thomas koshy," elementary number theory with applications", 2002. Smarandache
Notions Journal, 13:284–285, 2002.
7 Paul
Pritchard. Linear prime-number sieves: A family tree. Science of computer programming,
9(1):17–35, 1987.
8 R.
A. Mollin. Fundamental Number Theory with Applications. 2nd ed. Boca Raton: Chapman
& Hall/CRC, 2008.
9 Kenneth H. Rosen.
6th edition, 2007.
Discrete Mathematics and Its Applications. McGraw-Hill Higher Education,
10 Brian
C. Dean. A simple expected running time analysis for randomized “divide and conquer”
algorithms. Discrete Applied Mathematics, 154(1):1 – 5, 2006.
11 M
Perz. Uva 10003 - cutting sticks. https://uva.onlinejudge.org/index.php?option=
com_onlinejudge&Itemid=8&page=show_problem&problem=944. Diakses: 2017-12-25.
12 Rebecca
Fiebrink. Amortized analysis explained (pdf). 2007. Diakses: 2018-01-18.
13 Thomas
H. Cormen, Clifford Stein, Ronald L. Rivest, and Charles E. Leiserson. Introduction
to Algorithms. McGraw-Hill Higher Education, 2nd edition, 2001.
14 Robert
E. Tarjan and Jan van Leeuwen. Worst-case analysis of set union algorithms. J. ACM,
31(2):245–281, March 1984.
15 Marek
A. Suchenek. Elementary yet precise worst-case analysis of floyd’s heap-construction
program. Fundam. Inf., 120(1):75–92, January 2012.
148