<?xml version="1.0" encoding="utf-8" ?> <rss version="2.0" xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"> <channel> <title> <![CDATA[Delhi University Library System Search for 'au:&quot;Cormen Thomas H&quot;']]> </title> <!-- prettier-ignore-start --> <link> /cgi-bin/koha/opac-search.pl?idx=&#38;q=au%3A%22Cormen%20Thomas%20H%22&#38;sort_by=title_asc&#38;format=rss </link> <!-- prettier-ignore-end --> <atom:link rel="self" type="application/rss+xml" href="/cgi-bin/koha/opac-search.pl?idx=&#38;q=au%3A%22Cormen%20Thomas%20H%22&#38;sort_by=title_asc&#38;format=rss" /> <description> <![CDATA[ Search results for 'au:&quot;Cormen Thomas H&quot;' at Delhi University Library System]]> </description> <opensearch:totalResults>66</opensearch:totalResults> <opensearch:startIndex>0</opensearch:startIndex> <opensearch:itemsPerPage>50</opensearch:itemsPerPage> <atom:link rel="search" type="application/opensearchdescription+xml" href="/cgi-bin/koha/opac-search.pl?idx=&#38;q=au%3A%22Cormen%20Thomas%20H%22&#38;sort_by=title_asc&#38;format=opensearchdescription" /> <opensearch:Query role="request" searchTerms="idx%3D%26q%3Dau%253A%2522Cormen%2520Thomas%2520H%2522" startPage="" /> <item> <title> Algorithms unlocked </title> <dc:identifier>ISBN:9780262518802 (pbk) | SL01560484</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=7623</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/0262518805.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H.<br /> Cambridge MIT 2012 .<br /> xiv,222p. , Include bibliographical references.; Bibliography 213-214p.; Index 215-222p. 9780262518802 (pbk) | SL01560484 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=7623">Place hold on <em>Algorithms unlocked</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=7623</guid> </item> <item> <title> Algorithms unlocked. </title> <dc:identifier>ISBN:</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=769025</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Cormen Thomas H.<br /> Cambridge The MIT Press 2013 .<br /> xiii;222p cm..<br /> </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=769025">Place hold on <em>Algorithms unlocked.</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=769025</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9780262046305</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=1429058</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/026204630X.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen, Thomas H..<br /> Cambridge : The MIT Press, 2022 .<br /> xx, 1291p. 9780262046305 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=1429058">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=1429058</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=774087</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Cormen Thomas H..<br /> Delhi PHI Learning Private Limited 2015 .<br /> xix;1292p. cm..<br /> </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=774087">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=774087</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=774086</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Cormen Thomas H..<br /> Delhi PHI Learning Private Limited 2015 .<br /> xix;1292p. cm..<br /> </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=774086">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=774086</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=774085</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi PHI Learning Private Limited 2013 .<br /> xix;1292p cm..<br /> </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=774085">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=774085</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=774084</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi PHI Learning Private Limited 2013 .<br /> xix;1292p cm..<br /> </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=774084">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=774084</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:8120313534</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=529631</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120313534.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H and others.<br /> Cambridge MIT Press 1990 .<br /> xvii,1028p , Bibliography P 987-96 cm..<br /> 8120313534 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=529631">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=529631</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:8120313534</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=529620</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120313534.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H and others.<br /> Cambridge MIT Press 1990 .<br /> xvii,1028p , Bibliography P 987-96 cm..<br /> 8120313534 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=529620">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=529620</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:8120313534</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=496698</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120313534.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H and others.<br /> Cambridge MIT Press 1990 .<br /> xvii,1028p , Bibliography P 987-96 cm..<br /> 8120313534 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=496698">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=496698</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:8120313534</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=496687</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120313534.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H and others.<br /> Cambridge MIT Press 1990 .<br /> xvii,1028p , Bibliography P 987-96 cm..<br /> 8120313534 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=496687">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=496687</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:8120321413 (pbk)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=48502</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120321413.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi Prentice-hall of India Pvt. Ltd. 2001 .<br /> xix,1180p , Appendix A-C 1058-1126p; Bibliography 1128-1143p; Index 1145-1180p 8120321413 (pbk) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=48502">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=48502</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:8120321413 (pbk)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=48501</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120321413.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi Prentice-hall of India Pvt. Ltd. 2001 .<br /> xix,1180p , Appendix A-C 1058-1126p; Bibliography 1128-1143p; Index 1145-1180p 8120321413 (pbk) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=48501">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=48501</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:8120321413 (pbk)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=48500</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120321413.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi Prentice-hall of India Pvt. Ltd. 2001 .<br /> xix,1180p , Appendix A-C 1058-1126p; Bibliography 1128-1143p; Index 1145-1180p 8120321413 (pbk) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=48500">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=48500</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:8120321413 (pbk)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=48499</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120321413.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi Prentice-hall of India Pvt. Ltd. 2001 .<br /> xix,1180p , Appendix A-C 1058-1126p; Bibliography 1128-1143p; Index 1145-1180p 8120321413 (pbk) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=48499">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=48499</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:8120321413 (pbk)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=48498</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120321413.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi Prentice-hall of India Pvt. Ltd. 2001 .<br /> xix,1180p , Appendix A-C 1058-1126p; Bibliography 1128-1143p; Index 1145-1180p 8120321413 (pbk) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=48498">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=48498</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=48252</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi P H I Learning 2009 .<br /> xix; 1292p. cm..<br /> 9788120340077 (pbk) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=48252">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=48252</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=48251</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi P H I Learning 2009 .<br /> xix; 1292p. cm..<br /> 9788120340077 (pbk) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=48251">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=48251</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=48250</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi P H I Learning 2009 .<br /> xix; 1292p. cm..<br /> 9788120340077 (pbk) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=48250">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=48250</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:0262031418 (pbk)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=44196</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/0262031418.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H.<br /> Cambridge The MIT Press 1990 .<br /> xvii,1028p , Bibliography 987-996p; Index 997-1028p 0262031418 (pbk) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=44196">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=44196</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:8120313534 (pbk)</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=27400</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120313534.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H.<br /> Cambridge MIT Press 1990 .<br /> xvii, 1028p. , Bibliography 987-996p.; Index 997-1028p. cm..<br /> 8120313534 (pbk) </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=27400">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=27400</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558934</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11759</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558934 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11759">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11759</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558933</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11758</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558933 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11758">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11758</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558932</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11757</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558932 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11757">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11757</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558931</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11756</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558931 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11756">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11756</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558930</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11755</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558930 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11755">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11755</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558929</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11754</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558929 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11754">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11754</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558928</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11753</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558928 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11753">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11753</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558927</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11752</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558927 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11752">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11752</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558926</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11751</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558926 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11751">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11751</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558925</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11750</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558925 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11750">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11750</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558891</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11749</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558891 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11749">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11749</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558890</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11748</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558890 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11748">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11748</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558889</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11747</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558889 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11747">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11747</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558888</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11746</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558888 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11746">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11746</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01558887</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11745</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHL Learning 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01558887 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11745">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11745</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01561673</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11682</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHI 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01561673 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11682">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11682</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01561672</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11681</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHI 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01561672 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11681">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11681</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01561671</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11680</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHI 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01561671 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11680">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11680</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01561670</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11679</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHI 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01561670 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11679">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11679</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9788120340077 (pbk) | SL01561669</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=11678</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/8120340078.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> New Delhi PHI 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9788120340077 (pbk) | SL01561669 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=11678">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=11678</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9780262033848 (hbk) | SL01536073</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=7625</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/0262033844.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> Cambridge MIT Press 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9780262033848 (hbk) | SL01536073 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=7625">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=7625</guid> </item> <item> <title> Introduction to algorithms </title> <dc:identifier>ISBN:9780262033848 (hbk) | SL01536072</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=7624</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/0262033844.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Cormen Thomas H; Leiserson Charles E; Rivest Ronald L; Stein Clifford.<br /> Cambridge MIT Press 2009 .<br /> xix; 1292p. , Bibliography 1231-1250p.; Index 1251-1292p. 9780262033848 (hbk) | SL01536072 </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=7624">Place hold on <em>Introduction to algorithms</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=7624</guid> </item> <item> <title> Introduction to algorithms . </title> <dc:identifier>ISBN:</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=749595</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Cormen Thomas H.<br /> Delhi PHI Learning Private Limited 2013 .<br /> vi;1292p cm..<br /> </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=749595">Place hold on <em>Introduction to algorithms .</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=749595</guid> </item> <item> <title> Introduction to algorithms. </title> <dc:identifier>ISBN:</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=772824</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi Prentice-Hall of India 2001 .<br /> xix,1180p cm..<br /> </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=772824">Place hold on <em>Introduction to algorithms.</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=772824</guid> </item> <item> <title> Introduction to algorithms. </title> <dc:identifier>ISBN:</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=772823</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi Prentice-Hall of India 2001 .<br /> xix,1180p cm..<br /> </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=772823">Place hold on <em>Introduction to algorithms.</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=772823</guid> </item> <item> <title> Introduction to algorithms. </title> <dc:identifier>ISBN:</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=772822</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi Prentice-Hall of India 2001 .<br /> xix,1180p cm..<br /> </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=772822">Place hold on <em>Introduction to algorithms.</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=772822</guid> </item> <item> <title> Introduction to algorithms. </title> <dc:identifier>ISBN:</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=772821</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi Prentice-Hall of India 2001 .<br /> xix,1180p cm..<br /> </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=772821">Place hold on <em>Introduction to algorithms.</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=772821</guid> </item> <item> <title> Introduction to algorithms. </title> <dc:identifier>ISBN:</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=772820</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi Prentice-Hall of India 2001 .<br /> xix,1180p cm..<br /> </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=772820">Place hold on <em>Introduction to algorithms.</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=772820</guid> </item> <item> <title> Introduction to algorithms. </title> <dc:identifier>ISBN:</dc:identifier> <!-- prettier-ignore-start --> <link>/cgi-bin/koha/opac-detail.pl?biblionumber=772819</link> <!-- prettier-ignore-end --> <description> <![CDATA[ <p> By Cormen Thomas H.<br /> New Delhi Prentice-Hall of India 2001 .<br /> xix,1180p cm..<br /> </p> ]]> <![CDATA[ <p> <a href="/cgi-bin/koha/opac-reserve.pl?biblionumber=772819">Place hold on <em>Introduction to algorithms.</em></a> </p> ]]> </description> <guid>/cgi-bin/koha/opac-detail.pl?biblionumber=772819</guid> </item> </channel> </rss>
