Kott laurent (21 résultats)
- Couverture souple
Vendeur : -OnTimeBooks-, Phoenix, AZ, Etats-Unis-OnTimeBooks-
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Assez bon
EUR 50,44
Frais de port gratuitsExpédition nationale : Etats-UnisQuantité disponible : 1 disponible(s)
Etat : very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships…USPS Media Mail.
- Couverture souple
Vendeur : books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Allemagnebooks4less (Versandantiquariat Petra Gros GmbH & Co. KG)
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Assez bon
EUR 44,95
EUR 15,95 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Broschiert. Etat : Gut. 473 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.); leichte altersbedingte Anbräunung des Papiers; der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In EN…GLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 790.
- Couverture souple
Vendeur : Ria Christie Collections, Uxbridge, Royaume-UniRia Christie Collections
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 58,56
EUR 13,97 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. In.
- Couverture souple
Vendeur : Books Puddle, New York, NY, Etats-UnisBooks Puddle
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 78,78
EUR 3,46 expéditionExpédition nationale : Etats-UnisQuantité disponible : 4 disponible(s)
Etat : New. pp. 488.
- Couverture souple
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 50,28
EUR 63,67 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Characterizations of PUNC and precomputation.- Comparison of algorithms controlling concurrent access to a database: A combinatorial approach.- A new duality result concerning Voronoi diagrams.- Classification of all the minimal bilinear algorithms for… computing the coefficients of the product of two polynomials modulo a polynomial.- On exponential lowness.- A tradeoff between search and update time for the implicit dictionary problem.- Intersections of some families of languages.- Correspondence between ternary simulation and binary race analysis in gate networks.- Counting with rational functions.- Finite biprefix sets of paths in a Graph.- Parallel RAMs with owned global memory and deterministic context-free language recognition.- A Strong restriction of the inductive completion procedure.- On discerning words by automata.- Complexity classes without machines: On complete languages for UP.- Containment, separation, complete sets, and immunity of complexity classes.- On nontermination of Knuth-Bendix algorithm.- Tradeoffs for language recognition on parallel computing models.- Rational equivalence relations.- Some further results on digital search trees.- Knowledge, belief and time.- A termination detector for static and dynamic distributed systems with asynchronous non-first-in-first-out communication.- Decompositions of nondeterministic reductions.- Hierarchical planarity testing algorithms.- Synthesis and equivalence of concurrent systems.- The set union problem with backtracking.- Torsion matrix semigroups and recognizable transductions.- On recognizable subsets of free partially commutative monoids.- Min Cut is NP-complete for edge weighted trees.- Alternating automata, the weak monadic theory of the tree, and its complexity.- Subpolynomial complexity classes ofreal functions and real numbers.- Etude syntaxique des parties reconnaissables de mots infinis.- Refusal testing.- A timed model for communicating sequential processes.- A uniform reduction theorem extending a result of J. Grollmann and A. Selman.- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs.- A new approach to detection of locally indicative stability.- A more efficient algorithm for lattice basis reduction.- Lower bounds by recursion theoretic arguments.- An improved algorithm for transitive closure on acyclic digraphs.- Un algorithme determinant les melanges de deux mots.- A very fast, practical algorithm for finding a negative cycle in a digraph.- A compositional reformulation of Owicki-Gries's partial correctness logic for a concurrent while language.- Semigroups and languages of dot-depth 2.- A parallel vertex insertion algorithm for minimum spanning trees.- More complicated questions about maxima and minima, and some closures of NP.- Lower bounds for dynamic range query problems that permit subtraction (extended abstract).- E-unification algorithms for a class of confluent term rewriting systems.- On fixed-point clones.
Modeling and Design of Secure Internet of Things
Kamhoua, Charles A. (EDT); Njilla, Laurent L. (EDT); Kott, Alexander (EDT); Shetty, Sachin S. (EDT)
- Couverture rigide
Vendeur : GreatBookPrices, Columbia, MD, Etats-UnisGreatBookPrices
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Comme neuf
EUR 148,59
EUR 2,29 expéditionExpédition nationale : Etats-UnisQuantité disponible : 3 disponible(s)
Etat : As New. Unread book in perfect condition.
Modeling and Design of Secure Internet of Things
Kamhoua, Charles A. (EDT); Njilla, Laurent L. (EDT); Kott, Alexander (EDT); Shetty, Sachin S. (EDT)
- Couverture rigide
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-UniGreatBookPricesUK
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Comme neuf
EUR 155,12
EUR 17,50 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 3 disponible(s)
Etat : As New. Unread book in perfect condition.
Modeling and Design of Secure Internet of Things
Kamhoua, Charles A. (EDT); Njilla, Laurent L. (EDT); Kott, Alexander (EDT); Shetty, Sachin S. (EDT)
- Couverture rigide
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-UniGreatBookPricesUK
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 165,76
EUR 17,50 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 3 disponible(s)
Etat : New.
Modeling and Design of Secure Internet of Things
Kamhoua, Charles A.|Njilla, Laurent L.|Kott, Alexander|Shetty, Sachin
- Couverture rigide
Vendeur : moluna, Greven, Allemagnemoluna
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 143,79
EUR 48,99 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. CHARLES A. KAMHOUA, PHD, is a Senior Electronics Engineer at the U.S. Army Research Laboratory s Network Security Branch.LAURENT L. NJILLA, PHD, is a researcher at the U.S. Army Research Laboratory s Information Directorate/Cyber Assurance Branch.ALEXANDER .
Modeling and Design of Secure Internet of Things
Kamhoua, Charles A. (EDT); Njilla, Laurent L. (EDT); Kott, Alexander (EDT); Shetty, Sachin S. (EDT)
- Couverture rigide
Vendeur : GreatBookPrices, Columbia, MD, Etats-UnisGreatBookPrices
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 200,84
EUR 2,29 expéditionExpédition nationale : Etats-UnisQuantité disponible : 3 disponible(s)
Etat : New.
- Couverture rigide
Vendeur : Revaluation Books, Exeter, Royaume-UniRevaluation Books
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 194,14
EUR 17,50 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 2 disponible(s)
Hardcover. Etat : Brand New. 600 pages. 9.25x6.00x1.50 inches. In Stock.
- Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 197,00
EUR 65,47 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Buch. Etat : Neu. Neuware - An essential guide to the modeling and design techniques for securing systems that utilize the Internet of ThingsModeling and Design of Secure Internet of Things offers a guide to the underlying foundations of modeling secure Internet of Things' (IoT) techniques. The contributors--noted experts on the… topic--also include information on practical design issues that are relevant for application in the commercial and military domains. They also present several attack surfaces in IoT and secure solutions that need to be developed to reach their full potential.The book offers material on security analysis to help with in understanding and quantifying the impact of the new attack surfaces introduced by IoT deployments. The authors explore a wide range of themes including: modeling techniques to secure IoT, game theoretic models, cyber deception models, moving target defense models, adversarial machine learning models in military and commercial domains, and empirical validation of IoT platforms. This important book:\* Presents information on game-theory analysis of cyber deception\* Includes cutting-edge research finding such as IoT in the battlefield, advanced persistent threats, and intelligent and rapid honeynet generation\* Contains contributions from an international panel of experts\* Addresses design issues in developing secure IoT including secure SDN-based network orchestration, networked device identity management, multi-domain battlefield settings, and smart citiesWritten for researchers and experts in computer science and engineering, Modeling and Design of Secure Internet of Things contains expert contributions to provide the most recent modeling and design techniques for securing systems that utilize Internet of Things.
- Couverture souple
- impression à la demande
Vendeur : Basi6 International, Irving, TX, Etats-UnisBasi6 International
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 58,76
Frais de port gratuitsExpédition nationale : Etats-UnisQuantité disponible : 10 disponible(s)
Etat : Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days. Excellent Customer Service.
- Couverture souple
- impression à la demande
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AllemagneBuchWeltWeit Ludwig Meier e.K.
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 50,28
EUR 23,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponible(s)
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Characterizations of PUNC and precomputation.- Comparison of algorithms controlling concurrent access to a database: A combinatorial approach.- A new duality result concerning Voronoi diagrams.- Classification of all the minimal bilinea…r algorithms for computing the coefficients of the product of two polynomials modulo a polynomial.- On exponential lowness.- A tradeoff between search and update time for the implicit dictionary problem.- Intersections of some families of languages.- Correspondence between ternary simulation and binary race analysis in gate networks.- Counting with rational functions.- Finite biprefix sets of paths in a Graph.- Parallel RAMs with owned global memory and deterministic context-free language recognition.- A Strong restriction of the inductive completion procedure.- On discerning words by automata.- Complexity classes without machines: On complete languages for UP.- Containment, separation, complete sets, and immunity of complexity classes.- On nontermination of Knuth-Bendix algorithm.- Tradeoffs for language recognition on parallel computing models.- Rational equivalence relations.- Some further results on digital search trees.- Knowledge, belief and time.- A termination detector for static and dynamic distributed systems with asynchronous non-first-in-first-out communication.- Decompositions of nondeterministic reductions.- Hierarchical planarity testing algorithms.- Synthesis and equivalence of concurrent systems.- The set union problem with backtracking.- Torsion matrix semigroups and recognizable transductions.- On recognizable subsets of free partially commutative monoids.- Min Cut is NP-complete for edge weighted trees.- Alternating automata, the weak monadic theory of the tree, and its complexity.- Subpolynomial complexity classes of real functions and real numbers.- Etude syntaxique des parties reconnaissables de mots infinis.- Refusal testing.- A timed model for communicating sequential processes.- A uniform reduction theorem extending a result of J. Grollmann and A. Selman.- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs.- A new approach to detection of locally indicative stability.- A more efficient algorithm for lattice basis reduction.- Lower bounds by recursion theoretic arguments.- An improved algorithm for transitive closure on acyclic digraphs.- Un algorithme determinant les melanges de deux mots.- A very fast, practical algorithm for finding a negative cycle in a digraph.- A compositional reformulation of Owicki-Gries's partial correctness logic for a concurrent while language.- Semigroups and languages of dot-depth 2.- A parallel vertex insertion algorithm for minimum spanning trees.- More complicated questions about maxima and minima, and some closures of NP.- Lower bounds for dynamic range query problems that permit subtraction (extended abstract).- E-unification algorithms for a class of confluent term rewriting systems.- On fixed-point clones. 488 pp. Englisch.
- Couverture souple
- impression à la demande
Vendeur : Majestic Books, Hounslow, Royaume-UniMajestic Books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 77,83
EUR 7,58 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 4 disponible(s)
Etat : New. Print on Demand pp. 488 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
- Couverture souple
- impression à la demande
Vendeur : Biblios, frankfurt am main, HESSE, AllemagneBiblios
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 78,17
EUR 9,95 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 4 disponible(s)
Etat : New. PRINT ON DEMAND pp. 488.
- Couverture souple
- impression à la demande
Vendeur : moluna, Greven, Allemagnemoluna
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 45,74
EUR 48,99 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Characterizations of PUNC and precomputation.- Comparison of algorithms controlling concurrent access to a database: A combinatorial approach.- A new duality result concerning Voronoi diagrams.- Classification of all the…minimal bilinear algorithms for comp.
- Couverture souple
- impression à la demande
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagnebuchversandmimpf2000
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 50,28
EUR 60,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Characterizations of PUNC and precomputation.- Comparison of algorithms controlling concurrent access to a database: A combinatorial approach.- A new duality result concerning Voronoi diagrams.- Classification of all the minimal bilinear al…gorithms for computing the coefficients of the product of two polynomials modulo a polynomial.- On exponential lowness.- A tradeoff between search and update time for the implicit dictionary problem.- Intersections of some families of languages.- Correspondence between ternary simulation and binary race analysis in gate networks.- Counting with rational functions.- Finite biprefix sets of paths in a Graph.- Parallel RAMs with owned global memory and deterministic context-free language recognition.- A Strong restriction of the inductive completion procedure.- On discerning words by automata.- Complexity classes without machines: On complete languages for UP.- Containment, separation, complete sets, and immunity of complexity classes.- On nontermination of Knuth-Bendix algorithm.- Tradeoffs for language recognition on parallel computing models.- Rational equivalence relations.- Some further results on digital search trees.- Knowledge, belief and time.- A termination detector for static and dynamic distributed systems with asynchronous non-first-in-first-out communication.- Decompositions of nondeterministic reductions.- Hierarchical planarity testing algorithms.- Synthesis and equivalence of concurrent systems.- The set union problem with backtracking.- Torsion matrix semigroups and recognizable transductions.- On recognizable subsets of free partially commutative monoids.- Min Cut is NP-complete for edge weighted trees.- Alternating automata, the weak monadic theory of the tree, and its complexity.- Subpolynomial complexity classes ofreal functions and real numbers.- Etude syntaxique des parties reconnaissables de mots infinis.- Refusal testing.- A timed model for communicating sequential processes.- A uniform reduction theorem extending a result of J. Grollmann and A. Selman.- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs.- A new approach to detection of locally indicative stability.- A more efficient algorithm for lattice basis reduction.- Lower bounds by recursion theoretic arguments.- An improved algorithm for transitive closure on acyclic digraphs.- Un algorithme determinant les melanges de deux mots.- A very fast, practical algorithm for finding a negative cycle in a digraph.- A compositional reformulation of Owicki-Gries's partial correctness logic for a concurrent while language.- Semigroups and languages of dot-depth 2.- A parallel vertex insertion algorithm for minimum spanning trees.- More complicated questions about maxima and minima, and some closures of NP.- Lower bounds for dynamic range query problems that permit subtraction (extended abstract).- E-unification algorithms for a class of confluent term rewriting systems.- On fixed-point clones.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 488 pp. Englisch.
Autres images- Couverture souple
- impression à la demande
Vendeur : preigu, Osnabrück, Allemagnepreigu
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 47,50
EUR 70,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 5 disponible(s)
Taschenbuch. Etat : Neu. Automata, Languages and Programming | 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings | Laurent Kott | Taschenbuch | xii | Englisch | 1986 | Springer | EAN 9783540167617 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[do…t]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.
- Couverture rigide
- impression à la demande
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-UniTHE SAINT BOOKSTORE
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 178,36
EUR 25,34 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Hardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
- Couverture rigide
- impression à la demande
Vendeur : CitiRetail, Stevenage, Royaume-UniCitiRetail
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 165,77
EUR 43,15 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : new. Hardcover. An essential guide to the modeling and design techniques for securing systems that utilize the Internet of Things Modeling and Design of Secure Internet of Things offers a guide to the underlying foundations of modeling secure Internet of Things' (IoT) techniques. The contributorsnoted experts o…n the topicalso include information on practical design issues that are relevant for application in the commercial and military domains. They also present several attack surfaces in IoT and secure solutions that need to be developed to reach their full potential. The book offers material on security analysis to help with in understanding and quantifying the impact of the new attack surfaces introduced by IoT deployments. The authors explore a wide range of themes including: modeling techniques to secure IoT, game theoretic models, cyber deception models, moving target defense models, adversarial machine learning models in military and commercial domains, and empirical validation of IoT platforms. This important book: Presents information on game-theory analysis of cyber deceptionIncludes cutting-edge research finding such as IoT in the battlefield, advanced persistent threats, and intelligent and rapid honeynet generationContains contributions from an international panel of expertsAddresses design issues in developing secure IoT including secure SDN-based network orchestration, networked device identity management, multi-domain battlefield settings, and smart cities Written for researchers and experts in computer science and engineering, Modeling and Design of Secure Internet of Things contains expert contributions to provide the most recent modeling and design techniques for securing systems that utilize Internet of Things. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
