bloom" counterexample to the theorem of piccard,journal of combinatorial theory ( ) - blumr floydv prattr rivestand tarjan"time bounds for selection,journal of computer and system sciences ( ) - borodin and munrothe computational complexity of algebraic and numerical problemsamerican elseviernew york chang and korsh"canonical coin changing and greedy solutions,journal of the acm ( ) - christofides"worst-case analysis of new heuristic for the traveling salesman problem,management science research report # carnegie-mellon universitypittsburghpa coppersmith and winograd"matrix multiplication via arithmetic progressions,proceedings of the nineteenth annual acm symposium on the theory of computing ( ) - dor and zwick"selecting the median,siam journal on computing ( ) - dosa"the tight bound of first fit decreasing bin-packing algorithm is ffd( )=( / )opt( )+ / ,combinatoricsalgorithmsprobabilistic and experimental methodologies (escape )( ) - edelsbrunneralgorithms in combinatorial geometryspringer-verlagberlin eppsteinz galiland giancarlo"speeding up dynamic programming,proceedings of the twenty-ninth annual ieee symposium on the foundations of computer science ( ) - floyd"algorithm shortest path,communications of the acm ( ) floyd and rivest"expected time bounds for selection,communications of the acm ( ) - fredman"new bounds on the complexity of the shortest path problem,siam journal on computing ( ) - godbole"on efficient computation of matrix chain products,ieee transactions on computers ( ) - guptas smolkaand bhaskar"on randomization in sequential and distributed algorithms,acm computing surveys ( ) - han and takaoka"an ( log log nlog ntime algorithm for all pairs shortest paths,proceedings of the thirteenth scandinavian symposium and workshops on algorithm theory ( ) - hu and shing"computations of matrix chain productspart ,siam journal on computing ( ) - huffman" method for the construction of minimum redundancy codes,proceedings of the ire ( ) - johnsona demersj ullmanm gareyand graham"worst-case performance bounds for simple one-dimensional packing algorithms,siam journal on computing ( ) - karatsuba and ofman"multiplication of multi-digit numbers on automata,doklady akademii nauk sssr ( ) - karger"random sampling in graph optimization problems,ph thesisstanford university