<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <nonSort>The </nonSort>
    <title>art of computer programming</title>
  </titleInfo>
  <name type="personal">
    <namePart>Knuth, Donald Ervin</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">nju</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Upper Saddle River, NJ</placeTerm>
    </place>
    <publisher>Addison-Wesley</publisher>
    <dateIssued>2005-2009</dateIssued>
    <dateIssued encoding="marc" point="start">2005</dateIssued>
    <dateIssued encoding="marc" point="end">2006</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>v.  : ill. ; 25 cm.</extent>
  </physicalDescription>
  <tableOfContents>v. 4, fasc. 0. Introduction to combinatorial algorithms and boolean functions v. 4, fasc. 1. Bitwise tricks &amp; techniques, binary decision diagrams -- v. 4, fasc. 2. Generating all tuples and permutations -- v. 4, fasc. 3. Generating all combinations and partitions -- v. 4, fasc. 4. Generating all trees, history of combinatorial generation</tableOfContents>
  <targetAudience authority="marctarget">specialized</targetAudience>
  <note type="statement of responsibility">Donald E. Knuth</note>
  <note>Issued in fascicles. Consists of updates being published as the author continues working towards the complete 4th ed. of The art of computer programming, i.e. fascicles are supplements to the 3rd ed. in anticipation of the 4th ed. which will condense the most important material into a single book</note>
  <note>Includes index</note>
  <subject authority="lcsh">
    <topic>Computer programming</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Computer algorithms</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Newly available sections of the classic work</title>
    </titleInfo>
  </relatedItem>
  <identifier type="isbn">0321534964 (v.4, fasc. 0 : pbk. : alk. paper)</identifier>
  <identifier type="isbn">0321580508  (v.4, fasc.1 : pbk. : alk. paper)</identifier>
  <identifier type="isbn">0201853930 (v.4, fasc. 2 : pbk. : alk. paper)</identifier>
  <identifier type="isbn">0201853949 (v.4, fasc. 3 : pbk. : alk. paper)</identifier>
  <identifier type="isbn">0321335708 (v.4, fasc. 4 : pbk. : alk. paper)</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">UMP</recordContentSource>
    <recordCreationDate encoding="marc">061206</recordCreationDate>
    <recordChangeDate encoding="iso8601">20251117144227.0</recordChangeDate>
    <recordIdentifier source="KUKTEM">vtls000016796</recordIdentifier>
  </recordInfo>
</mods>
