<section name="raw">
    <SEQUENTIAL>
      <record key="001" att1="001" value="LIB90429240X" att2="LIB90429240X">001   LIB90429240X</record>
      <field key="037" subkey="x">englisch</field>
      <field key="050" subkey="x">Buch</field>
      <field key="076" subkey="">EDV</field>
      <field key="100" subkey="">aho, alfred v.</field>
      <field key="104" subkey="a">hopcroft, john e.</field>
      <field key="108" subkey="a">ullman, jeffrey d.</field>
      <field key="331" subkey="">the design and analysis of computer algorithms</field>
      <field key="403" subkey="">1. ed.</field>
      <field key="410" subkey="">readings, massachusetts, menlo park, california, london</field>
      <field key="412" subkey="">addison-wesley publishing company</field>
      <field key="425" subkey="">1974</field>
      <field key="433" subkey="">x, 470 pp.</field>
      <field key="451" subkey="">addison-wesley series in computer science and information processing</field>
      <field key="451" subkey="h">harrison, michael a. (ed.)</field>
      <field key="517" subkey="c">from the table of contents: models of computation; design of efficient algorithms; sorting and order statistics; data structures</field>
      <field key="for" subkey="">set manipulation problems; algorithms on graphs; matrix multiplication and related operations; the fast fourier transform and</field>
      <field key="its" subkey="">applications; integer and polynomial arithmetic; pattern-matching algorithms; np-complete problems; some provably intractable</field>
      <field key="pro" subkey="b">lems; lower bounds on numbers of arithmetic operations;</field>
      <field key="540" subkey="">0-201-00029-6</field>
      <field key="544" subkey="">8800-A</field>
    </SEQUENTIAL>
  </section>