<?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/author/Knuth"><title>BibSonomy publications for /author/Knuth</title><link>BibSonomypublrss/author/Knuth</link><description>BibSonomy RSS feed for /author/Knuth</description><dc:date>2012-02-15T13:21:28+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f6b86e734f1c6f24ccd0052cdce1b786/roni.stern"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2e7281e1fa586fd3501b3436ed4699567/schmidt2"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25b30dc5a067013300125d01cb68e3a49/cerniagigante"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2de20476b50d647b4f8bc645a929995f2/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d2201d750cb2a67137ae2c2a890734b5/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2be5decbddaebaf1b7ed14b54997e29af/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25fbab9701b43ed4f796e48ae35e8f57d/ji"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/266aca2733a5a248f0bf8070bbf2294b5/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25f03d30c645e6ded110ef193b32e92ca/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/28e216ae5bc7d24b5f715d1a88ad96d43/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2c9da60b74aeb1291a25d2d0f138a007a/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/210c6b20a5f3f9e9d99d576a3e1b04f25/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/28f4374e7b95b567640527ee44de0dab8/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23e96f3d67cbf0efc9fc2f92ca86bded0/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24771135a6764490e92c760cd583b6e89/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/245be06da83bc5d5906d4e5a62e110514/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a9da22e34611255b4e0243c746d2234d/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/251b045f0d530fd04988d1bf78c6755d5/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2583c61ae31226b7eca12d867571304f0/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27bc59ce0b790c891272c3301029ddc36/dblp"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2f6b86e734f1c6f24ccd0052cdce1b786/roni.stern"><title>Estimating the Efficiency of Backtrack Programs</title><link>http://www.bibsonomy.org/bibtex/2f6b86e734f1c6f24ccd0052cdce1b786/roni.stern</link><dc:creator>roni.stern</dc:creator><dc:date>2012-02-06T10:47:14+01:00</dc:date><dc:subject>imported </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Knuth&#034;&gt;D. E. Knuth&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Math. Comp.&lt;/em&gt;  (&lt;em&gt;1975&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2e7281e1fa586fd3501b3436ed4699567/schmidt2"><title>An Earthshaking Announcement</title><link>http://www.bibsonomy.org/bibtex/2e7281e1fa586fd3501b3436ed4699567/schmidt2</link><dc:creator>schmidt2</dc:creator><dc:date>2012-01-03T13:02:41+01:00</dc:date><dc:subject>donald_knuth fun itex latex tex tug tugboat unicode xml </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Knuth&#034;&gt;Donald Knuth&lt;/a&gt; &lt;/span&gt;&lt;em&gt;TUGboat - Communications of the TeX Users Group, &lt;/em&gt;&lt;em&gt; 31, &lt;/em&gt;&lt;em&gt;TeX Users Group, &lt;/em&gt;(&lt;em&gt;June 2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/donald_knuth"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/fun"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/itex"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/latex"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tex"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tug"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tugboat"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/unicode"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/xml"/></rdf:Bag></taxo:topics><description>https://www.tug.org/TUGboat/Contents/contents31-2.html</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/25b30dc5a067013300125d01cb68e3a49/cerniagigante"><title>Two notes on notation</title><link>http://www.bibsonomy.org/bibtex/25b30dc5a067013300125d01cb68e3a49/cerniagigante</link><dc:creator>cerniagigante</dc:creator><dc:date>2012-01-02T14:48:17+01:00</dc:date><dc:subject>combinatorics computer general mathematics science teaching </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;1992&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><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/general"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mathematics"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/science"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/teaching"/></rdf:Bag></taxo:topics><description>Two notes on notation</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2de20476b50d647b4f8bc645a929995f2/dblp"><title>The Stanford GraphBase: A Platform for Combinatorial Algorithms.</title><link>http://www.bibsonomy.org/bibtex/2de20476b50d647b4f8bc645a929995f2/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-23T00:00:00+01:00</dc:date><dc:subject>dblp </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;SODA, &lt;/em&gt;&lt;em&gt;page 41-43. &lt;/em&gt;&lt;em&gt;ACM/SIAM, &lt;/em&gt;(&lt;em&gt;1993&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2d2201d750cb2a67137ae2c2a890734b5/dblp"><title>Stable Husbands.</title><link>http://www.bibsonomy.org/bibtex/2d2201d750cb2a67137ae2c2a890734b5/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-23T00:00:00+01:00</dc:date><dc:subject>dblp </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;a href=&#034;/author/Motwani&#034;&gt;Rajeev Motwani&lt;/a&gt;,  and &lt;a href=&#034;/author/Pittel&#034;&gt;Boris Pittel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;SODA, &lt;/em&gt;&lt;em&gt;page 397-404. &lt;/em&gt;&lt;em&gt;SIAM, &lt;/em&gt;(&lt;em&gt;1990&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2be5decbddaebaf1b7ed14b54997e29af/dblp"><title>WhoKnows? Evaluating linked data heuristics with a quiz that cleans up DBpedia.</title><link>http://www.bibsonomy.org/bibtex/2be5decbddaebaf1b7ed14b54997e29af/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-08T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Waitelonis&#034;&gt;Jörg Waitelonis&lt;/a&gt;, &lt;a href=&#034;/author/Ludwig&#034;&gt;Nadine Ludwig&lt;/a&gt;, &lt;a href=&#034;/author/Knuth&#034;&gt;Magnus Knuth&lt;/a&gt;,  and &lt;a href=&#034;/author/Sack&#034;&gt;Harald Sack&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Interact. Techn. Smart Edu.&lt;/em&gt; &lt;em&gt;8(4):236-248&lt;/em&gt; (&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/25fbab9701b43ed4f796e48ae35e8f57d/ji"><title>Literate Programming</title><link>http://www.bibsonomy.org/bibtex/25fbab9701b43ed4f796e48ae35e8f57d/ji</link><dc:creator>ji</dc:creator><dc:date>2011-12-07T14:33:14+01:00</dc:date><dc:subject>Pascal TeX literate programming </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Knuth&#034;&gt;D. E. Knuth&lt;/a&gt; &lt;/span&gt;&lt;em&gt;The Computer Journal&lt;/em&gt; &lt;em&gt;27(2):97-111&lt;/em&gt; (&lt;em&gt;1984&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Pascal"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/TeX"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/literate"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/266aca2733a5a248f0bf8070bbf2294b5/dblp"><title>Information Physics: The New Frontier</title><link>http://www.bibsonomy.org/bibtex/266aca2733a5a248f0bf8070bbf2294b5/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Knuth&#034;&gt;Kevin H. Knuth&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/25f03d30c645e6ded110ef193b32e92ca/dblp"><title>Foundations of Inference</title><link>http://www.bibsonomy.org/bibtex/25f03d30c645e6ded110ef193b32e92ca/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Knuth&#034;&gt;Kevin H. Knuth&lt;/a&gt;,  and &lt;a href=&#034;/author/Skilling&#034;&gt;John Skilling&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/28e216ae5bc7d24b5f715d1a88ad96d43/dblp"><title>Evidence-Based Filters for Signal Detection: Application to Evoked Brain Responses</title><link>http://www.bibsonomy.org/bibtex/28e216ae5bc7d24b5f715d1a88ad96d43/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Mubeen&#034;&gt;M. Asim Mubeen&lt;/a&gt;,  and &lt;a href=&#034;/author/Knuth&#034;&gt;Kevin H. Knuth&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2c9da60b74aeb1291a25d2d0f138a007a/dblp"><title>Entropy-Based Search Algorithm for Experimental Design</title><link>http://www.bibsonomy.org/bibtex/2c9da60b74aeb1291a25d2d0f138a007a/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Malakar&#034;&gt;N. K. Malakar&lt;/a&gt;,  and &lt;a href=&#034;/author/Knuth&#034;&gt;K. H. Knuth&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/210c6b20a5f3f9e9d99d576a3e1b04f25/dblp"><title>Structured Programming with go to Statements.</title><link>http://www.bibsonomy.org/bibtex/210c6b20a5f3f9e9d99d576a3e1b04f25/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </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;ACM Comput. Surv.&lt;/em&gt; &lt;em&gt;6(4):261-301&lt;/em&gt; (&lt;em&gt;1974&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/28f4374e7b95b567640527ee44de0dab8/dblp"><title>Von Neumann&#039;s First Computer Program.</title><link>http://www.bibsonomy.org/bibtex/28f4374e7b95b567640527ee44de0dab8/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </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;ACM Comput. Surv.&lt;/em&gt; &lt;em&gt;2(4):247-260&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/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/23e96f3d67cbf0efc9fc2f92ca86bded0/dblp"><title>Irredundant Intervals.</title><link>http://www.bibsonomy.org/bibtex/23e96f3d67cbf0efc9fc2f92ca86bded0/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </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;ACM Journal of Experimental Algorithmics&lt;/em&gt;  (&lt;em&gt;1996&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/24771135a6764490e92c760cd583b6e89/dblp"><title>RISQ! Renowned Individuals Semantic Quiz: a Jeopardy like quiz game for ranking facts.</title><link>http://www.bibsonomy.org/bibtex/24771135a6764490e92c760cd583b6e89/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-20T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Wolf&#034;&gt;Lina Wolf&lt;/a&gt;, &lt;a href=&#034;/author/Knuth&#034;&gt;Magnus Knuth&lt;/a&gt;, &lt;a href=&#034;/author/Osterhoff&#034;&gt;Johannes Osterhoff&lt;/a&gt;,  and &lt;a href=&#034;/author/Sack&#034;&gt;Harald Sack&lt;/a&gt; &lt;/span&gt;&lt;em&gt;I-SEMANTICS, &lt;/em&gt;&lt;em&gt;page 71-78. &lt;/em&gt;&lt;em&gt;ACM, &lt;/em&gt;(&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/245be06da83bc5d5906d4e5a62e110514/dblp"><title>Deletions That Preserve Randomness.</title><link>http://www.bibsonomy.org/bibtex/245be06da83bc5d5906d4e5a62e110514/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-07T00:00:00+01:00</dc:date><dc:subject>dblp </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;IEEE Trans. Software Eng.&lt;/em&gt; &lt;em&gt;3(5):351-359&lt;/em&gt; (&lt;em&gt;1977&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a9da22e34611255b4e0243c746d2234d/dblp"><title>Multiple Prefetch Adaptive Disk Caching.</title><link>http://www.bibsonomy.org/bibtex/2a9da22e34611255b4e0243c746d2234d/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-02T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Grimsrud&#034;&gt;Knuth Stener Grimsrud&lt;/a&gt;, &lt;a href=&#034;/author/Archibald&#034;&gt;James K. Archibald&lt;/a&gt;,  and &lt;a href=&#034;/author/Nelson&#034;&gt;Brent E. Nelson&lt;/a&gt; &lt;/span&gt;&lt;em&gt;IEEE Trans. Knowl. Data Eng.&lt;/em&gt; &lt;em&gt;5(1):88-103&lt;/em&gt; (&lt;em&gt;1993&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/251b045f0d530fd04988d1bf78c6755d5/dblp"><title>Deciphering a linear congruential encryption.</title><link>http://www.bibsonomy.org/bibtex/251b045f0d530fd04988d1bf78c6755d5/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-10-31T00:00:00+01:00</dc:date><dc:subject>dblp </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;IEEE Transactions on Information Theory&lt;/em&gt; &lt;em&gt;31(1):49-52&lt;/em&gt; (&lt;em&gt;1985&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2583c61ae31226b7eca12d867571304f0/dblp"><title>Efficient balanced codes.</title><link>http://www.bibsonomy.org/bibtex/2583c61ae31226b7eca12d867571304f0/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-10-31T00:00:00+01:00</dc:date><dc:subject>dblp </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;IEEE Transactions on Information Theory&lt;/em&gt; &lt;em&gt;32(1):51-53&lt;/em&gt; (&lt;em&gt;1986&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/27bc59ce0b790c891272c3301029ddc36/dblp"><title>Activity in an Interleaved Memory.</title><link>http://www.bibsonomy.org/bibtex/27bc59ce0b790c891272c3301029ddc36/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-10-27T00:00:00+02:00</dc:date><dc:subject>dblp </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;,  and &lt;a href=&#034;/author/Rao&#034;&gt;Gururaj S. Rao&lt;/a&gt; &lt;/span&gt;&lt;em&gt;IEEE Trans. Computers&lt;/em&gt; &lt;em&gt;24(9):943-944&lt;/em&gt; (&lt;em&gt;1975&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item></rdf:RDF>
