{"product_id":"9783540575030","title":"Lecture Notes in Computer Science","description":"\u003ch1\u003eLecture Notes in Computer Science\u003c\/h1\u003e \u003ch2\u003eTeillaud, Monique\u003c\/h2\u003e \u003cp\u003eComputational geometry concerns itself with designing and\nanalyzing         algorithms for solving geometric problems. The\nfield has reached a high     level of sophistication, and very\ncomplicated algorithms have been designed.However, it is\nalso useful to develop more practical algorithms, so long    as\nthey are based on rigorous methods. One such method is the\nuse of    randomized algorithms. These algorithms have become\nmore and more popular,  turning into one of the hottest areas\nof recent years. Dynamic algorithms   are particularly\ninteresting because in practice the data of a problem      are\noften acquired progressively. In this monograph the author\nstudies  the theoretical complexity and practical efficiency\nof randomized dynamic   algorithms.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 1993-11-23\u003c\/p\u003e \u003cp\u003eFormat: Paperback\u003c\/p\u003e \u003cp\u003eISBN-13: 9783540575030\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/3-540-57503-0\u003c\/p\u003e \u003cp\u003eDimensions: 233cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 169\u003c\/p\u003e ","brand":"Springer Berlin Heidelberg","offers":[{"title":"Default Title","offer_id":45370086621324,"sku":"9783540575030","price":49.49,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9783540575030.jpg?v=1777979626","url":"https:\/\/lateknightbooks.com\/products\/9783540575030","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}