<rdf:RDF xmlns:burst="http://xmlns.com/burst/0.1/" 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:owl="http://www.w3.org/2002/07/owl#" 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#"><channel rdf:about="http://www.bibsonomy.org/burst/user/chesteve/filter"><title>BibSonomy publications for /user/chesteve/filter</title><link>http://www.bibsonomy.org/burst/user/chesteve/filter</link><description>BibSonomy BuRST Feed for /user/chesteve/filter</description><dc:date>2008-10-13T09:09:53+02:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2eaf31dd3a9fc180bea6ce287c5719321/chesteve"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2ab537b160621ec3a9746052d7296cfd7/chesteve"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2e14189d45c6aec7357f78d5b127bbe37/chesteve"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2240037323ffdd5d99011112bbf2d9699/chesteve"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2104613095cf15fd5f9fde565efaafc72/chesteve"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2379e59e4cd58efa589495f7c490f2a95/chesteve"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/257b8a7ce8e40433601ade42e311a6179/chesteve"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23cfa3dfe79ca746fe67aa5e68e99dfc1/chesteve"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2eaf31dd3a9fc180bea6ce287c5719321/chesteve"><title>Hash-based IP traceback</title><link>http://www.bibsonomy.org/bibtex/2eaf31dd3a9fc180bea6ce287c5719321/chesteve</link><dc:creator>chesteve</dc:creator><dc:date>2008-03-20T00:16:47+01:00</dc:date><dc:subject>bloom filter </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Alex C. &lt;a href=&#034;http://www.bibsonomy.org/author/Snoeren&#034;&gt;Snoeren&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;SIGCOMM &#039;01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, &lt;/em&gt;&lt;em&gt;Seite3--14. &lt;/em&gt;&lt;em&gt;New York, NY, USA, &lt;/em&gt;&lt;em&gt;ACM, &lt;/em&gt;(&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bloom"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/filter"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2eaf31dd3a9fc180bea6ce287c5719321/chesteve"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2eaf31dd3a9fc180bea6ce287c5719321/chesteve"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Thu Mar 20 00:16:47 CET 2008</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:booktitle>SIGCOMM &#039;01: Proceedings of the 2001 conference on Applications,
	technologies, architectures, and protocols for computer communications</swrc:booktitle><swrc:pages>3--14</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>Hash-based IP traceback</swrc:title><swrc:year>2001</swrc:year><swrc:keywords>bloom filter </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="San Diego, California, United States" swrc:key="location"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1-58113-411-8" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://doi.acm.org/10.1145/383059.383060" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Alex C. Snoeren"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2ab537b160621ec3a9746052d7296cfd7/chesteve"><title>Cache digests</title><link>http://www.bibsonomy.org/bibtex/2ab537b160621ec3a9746052d7296cfd7/chesteve</link><dc:creator>chesteve</dc:creator><dc:date>2008-03-20T00:16:47+01:00</dc:date><dc:subject>bloom filter </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Alex &lt;a href=&#034;http://www.bibsonomy.org/author/Rousskov&#034;&gt;Rousskov&lt;/a&gt;  und Duane &lt;a href=&#034;http://www.bibsonomy.org/author/Wessels&#034;&gt;Wessels&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Comput. Netw. ISDN Syst.&lt;/em&gt;&lt;em&gt;30(22-23):2155--2168&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/bloom"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/filter"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2ab537b160621ec3a9746052d7296cfd7/chesteve"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2ab537b160621ec3a9746052d7296cfd7/chesteve"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Thu Mar 20 00:16:47 CET 2008</swrc:date><swrc:address>Amsterdam, The Netherlands, The Netherlands</swrc:address><swrc:journal>Comput. Netw. ISDN Syst.</swrc:journal><swrc:number>22-23</swrc:number><swrc:pages>2155--2168</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Elsevier Science Publishers B. V."/></swrc:publisher><swrc:title>Cache digests</swrc:title><swrc:volume>30</swrc:volume><swrc:year>1998</swrc:year><swrc:keywords>bloom filter </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="0169-7552" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1016/S0169-7552(98)00251-7" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Alex Rousskov"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Duane Wessels"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2e14189d45c6aec7357f78d5b127bbe37/chesteve"><title>Probabilistic Location and Routing.</title><description>dblp</description><link>http://www.bibsonomy.org/bibtex/2e14189d45c6aec7357f78d5b127bbe37/chesteve</link><dc:creator>chesteve</dc:creator><dc:date>2008-03-20T00:16:47+01:00</dc:date><dc:subject>routing bloom filter </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Sean C. &lt;a href=&#034;http://www.bibsonomy.org/author/Rhea&#034;&gt;Rhea&lt;/a&gt;  und John &lt;a href=&#034;http://www.bibsonomy.org/author/Kubiatowicz&#034;&gt;Kubiatowicz&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;INFOCOM, &lt;/em&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/routing"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bloom"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/filter"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2e14189d45c6aec7357f78d5b127bbe37/chesteve"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2e14189d45c6aec7357f78d5b127bbe37/chesteve"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/infocom/infocom2002.html#RheaK02"/><swrc:date>Thu Mar 20 00:16:47 CET 2008</swrc:date><swrc:booktitle>INFOCOM</swrc:booktitle><swrc:title>Probabilistic Location and Routing.</swrc:title><swrc:year>2002</swrc:year><swrc:keywords>routing bloom filter </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://www.ieee-infocom.org/2002/papers/336.pdf" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2003-10-14" swrc:key="date"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Sean C. Rhea"/></rdf:_1><rdf:_2><swrc:Person swrc:name="John Kubiatowicz"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2240037323ffdd5d99011112bbf2d9699/chesteve"><title>Adaptive web caching: towards a new global caching architecture</title><link>http://www.bibsonomy.org/bibtex/2240037323ffdd5d99011112bbf2d9699/chesteve</link><dc:creator>chesteve</dc:creator><dc:date>2008-03-20T00:16:47+01:00</dc:date><dc:subject>bloom filter caching </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Scott &lt;a href=&#034;http://www.bibsonomy.org/author/Michel&#034;&gt;Michel&lt;/a&gt;  und Khoi &lt;a href=&#034;http://www.bibsonomy.org/author/Nguyen&#034;&gt;Nguyen&lt;/a&gt;  und Adam &lt;a href=&#034;http://www.bibsonomy.org/author/Rosenstein&#034;&gt;Rosenstein&lt;/a&gt;  und Lixia &lt;a href=&#034;http://www.bibsonomy.org/author/Zhang&#034;&gt;Zhang&lt;/a&gt;  und Sally &lt;a href=&#034;http://www.bibsonomy.org/author/Floyd&#034;&gt;Floyd&lt;/a&gt;  und Van &lt;a href=&#034;http://www.bibsonomy.org/author/Jacobson&#034;&gt;Jacobson&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Comput. Netw. ISDN Syst.&lt;/em&gt;&lt;em&gt;30(22-23):2169--2177&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/bloom"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/filter"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/caching"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2240037323ffdd5d99011112bbf2d9699/chesteve"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2240037323ffdd5d99011112bbf2d9699/chesteve"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Thu Mar 20 00:16:47 CET 2008</swrc:date><swrc:address>Amsterdam, The Netherlands, The Netherlands</swrc:address><swrc:journal>Comput. Netw. ISDN Syst.</swrc:journal><swrc:number>22-23</swrc:number><swrc:pages>2169--2177</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Elsevier Science Publishers B. V."/></swrc:publisher><swrc:title>Adaptive web caching: towards a new global caching architecture</swrc:title><swrc:volume>30</swrc:volume><swrc:year>1998</swrc:year><swrc:keywords>bloom filter caching </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="0169-7552" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1016/S0169-7552(98)00246-3" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Scott Michel"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Khoi Nguyen"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Adam Rosenstein"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Lixia Zhang"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Sally Floyd"/></rdf:_5><rdf:_6><swrc:Person swrc:name="Van Jacobson"/></rdf:_6></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2104613095cf15fd5f9fde565efaafc72/chesteve"><title>Summary cache: a scalable wide-area web cache sharing protocol</title><link>http://www.bibsonomy.org/bibtex/2104613095cf15fd5f9fde565efaafc72/chesteve</link><dc:creator>chesteve</dc:creator><dc:date>2008-03-20T00:16:47+01:00</dc:date><dc:subject>bloom filter </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Li &lt;a href=&#034;http://www.bibsonomy.org/author/Fan&#034;&gt;Fan&lt;/a&gt;  und Pei &lt;a href=&#034;http://www.bibsonomy.org/author/Cao&#034;&gt;Cao&lt;/a&gt;  und Jussara &lt;a href=&#034;http://www.bibsonomy.org/author/Almeida&#034;&gt;Almeida&lt;/a&gt;  und Andrei Z. &lt;a href=&#034;http://www.bibsonomy.org/author/Broder&#034;&gt;Broder&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;IEEE/ACM Trans. Netw.&lt;/em&gt;&lt;em&gt;8(3):281--293&lt;/em&gt;(&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bloom"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/filter"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2104613095cf15fd5f9fde565efaafc72/chesteve"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2104613095cf15fd5f9fde565efaafc72/chesteve"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Thu Mar 20 00:16:47 CET 2008</swrc:date><swrc:address>Piscataway, NJ, USA</swrc:address><swrc:journal>IEEE/ACM Trans. Netw.</swrc:journal><swrc:number>3</swrc:number><swrc:pages>281--293</swrc:pages><swrc:publisher><swrc:Organization swrc:name="IEEE Press"/></swrc:publisher><swrc:title>Summary cache: a scalable wide-area web cache sharing protocol</swrc:title><swrc:volume>8</swrc:volume><swrc:year>2000</swrc:year><swrc:keywords>bloom filter </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="1063-6692" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1109/90.851975" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Li Fan"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Pei Cao"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Jussara Almeida"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Andrei Z. Broder"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2379e59e4cd58efa589495f7c490f2a95/chesteve"><title>An architecture for a secure service discovery service</title><link>http://www.bibsonomy.org/bibtex/2379e59e4cd58efa589495f7c490f2a95/chesteve</link><dc:creator>chesteve</dc:creator><dc:date>2008-03-20T00:16:47+01:00</dc:date><dc:subject>bloom filter </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Steven E. &lt;a href=&#034;http://www.bibsonomy.org/author/Czerwinski&#034;&gt;Czerwinski&lt;/a&gt;  und Ben Y. &lt;a href=&#034;http://www.bibsonomy.org/author/Zhao&#034;&gt;Zhao&lt;/a&gt;  und Todd D. &lt;a href=&#034;http://www.bibsonomy.org/author/Hodes&#034;&gt;Hodes&lt;/a&gt;  und Anthony D. &lt;a href=&#034;http://www.bibsonomy.org/author/Joseph&#034;&gt;Joseph&lt;/a&gt;  und Randy H. &lt;a href=&#034;http://www.bibsonomy.org/author/Katz&#034;&gt;Katz&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;MobiCom &#039;99: Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, &lt;/em&gt;&lt;em&gt;Seite24--35. &lt;/em&gt;&lt;em&gt;New York, NY, USA, &lt;/em&gt;&lt;em&gt;ACM, &lt;/em&gt;(&lt;em&gt;1999&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bloom"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/filter"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2379e59e4cd58efa589495f7c490f2a95/chesteve"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2379e59e4cd58efa589495f7c490f2a95/chesteve"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Thu Mar 20 00:16:47 CET 2008</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:booktitle>MobiCom &#039;99: Proceedings of the 5th annual ACM/IEEE international
	conference on Mobile computing and networking</swrc:booktitle><swrc:pages>24--35</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>An architecture for a secure service discovery service</swrc:title><swrc:year>1999</swrc:year><swrc:keywords>bloom filter </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="Seattle, Washington, United States" swrc:key="location"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1-58113-142-9" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://doi.acm.org/10.1145/313451.313462" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Steven E. Czerwinski"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ben Y. Zhao"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Todd D. Hodes"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Anthony D. Joseph"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Randy H. Katz"/></rdf:_5></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/257b8a7ce8e40433601ade42e311a6179/chesteve"><title>Space/time trade-offs in hash coding with allowable errors</title><link>http://www.bibsonomy.org/bibtex/257b8a7ce8e40433601ade42e311a6179/chesteve</link><dc:creator>chesteve</dc:creator><dc:date>2008-03-20T00:16:47+01:00</dc:date><dc:subject>bloom filter </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Burton H. &lt;a href=&#034;http://www.bibsonomy.org/author/Bloom&#034;&gt;Bloom&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Commun. ACM&lt;/em&gt;&lt;em&gt;13(7):422--426&lt;/em&gt;(&lt;em&gt;1970&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bloom"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/filter"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/257b8a7ce8e40433601ade42e311a6179/chesteve"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/257b8a7ce8e40433601ade42e311a6179/chesteve"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Thu Mar 20 00:16:47 CET 2008</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:journal>Commun. ACM</swrc:journal><swrc:number>7</swrc:number><swrc:pages>422--426</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>Space/time trade-offs in hash coding with allowable errors</swrc:title><swrc:volume>13</swrc:volume><swrc:year>1970</swrc:year><swrc:keywords>bloom filter </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="0001-0782" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://doi.acm.org/10.1145/362686.362692" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Burton H. Bloom"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/23cfa3dfe79ca746fe67aa5e68e99dfc1/chesteve"><title>Cache-, Hash- and Space-Efficient Bloom Filters</title><link>http://www.bibsonomy.org/bibtex/23cfa3dfe79ca746fe67aa5e68e99dfc1/chesteve</link><dc:creator>chesteve</dc:creator><dc:date>2008-03-20T00:16:47+01:00</dc:date><dc:subject>Filter Bloom </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Felix &lt;a href=&#034;http://www.bibsonomy.org/author/Putze&#034;&gt;Putze&lt;/a&gt;  und Peter &lt;a href=&#034;http://www.bibsonomy.org/author/Sanders&#034;&gt;Sanders&lt;/a&gt;  und Johannes &lt;a href=&#034;http://www.bibsonomy.org/author/Singler&#034;&gt;Singler&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;WEA, &lt;/em&gt;&lt;em&gt;Seite108-121. &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/Filter"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Bloom"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/23cfa3dfe79ca746fe67aa5e68e99dfc1/chesteve"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/23cfa3dfe79ca746fe67aa5e68e99dfc1/chesteve"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Thu Mar 20 00:16:47 CET 2008</swrc:date><swrc:booktitle>WEA</swrc:booktitle><swrc:crossref>DBLP:conf/wea/2007</swrc:crossref><swrc:pages>108-121</swrc:pages><swrc:title>Cache-, Hash- and Space-Efficient Bloom Filters</swrc:title><swrc:year>2007</swrc:year><swrc:keywords>Filter Bloom </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/978-3-540-72845-0_9" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="DBLP, http://dblp.uni-trier.de" swrc:key="bibsource"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Felix Putze"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Peter Sanders"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Johannes Singler"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item></rdf:RDF>