<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/author/Kempe"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /author/Kempe</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2ed42abde4535669c1bf2aeff272dd24d/monoid"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2ed42abde4535669c1bf2aeff272dd24d/monoid"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Wed Jan 25 07:56:31 CET 2012</swrc:date><swrc:journal>J. Comput. Syst. Sci.</swrc:journal><swrc:number>1</swrc:number><swrc:pages>70-83</swrc:pages><swrc:title>A decentralized algorithm for spectral analysis</swrc:title><swrc:volume>74</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>expanders </swrc:keywords><swrc:abstract>In many large network settings, such as computer networks, social networks, or hyperlinked text documents, much information can be obtained from the network&#039;s spectral properties. However, traditional centralized approaches for computing eigenvectors struggle with at least two obstacles: the data may be difficult to obtain (both due to technical reasons and because of privacy concerns), and the sheer size of the networks makes the computation expensive. A decentralized, distributed algorithm addresses both of these obstacles: it utilizes the computational power of all nodes in the network and their ability to communicate, thus speeding up the computation with the network size. And as each node knows its incident edges, the data collection problem is avoided as well.

Our main result is a simple decentralized algorithm for computing the top k eigenvectors of a symmetric weighted adjacency matrix, and a proof that it converges essentially in O(τmixlog2n) rounds of communication and computation, where τmix is the mixing time of a random walk on the network. An additional contribution of our work is a decentralized way of actually detecting convergence, and diagnosing the current error. Our protocol scales well, in that the amount of computation performed at any node in any one round, and the sizes of messages sent, depend linearly on the degree of the node, polynomially on k, but not at all on the (typically much larger) number n of nodes. To achieve independence of n, the coordinates of the computed eigenvectors are held locally by the nodes to which they correspond, enabling many eigenanalyses without distributing complete global state.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="DBLP, http://dblp.uni-trier.de" swrc:key="bibsource"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1016/j.jcss.2007.04.014" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="David Kempe"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Frank McSherry"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2b71d5f3dfb046c1194f3981d0dc5faf8/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2b71d5f3dfb046c1194f3981d0dc5faf8/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/iccS/iccS2006-3.html#GolubchikCDDGKOSSSZ06"/><swrc:date>Sun Jan 15 00:00:00 CET 2012</swrc:date><swrc:booktitle>International Conference on Computational Science (3)</swrc:booktitle><swrc:crossref>conf/iccS/2006-3</swrc:crossref><swrc:pages>514-521</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>A Generic Multi-scale Modeling Framework for Reactive Observing Systems: An Overview.</swrc:title><swrc:volume>3993</swrc:volume><swrc:year>2006</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/11758532_68" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-34383-0" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Leana Golubchik"/></rdf:_1><rdf:_2><swrc:Person swrc:name="David A. Caron"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Abhimanyu Das"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Amit Dhariwal"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Ramesh Govindan"/></rdf:_5><rdf:_6><swrc:Person swrc:name="David Kempe"/></rdf:_6><rdf:_7><swrc:Person swrc:name="Carl Oberg"/></rdf:_7><rdf:_8><swrc:Person swrc:name="Abhishek Sharma"/></rdf:_8><rdf:_9><swrc:Person swrc:name="Beth Stauffer"/></rdf:_9><rdf:_10><swrc:Person swrc:name="Gaurav S. Sukhatme"/></rdf:_10><rdf:_11><swrc:Person swrc:name="Bin Zhang 0010"/></rdf:_11></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Vassil N. Alexandrov"/></rdf:_1><rdf:_2><swrc:Person swrc:name="G. Dick van Albada"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Peter M. A. Sloot"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Jack Dongarra"/></rdf:_4></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/267df78ea253affbc86d9a245a8b21ec1/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/267df78ea253affbc86d9a245a8b21ec1/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/iccS/iccS2007-1.html#CaronDDGGKOSSSZ07"/><swrc:date>Sun Jan 15 00:00:00 CET 2012</swrc:date><swrc:booktitle>International Conference on Computational Science (1)</swrc:booktitle><swrc:crossref>conf/iccS/2007-1</swrc:crossref><swrc:pages>995-1001</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>AMBROSia: An Autonomous Model-Based Reactive Observing System.</swrc:title><swrc:volume>4487</swrc:volume><swrc:year>2007</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/978-3-540-72584-8_131" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="978-3-540-72583-1" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="David A. Caron"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Abhimanyu Das"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Amit Dhariwal"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Leana Golubchik"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Ramesh Govindan"/></rdf:_5><rdf:_6><swrc:Person swrc:name="David Kempe"/></rdf:_6><rdf:_7><swrc:Person swrc:name="Carl Oberg"/></rdf:_7><rdf:_8><swrc:Person swrc:name="Abhishek Sharma"/></rdf:_8><rdf:_9><swrc:Person swrc:name="Beth Stauffer"/></rdf:_9><rdf:_10><swrc:Person swrc:name="Gaurav Sukhatme"/></rdf:_10><rdf:_11><swrc:Person swrc:name="Bin Zhang 0010"/></rdf:_11></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Yong Shi"/></rdf:_1><rdf:_2><swrc:Person swrc:name="G. Dick van Albada"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Jack Dongarra"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Peter M. A. Sloot"/></rdf:_4></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/236195cb25eb0159bbd80446847089f2f/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/236195cb25eb0159bbd80446847089f2f/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr1112.html#abs-1112-3680"/><swrc:date>Sun Jan 01 00:00:00 CET 2012</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>The Robust Price of Anarchy of Altruistic Games</swrc:title><swrc:volume>abs/1112.3680</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/1112.3680" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Po-An Chen"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Bart de Keijzer"/></rdf:_2><rdf:_3><swrc:Person swrc:name="David Kempe"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Guido Schäfer"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2229405b9593ea4258e23c5800fa576fb/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2229405b9593ea4258e23c5800fa576fb/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/acl/acl97.html#Kempe97"/><swrc:date>Fri Dec 23 00:00:00 CET 2011</swrc:date><swrc:booktitle>ACL</swrc:booktitle><swrc:crossref>conf/acl/1997</swrc:crossref><swrc:pages>460-467</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Morgan Kaufmann Publishers / ACL"/></swrc:publisher><swrc:title>Finite State Transducers Approximating Hidden Markov Models.</swrc:title><swrc:year>1997</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://aclweb.org/anthology-new/P/P97/" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="André Kempe"/></rdf:_1></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Philip R. Cohen"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Wolfgang Wahlster"/></rdf:_2></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/275c48128e8b43ad8f1572be66cca54dd/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/275c48128e8b43ad8f1572be66cca54dd/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/icml/icml2011.html#DasK11"/><swrc:date>Fri Dec 16 00:00:00 CET 2011</swrc:date><swrc:booktitle>ICML</swrc:booktitle><swrc:crossref>conf/icml/2011</swrc:crossref><swrc:pages>1057-1064</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Omnipress"/></swrc:publisher><swrc:title>Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection.</swrc:title><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Abhimanyu Das"/></rdf:_1><rdf:_2><swrc:Person swrc:name="David Kempe"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Lise Getoor"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Tobias Scheffer"/></rdf:_2></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2aaa7a6e7f0fafa3c65856a16d2283175/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2aaa7a6e7f0fafa3c65856a16d2283175/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/eccc/eccc13.html#GavinskyKW06"/><swrc:date>Wed Dec 07 00:00:00 CET 2011</swrc:date><swrc:journal>Electronic Colloquium on Computational Complexity (ECCC)</swrc:journal><swrc:number>086</swrc:number><swrc:title>Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function.</swrc:title><swrc:volume>13</swrc:volume><swrc:year>2006</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://eccc.hpi-web.de/eccc-reports/2006/TR06-086/index.html" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Dmitry Gavinsky"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Julia Kempe"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Ronald de Wolf"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2149b3ebae9e813f8ef4274080d57fb77/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2149b3ebae9e813f8ef4274080d57fb77/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0110.html#cs-CL-0110027"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Part-of-Speech Tagging with Two Sequential Transducers</swrc:title><swrc:volume>cs.CL/0110027</swrc:volume><swrc:year>2001</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/cs.CL/0110027" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="André Kempe"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2df6cc57afd86c788036feab89cb487e9/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2df6cc57afd86c788036feab89cb487e9/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0010.html#cs-CL-0010030"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Reduction of Intermediate Alphabets in Finite-State Transducer Cascades</swrc:title><swrc:volume>cs.CL/0010030</swrc:volume><swrc:year>2000</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/cs.CL/0010030" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="André Kempe"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/28182b6a11b43389fe82382f9bf6f86b2/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/28182b6a11b43389fe82382f9bf6f86b2/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0912.html#abs-0912-3310"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Frugal and Truthful Auctions for Vertex Covers, Flows, and Cuts</swrc:title><swrc:volume>abs/0912.3310</swrc:volume><swrc:year>2009</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/0912.3310" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="David Kempe"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Mahyar Salek"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Cristopher Moore"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2be22b281137ca6e8de67dfe77ede6db9/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2be22b281137ca6e8de67dfe77ede6db9/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0411.html#quant-ph-0411051"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Quantum Communication Cannot Simulate a Public Coin</swrc:title><swrc:volume>quant-ph/0411051</swrc:volume><swrc:year>2004</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/quant-ph/0411051" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Dmitry Gavinsky"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Julia Kempe"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Ronald de Wolf"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2b982dc25846d1a30f1c6db64047a6801/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2b982dc25846d1a30f1c6db64047a6801/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr9802.html#cmp-lg-9802001"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Look-Back and Look-Ahead in the Conversion of Hidden Markov Models into Finite State Transducers</swrc:title><swrc:volume>cmp-lg/9802001</swrc:volume><swrc:year>1998</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/cmp-lg/9802001" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="André Kempe"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/222e342ced606a68d4c9b4c38161d021e/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/222e342ced606a68d4c9b4c38161d021e/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr1106.html#abs-1106-2378"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>False-name-proof Mechanisms for Hiring a Team</swrc:title><swrc:volume>abs/1106.2378</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/1106.2378" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Atsushi Iwasaki"/></rdf:_1><rdf:_2><swrc:Person swrc:name="David Kempe"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Mahyar Salek"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Makoto Yokoo"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2d779cfb8961e222c2faa3338524b4df0/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2d779cfb8961e222c2faa3338524b4df0/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0603.html#abs-quant-ph-0603173"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Strengths and Weaknesses of Quantum Fingerprinting</swrc:title><swrc:volume>abs/quant-ph/0603173</swrc:volume><swrc:year>2006</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/quant-ph/0603173" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Dmitry Gavinsky"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Julia Kempe"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Ronald de Wolf"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/276a3a68fb7a03a5fe8acfe25fdd42eaf/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/276a3a68fb7a03a5fe8acfe25fdd42eaf/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr1101.html#abs-1101-3804"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Estimating the Average of a Lipschitz-Continuous Function from One Sample</swrc:title><swrc:volume>abs/1101.3804</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/1101.3804" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Abhimanyu Das"/></rdf:_1><rdf:_2><swrc:Person swrc:name="David Kempe"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2b3a5c7028682380e433d744831dc5834/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2b3a5c7028682380e433d744831dc5834/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr1104.html#abs-1104-5362"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Selected Operations, Algorithms, and Applications of n-Tape Weighted Finite-State Machines</swrc:title><swrc:volume>abs/1104.5362</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/1104.5362" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="André Kempe"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/28303082cbd3175fa62b0ae074c288f24/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/28303082cbd3175fa62b0ae074c288f24/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0503.html#abs-cond-mat-0503087"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in Regular Graphs</swrc:title><swrc:volume>abs/cond-mat/0503087</swrc:volume><swrc:year>2005</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/cond-mat/0503087" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Dimitris Achlioptas"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Aaron Clauset"/></rdf:_2><rdf:_3><swrc:Person swrc:name="David Kempe"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Cristopher Moore"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2ab31749c0c5ec3b94aa67e52619bce53/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2ab31749c0c5ec3b94aa67e52619bce53/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0911.html#abs-0911-0201"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>No Strong Parallel Repetition with Entangled and Non-signaling Provers</swrc:title><swrc:volume>abs/0911.0201</swrc:volume><swrc:year>2009</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/0911.0201" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Julia Kempe"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Oded Regev"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2bfdb133b7aa13e444154903e361d323a/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2bfdb133b7aa13e444154903e361d323a/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0406.html#cs-CL-0406003"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Algorithms for weighted multi-tape automata</swrc:title><swrc:volume>cs.CL/0406003</swrc:volume><swrc:year>2004</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/cs.CL/0406003" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="André Kempe"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Franck Guingne"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Florent Nicart"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/22bbc8ed88c6e980a62e52f2318b86e2a/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/22bbc8ed88c6e980a62e52f2318b86e2a/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr1101.html#abs-1101-3884"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Approximation algorithms for QMA-complete problems</swrc:title><swrc:volume>abs/1101.3884</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/1101.3884" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Sevag Gharibian"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Julia Kempe"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></rdf:RDF>
