algorithm design techniques knuththe art of computer programmingvol seminumerical algorithms ed addison-wesleyreadingmass knuth"optimum binary search trees,acta informatica ( ) - knuth"an analysis of alpha-beta cutoffs,artificial intelligence ( ) - knuthtex and metafontnew directions in typesettingdigital pressbedfordmass knuth"dynamic huffman coding,journal of algorithms ( ) - knuth and moore"estimating the efficiency of backtrack programs,mathematics of computation ( ) - landau and vishkin"introducing efficient parallelism into approximate string matching and new serial algorithm,proceedings of the eighteenth annual acm symposium on theory of computing ( ) - larmore"height-restricted optimal binary trees,siam journal on computing ( ) - larmore and hirschberg" fast algorithm for optimal length-limited huffman codes,journal of the acm ( ) - lee and mahajan"the development of world class othello program,artificial intelligence ( ) - lelewer and hirschberg"data compression,acm computing surveys ( ) - lenstrajr and pomerance"primality testing with gaussian periods,manuscript ( liang" lower bound for on-line bin packing,information processing letters ( ) - marsaglia and zaman" new class of random-number generators,the annals of applied probability ( ) - matsumoto and nishimura"mersenne twistera -dimensionally equidistributed uniform pseudo-random number generator,acm transactiona on modeling and computer simulation (tomacs) ( ) - miller"riemann' hypothesis and tests for primality,journal of computer and system sciences ( ) - monier"evaluation and comparison of two efficient probabilistic primality testing algorithms,theoretical computer science ( ) - motwani and raghavanrandomized algorithmscambridge university pressnew york mulmuleycomputational geometryan introduction through randomized algorithmsprentice hallenglewood cliffsn 'rourkecomputational geometry in ccambridge university pressnew york pan"strassen' algorithm is not optimal,proceedings of the nineteenth annual ieee symposium on the foundations of computer science ( ) - park and miller"random-number generatorsgood ones are hard to find,communications of the acm ( ) - (see also technical correspondencein ( - pettie and ramachandran" shortest path algorithm for undirected graphs,siam journal on computing ( ) -