Markedets billigste bøger
Levering: 1 - 2 hverdage

Bøger af Tim Roughgarden

Filter
Filter
Sorter efterSorter Populære
  • af Tim Roughgarden
    171,95 kr.

    Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. Part 1 covers asymptotic analysis and big-O notation, divide-and-conquer algorithms and the master method, randomized algorithms, and several famous algorithms for sorting and selection.

  • af Tim Roughgarden
    632,95 kr.

    An analysis of the loss in performance caused by selfish, uncoordinated behavior in networks.

  • af Tim Roughgarden
    668,95 kr.

  • - Algorithms for NP-Hard Problems
    af Tim Roughgarden
    171,95 kr.

  • - The Barbados Lectures
    af Tim Roughgarden
    1.097,95 kr.

    Presents a series of ten lectures divided into two parts. Part 1, referred to as the Solar Lectures, focuses on the communication and computational complexity of computing an (approximate) Nash equilibrium. Part 2, the Lunar Lectures, focuses on applications of computational complexity theory to game theory and economics.

  • - Greedy Algorithms and Dynamic Programming
    af Tim Roughgarden
    185,95 kr.

    Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).

  • - Graph Algorithms and Data Structures
    af Tim Roughgarden
    161,95 kr.

    Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. Part 2 covers graph search and applications, shortest paths, and the usage and implementation of several data structures (heaps, search trees, hash tables, and bloom filters).

  • af Tim Roughgarden
    971,95 kr.

    The two primary goals of the text are to learn several canonical problems in communication complexity that are useful for proving lower bounds for algorithms (Disjointness, Index, Gap-Hamming, and so on); and to learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds.

  • af Tim Roughgarden
    329,95 kr.

    An analysis of the loss in performance caused by selfish, uncoordinated behavior in networks.

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.