<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Thu, 21 Aug 2008 15:06:09 BST</pubDate>


	<title>CiteULike: AbnerCYH's Italiano</title>
	<description>CiteULike: AbnerCYH's Italiano</description>


	<link>http://www.citeulike.org/user/AbnerCYH/author/Italiano</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/AbnerCYH/article/2609109"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/AbnerCYH/article/1758665"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/AbnerCYH/article/2609109">
    <title>Algorithm engineering</title>
    <link>http://www.citeulike.org/user/AbnerCYH/article/2609109</link>
    <description>&lt;i&gt;ACM Comput. Surv. (1999)&lt;/i&gt;</description>
    <dc:title>Algorithm engineering</dc:title>

    <dc:creator>Giuseppe Cattaneo</dc:creator>
    <dc:creator>Giuseppe Italiano</dc:creator>
    <dc:identifier>doi:10.1145/333580.333582</dc:identifier>
    <dc:source>ACM Comput. Surv. (1999)</dc:source>
    <dc:date>2008-03-28T18:31:17-00:00</dc:date>
    <prism:publicationYear>1999</prism:publicationYear>
    <prism:publicationName>ACM Comput. Surv.</prism:publicationName>
    <prism:issn>0360-0300</prism:issn>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>algorithms</prism:category>
    <prism:category>sys_performance</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/AbnerCYH/article/1758665">
    <title>Data structures and algorithms for disjoint set union problems</title>
    <link>http://www.citeulike.org/user/AbnerCYH/article/1758665</link>
    <description>&lt;i&gt;ACM Comput. Surv., Vol. 23, No. 3. (September 1991), pp. 319-344.&lt;/i&gt;</description>
    <dc:title>Data structures and algorithms for disjoint set union problems</dc:title>

    <dc:creator>Zvi Galil</dc:creator>
    <dc:creator>Giuseppe Italiano</dc:creator>
    <dc:identifier>doi:10.1145/116873.116878</dc:identifier>
    <dc:source>ACM Comput. Surv., Vol. 23, No. 3. (September 1991), pp. 319-344.</dc:source>
    <dc:date>2007-10-12T04:50:31-00:00</dc:date>
    <prism:publicationYear>1991</prism:publicationYear>
    <prism:publicationName>ACM Comput. Surv.</prism:publicationName>
    <prism:issn>0360-0300</prism:issn>
    <prism:volume>23</prism:volume>
    <prism:number>3</prism:number>
    <prism:startingPage>319</prism:startingPage>
    <prism:endingPage>344</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>algorithms</prism:category>
    <prism:category>data_structure</prism:category>
</item>



</rdf:RDF>

