<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>01480nam a2200193Ia 4500</leader>
  <controlfield tag="001">CTU_191457</controlfield>
  <controlfield tag="008">210402s9999    xx            000 0 und d</controlfield>
  <datafield tag="082" ind1=" " ind2=" ">
   <subfield code="a">005.1</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
   <subfield code="b">G441</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
   <subfield code="a">Gibbons, Alan</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2="0">
   <subfield code="a">Efficient parallel algorithms</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2="0">
   <subfield code="c">Alan Gibbons, Wojciech Rytter</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="a">Cambridge</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="b">Cambridge University Press</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="c">1989</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">This largely self-contained text is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelism, that presumes no special knowledge of parallel computers or particular mathematics. The book emphasizes designing algorithms within the timeless and abstracted context of a high-level programming language rather than within highly specific computer architectures. This is an approach that concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problems. The authors present regularly-used techniques and a range of algorithms including some of the more celebrated ones. Nonspecialists considering entering the field of parallel algorithms, as well as advanced undergraduate or postgraduate students of computer science and mathematics will find this book helpful.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
   <subfield code="a">Parallel programming (Computer science),Lập trình song song (khoa học máy tính)</subfield>
  </datafield>
  <datafield tag="904" ind1=" " ind2=" ">
   <subfield code="i">Qhieu</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
   <subfield code="a">Trung tâm Học liệu Trường Đại học Cần Thơ</subfield>
  </datafield>
 </record>
</collection>
