Isbn: 9783954043248 - time- and space-efficient self-stabilizing algorithms (2 risultati)

Perfeziona la tua ricerca

  • Libri (2)

  • Nuovo (2)

  • Con foto (2)

a

Fascia di prezzo personalizzata (EUR)

a

    • Lingua: Inglese

      Editore: Cuvillier, Cuvillier Jan 2013, 2013

      3954043246 / 9783954043248

      • Brossura
      • Print on Demand

      Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 29,70

      EUR 60,00 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: 1 disponibili

      Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Self-stabilization is a general approach to design a system to tolerate arbitrary transient faults. This thesis presents new time- and space-efficient self-stabilizing algorithms for well-known problems in graph theory and provides new complexity analyzes for existing algorithms. The main focus of this thesis is on the proof techniques used in the complexity analyzes and the design of the algorithms.Cuvillier Verlag, Nonnenstieg 8, 37075 Göttingen 168 pp. Englisch.

    • Lingua: Inglese

      Editore: Cuvillier, Cuvillier

      3954043246 / 9783954043248

      • Brossura
      • Print on Demand

      Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 29,70

      EUR 61,13 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: 1 disponibili

      Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Self-stabilization is a general approach to design a system to tolerate arbitrary transient faults. This thesis presents new time- and space-efficient self-stabilizing algorithms for well-known problems in graph theory and provides new complexity analyzes for existing algorithms. The main focus of this thesis is on the proof techniques used in the complexity analyzes and the design of the algorithms.