<section name="raw">
    <SEQUENTIAL>
      <record key="001" att1="001" value="LIB905674005" att2="LIB905674005">001   LIB905674005</record>
      <field key="037" subkey="x">englisch</field>
      <field key="050" subkey="x">Buch</field>
      <field key="076" subkey="">Formalwissenschaft</field>
      <field key="100" subkey="">kemp, rainer</field>
      <field key="103" subkey="">fachbereich informatik, universitaet frankfurt, germany</field>
      <field key="331" subkey="">fundamentals of the average case analysis of particular algorithms</field>
      <field key="403" subkey="">1. ed.</field>
      <field key="410" subkey="">stuttgart</field>
      <field key="412" subkey="">b.g. teubner verlagsgesellschaft</field>
      <field key="415" subkey="">chichester, new york, brisbane</field>
      <field key="417" subkey="">john wiley and sons</field>
      <field key="425" subkey="">1984</field>
      <field key="433" subkey="">viii, 233 pp.</field>
      <field key="451" subkey="">wiley-teubner series in computer science</field>
      <field key="451" subkey="h">hotz, guenter (ed.) ; fischer, michael j. (ed.) ; nivat, maurice (ed.) ; et al.</field>
      <field key="517" subkey="c">from the table of contents: preface; introduction; a simple class of algorithms; permutations and their applications; random</field>
      <field key="wal" subkey="k">s, trees, lists; applications; appendixes;</field>
      <field key="540" subkey="">0-471-90322-1</field>
      <field key="544" subkey="">10810-A</field>
      <field key="700" subkey="b">511</field>
      <field key="700" subkey="b">general principles of mathematics</field>
      <field key="700" subkey="b">519</field>
      <field key="700" subkey="b">probabilities and applied mathematics</field>
      <field key="710" subkey="">computer programming</field>
      <field key="710" subkey="">computer algorithms</field>
      <field key="720" subkey="">algorithms</field>
    </SEQUENTIAL>
  </section>