<?xml version="1.0" encoding="UTF-8"?>
<GoodreadsResponse>
	<Request>
		<authentication>false</authentication>
		    <method><![CDATA[]]></method>
	</Request>
	<author>
  
  <id>578079</id>
  <name><![CDATA[Herbert S. Wilf]]></name>
  <link><![CDATA[http://www.goodreads.com/author/show/578079.Herbert_S_Wilf]]></link>
  <fans_count type="integer">0</fans_count>
  <followers_count type="integer">0</followers_count>
  <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
  <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
  <about><![CDATA[]]></about>
  <influences><![CDATA[]]></influences>
  <gender></gender>
  <hometown></hometown>
  <born_at></born_at>
  <died_at></died_at>
  
  <books>
        <book>
  <id type="integer">1404774</id>
  <isbn>1568812795</isbn>
  <isbn13>9781568812793</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Generatingfunctionology]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1183339658m/1404774.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1183339658s/1404774.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/1404774.Generatingfunctionology</link>
  <average_rating>5.00</average_rating>
  <ratings_count>2</ratings_count>
  <description>
    <![CDATA[Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in  <p>* Combinatorics<br/> * Probability Theory<br/> * Statistics<br/> * Theory of Markov Chains<br/> * Number Theory  <p>One of the most important and relevant recent applications of combinatorics lies in the development of Internet search engines whose incredible capabilities dazzle even the mathematically trained user.</p></p>]]>
  </description>
<authors>
    <author>
    <id>578079</id>
        <name><![CDATA[Herbert S. Wilf]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/578079.Herbert_S_Wilf]]></link>
    <average_rating>4.75</average_rating>
    <ratings_count>4</ratings_count>
    <text_reviews_count>0</text_reviews_count>
  </author>
  </authors>  <published>2006</published>
</book>

        <book>
  <id type="integer">4791633</id>
  <isbn>0130219738</isbn>
  <isbn13>9780130219732</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Algorithms and Complexity]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/4791633.Algorithms_and_Complexity</link>
  <average_rating>5.00</average_rating>
  <ratings_count>1</ratings_count>
  <description>
    <![CDATA[An internet search for the terms &quot;algorithms and complexity&quot; delivers a myriad of links, topped by the popular website for this book.    <p>Updated and back in print, this classic text provides the perfect introduction to the tools of algorithmic design and analysis, concentrating on basic principles and illustrating them with well-chosen paradigms such as:    <p>• Fast Fourier Transform<br/>  • NP-Completeness<br/>  • Number Theory and Cryptography    <p>Including updated topics for the new edition:<br/>  • The Network Flow Algorithm<br/>  • A breakthrough result in Primality Testing    <p>And very importantly, it contains solutions and hints for most of the problems.</p></p></p></p>]]>
  </description>
<authors>
    <author>
    <id>578079</id>
        <name><![CDATA[Herbert S. Wilf]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/578079.Herbert_S_Wilf]]></link>
    <average_rating>4.75</average_rating>
    <ratings_count>4</ratings_count>
    <text_reviews_count>0</text_reviews_count>
  </author>
  </authors>  <published>1986</published>
</book>

        <book>
  <id type="integer">2040019</id>
  <isbn>0127519564</isbn>
  <isbn13>9780127519562</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Generatingfunctionology]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/2040019.Generatingfunctionology</link>
  <average_rating>4.00</average_rating>
  <ratings_count>1</ratings_count>
  <description>
    <![CDATA[This is the Second Edition of the highly successful introduction to the use of generating functions and series in combinatorial mathematics. This new edition includes several new areas of application, including the cycle index of the symmetric group, permutations and square roots, counting polyominoes, and exact covering sequences. An appendix on using the computer algebra programs MAPLE(r) and <em>Mathematica</em>(r) to generate functions is also included. The book provides a clear, unified introduction to the basic enumerative applications of generating functions, and includes exercises and solutions, many new, at the end of each chapter.<br/><br/>Key Features<br/>* Provides <strong>new applications</strong> on the cycle index of the symmetric group, permutations and square roots, counting polyominoes, and exact covering sequences<br/>* Features an <strong>Appendix</strong> on using <strong>MAPLE(r)</strong> and <strong><em>Mathematica (r)</em> to generate functions<br/>* Includes many <strong>new exercises with complete solutions</strong> at the end of each chapter</strong>]]>
  </description>
<authors>
    <author>
    <id>578079</id>
        <name><![CDATA[Herbert S. Wilf]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/578079.Herbert_S_Wilf]]></link>
    <average_rating>4.75</average_rating>
    <ratings_count>4</ratings_count>
    <text_reviews_count>0</text_reviews_count>
  </author>
  </authors>  <published>1994</published>
</book>

        <book>
  <id type="integer">3608432</id>
  <isbn>0898712319</isbn>
  <isbn13>9780898712315</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Combinatorial Algorithms : An Update (CBMS-NSF Regional Conference Series in Applied Mathematics) (CBMS-NSF Regional Conference Series in Applied Mathematics)]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/3608432.Combinatorial_Algorithms_An_Update</link>
  <average_rating>0.0</average_rating>
  <ratings_count>0</ratings_count>
  <description>
    <![CDATA[A survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled graphs uniformly at random, and ranking and unranking problems on unlabeled trees.]]>
  </description>
<authors>
    <author>
    <id>578079</id>
        <name><![CDATA[Herbert S. Wilf]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/578079.Herbert_S_Wilf]]></link>
    <average_rating>4.75</average_rating>
    <ratings_count>4</ratings_count>
    <text_reviews_count>0</text_reviews_count>
  </author>
  </authors>  <published>1987</published>
</book>

        <book>
  <id type="integer">4413387</id>
  <isbn>0486636356</isbn>
  <isbn13>9780486636351</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Mathematics for the Physical Sciences]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/4413387.Mathematics_for_the_Physical_Sciences</link>
  <average_rating>0.0</average_rating>
  <ratings_count>0</ratings_count>
  <description>
    <![CDATA[]]>
  </description>
<authors>
    <author>
    <id>578079</id>
        <name><![CDATA[Herbert S. Wilf]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/578079.Herbert_S_Wilf]]></link>
    <average_rating>4.75</average_rating>
    <ratings_count>4</ratings_count>
    <text_reviews_count>0</text_reviews_count>
  </author>
  </authors>  <published>1978</published>
</book>

        <book>
  <id type="integer">2988402</id>
  <isbn>1568811780</isbn>
  <isbn13>9781568811789</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Algorithms and Complexity]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/2988402.Algorithms_and_Complexity</link>
  <average_rating>0.0</average_rating>
  <ratings_count>0</ratings_count>
  <description>
    <![CDATA[...introductory textbook on the design and analysis of  algorithms...careful selection of a few topics to illustrate the tools ofr algorithm analysis.]]>
  </description>
<authors>
    <author>
    <id>578079</id>
        <name><![CDATA[Herbert S. Wilf]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/578079.Herbert_S_Wilf]]></link>
    <average_rating>4.75</average_rating>
    <ratings_count>4</ratings_count>
    <text_reviews_count>0</text_reviews_count>
  </author>
  </authors>  <published>2002</published>
</book>

        <book>
  <id type="integer">1996709</id>
  <isbn>0471706892</isbn>
  <isbn13>9780471706892</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Mathematical Methods for Digital Computers]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/1996709.Mathematical_Methods_for_Digital_Computers</link>
  <average_rating>0.0</average_rating>
  <ratings_count>0</ratings_count>
  <description>
    <![CDATA[]]>
  </description>
<authors>
    <author>
    <id>578079</id>
        <name><![CDATA[Herbert S. Wilf]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/578079.Herbert_S_Wilf]]></link>
    <average_rating>4.75</average_rating>
    <ratings_count>4</ratings_count>
    <text_reviews_count>0</text_reviews_count>
  </author>
  </authors>  <published>1967</published>
</book>

        <book>
  <id type="integer">3932870</id>
  <isbn>0125192509</isbn>
  <isbn13>9780125192507</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Combinatorial Algorithms]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/3932870.Combinatorial_Algorithms</link>
  <average_rating>0.0</average_rating>
  <ratings_count>0</ratings_count>
  <description>
    <![CDATA[]]>
  </description>
<authors>
    <author>
    <id>1677166</id>
        <name><![CDATA[Albert Nijenhuis]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/1677166.Albert_Nijenhuis]]></link>
    <average_rating>0.0</average_rating>
    <ratings_count>0</ratings_count>
    <text_reviews_count>0</text_reviews_count>
  </author>
    <author>
    <id>578079</id>
        <name><![CDATA[Herbert S. Wilf]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/578079.Herbert_S_Wilf]]></link>
    <average_rating>4.75</average_rating>
    <ratings_count>4</ratings_count>
    <text_reviews_count>0</text_reviews_count>
  </author>
  </authors>  <published>1976</published>
</book>

      <books>
</author>
</GoodreadsResponse>