<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/user/jaeschke/programming"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /user/jaeschke/programming</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><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><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><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><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></rdf:RDF>
