Matches in DBpedia 2015-10 for { <http://books.google.com/books?vid=ISBN0-262-03293-7> ?p ?o }
- books?vid=ISBN0-262-03293-7 author Charles_E._Leiserson.
- books?vid=ISBN0-262-03293-7 author Clifford_Stein.
- books?vid=ISBN0-262-03293-7 author Ronald_L._Rivest.
- books?vid=ISBN0-262-03293-7 author Thomas_H._Cormen.
- books?vid=ISBN0-262-03293-7 author "Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, Clifford Stein".
- books?vid=ISBN0-262-03293-7 author "Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein".
- books?vid=ISBN0-262-03293-7 author1Link "Thomas H. Cormen".
- books?vid=ISBN0-262-03293-7 author2 Charles_E._Leiserson.
- books?vid=ISBN0-262-03293-7 author2 "Leiserson, Rivest".
- books?vid=ISBN0-262-03293-7 author2Link "Charles E. Leiserson".
- books?vid=ISBN0-262-03293-7 author3 Ronald_L._Rivest.
- books?vid=ISBN0-262-03293-7 author3Link "Ron Rivest".
- books?vid=ISBN0-262-03293-7 author3Link "Ronald L. Rivest".
- books?vid=ISBN0-262-03293-7 author4 Clifford_Stein.
- books?vid=ISBN0-262-03293-7 author4Link "Clifford Stein".
- books?vid=ISBN0-262-03293-7 authorlink "Thomas Cormen".
- books?vid=ISBN0-262-03293-7 authorlink "Thomas H. Cormen".
- books?vid=ISBN0-262-03293-7 authorlink1 "Thomas H. Cormen".
- books?vid=ISBN0-262-03293-7 authorlink2 "Charles E. Leiserson".
- books?vid=ISBN0-262-03293-7 authorlink3 "Ronald L. Rivest".
- books?vid=ISBN0-262-03293-7 authorlink4 "Clifford Stein".
- books?vid=ISBN0-262-03293-7 chapter "10.2: Linked lists".
- books?vid=ISBN0-262-03293-7 chapter "12: Binary search trees, 15.5: Optimal binary search trees".
- books?vid=ISBN0-262-03293-7 chapter "26".
- books?vid=ISBN0-262-03293-7 chapter "Chapter 14: Augmenting Data Structures".
- books?vid=ISBN0-262-03293-7 chapter "Chapter 30: Polynomials and the FFT".
- books?vid=ISBN0-262-03293-7 chapter "Section 22.1: Representations of graphs".
- books?vid=ISBN0-262-03293-7 chapter "Section 24.3: Dijkstra's algorithm".
- books?vid=ISBN0-262-03293-7 chapter "Section 26.2: The Ford–Fulkerson method".
- books?vid=ISBN0-262-03293-7 chapter "Section 31.8: Primality testing".
- books?vid=ISBN0-262-03293-7 chapter "Section 32.4: The Knuth-Morris-Pratt algorithm".
- books?vid=ISBN0-262-03293-7 chapter "Section 5.2: Indicator random variables".
- books?vid=ISBN0-262-03293-7 coauthors Charles_E._Leiserson.
- books?vid=ISBN0-262-03293-7 coauthors Clifford_Stein.
- books?vid=ISBN0-262-03293-7 coauthors Ronald_L._Rivest.
- books?vid=ISBN0-262-03293-7 contribution "35.2: The traveling-salesman problem".
- books?vid=ISBN0-262-03293-7 contribution "Section 22.4: Topological sort".
- books?vid=ISBN0-262-03293-7 date "2001".
- books?vid=ISBN0-262-03293-7 date "2003".
- books?vid=ISBN0-262-03293-7 edition "2".
- books?vid=ISBN0-262-03293-7 edition "Second".
- books?vid=ISBN0-262-03293-7 first "T.H.".
- books?vid=ISBN0-262-03293-7 first "Thomas H.".
- books?vid=ISBN0-262-03293-7 first "Thomas".
- books?vid=ISBN0-262-03293-7 first1 "T. H.".
- books?vid=ISBN0-262-03293-7 first1 "Thomas H.".
- books?vid=ISBN0-262-03293-7 first1 "Thomas".
- books?vid=ISBN0-262-03293-7 first2 "C. E.".
- books?vid=ISBN0-262-03293-7 first2 "Charles E.".
- books?vid=ISBN0-262-03293-7 first3 "R. L.".
- books?vid=ISBN0-262-03293-7 first3 "Ronald L.".
- books?vid=ISBN0-262-03293-7 first4 "C.".
- books?vid=ISBN0-262-03293-7 first4 "Clifford".
- books?vid=ISBN0-262-03293-7 isCitedBy Adjacency_matrix.
- books?vid=ISBN0-262-03293-7 isCitedBy Analysis_of_algorithms.
- books?vid=ISBN0-262-03293-7 isCitedBy Approximate_string_matching.
- books?vid=ISBN0-262-03293-7 isCitedBy Binary_search_tree.
- books?vid=ISBN0-262-03293-7 isCitedBy Chinese_remainder_theorem.
- books?vid=ISBN0-262-03293-7 isCitedBy Dijkstras_algorithm.
- books?vid=ISBN0-262-03293-7 isCitedBy Discrete_Fourier_transform.
- books?vid=ISBN0-262-03293-7 isCitedBy Dynamic_programming.
- books?vid=ISBN0-262-03293-7 isCitedBy Fermat_primality_test.
- books?vid=ISBN0-262-03293-7 isCitedBy Flow_network.
- books?vid=ISBN0-262-03293-7 isCitedBy Ford–Fulkerson_algorithm.
- books?vid=ISBN0-262-03293-7 isCitedBy Indicator_function.
- books?vid=ISBN0-262-03293-7 isCitedBy Integer_sorting.
- books?vid=ISBN0-262-03293-7 isCitedBy Josephus_problem.
- books?vid=ISBN0-262-03293-7 isCitedBy Knuth–Morris–Pratt_algorithm.
- books?vid=ISBN0-262-03293-7 isCitedBy Linked_list.
- books?vid=ISBN0-262-03293-7 isCitedBy NP-completeness.
- books?vid=ISBN0-262-03293-7 isCitedBy P_versus_NP_problem.
- books?vid=ISBN0-262-03293-7 isCitedBy Primality_test.
- books?vid=ISBN0-262-03293-7 isCitedBy RSA_(cryptosystem).
- books?vid=ISBN0-262-03293-7 isCitedBy Recursion.
- books?vid=ISBN0-262-03293-7 isCitedBy Set_cover_problem.
- books?vid=ISBN0-262-03293-7 isCitedBy Topological_sorting.
- books?vid=ISBN0-262-03293-7 isCitedBy Travelling_salesman_problem.
- books?vid=ISBN0-262-03293-7 isCitedBy Vertex_cover.
- books?vid=ISBN0-262-03293-7 isbn "0-262-03293-7".
- books?vid=ISBN0-262-03293-7 last "Cormen".
- books?vid=ISBN0-262-03293-7 last1 "Cormen".
- books?vid=ISBN0-262-03293-7 last2 "Leiserson".
- books?vid=ISBN0-262-03293-7 last2 "Lesiserson".
- books?vid=ISBN0-262-03293-7 last3 "Rivest".
- books?vid=ISBN0-262-03293-7 last4 "Stein".
- books?vid=ISBN0-262-03293-7 lastauthoramp "yes".
- books?vid=ISBN0-262-03293-7 location "Cambridge".
- books?vid=ISBN0-262-03293-7 location "Cambridge, MA".
- books?vid=ISBN0-262-03293-7 location "Cambridge, Mass.".
- books?vid=ISBN0-262-03293-7 nopp "true".
- books?vid=ISBN0-262-03293-7 origyear "1990".
- books?vid=ISBN0-262-03293-7 others "Chapter 1: Foundations".
- books?vid=ISBN0-262-03293-7 page "318".
- books?vid=ISBN0-262-03293-7 page "889–890".
- books?vid=ISBN0-262-03293-7 pages "1024–1027".
- books?vid=ISBN0-262-03293-7 pages "1027–1033".
- books?vid=ISBN0-262-03293-7 pages "1033–1038".
- books?vid=ISBN0-262-03293-7 pages "204–209".
- books?vid=ISBN0-262-03293-7 pages "205–213,501–505".
- books?vid=ISBN0-262-03293-7 pages "253–272, 356–363".