Bokus

Roman Dementiev – författare

Visar alla böcker från författaren Roman Dementiev. Handla med fri frakt och snabb leverans.

3 produkter

  1. Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev - Sequential and Parallel Algorithms and Data Structures, Inbunden. Tillgänglighet: Lägg i varukorg

    Sequential and Parallel Algorithms and Data Structures

    The Basic Toolbox

    Av Peter Sanders, Kurt Mehlhorn m. fl.

    Inbunden, 2019

    551 kr

    Lägg i varukorg

    This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between …

  2. Roman Dementiev, Martin Dietzfelbinger, Kurt Mehlhorn, Peter Sanders - Sequential and Parallel Algorithms and Data Structures, E-bok. Tillgänglighet: Lägg i varukorg

    Sequential and Parallel Algorithms and Data Structures

    The Basic Toolbox

    Av Roman Dementiev, Martin Dietzfelbinger m. fl.

    E-bok, 2019

    734 kr

    Lägg i varukorg

    This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between …

  3. Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev - Sequential and Parallel Algorithms and Data Structures, Häftad. Tillgänglighet: Lägg i varukorg

    Sequential and Parallel Algorithms and Data Structures

    The Basic Toolbox

    Av Peter Sanders, Kurt Mehlhorn m. fl.

    Häftad, 2020

    569 kr

    Lägg i varukorg

    This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between …