bibliography [ gammar helmr johnsonand vlissidesdesign patternselements of reusable object-oriented software readingmaaddison-wesley [ goldberg and robsonsmalltalk- the language readingmaaddisonwesley [ goldwasser and letscherobject-oriented programming in python upper saddle rivernjprentice hall [ gonnet and baeza-yateshandbook of algorithms and data structures in pascal and readingmaaddison-wesley [ gonnet and munro"heaps on heaps,siam comput vol no pp - [ goodrichj - tsayd vengroffand vitter"external-memory computational geometry,in proc th annu ieee sympos found comput sci pp - [ graham and hell"on the history of the minimum spanning tree problem,annals of the history of computingvol no pp - [ guibas and sedgewick" dichromatic framework for balanced trees,in proc th annu ieee sympos found comput sci lecture notes comput sci pp - springer-verlag [ gurevich"what does (nmean?,sigact newsvol no pp - [ hennessy and pattersoncomputer architecturea quantitative approach san franciscomorgan kaufmann nd ed [ hoare"quicksort,the computer journalvol pp - [ hopcroft and tarjan"efficient algorithms for graph manipulation,communications of the acmvol no pp - [ - huang and langston"practical in-place merging,communications of the acmvol no pp - [ jajaan introduction to parallel algorithms readingmaaddison-wesley [ jarnik" jistem problemu minimalnim,praca moravske prirodovedecke spolecnostivol pp - (in czech[ jones and linsgarbage collectionalgorithms for automatic dynamic memory management john wiley and sons [ kargerp kleinand tarjan" randomized linear-time algorithm to find minimum spanning trees,journal of the acmvol pp - [ karp and ramachandran"parallel algorithms for shared memory machines,in handbook of theoretical computer science ( van leeuwened )pp - amsterdamelsevier/the mit press [ kirschenhofer and prodinger"the path length of random skip lists,acta informaticavol pp - [ kleinberg and tardosalgorithm design readingmaaddison-wesley [ klink and walde"efficient denial of service attacks on web application platforms [ knuthsorting and searchingvol of the art of computer programming readingmaaddison-wesley