Algorithms and data structures

10 papers, 1956 to 1998.

• Maximal Flow Through a Network

  L. R. Ford Jr., D. R. Fulkerson, 1956, Canadian Journal of Mathematics

  max-flow min-cut

  EnglishTiếng Việt中文日本語

• A Note on Two Problems in Connexion with Graphs

  Edsger W. Dijkstra, 1959, Numerische Mathematik

  single-source shortest paths, and a minimum spanning tree, in three pages

  EnglishTiếng Việt中文日本語

• Algorithm 97: Shortest Path

  Robert W. Floyd, 1962, Communications of the ACM

  all-pairs shortest paths as a triple loop

  EnglishTiếng Việt中文日本語

• Quicksort

  C. A. R. Hoare, 1962, The Computer Journal

  partition in place, recurse on the parts

  EnglishTiếng Việt中文日本語

• An Algorithm for the Machine Calculation of Complex Fourier Series

  James W. Cooley, John W. Tukey, 1965, Mathematics of Computation

  the discrete Fourier transform in n log n

  EnglishTiếng Việt中文日本語

• Space/Time Trade-offs in Hash Coding with Allowable Errors

  Burton H. Bloom, 1970, Communications of the ACM

  a set membership test that is wrong only in one direction

  EnglishTiếng Việt中文日本語

• Depth-First Search and Linear Graph Algorithms

  Robert Tarjan, 1972, SIAM Journal on Computing

  strongly connected components in one pass

  EnglishTiếng Việt中文日本語

• Efficient String Matching: An Aid to Bibliographic Search

  Alfred V. Aho, Margaret J. Corasick, 1975, Communications of the ACM

  many patterns at once, with failure links over a trie

  EnglishTiếng Việt中文日本語

• Fast Pattern Matching in Strings

  Donald E. Knuth, James H. Morris Jr., Vaughan R. Pratt, 1977, SIAM Journal on Computing

  never move the text pointer backwards

  EnglishTiếng Việt日本語

• The Anatomy of a Large-Scale Hypertextual Web Search Engine

  Sergey Brin, Lawrence Page, 1998, Computer Networks and ISDN Systems

  rank a page by the ranks of the pages that link to it

  EnglishTiếng Việt