17.2. Bibliography¶

Ahern05

Dennis Ahern et al., CMMI Distilled: a practical introduction to integrated process improvement, 2005. ISBN: 0-321-18613-3.

Bacon

Francis Bacon, Novum Organum, Google eBook, Clarendon Press, 1878.

Beck99

Kent Beck. Extreme Programming Explained: Embrace Change. 1999.

Bloch

Joshua Bloch, Effective Java, Second Edition, Addison-Wesley, 2008.

Boehm03

Barry Boehm and Richard Turner, Balancing Agility and Discipline: A Guide for the Perplexed, 2003. ISBN: 0-321-18612-5.

Booch

Grady Booch, Object-Oriented Design With Applications, Benjamin/Cummings, Menlo Park, California, 1991.

Brooks95

Frederick P. Brooks, The Mythical Man-Month: Essays on Software Engineering, Second Edition, Addison-Wesley, 1995.

Cockburn04

Alistair Cockburn, Crystal Clear: A Human-Powered Methodology for Small Teams, 2004. ISBN: 0-201-69947-8

GalilItaliano91

Zvi Galil and Giuseppe F. Italiano, “Data Structures and Algorithms for Disjoint Set Union Problems”, Computing Surveys 23, 3(September 1991), 319-344.

Gauss65

Carl F. Gauss, Arthur A. Clarke (translator) Disquisitiones Arithmeticae, Yale University Press, 1965.

KnuthV3

Donald E. Knuth, The Art of Computer Programming Volume 3: Sorting and Searching, Second Edition, Addison-Wesley, Reading, MA, 1998.

Lafore

Robert Lafore, Data Structures & Algorithms in Java, Second Edition, Sams Publishing, 2003.

Sierra

Kathy Sierra and Bert Bates, OCA/OCP Java 7 SE Programmer I & II Study Guide (Exams 1Z0-803 & 1Z0-804), McGraw-Hill Education, 2015.

Tarjan75

Robert E. Tarjan, “On the efficiency of a good but not linear set merging algorithm”, Journal of the ACM 22, 2(April 1975), 215-225.