@inproceedings{deshpande-barzilay-karger:2007:main,
	title = "Randomized Decoding for Selection-and-Ordering Problems",
	month = "April",
	pages = "444--451",
	publisher = "Association for Computational Linguistics",
	year = "2007",
	venue = "NAACL",
	author = "Deshpande, Pawan and Barzilay, Regina and Karger, David",
	pdf = "http://www.aclweb.org/anthology/N/N07/N07-1056",
	booktitle = "Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Proceedings of the Main Conference",
	cat = "Applications of Theory",
	address = "Rochester, New York",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Randomized%20Decoding%20for%20Selection-and-Ordering%20Problems"
}

@inproceedings{Karger:Relo,
	title = "Incremental exploratory visualization of relationships in large codebases for program comprehension",
	pages = "116--117",
	doi = "http://doi.acm.org/10.1145/1094855.1094891",
	publisher = "ACM Press",
	year = "2005",
	venue = "OOPSLA",
	author = "Sinha, Vineet and Miller, Robert C. and Karger, David",
	pdf = "http://relo.csail.mit.edu/documentation/relo-etx05.pdf",
	location = "San Diego, CA, USA",
	booktitle = "OOPSLA'05 Eclipse Technology eXchange (ETX) Workshop",
	isbn = "1-59593-193-7",
	crossref = "OOPSLA '05: Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications",
	address = "New York, NY, USA",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Incremental%20exploratory%20visualization%20of%20relationships%20in%20large%20codebases%20for%20program%20comprehension"
}

@inproceedings{Karger:FightFire,
	title = "{DoS:} Fighting Fire with Fire",
	month = "November",
	year = "2005",
	venue = "HotNets",
	author = "Walfish, Michael and Balakrishnan, Hari and Karger, David and Shenker, Scott",
	pdf = "http://nms.csail.mit.edu/papers/fightfire-hotnets-2005.pdf",
	booktitle = "4th ACM Workshop on Hot Topics in Networks (HotNets)",
	cat = "Systems",
	crossref = "4th ACM Workshop on Hot Topics in Networks (HotNets)",
	address = "College Park, MD",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#%7BDoS%3A%7D%20Fighting%20Fire%20with%20Fire"
}

@inproceedings{Karger:UncertainShortestPaths,
	title = "Optimal Route Planning under Uncertainty",
	year = "2006",
	venue = "ICAPS",
	author = "Nikolova, Evdokia and Brand, Matthew and Karger, David",
	pdf = "ICAPS0602NikolovaE.pdf",
	booktitle = "Proceedings of 2006 International Conference on Automated Planning and Scheduling (ICAPS 2006)",
	cat = "Theory",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Optimal%20Route%20Planning%20under%20Uncertainty"
}

@inproceedings{Karger:Walsh,
	title = "Local Decoding of Walsh Codes to Reduce CDMA Despreading Computation",
	month = "November",
	year = "2005",
	venue = "SDR",
	author = "Chan, A. and Feldman, Jon and Madyastha, Raghu and Indyk, Piotr and Karger, David",
	pdf = "http://www.vanu.com/wp-content/resources/publications/2.1-01%20Chan_SDR05.pdf",
	booktitle = "Sotware Defined Radio Technical Conference",
	cat = "Applications of Theory and Machine Learning",
	address = "Orange County, CA",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Local%20Decoding%20of%20Walsh%20Codes%20to%20Reduce%20CDMA%20Despreading%20Computation"
}

@article{dht:cacm03,
	title = "Looking up data in P2P systems",
	month = "February",
	year = "2003",
	author = "Balakrishnan, Hari and Kaashoek, M. Frans and Karger, David and Morris, Robert and Stoica, Ion",
	pdf = "http://project-iris.net/irisbib/papers/dht:cacm03/paper.pdf",
	cat = "Systems and P2P",
	journal = "Communications of the ACM",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Looking%20up%20data%20in%20P2P%20systems"
}

@inproceedings{Karger:FirstPathAuction,
	title = "First-price path auctions",
	month = "June",
	pages = "203--212",
	doi = "http://doi.acm.org/10.1145/1064009.1064031",
	publisher = "ACM Press",
	year = "2005",
	venue = "EC",
	author = "Immorlica, Nicole and Karger, David and Nikolova, Evdokia and Sami, Rahul",
	ps = "http://www.umich.edu/ rsami/papers/PAdraft.ps",
	location = "Vancouver, BC, Canada",
	abstract = "We study first-price auction mechanisms for auctioning flow between given nodes in a graph. We assume edges are independent agents with fixed capacities and costs, and their objective is to maximize their profit. We characterize all {\it strong $\epsilon$-Nash equilibria} of a first-price auction for this problem, and show that the total payment is never significantly more than, and often less than, the well known dominant strategy Vickrey-Clark-Groves (VCG) mechanism. We then present a randomized version of the first-price auction, for which the equilibrium condition can be relaxed to $\epsilon$-Nash equilibrium. We next consider a model in which the amount of demand is uncertain, but its probability distribution is known to the edges. For this model, we show that a simple {\em ex ante} first-price auction may not have any $\epsilon$-Nash equilibria. We then present a modified auction mechanism with $2$-parameter bids, and show that it has an $\epsilon$-Nash equilibrium.",
	booktitle = "EC '05: Proceedings of the 6th ACM conference on Electronic commerce",
	isbn = "1-59593-049-3",
	cat = "Theory and Mechanism Design",
	address = "New York, NY, USA",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#First-price%20path%20auctions"
}

@inproceedings{Hogue:Wrapper,
	title = "Wrapper Induction for End-User Semantic Content Development",
	year = "2004",
	venue = "WWW",
	author = "Hogue, Andrew and Karger, David",
	booktitle = "Interaction and Design for the Semantic Web Workshop at the $13^{th}$ annual World Wide Web Conference",
	cat = "Haystack and Information Retrieval and Semantic Web and Machine Learning",
	address = "New York, NY",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Wrapper%20Induction%20for%20End-User%20Semantic%20Content%20Development"
}

@inproceedings{Hogue:Thresher,
	title = "Thresher: Automating the Unwrapping of Semantic Content from the World Wide Web",
	pages = "86--95",
	year = "2005",
	venue = "WWW",
	author = "Hogue, Andrew and Karger, David",
	pdf = "http://haystack.lcs.mit.edu/papers/www2005-thresher.pdf",
	booktitle = "Proceedings of the $14^{th}$ International World Wide Web Conference (WWW)",
	cat = "Haystack and Information Retrieval and Semantic Web and Machine Learning",
	crossref = "Proceedings of the $14^{th}$ International World Wide Web Conference (WWW)",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Thresher%3A%20Automating%20the%20Unwrapping%20of%20Semantic%20Content%20from%20the%20World%20Wide%20Web"
}

@inproceedings{twine:pervasive02,
	title = "INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery",
	month = "August",
	year = "2002",
	venue = "Pervasive",
	author = "Balazinska, Magdalena and Balakrishnan, Hari and Karger, David",
	pdf = "http://project-iris.net/irisbib/papers/twine:pervasive02/paper.pdf",
	booktitle = "Proceedings of the International Conference on Pervasive Computing (Pervasive 2002)",
	cat = "Systems and P2P",
	address = "Zurich, Switzerland",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#INS%2FTwine%3A%20A%20Scalable%20Peer-to-Peer%20Architecture%20for%20Intentional%20Resource%20Discovery"
}

@inproceedings{Karger:PlanarTSP,
	title = "A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP",
	editor = "Howard Karloff",
	month = "January",
	pages = "33--41",
	place = "San Fransisco, CA",
	year = "1998",
	venue = "SODA",
	author = "Arora, Sanjeev and Grigni, Michelangelo and Karger, David and Klein, Philip and Woloszyn, Andrzej",
	abstract = "Given a planar graph on $n$ nodes with costs (weights) on its edges, define the distance between nodes $i$ and $j$ as the length of the shortest path between $i$ and $j$. Consider this as an instance of {\em metric\/} TSP. For any $\eps>0$, our algorithm finds a salesman tour of total cost at most $(1+\eps)$ times optimal in time $n^{O(1/\eps^2)}$. We also present a quasi-polynomial time algorithm for the Steiner version of this problem. ",
	booktitle = "Proceedings of the {$9^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms",
	cat = "Theory",
	organization = "ACM-SIAM",
	psgz = "Papers/qtsp.ps.gz",
	crossref = "Proceedings of the {$9^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#A%20Polynomial-Time%20Approximation%20Scheme%20for%20Weighted%20Planar%20Graph%20TSP"
}

@inproceedings{Karger:Chord-FS,
	title = "Wide-area cooperative storage with CFS",
	month = "October",
	year = "2001",
	venue = "SOSP",
	author = "Dabek, Frank and Kaashoek, M. Frans and Karger, David and Morris, Robert and Stoica, Ion",
	pdf = "http://www.cs.ucsd.edu/sosp01/papers/morris.pdf",
	location = "Banff, Canada",
	confurl = "http://portal.acm.org/toc.cfm?id=502034&idx=SERIES372&type=proceeding&coll=ACM&dl=ACM&part=series&WantType=Proceedings",
	booktitle = "Proceedings of the {ACM} 2001 Symposium on Operating System Principles",
	cat = "Theory and Systems and P2P and Applications of Theory",
	studentwork = "\asteriskit{\labelwidth} ",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Wide-area%20cooperative%20storage%20with%20CFS"
}

@inproceedings{Karger:Chord-hotos,
	title = "Building Peer-to-Peer Systems With Chord, a Distributed Lookup Service",
	month = "May",
	year = "2001",
	venue = "HotOS",
	author = "Dabek, Frank and Brunskill, Emma and Kaashoek, M. Frans and Karger, David and Morris, Robert and Stoica, Ion and Balakrishnan, Hari",
	ps = "http://www.pdos.lcs.mit.edu/papers/chord:hotos01/hotos8.ps",
	booktitle = "Proceedings of the 8th {W}orkshop on {H}ot {T}opics in {O}perating {S}ystems ({HotOS-VIII})",
	cat = "Theory and Systems and P2P and Applications of Theory",
	organization = "{IEEE} {C}omputer {S}ociety",
	address = "Schloss Elmau, Germany",
	studentwork = "\asteriskit{\labelwidth} ",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Building%20Peer-to-Peer%20Systems%20With%20Chord%2C%20a%20Distributed%20Lookup%20Service"
}

@inproceedings{Karger:Chord-sigcomm01,
	title = "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications",
	month = "August",
	pages = "149--160",
	year = "2001",
	venue = "SIGCOMM",
	author = "Stoica, Ion and Morris, Robert and Karger, David and Kaashoek, M. Frans and Balakrishnan, Hari",
	ps = "http://pdos.lcs.mit.edu/papers/chord:sigcomm01/chord_sigcomm.ps",
	confurl = "http://portal.acm.org/toc.cfm?id=383059&dl=ACM&dl=ACM&type=proceeding&idx=SERIES419&part=Proceedings&WantType=Proceedings",
	booktitle = "Proceedings of the {ACM} {SIGCOMM} '01 Conference",
	cat = "Theory and Systems and P2P and Applications of Theory",
	address = "San Diego, California",
	studentwork = "\asteriskit{\labelwidth} ",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Chord%3A%20A%20Scalable%20Peer-to-peer%20Lookup%20Service%20for%20Internet%20Applications"
}

@inproceedings{Karger:Workspace,
	title = "End-User Application Development for the Semantic Web",
	year = "2005",
	venue = "ISWC",
	author = "Bakshi, Karun and Karger, David",
	pdf = "http://haystack.lcs.mit.edu/papers/SemDesk-Final.pdf",
	confurl = "http://iswc2005.semanticweb.org/",
	booktitle = "Semantic Desktop 2005 Workshop, International Semantic Web Conference (ISWC)",
	pdfkb = "1465",
	cat = "Information Retrieval and Semantic Web and CHI and Haystack",
	event = "Semantic Desktop Workshop",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#End-User%20Application%20Development%20for%20the%20Semantic%20Web"
}

@inproceedings{Karger:Haystack-Semweb02,
	title = "Haystack: A Platform for Creating, Organizing, and Visualizing Information Using {RDF}",
	month = "May",
	year = "2002",
	venue = "WWW",
	author = "Huynh, David and Karger, David and Quan, Dennis",
	pdf = "http://haystack.csail.mit.edu/papers/sww02.pdf",
	confurl = "http://www.www2002.org/",
	booktitle = "Semantic Web Workshop at WWW2002",
	pdfkb = "310",
	cat = "Information Retrieval and Semantic Web and CHI and Haystack",
	crossref = "Semantic Web Workshop at WWW2002",
	address = "Hawaii",
	studentwork = "\asteriskit{\labelwidth} ",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Haystack%3A%20A%20Platform%20for%20Creating%2C%20Organizing%2C%20and%20Visualizing%20Information%20Using%20%7BRDF%7D"
}

@inproceedings{Karger:ImpWeb-Conf,
	title = "Web Caching with Consistent Hashing",
	keywords = "load balancing",
	comments = "A key performance measure for the World Wide Web is the speed with which content is served to users. As traffic on the Web increases, users are faced with increasing delays and failures in data delivery. Web caching is one of the key strategies that has been explored to improve performance. An important issue in many caching systems is how to decide what is cached where at any given time. Solutions have included multicast queries and directory schemes. In this paper, we offer a new Web caching strategy based on consistent hashing. Consistent hashing provides an alternative to multicast and directory schemes, and has several other advantages in load balancing and fault tolerance. Its performance was analyzed theoretically in previous work: in this paper we describe the implementation of a consistent-hashing-based system and experiments that support our thesis that it can provide performance improvements.",
	url = "http://www8.org/w8-papers/2a-webserver/caching/paper2.html",
	year = "1999",
	venue = "WWW",
	author = "Karger, David and Sherman, Alex and Berkheimer, Andy and Bogstad, Bill and Dhanidina, Rizwan and Iwamoto, Ken and Kim, Brian and Matkins, Luke and Yerushalmi, Yoav",
	booktitle = "Proceedings of the Eighth World-Wide Web Conference",
	cat = "Systems and Theory and Applications of Theory",
	studentwork = "\asteriskit{\labelwidth} ",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Web%20Caching%20with%20Consistent%20Hashing"
}

@article{Karger:ImpWeb-Journal,
	title = "{Web} caching with consistent hashing",
	month = "May",
	pages = "1203--1213",
	issn = "1389-1286",
	url = "http://www.elsevier.com/cas/tree/store/comnet/sub/1999/31/11-16/2181.pdf",
	year = "1999",
	author = "Karger, David and Sherman, Alex and Berkheimer, Andy and Bogstad, Bill and Dhanidina, Rizwan and Iwamoto, Ken and Kim, Brian and Matkins, Luke and Yerushalmi, Yoav",
	day = "17",
	bibdate = "Fri Sep 24 19:43:29 MDT 1999",
	cat = "Systems and Theory and Applications of Theory",
	volume = "31",
	coden = "????",
	journal = "Computer Networks",
	address = "Amsterdam, Netherlands",
	studentwork = "\asteriskit{\labelwidth} ",
	number = "11--16",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#%7BWeb%7D%20caching%20with%20consistent%20hashing"
}

@inproceedings{Karger:Infranet,
	title = "Infranet: Circumventing Web Censorship and Surveillance",
	month = "August",
	pages = "247--262",
	year = "2002",
	venue = "USENIX Security",
	author = "Feamster, Nick and Balazinska, Magdalena and Harfst, Greg and Balakrishnan, Hari and Karger, David",
	ps = "http://wind.lcs.mit.edu/papers/usenixsec2002.ps",
	pdf = "http://wind.lcs.mit.edu/papers/usenixsec2002.pdf",
	note = "Best Student Paper Award",
	booktitle = "Proceedings of the $11^{th}$ USENIX Security Symposium",
	cat = "Systems and Theory and Applications of Theory",
	psgz = "http://wind.lcs.mit.edu/papers/usenixsec2002.ps.gz",
	address = "San Fransisco, CA",
	studentwork = "\asteriskit{\labelwidth} ",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Infranet%3A%20Circumventing%20Web%20Censorship%20and%20Surveillance"
}

@inproceedings{Karger:2Stage,
	title = "On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems",
	pages = "691--700",
	publisher = "Society for Industrial and Applied Mathematics",
	year = "2004",
	venue = "SODA",
	author = "Immorlica, Nicole and Karger, David and Minkoff, Maria and Mirrokni, Vahab S.",
	pdf = "http://www.ece.northwestern.edu/ nickle/pubs/stochopt.pdf",
	location = "New Orleans, Louisiana",
	booktitle = "SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms",
	isbn = "0-89871-558-X",
	cat = "Theory",
	crossref = "Proceedings of the {$15^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms",
	address = "Philadelphia, PA, USA",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#On%20the%20costs%20and%20benefits%20of%20procrastination%3A%20approximation%20algorithms%20for%20stochastic%20combinatorial%20optimization%20problems"
}

@inproceedings{Karger:Release,
	title = "Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates",
	month = "October",
	pages = "32--43",
	place = "New York, NY",
	publisher = "{IEEE} Computer Society Press",
	year = "1999",
	venue = "FOCS",
	author = "Afrati, Foto and Bampis, Evripidis and Chekuri, Chandra and Karger, David and Kenyon, Claire and Khanna, Sanjeev and Milis, Ioannis and Queyranne, Maurice and Skutella, Martin and Stein, Cliff and Sviridenko, Maxim",
	ps = "release.ps",
	booktitle = "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science",
	cat = "Theory",
	organization = "IEEE",
	crossref = "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Approximation%20Schemes%20for%20Minimizing%20Average%20Weighted%20Completion%20Time%20with%20Release%20Dates"
}

@inproceedings{Karger:LDPC,
	title = "Using Linear Programming to Decode Linear Codes",
	month = "March",
	year = "2003",
	venue = "CISS",
	author = "Feldman, Jon and Karger, David and Wainwright, Martin",
	pdf = "Papers/ciss03.pdf",
	booktitle = "37th annual Conference on Information Sciences and Systems (CISS)",
	cat = "Theory and Coding",
	psgz = "Papers/ciss03.ps.gz",
	address = "Baltimore, MD",
	studentwork = "\asteriskit{\labelwidth} ",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Using%20Linear%20Programming%20to%20Decode%20Linear%20Codes"
}

@article{Karger:LDPC-Journal,
	title = "Using Linear Programming to Decode Linear Codes",
	month = "March",
	pages = "954-972",
	url = "http://ieeexplore.ieee.org/iel5/18/30405/01397933.pdf?isNumber=30405&prod=JNL&arnumber=1397933&arSt=+954&ared=+972&arAuthor=+Feldman%2C+J.%3B++Wainwright%2C+M.J.%3B++Karger%2C+D.R.",
	year = "2005",
	author = "Feldman, Jon and Karger, David and Wainwright, Martin",
	cat = "Theory and Coding",
	volume = "51",
	journal = "IEEE Transactions on Information Theory",
	studentwork = "\asteriskit{\labelwidth} ",
	number = "3",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#7c95b08fb178a1a132b2b8efc8d98da1"
}

@article{Karger:VLSI,
	title = "Prim-{D}ijkstra Tradeoffs for Improved Performance-Driven Routing Tree Design",
	month = "July",
	pages = "890--895",
	year = "1995",
	author = "Alpert, C. J. and Hu, T. C. and Huang, J. H. and Kahng, A. B. and Karger, David",
	cat = "Applications of Theory",
	volume = "14",
	journal = "IEEE Transactions on Computer Aided Design",
	number = "7",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Prim-%7BD%7Dijkstra%20Tradeoffs%20for%20Improved%20Performance-Driven%20Routing%20Tree%20Design"
}

@inproceedings{Karger:NonMulticast,
	title = "On Coding for Non-Multicast Networks",
	year = "2003",
	venue = "Allerton",
	author = "M?dard, Muriel and Effros, Michelle and Ho, Tracey and Karger, David",
	pdf = "http://www.its.caltech.edu/ tho/allertonM03.pdf",
	note = "Invited paper",
	booktitle = "$41^{st}$ Allerton Annual Conference on Communication, Control, and Signal Processing",
	cat = "Theory and Applications of Theory and Coding and Cuts and Flows",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#On%20Coding%20for%20Non-Multicast%20Networks"
}

@inproceedings{Karger:NCoding4,
	title = "Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding",
	year = "2003",
	venue = "DIMACS",
	author = "Effros, Michelle and M?dard, Muriel and Ho, Tracey and Ray, S. and Karger, David and Koetter, Ralf and Hassibi, B.",
	pdf = "http://www.its.caltech.edu/ tho/dimacs03.pdf",
	note = "Invited Paper",
	booktitle = "DIMACS workshop on network information theory",
	cat = "Theory and Coding and Cuts and Flows",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Linear%20Network%20Codes%3A%20A%20Unified%20Framework%20for%20Source%2C%20Channel%2C%20and%20Network%20Coding"
}

@techreport{shih2001,
	title = "Learning Classes Correlated to a Hierarchy",
	year = "2001",
	author = "Shih, Lawrence and Karger, David",
	cat = "Information Retrieval and Machine Learning",
	institution = "MIT AI Lab",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Learning%20Classes%20Correlated%20to%20a%20Hierarchy"
}

@unpublished{Karger97,
	title = "Haystack: Per-User Information Environments.",
	year = "1997",
	author = "Karger, David and Stein, Lynn",
	cat = "Information Retrieval and Haystack",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Haystack%3A%20Per-User%20Information%20Environments."
}

@inproceedings{Karger:Fresnel-ISWC06,
	title = "Fresnel: A Browser-Independent Presentation Vocabulary for RDF",
	month = "November",
	pages = "158--171",
	year = "2006",
	venue = "ISWC",
	author = "Pietriga, Emmanuel and Bizer, Chris and Karger, David and Lee, Ryan",
	pdf = "fresnelISWC06.pdf",
	booktitle = "$5^{th}$ International Semantic Web Conference (ISWC)",
	cat = "Information Retrieval and Haystack and Semantic Web",
	crossref = "$5^{th}$ International Semantic Web Conference (ISWC)",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Fresnel%3A%20A%20Browser-Independent%20Presentation%20Vocabulary%20for%20RDF"
}

@inproceedings{Karger:Piggy,
	title = "Piggy Bank: Experience the Semantic Web Inside your Web Browser",
	year = "2005",
	venue = "ISWC",
	author = "Huynh, David and Mazzochi, Stefano and Karger, David",
	pdf = "http://simile.mit.edu/papers/iswc05.pdf",
	abstract = "<p>The Semantic Web Initiative envisions a Web wherein information is offered free of presentation, allowing more effective exchange and mixing across web sites and across web pages. But without substantial Semantic Web content, few tools will be written to consume it; without many such tools, there is little appeal to publish Semantic Web content.</p><p>To break this chicken-and-egg problem, thus enabling more flexible information access, we have created a web browser extension called Piggy Bank that lets users make use of Semantic Web content within Web content as users browse the Web. Wherever Semantic Web content is not available, Piggy Bank can invoke screenscrapers to re-structure information within web pages into Semantic Web format. Through the use of Semantic Web technologies, Piggy Bank provides direct, immediate benefits to users in their use of the existing Web. Thus, the existence of even just a few Semantic Web-enabled sites or a few scrapers already benefits users. Piggy Bank thereby offers an easy, incremental upgrade path to users without requiring a wholesale adoption of the Semantic Web's vision.</p><p>To further improve this Semantic Web experience, we have created Semantic Bank, a web server application that lets Piggy Bank users share the Semantic Web information they have collected, enabling collaborative efforts to build sophisticated Semantic Web information repositories through simple, everyday's use of Piggy Bank.</p>",
	booktitle = "International Semantic Web Conference (ISWC)",
	pdfkb = "2400",
	cat = "Haystack and Semantic Web and Information Retrieval",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Piggy%20Bank%3A%20Experience%20the%20Semantic%20Web%20Inside%20your%20Web%20Browser"
}

@article{Karger:Piggy-Journal,
	title = "Piggy Bank: Experience the Semantic Web Inside your Web Browser",
	pages = "16=27",
	year = "2007",
	author = "Huynh, David and Mazzochi, Stefano and Karger, David",
	pdf = "http://simile.mit.edu/papers/iswc05.pdf",
	abstract = "<p>The Semantic Web Initiative envisions a Web wherein information is offered free of presentation, allowing more effective exchange and mixing across web sites and across web pages. But without substantial Semantic Web content, few tools will be written to consume it; without many such tools, there is little appeal to publish Semantic Web content.</p><p>To break this chicken-and-egg problem, thus enabling more flexible information access, we have created a web browser extension called Piggy Bank that lets users make use of Semantic Web content within Web content as users browse the Web. Wherever Semantic Web content is not available, Piggy Bank can invoke screenscrapers to re-structure information within web pages into Semantic Web format. Through the use of Semantic Web technologies, Piggy Bank provides direct, immediate benefits to users in their use of the existing Web. Thus, the existence of even just a few Semantic Web-enabled sites or a few scrapers already benefits users. Piggy Bank thereby offers an easy, incremental upgrade path to users without requiring a wholesale adoption of the Semantic Web's vision.</p><p>To further improve this Semantic Web experience, we have created Semantic Bank, a web server application that lets Piggy Bank users share the Semantic Web information they have collected, enabling collaborative efforts to build sophisticated Semantic Web information repositories through simple, everyday's use of Piggy Bank.</p>",
	pdfkb = "2400",
	cat = "Haystack and Semantic Web and Information Retrieval",
	volume = "5",
	journal = "Journal of Web Semantics",
	number = "1",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#e3908e6d922010969816470cc4313fd8"
}

@inproceedings{Quan,
	title = "Basic Concepts for Managing Semi-structured Information in Haystack",
	year = "2002",
	venue = "Oxygen",
	author = "Quan, Dennis and Huynh, David F. and Sinha, Vineet and Zhurakhinskaya, Marina and Karger, David",
	booktitle = "2nd Annual Student Oxygen Workshop, Gloucester, MA, USA",
	origin = "http://simile.mit.edu/playground/exhibit-builder/edit-mode-composition#Basic%20Concepts%20for%20Managing%20Semi-structured%20Information%20in%20Haystack"
}