<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:cc="http://web.resource.org/cc/"><channel rdf:about="http://www.bibsonomy.org/user/jaeschke/programming"><title>BibSonomy publications for /user/jaeschke/programming</title><link>BibSonomyburst/user/jaeschke/programming</link><description>BibSonomy RSS feed for /user/jaeschke/programming</description><dc:date>2012-02-16T17:13:21+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2481baec64f095b2555e780614e5c8f13/jaeschke"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/200821d3bcac5f90eb2e6b90b17464037/jaeschke"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2bbcd4d56e619911172e571d36bb28f3b/jaeschke"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2e023d8d61f47f3208d4cbe4fdc9b1fd5/jaeschke"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2481baec64f095b2555e780614e5c8f13/jaeschke"><title>Combinatorial Algorithms</title><link>http://www.bibsonomy.org/bibtex/2481baec64f095b2555e780614e5c8f13/jaeschke</link><dc:creator>jaeschke</dc:creator><dc:date>2011-03-10T11:45:32+01:00</dc:date><dc:subject>algorithm combinatorics computer knuth programming taocp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Knuth&#034;&gt;Donald E. Knuth&lt;/a&gt; &lt;/span&gt;&lt;em&gt;The Art of Computer Programming &lt;/em&gt;&lt;em&gt;Addison-Wesley Professional, &lt;/em&gt;(&lt;em&gt;January 2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/combinatorics"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/computer"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/knuth"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/taocp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2481baec64f095b2555e780614e5c8f13/jaeschke"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2481baec64f095b2555e780614e5c8f13/jaeschke"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Book"/><owl:sameAs rdf:resource="http://www.amazon.com/Art-Computer-Programming-Combinatorial-Algorithms/dp/0201038048/ref=sr_1_1/179-7432054-1264222?ie=UTF8&amp;s=books&amp;qid=1298901523&amp;sr=8-1"/><swrc:date>Thu Mar 10 11:45:32 CET 2011</swrc:date><swrc:month>jan</swrc:month><swrc:publisher><swrc:Organization swrc:name="Addison-Wesley Professional"/></swrc:publisher><swrc:series>The Art of Computer Programming</swrc:series><swrc:title>Combinatorial Algorithms</swrc:title><swrc:volume>4A</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>algorithm combinatorics computer knuth programming taocp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="9780201038040" swrc:key="ean"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="0201038048" swrc:key="asin"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="0201038048" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="001.642" swrc:key="dewey"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Donald E. Knuth"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/200821d3bcac5f90eb2e6b90b17464037/jaeschke"><title>Accelerating Large Graph Algorithms on the GPU Using CUDA.</title><link>http://www.bibsonomy.org/bibtex/200821d3bcac5f90eb2e6b90b17464037/jaeschke</link><dc:creator>jaeschke</dc:creator><dc:date>2010-04-28T14:11:10+02:00</dc:date><dc:subject>analysis cuda gpu graph network programming </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Harish&#034;&gt;Pawan Harish&lt;/a&gt;,  and &lt;a href=&#034;/author/Narayanan&#034;&gt;P. J. Narayanan&lt;/a&gt; &lt;/span&gt;&lt;em&gt;HiPC, &lt;/em&gt;&lt;em&gt;volume 4873 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 197-208. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2007&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analysis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cuda"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/gpu"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/200821d3bcac5f90eb2e6b90b17464037/jaeschke"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/200821d3bcac5f90eb2e6b90b17464037/jaeschke"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/hipc/hipc2007.html#HarishN07"/><swrc:date>Wed Apr 28 14:11:10 CEST 2010</swrc:date><swrc:booktitle>HiPC</swrc:booktitle><swrc:crossref>conf/hipc/2007</swrc:crossref><swrc:pages>197-208</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Accelerating Large Graph Algorithms on the GPU Using CUDA.</swrc:title><swrc:volume>4873</swrc:volume><swrc:year>2007</swrc:year><swrc:keywords>analysis cuda gpu graph network programming </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/978-3-540-77220-0_21" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="978-3-540-77219-4" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2008-01-25" swrc:key="date"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Pawan Harish"/></rdf:_1><rdf:_2><swrc:Person swrc:name="P. J. Narayanan"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Srinivas Aluru"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Manish Parashar"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Ramamurthy Badrinath"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Viktor K. Prasanna"/></rdf:_4></rdf:Seq></swrc:editor></rdf:Description></burst:publication><description>dblp</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2bbcd4d56e619911172e571d36bb28f3b/jaeschke"><title>The art of computer programming</title><link>http://www.bibsonomy.org/bibtex/2bbcd4d56e619911172e571d36bb28f3b/jaeschke</link><dc:creator>jaeschke</dc:creator><dc:date>2009-06-02T10:26:42+02:00</dc:date><dc:subject>algorithm knuth programming searching sorting taocp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Knuth&#034;&gt;Donald E. Knuth&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Addison-Wesley Longman Publishing Co., &lt;/em&gt;&lt;em&gt;Boston, MA, USA, &lt;/em&gt;&lt;em&gt;2nd edition, &lt;/em&gt;(&lt;em&gt;1998&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/knuth"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/searching"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sorting"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/taocp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2bbcd4d56e619911172e571d36bb28f3b/jaeschke"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2bbcd4d56e619911172e571d36bb28f3b/jaeschke"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Book"/><owl:sameAs rdf:resource="http://portal.acm.org/citation.cfm?id=270146"/><swrc:date>Tue Jun 02 10:26:42 CEST 2009</swrc:date><swrc:address>Boston, MA, USA</swrc:address><swrc:edition>2nd</swrc:edition><swrc:publisher><swrc:Organization swrc:name="Addison-Wesley Longman Publishing Co."/></swrc:publisher><swrc:title>The art of computer programming</swrc:title><swrc:volume>3</swrc:volume><swrc:year>1998</swrc:year><swrc:keywords>algorithm knuth programming searching sorting taocp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="0-201-89685-0" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Donald E. Knuth"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2e023d8d61f47f3208d4cbe4fdc9b1fd5/jaeschke"><title>JavaTM Puzzlers: Traps, Pitfalls, and Corner Cases</title><link>http://www.bibsonomy.org/bibtex/2e023d8d61f47f3208d4cbe4fdc9b1fd5/jaeschke</link><dc:creator>jaeschke</dc:creator><dc:date>2006-12-08T15:28:10+01:00</dc:date><dc:subject>code java programming pitfall </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Bloch&#034;&gt;Joshua Bloch&lt;/a&gt;,  and &lt;a href=&#034;/author/Gafter&#034;&gt;Neal Gafter&lt;/a&gt; &lt;/span&gt;  (&lt;em&gt;2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/code"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/java"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pitfall"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2e023d8d61f47f3208d4cbe4fdc9b1fd5/jaeschke"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2e023d8d61f47f3208d4cbe4fdc9b1fd5/jaeschke"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.javapuzzlers.com/"/><swrc:date>Fri Dec 08 15:28:10 CET 2006</swrc:date><swrc:title>Java(TM) Puzzlers: Traps, Pitfalls, and Corner Cases</swrc:title><swrc:year>2005</swrc:year><swrc:keywords>code java programming pitfall </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="Simple CitationSource" swrc:key="typesource"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="032133678X" swrc:key="asin"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Joshua Bloch"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Neal Gafter"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication><description>Amazon.com: Java(TM) Puzzlers: Traps, Pitfalls, and Corner Cases: Books: Joshua Bloch,Neal Gafter</description></item></rdf:RDF>
