<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>01236nam a2200265Ia 4500</leader>
  <controlfield tag="001">TVU_20738</controlfield>
  <controlfield tag="008">210423s9999    xx            000 0 und d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
   <subfield code="a">0124045782</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
   <subfield code="a">9780124045781</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
   <subfield code="a">4.36</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
   <subfield code="b">H206</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
   <subfield code="a">Herlihy, Maurice</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2="0">
   <subfield code="a">Distributed computing through combinatorial topology</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2="0">
   <subfield code="c">Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="a">Amsterdam</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="b">Morgan Kaufmann, is an imprint of Elsevier</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">xiv, 319 p.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="b">ill.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="c">24 cm</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
   <subfield code="a">Includes bibliographical references (pages 305-312) and index</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
   <subfield code="a">Electronic data processing; Combinatorial topology</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
   <subfield code="a">Maurice Herlihy; Dmitry Kozlov; Sergio Rajsbaum</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
   <subfield code="a">Trung tâm Học liệu Trường Đại học Trà Vinh</subfield>
  </datafield>
 </record>
</collection>
