<?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/Holzer"><title>BibSonomy publications for /author/Holzer</title><link>BibSonomypublrss/author/Holzer</link><description>BibSonomy RSS feed for /author/Holzer</description><dc:date>2012-02-15T19:14:45+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/297610f61952e6ea4fa5f8d3ad37d80c6/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/231e91b26b3f6d58590a28ebb2034425c/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/267c976474d26fe8942e805240348bc01/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25da7eb546ef7f2abe829da1b4ce8730b/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2eb84884bd051e21b905ad37ddc8e19d0/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/26aedaa92f76eedc35dd6766cec25d7e4/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2db56a438b5d654f6177bc76f8f50ae1d/pbrada"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/21414123d697334d01e03b092bf726e34/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/273cc7e7d262bb755a461807df6e2608d/hanbury"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24ac8903e48df654f4a2a5394517b266c/hanbury"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24027c106dd24ad8825007ddecd0614a1/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2c24b4d0642425cc6852e372efedf1879/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2db99db102918325f379f645b8ecb379b/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/284f82db5bd4d4b3a690f20284a728342/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24663cfdf33059ec63dc05456f6873a6a/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2c0b84ff37cefa5fa9c0eee76cba18dae/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2ff2999b0bd27c84338aa5546f1c803ad/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2b2401b23bf0f224360d2882da405b99e/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2e165a688159979be3efbe2fb52d6c5c5/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d712fe10e907fc98ad952b5250e9510e/dblp"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/297610f61952e6ea4fa5f8d3ad37d80c6/dblp"><title>Preface.</title><link>http://www.bibsonomy.org/bibtex/297610f61952e6ea4fa5f8d3ad37d80c6/dblp</link><dc:creator>dblp</dc:creator><dc:date>2012-02-10T00: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/Bordihn&#034;&gt;Henning Bordihn&lt;/a&gt;, &lt;a href=&#034;/author/Freund&#034;&gt;Rudolf Freund&lt;/a&gt;, &lt;a href=&#034;/author/Hirvensalo&#034;&gt;Mika Hirvensalo&lt;/a&gt;, &lt;a href=&#034;/author/Holzer&#034;&gt;Markus Holzer&lt;/a&gt;, &lt;a href=&#034;/author/Kutrib&#034;&gt;Martin Kutrib&lt;/a&gt;,  and &lt;a href=&#034;/author/Otto&#034;&gt;Friedrich Otto&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Fundam. Inform.&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/231e91b26b3f6d58590a28ebb2034425c/dblp"><title>Networks cannot compute their diameter in sublinear time.</title><link>http://www.bibsonomy.org/bibtex/231e91b26b3f6d58590a28ebb2034425c/dblp</link><dc:creator>dblp</dc:creator><dc:date>2012-01-27T00: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/Frischknecht&#034;&gt;Silvio Frischknecht&lt;/a&gt;, &lt;a href=&#034;/author/Holzer&#034;&gt;Stephan Holzer&lt;/a&gt;,  and &lt;a href=&#034;/author/Wattenhofer&#034;&gt;Roger Wattenhofer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;SODA, &lt;/em&gt;&lt;em&gt;page 1150-1162. &lt;/em&gt;&lt;em&gt;SIAM, &lt;/em&gt;(&lt;em&gt;2012&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/267c976474d26fe8942e805240348bc01/dblp"><title>Multimodal templates for real-time detection of texture-less objects in heavily cluttered scenes.</title><link>http://www.bibsonomy.org/bibtex/267c976474d26fe8942e805240348bc01/dblp</link><dc:creator>dblp</dc:creator><dc:date>2012-01-19T00: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/Hinterstoisser&#034;&gt;Stefan Hinterstoisser&lt;/a&gt;, &lt;a href=&#034;/author/Holzer&#034;&gt;Stefan Holzer&lt;/a&gt;, &lt;a href=&#034;/author/Cagniart&#034;&gt;Cedric Cagniart&lt;/a&gt;, &lt;a href=&#034;/author/Ilic&#034;&gt;Slobodan Ilic&lt;/a&gt;, &lt;a href=&#034;/author/Konolige&#034;&gt;Kurt Konolige&lt;/a&gt;, &lt;a href=&#034;/author/Navab&#034;&gt;Nassir Navab&lt;/a&gt;,  and &lt;a href=&#034;/author/Lepetit&#034;&gt;Vincent Lepetit&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ICCV, &lt;/em&gt;&lt;em&gt;page 858-865. &lt;/em&gt;&lt;em&gt;IEEE, &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/25da7eb546ef7f2abe829da1b4ce8730b/dblp"><title>Expressing Uniformity via Oracles</title><link>http://www.bibsonomy.org/bibtex/25da7eb546ef7f2abe829da1b4ce8730b/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-29T00: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/Damm&#034;&gt;Carsten Damm&lt;/a&gt;, &lt;a href=&#034;/author/Holzer&#034;&gt;Markus Holzer&lt;/a&gt;,  and &lt;a href=&#034;/author/Rossmanith&#034;&gt;Peter Rossmanith&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Universität Trier, Mathematik/Informatik, Forschungsbericht&lt;/em&gt;  (&lt;em&gt;1995&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/2eb84884bd051e21b905ad37ddc8e19d0/dblp"><title>Inductive Counting below LOGSPACE</title><link>http://www.bibsonomy.org/bibtex/2eb84884bd051e21b905ad37ddc8e19d0/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-29T00: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/Damm&#034;&gt;Carsten Damm&lt;/a&gt;,  and &lt;a href=&#034;/author/Holzer&#034;&gt;Markus Holzer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Universität Trier, Mathematik/Informatik, Forschungsbericht&lt;/em&gt;  (&lt;em&gt;1994&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/26aedaa92f76eedc35dd6766cec25d7e4/dblp"><title>The Complexity of Regular-like Expressions.</title><link>http://www.bibsonomy.org/bibtex/26aedaa92f76eedc35dd6766cec25d7e4/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/Holzer&#034;&gt;Markus Holzer&lt;/a&gt;,  and &lt;a href=&#034;/author/Kutrib&#034;&gt;Martin Kutrib&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Int. J. Found. Comput. Sci.&lt;/em&gt; &lt;em&gt;22(7):1533-1548&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/2db56a438b5d654f6177bc76f8f50ae1d/pbrada"><title>Seamless Testing for Models and Code</title><link>http://www.bibsonomy.org/bibtex/2db56a438b5d654f6177bc76f8f50ae1d/pbrada</link><dc:creator>pbrada</dc:creator><dc:date>2011-12-16T09:35:52+01:00</dc:date><dc:subject>sweng testing specification </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Holzer&#034;&gt;Andreas Holzer&lt;/a&gt;, &lt;a href=&#034;/author/Januzaj&#034;&gt;Visar Januzaj&lt;/a&gt;, &lt;a href=&#034;/author/Kugele&#034;&gt;Stefan Kugele&lt;/a&gt;, &lt;a href=&#034;/author/Langer&#034;&gt;Boris Langer&lt;/a&gt;, &lt;a href=&#034;/author/Schallhart&#034;&gt;Christian Schallhart&lt;/a&gt;, &lt;a href=&#034;/author/Tautschnig&#034;&gt;Michael Tautschnig&lt;/a&gt;,  and &lt;a href=&#034;/author/Veith&#034;&gt;Helmut Veith&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Fundamental Approaches to Software Engineering, &lt;/em&gt;&lt;em&gt;volume 6603 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 278--293. &lt;/em&gt;&lt;em&gt;Springer, &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/sweng"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/testing"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/specification"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/21414123d697334d01e03b092bf726e34/dblp"><title>Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence.</title><link>http://www.bibsonomy.org/bibtex/21414123d697334d01e03b092bf726e34/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-09T00: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/ter Beek&#034;&gt;Maurice H. ter Beek&lt;/a&gt;, &lt;a href=&#034;/author/Csuhaj-Varjú&#034;&gt;Erzsébet Csuhaj-Varjú&lt;/a&gt;, &lt;a href=&#034;/author/Holzer&#034;&gt;Markus Holzer&lt;/a&gt;,  and &lt;a href=&#034;/author/Vaszil&#034;&gt;György Vaszil&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Computation, Cooperation, and Life, &lt;/em&gt;&lt;em&gt;volume 6610 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 70-89. &lt;/em&gt;&lt;em&gt;Springer, &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/273cc7e7d262bb755a461807df6e2608d/hanbury"><title>Evaluation of Fast 2D and 3D Medical Image Retrieval Approaches based on Image Miniatures</title><link>http://www.bibsonomy.org/bibtex/273cc7e7d262bb755a461807df6e2608d/hanbury</link><dc:creator>hanbury</dc:creator><dc:date>2011-12-08T16:02:55+01:00</dc:date><dc:subject>khresmoi-project </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Donner&#034;&gt;René Donner&lt;/a&gt;, &lt;a href=&#034;/author/Haas&#034;&gt;Sebastian Haas&lt;/a&gt;, &lt;a href=&#034;/author/Burner&#034;&gt;Andreas Burner&lt;/a&gt;, &lt;a href=&#034;/author/Holzer&#034;&gt;Markus Holzer&lt;/a&gt;, &lt;a href=&#034;/author/Bischof&#034;&gt;Horst Bischof&lt;/a&gt;,  and &lt;a href=&#034;/author/Langs&#034;&gt;Georg Langs&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proc. MICCAI 2011 Workshop on Medical Content-based Retrieval for Clinical Decision Support, &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/khresmoi-project"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/24ac8903e48df654f4a2a5394517b266c/hanbury"><title>SuperPixel-based Interest Points for Effective Bags of Visual Words Medical Image Retrieval</title><link>http://www.bibsonomy.org/bibtex/24ac8903e48df654f4a2a5394517b266c/hanbury</link><dc:creator>hanbury</dc:creator><dc:date>2011-12-08T16:01:08+01:00</dc:date><dc:subject>khresmoi-project </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Haas&#034;&gt;Sebastian Haas&lt;/a&gt;, &lt;a href=&#034;/author/Donner&#034;&gt;René Donner&lt;/a&gt;, &lt;a href=&#034;/author/Burner&#034;&gt;Andreas Burner&lt;/a&gt;, &lt;a href=&#034;/author/Holzer&#034;&gt;Markus Holzer&lt;/a&gt;,  and &lt;a href=&#034;/author/Langs&#034;&gt;Georg Langs&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proc. MICCAI 2011 Workshop on Medical Content-based Retrieval for Clinical Decision Support, &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/khresmoi-project"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/24027c106dd24ad8825007ddecd0614a1/dblp"><title>Finding Lower Bounds for Nondeterministic State Complexity is Hard.</title><link>http://www.bibsonomy.org/bibtex/24027c106dd24ad8825007ddecd0614a1/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-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/Gruber&#034;&gt;Hermann Gruber&lt;/a&gt;,  and &lt;a href=&#034;/author/Holzer&#034;&gt;Markus Holzer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Electronic Colloquium on Computational Complexity ECCC&lt;/em&gt;  (&lt;em&gt;2006&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/2c24b4d0642425cc6852e372efedf1879/dblp"><title>Equilibria of Graphical Games with Symmetries.</title><link>http://www.bibsonomy.org/bibtex/2c24b4d0642425cc6852e372efedf1879/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-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/Brandt&#034;&gt;Felix Brandt&lt;/a&gt;, &lt;a href=&#034;/author/Fischer&#034;&gt;Felix A. Fischer&lt;/a&gt;,  and &lt;a href=&#034;/author/Holzer&#034;&gt;Markus Holzer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Electronic Colloquium on Computational Complexity ECCC&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/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2db99db102918325f379f645b8ecb379b/dblp"><title>The Complexity of Tensor Calculus</title><link>http://www.bibsonomy.org/bibtex/2db99db102918325f379f645b8ecb379b/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-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/Damm&#034;&gt;Carsten Damm&lt;/a&gt;, &lt;a href=&#034;/author/Holzer&#034;&gt;Markus Holzer&lt;/a&gt;,  and &lt;a href=&#034;/author/McKenzie&#034;&gt;Pierre McKenzie&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Electronic Colloquium on Computational Complexity ECCC&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/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/284f82db5bd4d4b3a690f20284a728342/dblp"><title>On Iterated Dominance, Matrix Elimination, and Matched Paths.</title><link>http://www.bibsonomy.org/bibtex/284f82db5bd4d4b3a690f20284a728342/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-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/Brandt&#034;&gt;Felix Brandt&lt;/a&gt;, &lt;a href=&#034;/author/Fischer&#034;&gt;Felix A. Fischer&lt;/a&gt;,  and &lt;a href=&#034;/author/Holzer&#034;&gt;Markus Holzer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Electronic Colloquium on Computational Complexity ECCC&lt;/em&gt;  (&lt;em&gt;2008&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/24663cfdf33059ec63dc05456f6873a6a/dblp"><title>Symmetries and the Complexity of Pure Nash Equilibrium.</title><link>http://www.bibsonomy.org/bibtex/24663cfdf33059ec63dc05456f6873a6a/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-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/Brandt&#034;&gt;Felix Brandt&lt;/a&gt;, &lt;a href=&#034;/author/Fischer&#034;&gt;Felix A. Fischer&lt;/a&gt;,  and &lt;a href=&#034;/author/Holzer&#034;&gt;Markus Holzer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Electronic Colloquium on Computational Complexity ECCC&lt;/em&gt;  (&lt;em&gt;2006&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/2c0b84ff37cefa5fa9c0eee76cba18dae/dblp"><title>Distributed Verification and Hardness of Distributed Approximation</title><link>http://www.bibsonomy.org/bibtex/2c0b84ff37cefa5fa9c0eee76cba18dae/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/Sarma&#034;&gt;Atish Das Sarma&lt;/a&gt;, &lt;a href=&#034;/author/Holzer&#034;&gt;Stephan Holzer&lt;/a&gt;, &lt;a href=&#034;/author/Kor&#034;&gt;Liah Kor&lt;/a&gt;, &lt;a href=&#034;/author/Korman&#034;&gt;Amos Korman&lt;/a&gt;, &lt;a href=&#034;/author/Nanongkai&#034;&gt;Danupon Nanongkai&lt;/a&gt;, &lt;a href=&#034;/author/Pandurangan&#034;&gt;Gopal Pandurangan&lt;/a&gt;, &lt;a href=&#034;/author/Peleg&#034;&gt;David Peleg&lt;/a&gt;,  and &lt;a href=&#034;/author/Wattenhofer&#034;&gt;Roger Wattenhofer&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/2ff2999b0bd27c84338aa5546f1c803ad/dblp"><title>On Iterated Dominance, Matrix Elimination, and Matched Paths</title><link>http://www.bibsonomy.org/bibtex/2ff2999b0bd27c84338aa5546f1c803ad/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/Brandt&#034;&gt;Felix Brandt&lt;/a&gt;, &lt;a href=&#034;/author/Fischer&#034;&gt;Felix A. Fischer&lt;/a&gt;,  and &lt;a href=&#034;/author/Holzer&#034;&gt;Markus Holzer&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/2b2401b23bf0f224360d2882da405b99e/dblp"><title>Detecting and Tracking People in Motion - A Hybrid Approach Combining 3D Reconstruction and 2D Description.</title><link>http://www.bibsonomy.org/bibtex/2b2401b23bf0f224360d2882da405b99e/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-29T00: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/Holzer&#034;&gt;Peter Holzer&lt;/a&gt;, &lt;a href=&#034;/author/Li&#034;&gt;Chunming Li&lt;/a&gt;,  and &lt;a href=&#034;/author/Pinz&#034;&gt;Axel Pinz&lt;/a&gt; &lt;/span&gt;&lt;em&gt;VISAPP, &lt;/em&gt;&lt;em&gt;page 561-568. &lt;/em&gt;&lt;em&gt;SciTePress, &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/2e165a688159979be3efbe2fb52d6c5c5/dblp"><title>Shape independent VLSI-architecture design approach for 2D morphological operations with non-flat structuring elements.</title><link>http://www.bibsonomy.org/bibtex/2e165a688159979be3efbe2fb52d6c5c5/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-29T00: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/Holzer&#034;&gt;Markus Holzer&lt;/a&gt;, &lt;a href=&#034;/author/Schumacher&#034;&gt;Frank Schumacher&lt;/a&gt;, &lt;a href=&#034;/author/Greiner&#034;&gt;Thomas Greiner&lt;/a&gt;,  and &lt;a href=&#034;/author/Rosenstiel&#034;&gt;Wolfgang Rosenstiel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ICECS, &lt;/em&gt;&lt;em&gt;page 579-582. &lt;/em&gt;&lt;em&gt;IEEE, &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/2d712fe10e907fc98ad952b5250e9510e/dblp"><title>BROADTRIP: Broadcast for transit in platoons.</title><link>http://www.bibsonomy.org/bibtex/2d712fe10e907fc98ad952b5250e9510e/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-25T00: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/Holzer&#034;&gt;Adrian Holzer&lt;/a&gt;, &lt;a href=&#034;/author/Maaroufi&#034;&gt;Saida Maaroufi&lt;/a&gt;,  and &lt;a href=&#034;/author/Pierre&#034;&gt;Samuel Pierre&lt;/a&gt; &lt;/span&gt;&lt;em&gt;WiMob, &lt;/em&gt;&lt;em&gt;page 301-306. &lt;/em&gt;&lt;em&gt;IEEE, &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></rdf:RDF>
