As more and more reusable structured data appears on the Web, casual users will want to take into their own hands the task of mashing up data rather than wait for mash-up sites to be built that address exactly their individually unique needs. In this paper, we present Potluck, a Web user interface that lets casual users?those without programming skills and data modeling expertise?mash up data themselves.
Potluck is novel in its use of drag and drop for merging fields, its integration and extension of the faceted browsing paradigm for focusing on subsets of data to align, and its application of simultaneous editing for cleaning up data syntactically. Potluck also lets the user construct rich visualizations of data in-place as the user aligns and cleans up the data. This iterative process of integrating the data while constructing useful visualizations is desirable when the user is unfamiliar with the data at the beginning?a common case?and wishes to get immediate value out of the data without having to spend the overhead of completely and perfectly integrating the data first.
A user study on Potluck indicated that it was usable and learnable, and elicited excitement from programmers who, even with their programming skills, previously had great difficulties performing data integration.
", "work-done-at" : "MIT CSAIL", "pdfkb" : "1677", "pub-type" : "inproceedings", "pdf" : "http://people.csail.mit.edu/dfhuynh/research/papers/iswc2007-potluck.pdf", "date" : "2007-11", "month" : "November", "screencastkb" : "67274", "key" : "Karger:Potluck" }, { "pdf" : "http://haystack.csail.mit.edu/papers/swfat2003.pdf", "booktitle" : "International Workshop on Semantic Web Foundations and Application Technologies (SWFAT)", "pub-type" : "inproceedings", "venue" : "SWFAT", "uri" : "urn:5e8f150b21196e158962ce7aed6b029a", "date" : "2003", "author" : [ "Quan, Dennis", "Huynh, David", "Karger, David R." ], "studentwork" : "\\asteriskit{\\labelwidth} ", "type" : "Publication", "confurl" : "http://www-kasm.nii.ac.jp/SWFAT/proceedings.html", "year" : "2003", "cat" : [ "Information Retrieval", "Semantic Web", "CHI", "Haystack" ], "abstract" : "The Semantic Web promises to open innumerable opportunities for automation and information retrieval by standardizing the protocols for metadata exchange. However, just as the success of the World Wide Web can be attributed to the ease of use and ubiquity of Web browsers, we believe that the unfolding of the Semantic Web vision depends on users getting powerful but easy-to-use tools for managing their information. But unlike HTML, which can be easily edited in any text editor, RDF is more complicated to author and does not have an obvious presentation mechanism. Previous work has concentrated on the ideas of generic RDF graph visualization and RDF Schemabased form generation. In this paper, we present a comprehensive platform for constructing end user applications that create, manipulate, and visualize arbitrary RDF-encoded information, adding another layer to the abstraction cake. We discuss a programming environment specifically designed for manipulating RDF and introduce user interface concepts on top that allow the developer to quickly assemble applications that are based on RDF data models. Also, because user interface specifications and program logic are themselves describable in RDF, applications built upon our framework enjoy properties such as network updatability, extensibility, and end user customizability ? all desirable characteristics in the spirit of the Semantic Web.", "label" : "RDF Authoring Environments for End Users", "key" : "Karger:Haystack-swfat03", "pdfkb" : "494" }, { "event" : "Semantic Desktop Workshop", "pdf" : "http://haystack.lcs.mit.edu/papers/SemDesk-Final.pdf", "booktitle" : "Semantic Desktop 2005 Workshop, International Semantic Web Conference (ISWC)", "pub-type" : "inproceedings", "venue" : "ISWC", "uri" : "urn:171724eb0311faae63f691694cae2616", "date" : "2005", "author" : [ "Bakshi, Karun", "Karger, David" ], "type" : "Publication", "confurl" : "http://iswc2005.semanticweb.org/", "year" : "2005", "cat" : [ "Information Retrieval", "Semantic Web", "CHI", "Haystack" ], "abstract" : "Although a lot of information has become readily accessible and necessary for daily work, the current infrastructure for managing information is ill-suited for information-oriented activities: information and functionality are scattered across applications and websites, making it difficult to aggregate and reuse just the right set of content and operations required for unique user tasks. We discuss a collection of tools built into the Haystack platform that address many of the shortcomings of current applications, and allow composing reusable fragments of information and associated operations and views from the Semantic Web into a task workspace tailored to the user and the task. Users can change the workspace to immediately meet changing requirements to easily include, remove or reuse information in multiple tasks simultaneously. The time that a user invests for the initial setup and occasional updates to the workspace is amortized over the numerous times he or she returns to the task, and all relevant information resources are co-located and ready to use.", "label" : "End-User Application Development for the Semantic Web", "key" : "Karger:Workspace", "pdfkb" : "1465" }, { "crossref" : "Proceedings of the $12^{th}$ International World Wide Web Conference", "type" : "Publication", "author" : [ "Quan, Dennis", "Bakshi, Karun", "Karger, David R." ], "uri" : "urn:595c1303e26eea83a353e4be978af025", "cat" : [ "Information Retrieval", "Semantic Web", "CHI", "Haystack" ], "label" : "A Unified Abstraction for Messaging on the Semantic Web", "venue" : "WWW", "conf" : "http://www.www2003.org/", "pages" : "231", "year" : "2003", "booktitle" : "Developers\' day, $12^{th}$ International World Wide Web Conference", "abstract" : "Since its inception, the Internet has been a hotbed of several successful communications channels, starting off with e-mail, Internet Relay Chat and Usenet newsgroups and more recently adding Web annotation, instant messaging, and news feeds. However, these channels were developed fairly independently, and in many cases their respective functionalities have grown to overlap significantly. For instance, users of these systems have separate identifiers for e-mail, chat, and instant messaging, and clients for these systems all have their own implementations of threaded message views. We believe these problems stem from a lack of a common user interface and data model. In this paper we use basic concepts from the Semantic Web and RDF to unify and model these seemingly disparate messaging paradigms. We also demonstrate a generalized user interface for messaging that uses the data model we have developed. From this process we realize a number of synergies that result from the reduction of overlap and the finer-grained control users are given over message composition, transmission, storage and retrieval.", "event" : "Developer\'s Day", "pdfkb" : "307", "pub-type" : "inproceedings", "pdfurl" : "http://haystack.lcs.mit.edu/papers/www2003-messaging.pdf", "date" : "2003", "key" : "Haystack:Messaging" }, { "confurl" : "http://www.interact2003.org/", "crossref" : "INTERACT: $9^{th}$ IFIP International Conference on Human Computer Interaction", "type" : "Publication", "author" : [ "Quan, Dennis", "Bakshi, Karun", "Huynh, David", "Karger, David R." ], "address" : "Zurich", "uri" : "urn:ad03641543bfb861d38c6ead31a08dce", "cat" : [ "Information Retrieval", "Semantic Web", "CHI" ], "label" : "User Interfaces for Supporting Multiple Categorization.", "venue" : "INTERACT", "pages" : "228--235", "year" : "2003", "booktitle" : "INTERACT: $9^{th}$ IFIP International Conference on Human Computer Interaction", "abstract" : "As the amount of information stored on and accessed by computer has increased over the past twenty years, the tools available for organizing and retrieving such information have become outdated. The folder paradigm has dominated existing user interfaces as the primary mechanism for organizing information for day-to-day use. This paradigm encourages many-to-one placement of documents into strictly hierarchical containers. In this paper we examine an alternative organization and navigation mechanism that promotes membership in multiple overlapping categories (as opposed to storage containment). In particular, we explore the user interface consequences of multiple categorization support being made conveniently available from within Web browsers. We have carried out user studies providing evidence that compared to the folder paradigm, multiple categorization not only improves organization and retrieval times but also matches more closely with the way users naturally think about organizing their information.", "pdfkb" : "175", "pub-type" : "inproceedings", "pdf" : "http://haystack.lcs.mit.edu/papers/interact2003-multicat.pdf", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2003-09", "month" : "September", "organization" : "International Federation for Information Processing", "key" : "Karger:MultipleCategorization" }, { "confurl" : "http://www.www2002.org/", "crossref" : "Semantic Web Workshop at WWW2002", "type" : "Publication", "author" : [ "Huynh, David", "Karger, David", "Quan, Dennis" ], "address" : "Hawaii", "uri" : "urn:74f703eda139d4cd56175c9f9e9234a9", "cat" : [ "Information Retrieval", "Semantic Web", "CHI", "Haystack" ], "label" : "Haystack: A Platform for Creating, Organizing, and Visualizing Information Using {RDF}", "venue" : "WWW", "year" : "2002", "booktitle" : "Semantic Web Workshop at WWW2002", "abstract" : "The Resource Definition Framework (RDF) is designed to support agent communication on the Web, but it is also suitable as a framework for modeling and storing personal information. Haystack is a personalized information repository that employs RDF in this manner. This flexible semistructured data model is appealing for several reasons. First, RDF supports ontologies created by the user and tailored to the user?s needs. At the same time, system ontologies can be specified and evolved to support a variety of high-level functionalities such as flexible organization schemes, semantic querying, and collaboration. In addition, we show that RDF can be used to engineer a component architecture that gives rise to a semantically rich and uniform user interface. We demonstrate that by aggregating various types of users? data together in a homogeneous representation, we create opportunities for agents to make more informed deductions in automating tasks for users. Finally, we discuss the implementation of an RDF information store and a programming language specifically suited for manipulating RDF.", "pdfkb" : "310", "pub-type" : "inproceedings", "pdf" : "http://haystack.csail.mit.edu/papers/sww02.pdf", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2002-05", "month" : "May", "key" : "Karger:Haystack-Semweb02" }, { "confurl" : "http://www.iuiconf.org/03program.html", "crossref" : "Proceedings of the 2003 International Conference on Intelligent User Interfaces", "note" : "Demo", "type" : "Publication", "author" : [ "Huynh, David", "Karger, David R.", "Quan, Dennis" ], "address" : "Miami, FL", "isbn" : "1-58113-586-6", "uri" : "urn:8a1cfd57494ff575f308214ded44a3a6", "cat" : [ "Information Retrieval", "Semantic Web", "CHI", "Haystack" ], "label" : "Haystack: A Platform for Creating, Organizing, and Visualizing Semistructured Information", "venue" : "IUI", "year" : "2003", "booktitle" : "Intelligent User Interfaces", "publisher" : "ACM", "pdfkb" : "97", "pub-type" : "inproceedings", "pdf" : "http://haystack.lcs.mit.edu/papers/iui2003-demo.pdf", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2003-01", "bibsource" : "DBLP, http://dblp.uni-trier.de", "month" : "January", "key" : "Karger:Haystack-IUI03-Poster" }, { "confurl" : "http://www.iuiconf.org/03program.html", "crossref" : "Proceedings of the 2003 International Conference on Intelligent User Interfaces", "note" : "Poster", "type" : "Publication", "author" : [ "Karger, David R.", "Katz, Boris", "Lin, Jimmy", "Quan, Dennis" ], "address" : "Miami, FL", "url" : "citeseer.ist.psu.edu/563406.html", "isbn" : "1-58113-586-6", "uri" : "urn:dbe3c543d456eef6a3d1c673642f3206", "cat" : [ "Information Retrieval", "Semantic Web", "CHI", "Haystack" ], "label" : "Sticky Notes for the Semantic Web", "venue" : "IUI", "pages" : "254--256", "year" : "2003", "booktitle" : "Intelligent User Interfaces", "publisher" : "ACM", "pub-type" : "inproceedings", "pdf" : "http://haystack.lcs.mit.edu/papers/iui2003-annotation.pdf", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2003-01", "bibsource" : "DBLP, http://dblp.uni-trier.de", "month" : "January", "key" : "Karger:StickyNotes-Poster" }, { "label" : "72fd20d6730703d54e619d252974269b", "key" : "Adar99", "type" : "Publication", "pub-type" : "inproceedings", "note" : "see Karger:Haystack-CIKM", "uri" : "urn:72fd20d6730703d54e619d252974269b" }, { "confurl" : "http://portal.acm.org/toc.cfm?id=319950&dl=ACM&type=proceeding&idx=SERIES772&part=Proceedings&WantType=Proceedings", "type" : "Publication", "author" : [ "Adar, Eytan", "Karger, David R.", "Stein, Lynn Andrea" ], "uri" : "urn:2b8abbdcefc4d8f80c59d545fa09b458", "cat" : [ "Information Retrieval", "Semantic Web", "CHI", "Haystack" ], "label" : "Haystack: Per-User Information Environments", "venue" : "CIKM", "pages" : "413--422", "year" : "1999", "booktitle" : "Proceedings of the 8th International Conference on Information and Knowledge Management", "id" : "2b8abbdcefc4d8f80c59d545fa09b458", "ps" : "Papers/cikm99.ps", "abstract" : " Traditional Information Retrieval (IR) systems are designed to provide uniform access to centralized corpora by large numbers of people. The Haystack project emphasizes the relationship between a particular individual and his corpus. An individual\'s own haystack priviliges information with which that user interacts, gathers data about those interactions, and uses this metadata to further personalize the retrieval process. This paper describes the prototype Haystack system. ", "psgz" : "Papers/cikm99.p.gzs", "pub-type" : "inproceedings", "pdf" : "Papers/cikm99.ps.pdf", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "1999", "key" : "Karger:Haystack-CIKM" }, { "crossref" : "Proceedings of the {$28^{th}$} {ACM} Symposium on Theory of Computing", "note" : "Journal version appears in Journal of the ACM 47(1)", "type" : "Publication", "author" : "Karger, David R.", "editor" : "Gary Miller", "uri" : "urn:e572a43ebb5438b451d825d440ff32e6", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "Minimum Cuts in Near-Linear Time", "venue" : "STOC", "place" : "Philadelphia, PA", "pages" : "56--63", "year" : "1996", "booktitle" : "Proceedings of the {$28^{th}$} {ACM} Symposium on Theory of Computing", "publisher" : "ACM Press", "ps" : "http://people.csail.mit.edu/karger/Papers/lincut.ps", "abstract" : " We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a \"semiduality\" between minimum cuts and maximum spanning tree packings combined with our previously developed random sampling techniques. We give a randomized (Monte Carlo) algorithm that finds a minimum cut in an m-edge, n-vertex graph with high probability in O(m log3 n) time. We also give a simpler randomized algorithm that finds all minimum cuts with high probability in O(m log3 n) time. This variant has an optimal RNC parallelization. Both variants improve on the previous best time bound of O(n2 log3 n). Other applications of the tree-packing approach are new, nearly tight bounds on the number of near-minimum cuts a graph may have and a new data structure for representing them in a space-efficient manner. ", "pub-type" : "inproceedings", "date" : "1996-05", "month" : "May", "organization" : "ACM", "key" : "Karger:Lincut-Conf" }, { "number" : "1", "note" : "A preliminary version appeared in Proceedings of the {$28^{th}$} {ACM} Symposium on Theory of Computing", "type" : "Publication", "author" : "Karger, David R.", "uri" : "urn:e36b68943f1f6d1948f13cdcf964d62e", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "Minimum Cuts in Near-Linear Time", "pages" : "46--76", "year" : "2000", "journal" : "Journal of the ACM", "id" : "e36b68943f1f6d1948f13cdcf964d62e", "ps" : "http://people.csail.mit.edu/karger/Papers/lincut-journal.ps", "abstract" : " We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a \"semiduality\" between minimum cuts and maximum spanning tree packings combined with our previously developed random sampling techniques. We give a randomized (Monte Carlo) algorithm that finds a minimum cut in an m-edge, n-vertex graph with high probability in O(m log3 n) time. We also give a simpler randomized algorithm that finds all minimum cuts with high probability in O(m log3 n) time. This variant has an optimal RNC parallelization. Both variants improve on the previous best time bound of O(n2 log3 n). Other applications of the tree-packing approach are new, nearly tight bounds on the number of near-minimum cuts a graph may have and a new data structure for representing them in a space-efficient manner. ", "volume" : "47", "pub-type" : "article", "date" : "2000-01", "month" : "January", "key" : "Karger:Lincut" }, { "ps" : "http://people.csail.mit.edu/karger/Papers/impconn.ps", "booktitle" : "Proceedings of ALENEX00: Workshop on Algorithm Engineering and Experimentation", "pub-type" : "inproceedings", "venue" : "ALENEX", "uri" : "urn:3ef548c744b529ad4ecb4f888cbd1720", "date" : "2000-01", "author" : [ "Iyer, Raj D.", "Karger, David R.", "Rahul, Hariharan", "Thorup, Mikkel" ], "studentwork" : "\\asteriskit{\\labelwidth} ", "month" : "January", "type" : "Publication", "year" : "2000", "cat" : "Theory", "abstract" : "We present an experimental study of different variants of the amortized O(log2 n)-time fully-dynamic connectivity algorithm of Holm, de Lichtenberg, and Thorup (STOC\'98). The experiments build upon experiments provided by Alberts, Cattaneo, and Italiano (SODA\'96) on the randomized amortized O(log3 n) fully-dynamic connectivity algorithm of Henzinger and King (STOC\'95). Our experiments shed light upon similarities and differences between the two algorithms. We also present a slightly modified version of the Henzinger-King algorithm that runs in O(log2 n) time, which resulted from our experiments.", "label" : "An Experimental Study of Polylogarithmic Fully-Dynamic Connectivity Algorithms", "key" : "Karger:ImpConn-Conf", "brag" : "ALENEX00 special issue of the Journal of Experimental Algorithmics" }, { "id" : "79ab249011300fd14715daf3ae9f6ffd", "journal" : "ACM Journal of Experimental Algorithmics", "pub-type" : "article", "uri" : "urn:79ab249011300fd14715daf3ae9f6ffd", "date" : "2001", "vol" : "6", "author" : [ "Iyer, Raj D.", "Karger, David R.", "Rahul, Hariharan", "Thorup, Mikkel" ], "studentwork" : "\\asteriskit{\\labelwidth} ", "type" : "Publication", "year" : "2001", "abstract" : "We present an experimental study of different variants of the amortized O(log2 n)-time fully-dynamic connectivity algorithm of Holm, de Lichtenberg, and Thorup (STOC\'98). The experiments build upon experiments provided by Alberts, Cattaneo, and Italiano (SODA\'96) on the randomized amortized O(log3 n) fully-dynamic connectivity algorithm of Henzinger and King (STOC\'95). Our experiments shed light upon similarities and differences between the two algorithms. We also present a slightly modified version of the Henzinger-King algorithm that runs in O(log2 n) time, which resulted from our experiments. ", "cat" : "Theory", "label" : "An Experimental Study of Polylogarithmic Fully-Dynamic Connectivity Algorithms", "key" : "Karger:ImpConn", "brag" : "Special issue of papers selected from ALENEX 2000" }, { "crossref" : "Proceedings of the {$8^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "type" : "Publication", "author" : [ "Chekuri, Chandra C.", "Goldberg, Andrew V.", "Karger, David R.", "Levine, Matthew S.", "Stein, Cliff" ], "editor" : "Michael Saks", "uri" : "urn:ce03d3476b56d2d0cd86629cf8367d4d", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "Experimental Study of Minimum Cut Algorithms", "venue" : "SODA", "place" : "New Orleans, LA", "pages" : "324--333", "year" : "1997", "booktitle" : "Proceedings of the {$8^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "abstract" : "Recently, several new algorithms have been developed for the minimum cut problem. These algorithms are very different from the earlier ones and from each other and substantially improve the worst-case time bounds for the problem. In this paper, we conduct experimental evaluation the relative performance of these algorithms. In the process, we develop heuristics and data structures that substantially improve the practical performance of the algorithms. We also develop problem families for testing minimum cut algorithms. Our work leads to a better understanding of the practical performance of minimum cut algorithms and produces very efficient codes for the problem.", "pub-type" : "inproceedings", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "1997-01", "month" : "January", "organization" : "ACM-SIAM", "key" : "Karger:ImpCut" }, { "crossref" : "Proceedings of the {$8^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "type" : "Publication", "author" : [ "Karger, David R.", "Tai, Ray P." ], "editor" : "Michael Saks", "uri" : "urn:36d0359946c0505174c622d5f9f819ed", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "Implementing a Fully Polynomial Time Approximation Scheme for All Terminal Network Reliability", "venue" : "SODA", "place" : "New Orleans, LA", "pages" : "334--343", "year" : "1997", "booktitle" : "Proceedings of the {$8^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "ps" : "Papers/imprel.ps", "abstract" : "The classic all-terminal network reliability problem posits a graph, each of whose edges fails (disappears) independently with some given probability. The goal is to determine the probability that the network becomes disconnected due to edge failures. The practical applications of this question to communication networks are obvious, and the problem has therefore been the subject of a great deal of study. Since it is tjp-complete, and thus believed hard to solve exactly, a great deal of research has been devoted to estimating the failure probability. A comprehensive survey can be found in [Co187]. The first author recently presented an algorithm for approximating the probability of network disconnection under random edge failures. In this paper, we report on our experience implementing this algorithm. Our implementation shows that the algorithm is practical on networks of moderate size, and indeed works better than the theoretical bounds predict. Part of this improvement arises from heuristic modifications to the theoretical algorithm, while another part suggests that the theoretical running time analysis of the algorithm might not be tight. Based on our observation of the implementation, we were able to devise analytic explanations of at least some of the improved performance. As one example, we formally prove the accuracy of a simple heuristic approximation for the reliability. We also discuss other questions raised by the implementation which might be susceptible to analysis. ", "psgz" : "Papers/imprel.ps.gz", "pub-type" : "inproceedings", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "1997-01", "month" : "January", "organization" : "ACM-SIAM", "key" : "Karger:ImpRel" }, { "url" : "http://www8.org/w8-papers/2a-webserver/caching/paper2.html", "booktitle" : "Proceedings of the Eighth World-Wide Web Conference", "pub-type" : "inproceedings", "venue" : "WWW", "uri" : "urn:28b609a046e1ad3ed99c280cbbdd4fc1", "date" : "1999", "author" : [ "Karger, David", "Sherman, Alex", "Berkheimer, Andy", "Bogstad, Bill", "Dhanidina, Rizwan", "Iwamoto, Ken", "Kim, Brian", "Matkins, Luke", "Yerushalmi, Yoav" ], "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.", "studentwork" : "\\asteriskit{\\labelwidth} ", "type" : "Publication", "year" : "1999", "cat" : [ "Systems", "Theory", "Applications of Theory" ], "label" : "Web Caching with Consistent Hashing", "key" : "Karger:ImpWeb-Conf" }, { "issn" : "1389-1286", "number" : "11--16", "type" : "Publication", "author" : [ "Karger, David", "Sherman, Alex", "Berkheimer, Andy", "Bogstad, Bill", "Dhanidina, Rizwan", "Iwamoto, Ken", "Kim, Brian", "Matkins, Luke", "Yerushalmi, Yoav" ], "address" : "Amsterdam, Netherlands", "url" : "http://www.elsevier.com/cas/tree/store/comnet/sub/1999/31/11-16/2181.pdf", "uri" : "urn:9b006e101f670e0f83a7404ab4ad93d3", "cat" : [ "Applications of Theory", "Systems", "Theory" ], "label" : "{Web} caching with consistent hashing", "pages" : "1203--1213", "year" : "1999", "journal" : "Computer Networks", "abstract" : "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. ", "day" : "17", "volume" : "31", "pub-type" : "article", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "1999-05", "bibdate" : "Fri Sep 24 19:43:29 MDT 1999", "month" : "May", "coden" : "????", "key" : "Karger:ImpWeb-Journal" }, { "note" : "Best Student Paper Award", "type" : "Publication", "author" : [ "Feamster, Nick", "Balazinska, Magdalena", "Harfst, Greg", "Balakrishnan, Hari", "Karger, David" ], "address" : "San Fransisco, CA", "uri" : "urn:252fb10982f3d18f5c401d7cc24a75da", "cat" : [ "Systems", "Theory", "Applications of Theory" ], "label" : "Infranet: Circumventing Web Censorship and Surveillance", "venue" : "USENIX Security", "pages" : "247--262", "year" : "2002", "booktitle" : "Proceedings of the $11^{th}$ USENIX Security Symposium", "ps" : "http://wind.lcs.mit.edu/papers/usenixsec2002.ps", "abstract" : "An increasing number of countries and companies routinely block or monitor access to parts of the Internet. To counteract these measures, we propose Infranet, a system that enables clients to surreptitiously retrieve sensitive content via cooperating Web servers distributed across the global Internet. These Infranet servers provide clients access to censored sites while continuing to host normal uncensored content. Infranet uses a tunnel protocol that provides a covert communication channel between its clients and servers, modulated over standard HTTP transactions that resemble innocuous Web browsing. In the upstream direction, Infranet clients send covert messages to Infranet servers by associating meaning to the sequence of HTTP requests being made. In the downstream direction, Infranet servers return content by hiding censored data in uncensored images using steganographic techniques. We describe the design, a prototype implementation, security properties, and performance of Infranet. Our security analysis shows that Infranet can successfully circumvent several sophisticated censoring techniques.", "psgz" : "http://wind.lcs.mit.edu/papers/usenixsec2002.ps.gz", "pub-type" : "inproceedings", "pdf" : "http://wind.lcs.mit.edu/papers/usenixsec2002.pdf", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2002-08", "month" : "August", "key" : "Karger:Infranet" }, { "confurl" : "http://portal.acm.org/toc.cfm?id=365411&dl=GUIDE&dl=ACM&type=proceeding&idx=SERIES422&part=Proceedings&WantType=Proceedings", "crossref" : "Proceedings of the {$12^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "type" : "Publication", "author" : [ "Engels, Daniel W.", "Feldman, Jon", "Karger, David R.", "Ruhl, Matthias" ], "editor" : "S. Rao Kosaraju", "uri" : "urn:765d84ffe77cd6e06495b57c04b8b0a4", "cat" : "Theory", "label" : "Scheduling Trees with Communication and Precedence Delays", "venue" : "SODA", "place" : "Washington, DC", "year" : "2001", "booktitle" : "Proceedings of the {$12^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "ps" : "Papers/engels01parallel.ps", "pub-type" : "inproceedings", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2001-01", "month" : "January", "organization" : "ACM-SIAM", "key" : "Karger:Pipeline" }, { "publisher" : "Springer", "pdf" : "http://iptps04.cs.ucsd.edu/papers/karger-load-balance.pdf", "booktitle" : "IPTPS: 3rd International Workshop on Peer to Peer Systems", "pub-type" : "inproceedings", "venue" : "IPTPS", "crossref" : "IPTPS: 3rd International Workshop on Peer to Peer Systems", "uri" : "urn:0ae7f4ba004b165fc530ac4d998b441f", "date" : "2004-02", "author" : [ "Karger, David R.", "Ruhl, Matthias" ], "series" : "LNCS Hot Topics", "month" : "February", "type" : "Publication", "year" : "2004", "cat" : [ "Theory", "P2P" ], "label" : "Load Balancing in P2P Systems", "key" : "Karger:P2PLoadBalance-IPTPS" }, { "location" : "Barcelona, Spain", "note" : "Preliminary version in IPTPS 2004", "type" : "Publication", "author" : [ "Karger, David R.", "Ruhl, Matthias" ], "isbn" : "1-58113-840-7", "uri" : "urn:f9d24b939587cacfb143772467d83d25", "cat" : [ "Theory", "P2P" ], "label" : "Simple efficient load balancing algorithms for peer-to-peer systems", "venue" : "SPAA", "pages" : "36--43", "year" : "2004", "booktitle" : "SPAA \'04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures", "publisher" : "ACM Press", "ps" : "Papers/loadbalancing-spaa.ps", "abstract" : "Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a constant factor of optimal. Our protocols refine the consistent hashing data structure that underlies the Chord (and Koorde) P2P network. Both preserve Chord\'s logarithmic query time and near-optimal data migration cost.Consistent hashing is an instance of the distributed hash table (DHT) paradigm for assigning items to nodes in a peer-to-peer system: items and nodes are mapped to a common address space, and nodes have to store all items residing closeby in the address space.Our first protocol balances the distribution of the key address space to nodes, which yields a load-balanced system when the DHT maps items \"randomly\" into the address space. To our knowledge, this yields the first P2P scheme simultaneously achieving O(log n) degree, O(log n) look-up cost, and constant-factor load balance (previous schemes settled for any two of the three).Our second protocol aims to directly balance the distribution of items among the nodes. This is useful when the distribution of items in the address space cannot be randomized. We give a simple protocol that balances load by moving nodes to arbitrary locations \"where they are needed.\" As an application, we use the last protocol to give an optimal implementation of a distributed data structure for range searches on ordered data.", "pub-type" : "inproceedings", "pdf" : "Papers/loadbalancing-spaa.pdf", "doi" : "http://doi.acm.org/10.1145/1007912.1007919", "date" : "2004", "key" : "Karger:P2PLoadBalance" }, { "id" : "a5e2a68957ab421f1b68ae99d9029d3c", "pdf" : "Papers/dht-loadbalance-journal.pdf", "journal" : "Theory of Computing Systems", "pub-type" : "article", "uri" : "urn:a5e2a68957ab421f1b68ae99d9029d3c", "pages" : "787--804", "date" : "2006", "number" : "6", "author" : [ "Karger, David R.", "Ruhl, Matthias" ], "volume" : "39", "type" : "Publication", "year" : "2006", "note" : "Preliminary versions in IPTPS 2004 and SPAA 2004", "abstract" : "Load balancing is a critical issue for the efficient operation of peer-to-peer (P2P) networks. We give two new load-balancing protocols whose provable performance guarantees are within a constant factor of optimal. Our protocols refine the consistent hashing data structure that underlies the Chord (and Koorde) P2P network. Both preserve Chord\'s logarithmic query time and near-optimal data migration cost. Consistent hashing is an instance of the distributed hash table (DHT) paradigm for assigning items to nodes in a P2P system: items and nodes are mapped to a common address space, and nodes have to store all items residing closeby in the address space. Our first protocol balances the distribution of the key address space to nodes, which yields a load-balanced system when the DHT maps items \"randomly\" into the address space. To our knowledge, this yields the first P2P scheme simultaneously achieving O(log n) degree, O(log n) look-up cost, and constant-factor load balance (previous schemes settled for any two of the three). Our second protocol aims to balance directly the distribution of items among the nodes. This is useful when the distribution of items in the address space cannot be randomized. We give a simple protocol that balances load by moving nodes to arbitrary locations \"where they are needed.\" As an application, we use the last protocol to give an optimal implementation of a distributed data structure for range searches on ordered data. ", "cat" : [ "Theory", "P2P" ], "label" : "Simple efficient load balancing algorithms for peer-to-peer systems", "key" : "Karger:P2PLoadBalance-Journal" }, { "crossref" : "Proceedings of the {$16^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "type" : "Publication", "author" : [ "Harvey, Nicholas J. A.", "Karger, David R.", "Murota, Kazuo" ], "uri" : "urn:57a4973f2ab26e6d8b65f1be1023486e", "cat" : [ "Theory", "Coding" ], "label" : "Deterministic Network Coding by Matrix Completion", "venue" : "SODA", "place" : "Vancouver, BC", "year" : "2005", "booktitle" : "Proceedings of the {$16^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "ps" : "Papers/detnetcode.ps", "abstsract" : " We present a new deterministic algorithm to construct network codes for multicast problems, a particular class of network information ow problems. Our algorithm easily generalizes to several variants of multicast problems. Our approach is based on a new algorithm for maximum-rank completion of mixed matrices---taking a matrix whose entries are a mixture of numeric values and symbolic variables, and assigning values to the variables so as to maximize the resulting matrix rank. Our algorithm is faster than existing deterministic algorithms and can operate over a smaller field. ", "pub-type" : "inproceedings", "pdf" : "Papers/detnetcode.pdf", "date" : "2005-01", "month" : "January", "organization" : "ACM-SIAM", "key" : "Karger:DetNetCoding" }, { "location" : "Miami, Florida", "crossref" : "Proceedings of the {$17^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "type" : "Publication", "author" : [ "Harvey, Nicholas J. A.", "Karger, David R.", "Yekhanin, Sergey" ], "address" : "New York, NY, USA", "isbn" : "0-89871-605-5", "uri" : "urn:1cb5957b405d27ad1fb5051156001aa4", "cat" : [ "Theory", "Coding" ], "label" : "The Complexity of Matrix Completion", "venue" : "SODA", "place" : "Miami, FL", "pages" : "1103--1111", "year" : "2006", "booktitle" : "Proceedings of the {$17^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "publisher" : "ACM Press", "abstsract" : "Given a matrix whose entries are a mixture of numeric values and symbolic variables, the matrix completion problem is to assign values to the variables so as to maximize the resulting matrix rank. This problem has deep connections to computational complexity and numerous important algorithmic applications. Determining the complexity of this problem is a fundamental open question in computational complexity. Under different settings of parameters, the problem is variously in P, in RP, or NP-hard. We shed new light on this landscape by demonstrating a new region of NP-hard scenarios. As a special case, we obtain the first known hardness result for matrices in which each variable appears only twice.Another particular scenario that we consider is the simultaneous matrix completion problem, where one must simultaneously maximize the rank for several matrices that share variables. This problem has important applications in the field of network coding. Recent work has given a simple, greedy, deterministic algorithm for this problem, assuming that the algorithm works over a sufficiently large field. We show an exact threshold for the field size required to find a simultaneous completion efficiently. This result implies that, surprisingly, the simple greedy algorithm is optimal: finding a simultaneous completion over any smaller field is NP-hard.", "pub-type" : "inproceedings", "pdf" : "http://math.ias.edu/ yekhanin/Papers/Soda06.pdf", "doi" : "http://doi.acm.org/10.1145/1109557.1109679", "date" : "2006-01", "month" : "January", "organization" : "ACM-SIAM", "key" : "Karger:MatrixCompletion" }, { "location" : "New Orleans, Louisiana", "crossref" : "Proceedings of the {$15^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "type" : "Publication", "author" : [ "Karger, David R.", "Ruhl, Matthias" ], "address" : "Philadelphia, PA, USA", "isbn" : "0-89871-558-X", "uri" : "urn:6d898f53767e85d4bcc4b40a813cabbf", "cat" : [ "Theory", "P2P" ], "label" : "Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer to Peer Systems", "venue" : "SODA", "year" : "2004", "booktitle" : "Proceedings of the {$15^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "publisher" : "Society for Industrial and Applied Mathematics", "ps" : "Papers/subgroups-iptps.ps", "abstract" : "n most of the P2P systems developed so far, all nodes play essentially the same role. In some applications, however, different machine capabilities or owner preferences may mean that only a subset of nodes in the system should participate in offering a particular service. Arranging for each service to be supported by a different peer to peer network is, we argue here, a wasteful solution.", "pub-type" : "inproceedings", "pdf" : "Papers/subgroups-iptps.pdf", "date" : "2004", "key" : "Karger:SubRings" }, { "label" : "d76a8f67574c71f4b193422d1ad027e3", "key" : "Rennie03", "type" : "Publication", "pub-type" : "inproceedings", "note" : "see karger:fixbayes", "uri" : "urn:d76a8f67574c71f4b193422d1ad027e3" }, { "confurl" : "http://www.sigir2003.org", "crossref" : "$26^{th}$ Internationl ACM SIGIR Conference", "type" : "Publication", "author" : [ "Teevan, Jaime", "Karger, David R." ], "address" : "Toronto", "uri" : "urn:063611ee751601afb0214c7edf5ca2ca", "cat" : [ "Information Retrieval", "Machine Learning" ], "label" : "Empirical Development of an Exponential Probabilistic Model for Text Retrieval", "venue" : "SIGIR", "year" : "2003", "booktitle" : "$26^{th}$ Internationl ACM SIGIR Conference", "publisher" : "ACM", "abstract" : "Much work in information retrieval focuses on using a model of documents and queries to derive retrieval algorithms. Model based development is a useful alternative to heuristic development because in a model the assumptions are explicit and can be examined and refined independent of the particular retrieval algorithm. We explore the explicit assumptions underlying the na?ve framework by performing computational analysis of actual corpora and queries to devise a generative document model that closely matches text. Our thesis is that a model so developed will be more accurate than existing models, and thus more useful in retrieval, as well as other applications. We test this by learning from a corpus the best document model. We find the learned model better predicts the existence of text data and has improved performance on certain IR tasks.", "pub-type" : "inproceedings", "pdf" : "http://people.csail.mit.edu/karger/Papers/sigir03.pdf", "date" : "2003-07", "month" : "July", "organization" : "ACM SIGIR", "key" : "Karger:EmpiricalExponential" }, { "crossref" : "The Twentieth International Conference on Machine Learning", "type" : "Publication", "author" : [ "Rennie, Jason D. M.", "Shih, Lawrence", "Teevan, Jaime", "Karger, David R." ], "address" : "Washington, DC", "url" : "http://www.hpl.hp.com/conferences/icml03/", "uri" : "urn:179458c0336746a029760729b504cbc9", "cat" : [ "Information Retrieval", "Machine Learning" ], "label" : "Tackling the Poor Assumptions of Naive Bayes Text Classifiers", "venue" : "ICML", "year" : "2003", "booktitle" : "The Twentieth International Conference on Machine Learning", "abstract" : "Naive Bayes is often used as a baseline in text classification because it is fast and easy to implement. Its severe assumptions make such efficiency possible but also adversely affect the quality of its results. In this paper we propose simple, heuristic solutions to some of the problems with Naive Bayes classifiers, addressing both systemic issues as well as problems that arise because text is not actually generated according to a multinomial model. We find that our simple corrections result in a fast algorithm that is competitive with stateof- the-art text classification algorithms such as the Support Vector Machine.", "psgz" : "http://haystack.lcs.mit.edu/papers/rennie.icml03.ps.gz", "pub-type" : "inproceedings", "pdf" : "http://haystack.lcs.mit.edu/papers/rennie.icml03.pdf", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2003-08", "month" : "August", "key" : "Karger:FixBayes" }, { "confurl" : "http://www.sigir2003.org", "crossref" : "$26^{th}$ Internationl ACM SIGIR Conference", "type" : "Publication", "author" : [ "Teevan, Jaime", "Karger, David R." ], "address" : "Toronto", "uri" : "urn:11fa3a4ea4d8771ff60af2218220a11c", "cat" : [ "Information Retrieval", "Machine Learning" ], "label" : "Empirical Development of an Exponential Probabilistic Model for Text Retrieval: Using Textual Analysis to Build a Better Model", "venue" : "SIGIR", "year" : "2003", "booktitle" : "$26^{th}$ Internationl ACM SIGIR Conference", "publisher" : "ACM", "ps" : "http://haystack.lcs.mit.edu/papers/teevan.sigir03.ps", "abstract" : "Much work in information retrieval focuses on using a model of documents and queries to derive retrieval algorithms. Model based development is a useful alternative to heuristic development because in a model the assumptions are explicit and can be examined and refined independent of the particular retrieval algorithm. We explore the explicit assumptions underlying the na?ve framework by performing computational analysis of actual corpora and queries to devise a generative document model that closely matches text. Our thesis is that a model so developed will be more accurate than existing models, and thus more useful in retrieval, as well as other applications. We test this by learning from a corpus the best document model. We find the learned model better predicts the existence of text data and has improved performance on certain IR tasks.", "pub-type" : "inproceedings", "pdf" : "http://haystack.lcs.mit.edu/papers/teevan.sigir03.pdf", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2003-07", "month" : "July", "organization" : "ACM SIGIR", "key" : "Karger:BayesIR" }, { "confurl" : "http://portal.acm.org/toc.cfm?id=365411&dl=GUIDE&dl=ACM&type=proceeding&idx=SERIES422&part=Proceedings&WantType=Proceedings", "postscript" : "Papers/bayes.ps", "crossref" : "Proceedings of the {$12^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "type" : "Publication", "author" : [ "Karger, David R.", "Srebro, Nati" ], "editor" : "S. Rao Kosaraju", "uri" : "urn:8faf7884e2ab3a60228ed5d64aab0981", "cat" : [ "Theory", "Machine Learning" ], "label" : "Learning Markov Networks: Maximum Bounded Tree-width Graphs", "venue" : "SODA", "place" : "Washington, DC", "pages" : "392--401", "year" : "2001", "booktitle" : "Proceedings of the {$12^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "abstract" : "Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a joint probability distribution. Once one has chosen to use a Markov network model, one aims to choose the model that ?best explains? the data that has been observed?this model can then be used to make predictions about future data. We show that the problem of learning a maximum likelihood Markov network given certain observed data can be reduced to the problem of identifying a maximum weight low-treewidth graph under a given input weight function. We give the first constant factor approximation algorithm for this problem. More precisely, for any fixed treewidth objective k, we find a treewidth-k graph with an f(k) fraction of the maximum possible weight of any treewidth-k graph.", "psgz" : "Papers/bayes.ps.gz", "pub-type" : "inproceedings", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2001-01", "month" : "January", "organization" : "ACM-SIAM", "key" : "Karger:Markov" }, { "crossref" : "Proceedings of the {$34^{th}$} Annual Symposium on the Foundations of Computer Science", "note" : "Journal version appears in Mathematical Programming B 82(1--2)", "type" : "Publication", "author" : "Karger, David R.", "editor" : "Leonidas Guibas", "uri" : "urn:31f9417b42bcd572b624106105db9c02", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "Random Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning Trees", "venue" : "FOCS", "place" : "Palo Alto, CA", "pages" : "84--93", "year" : "1993", "booktitle" : "Proceedings of the {$34^{th}$} Annual Symposium on the Foundations of Computer Science", "publisher" : "{IEEE} Computer Society Press", "ps" : "http://people.csail.mit.edu/karger/Papers/matroid.ps", "abstract" : "Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization and demonstrate the effectiveness of these paradigms for two optimization problems on matroids: Finding an optimum matroid basis and packing disjoint matroid bases. Applications of these ideas to the graphic matroid led to fast algorithms for minimum spanning trees and minimum cuts. An optimum matroid basis is typically found by a greedy algorithm that grows an independent set into an the optimum basis one element at a time. This continuous change in the independent set can make it hard to perform the independence tests needed by the greedy algorithm. We simplify matters by using sampling to reduce the problem of finding an optimum matroid basis to the problem of verifying that a given fixed basis is optimum, showing that the two problems can be solved in roughly the same time. Another application of sampling is to packing matroid bases, also known as matroid partitioning. Sampling reduces the number of bases that must be packed. We combine sampling with a greedy packing strategy that reduces the size of the matroid. Together, these techniques give accelerated packing algorithms. We give particular attention to the problem of packing spanning trees in graphs, which has applications in network reliability analysis. Our results can be seen as generalizing certain results from random graph theory. The techniques have also been effective for other packing problems.", "pub-type" : "inproceedings", "date" : "1993-11", "month" : "November", "organization" : "IEEE", "key" : "Karger:Matroid-Conf" }, { "ps" : "http://people.csail.mit.edu/karger/Papers/matroid.ps", "journal" : "Mathematical Programming {B}", "pub-type" : "article", "uri" : "urn:a51db1b607a9e928e8c87d1ef680e065", "pages" : "41--81", "date" : "1998-06", "number" : "1--2", "author" : "Karger, David R.", "volume" : "82", "month" : "June", "type" : "Publication", "year" : "1998", "note" : "A preliminary version appeared in Proceedings of the {$34^{th}$} Annual Symposium on the Foundations of Computer Science", "cat" : [ "Theory", "Cuts and Flows" ], "abstract" : "Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the effectiveness of these paradigms for two optimization problems on matroids: finding an optimum matroid basis and packing disjoint matroid bases. Applications of these ideas to the graphic matroid led to fast algorithms for minimum spanning trees and minimum cuts. An optimum matroid basis is typically found by a greedy algorithm that grows an independent set into an the optimum basis one element at a time. This continuous change in the independent set can make it hard to perform the independence tests needed by the greedy algorithm. We simplify matters by using sampling to reduce the problem of finding an optimum matroid basis to the problem of verifying that a given fixed basis is optimum, showing that the two problems can be solved in roughly the same time. Another application of sampling is to packing matroid bases, also known as matroid partitioning. Sampling reduces the number of bases that must be packed. We combine sampling with a greedy packing strategy that reduces the size of the matroid. Together, these techniques give accelerated packing algorithms. We give particular attention to the problem of packing spanning trees in graphs, which has applications in network reliability analysis. Our results can be seen as generalizing certain results from random graph theory. The techniques have also been effective for other packing problems.", "label" : "Random Sampling and Greedy Sparsification in Matroid Optimization Problems", "key" : "Karger:Matroid" }, { "crossref" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "note" : "Journal version appears in Journal of the ACM43(4)", "type" : "Publication", "author" : "Karger, David R.", "uri" : "urn:c58d1f15653d9cd4838b598385ff8fd6", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "Global Min-cuts in {$\\RNC$} and Other Ramifications of a Simple Mincut Algorithm", "venue" : "SODA", "place" : "Austin, TX", "pages" : "21--30", "year" : "1993", "booktitle" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "ps" : "Papers/mincut.ps", "abstract" : "This paper presents a new algorithm for finding global min-cuts in weighted, undirected graphs. One of the strengths of the algorithm is its extreme simplicity. This randomized algorithm can be implemented as a strongly polynomial sequential algorithm with running time 6(mn2), even if space is restricted to O(n), or can be parallelized as an Zn/C algorithm which runs in time O(log2 n) on a CRCW PRAM with mn2 log n processors. In addition to yielding the best known processor bounds on unweighted graphs, this algorithm provides the first proof that the min-cut problem for weighted undirected graphs is in 7ZAfC. The algorithm does more than find a single mm-cut; it finds all of them. The algorithm also yields numerous results on network reliability, enumeration of cuts, multi-way cuts, and approximate mm-cuts. 1", "pub-type" : "inproceedings", "date" : "1993-01", "month" : "January", "organization" : "ACM-SIAM", "key" : "Karger:Mincut" }, { "crossref" : "Proceedings of the {$5^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "note" : "Journal version appears in Journal of Algorithms 20", "type" : "Publication", "author" : [ "Karger, David R.", "Phillips, Steven", "Torng, Eric" ], "editor" : "Daniel D. Sleator", "uri" : "urn:d0de99647219e7f1a0ff2d7b3259b12e", "cat" : [ "Theory", "Scheduling" ], "label" : "A Better Algorithm for an Ancient Scheduling Problem", "venue" : "SODA", "place" : "Arlington, VA", "pages" : "132--140", "year" : "1994", "booktitle" : "Proceedings of the {$5^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "ps" : "http://people.csail.mit.edu/karger/Papers/makespan.ps", "abstract" : "One of the oldest and simplest variants of multiprocessor scheduling is the on-line scheduling problem studied by Graham in 1966. In this problem, the jobs arrive on-line and must be scheduled non-preemptively on m identical machines so as to minimize the makespan. The size of a job is known on arrival. Graham proved that the List Processing Algorithm which assigns each job to the currently least loaded machine has competitive ratio (2 - l/m). Recently algorithms with smaller competitive ratios than List Processing have been discovered, culminating in Bartal, Fiat, Karloff, and Vohra?s construction of an algorithm with competitive ratio bounded away from 2. Their algorithm has a competitive ratio of at most (2 - l/70) w 1.986 for all m; hence for m > 70, their algorithm is provably better than List Processing. We present a more natural algorithm that outperforms List Processing for any m 2 6 and has a competitive ratio of at most 1.945 for all m, which is significantly closer to the best known lower bound of 1.837 for the problem. We show that our analysis of the algorithm is almost tight by presenting a lower bound of 1.9378 on the algorithm?s competitive ratio for large m. ", "pub-type" : "inproceedings", "date" : "1994-01", "month" : "January", "organization" : "ACM-SIAM", "key" : "Karger:Makespan-Conf" }, { "ps" : "http://www.cse.msu.edu/ torng/Research/Pubs/ancient.ps", "id" : "027cf327a70ea786c34de3c8528fcc15", "journal" : "Journal of Algorithms", "pub-type" : "article", "uri" : "urn:027cf327a70ea786c34de3c8528fcc15", "pages" : "400--430", "date" : "1996-03", "author" : [ "Karger, David R.", "Phillips, Steven", "Torng, Eric" ], "volume" : "20", "month" : "March", "type" : "Publication", "year" : "1996", "note" : "A preliminary version appeared in Proceedings of the {$5^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "abstract" : "One of the oldest and simplest variants of multiprocessor scheduling is the on-line scheduling problem studied by Graham in 1966. In this problem, the jobs arrive on-line and must be scheduled non-preemptively on m identical machines so as to minimize the makespan. The size of a job is known on arrival. Graham proved that the List Processing Algorithm which assigns each job to the currently least loaded machine has competitive ratio (2 - l/m). Recently algorithms with smaller competitive ratios than List Processing have been discovered, culminating in Bartal, Fiat, Karloff, and Vohra?s construction of an algorithm with competitive ratio bounded away from 2. Their algorithm has a competitive ratio of at most (2 - l/70) w 1.986 for all m; hence for m > 70, their algorithm is provably better than List Processing. We present a more natural algorithm that outperforms List Processing for any m 2 6 and has a competitive ratio of at most 1.945 for all m, which is significantly closer to the best known lower bound of 1.837 for the problem. We show that our analysis of the algorithm is almost tight by presenting a lower bound of 1.9378 on the algorithm?s competitive ratio for large m. ", "cat" : [ "Theory", "Scheduling" ], "label" : "A Better Algorithm for an Ancient Scheduling Problem", "key" : "Karger:Makespan" }, { "pub-type" : "unpublished", "uri" : "urn:5962d2e12e692905cce3b20742ccb956", "date" : "1992", "author" : "Karger, David R.", "note" : "Manuscript.", "type" : "Publication", "year" : "1992", "cat" : "Theory", "label" : "Approximating, Verifying, and Constructing Minimum Spanning Forests", "key" : "Karger:MST-manuscript" }, { "crossref" : "Proceedings of the {$33^{rd}$} Annual Symposium on the Foundations of Computer Science", "type" : "Publication", "author" : [ "Karger, David R.", "Minkoff, Maria" ], "uri" : "urn:ef9a7ee49f4117ea68178855a79be213", "cat" : "Theory", "label" : "Building Routing Trees with Incomplete Global Knowledge", "venue" : "FOCS", "place" : "Rodondo Beach, CA", "pages" : "613--623", "year" : "2000", "booktitle" : "Proceedings of the {$33^{rd}$} Annual Symposium on the Foundations of Computer Science", "publisher" : "{IEEE} Computer Society Press", "ps" : "Papers/maybecast.ps", "pub-type" : "inproceedings", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2000-11", "month" : "November", "organization" : "IEEE", "key" : "Karger:Maybecast" }, { "location" : "New Orleans, Louisiana", "crossref" : "Proceedings of the {$15^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "type" : "Publication", "author" : [ "Immorlica, Nicole", "Karger, David", "Minkoff, Maria", "Mirrokni, Vahab S." ], "address" : "Philadelphia, PA, USA", "isbn" : "0-89871-558-X", "uri" : "urn:37fb82b6ab763d3ed0e835724c0730d1", "cat" : "Theory", "label" : "On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems", "venue" : "SODA", "pages" : "691--700", "year" : "2004", "booktitle" : "SODA \'04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms", "publisher" : "Society for Industrial and Applied Mathematics", "abstract" : "Combinatorial optimization is often used to \"plan ahead,\" purchasing and allocating resources for demands that are not precisely known at the time of solution. This advance planning may be done because resources become very expensive to purchase or difficult to allocate at the last minute when the demands are known. In this work we study the tradeoffs involved in making some purchase/allocation decisions early to reduce cost while deferring others at greater expense to take advantage of additional, late-arriving information. We consider a number of combinatorial optimization problems in which the problem instance is uncertain---modeled by a probability distribution---and in which solution elements can be purchased cheaply now or at greater expense after the distribution is sampled. We show how to approximately optimize the choice of what to purchase in advance and what to defer.", "pub-type" : "inproceedings", "pdf" : "http://www.ece.northwestern.edu/ nickle/pubs/stochopt.pdf", "date" : "2004", "key" : "Karger:2Stage" }, { "crossref" : "Proceedings of the {$36^{th}$} Annual Symposium on the Foundations of Computer Science", "type" : "Publication", "author" : [ "Blum, Avrim", "Chawla, Shuchi", "Karger, David R.", "Lane, Terran", "Meyerson, Adam", "Minkoff, Maria" ], "uri" : "urn:9ad86e311b9a996411ff61331ff278e2", "cat" : "Theory", "label" : "Approximation Algorithms for Orienteering and Discounted-Reward TSP", "venue" : "FOCS", "place" : "Cambridge, MA", "year" : "2003", "booktitle" : "Proceedings of the {$36^{th}$} Annual Symposium on the Foundations of Computer Science", "publisher" : "{IEEE} Computer Society Press", "ps" : "http://people.csail.mit.edu/karger/Papers/markovTSP.ps", "abstract" : "In this paper, we give the first constant-factor approximation algorithm for the rooted ORIENTEERING problem, as well as a new problem that we call the DISCOUNTED-REWARD-TSP, motivated by robot navigation. In both problems, we are given a graph with lengths on edges and rewards on nodes, and a start node s. In the ORIENTEERING problem, the goal is to find a path starting at s that maximizes the reward collected, subject to a hard limit on the total length of the path. In the DISCOUNTEDREWARD- TSP, instead of a length limit we are given a discount factor ?, and the goal is to maximize total discounted reward collected, where reward for a node reached at time t is discounted by ?t. This problem is motivated by an approximation to a planning problem in theMarkov decision process (MDP) framework under the commonly employed infinite horizon discounted reward optimality criterion. The approximation arises from a need to deal with exponentially large state spaces that emerge when trying to model one-time events and non-repeatable rewards (such as for package deliveries). We also consider tree and multiple-path variants of these problems and provide approximations for those as well. Although the unrooted ORIENTEERING problem, where there is no fixed start node s, has been known to be approximable using algorithms for related problems such as k-TSP (in which the amount of reward to be collected is fixed and the total length is approximately minimized), ours is the first to approximate the rooted question, solving an open problem [3, 1]. We complement our approximation result for ORIENTEERING by showing that the problem is APX-hard. ", "pub-type" : "inproceedings", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2003-10", "month" : "October", "organization" : "IEEE", "key" : "Karger:DiscountTSP" }, { "number" : "6", "crossref" : "014364d38bc00d07e9f83b8d4993fac7", "note" : "A preliminary version appeared in Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "type" : "Publication", "author" : [ "Karger, David R.", "Koller, Daphne", "Phillips, Steven J." ], "uri" : "urn:6d7259c15ae1c46ebc5d729fc327e376", "cat" : "Theory", "label" : "Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths", "pages" : "1199--1217", "year" : "1993", "journal" : "SIAM Journal on Computing", "ps" : "http://people.csail.mit.edu/karger/Papers/path.journal.ps", "abstract" : "The all-pairs shortest-paths problem in weighted graphs is investigated. An algorithm?the Hidden-Paths Algorithm?that finds these paths in time $O(m^ * n + n^2 \\log n)$, where $m^ * $ is the number of edges participating in shortest paths, is presented. The algorithm is a practical substitute for Dijkstra\'s algorithm. It is argued that $m^ * $ is likely to be small in practice since $m^ * = O(n\\log n)$ with high probability for many probability distributions on edge weights. An $\\Omega (mn)$ lower bound on the running time of any path-comparison-based algorithm for the all-pairs shortest-paths problem is also proved. Path-comparison-based algorithms form a natural class containing the Hidden-Paths Algorithm, as well as the algorithms of E. W. Dijkstra [Numer. Math., 1 (1959), pp. 269?271] and R. W. Floyd [Comm. ACM, 5 (1962), p. 345]. Lastly, generalized forms of the shortest-paths problem are considered, and it is shown that many of the standard shortest-paths algorithms are effective in this more general setting.", "volume" : "22", "pub-type" : "article", "date" : "1993-12", "month" : "December", "key" : "Karger:Paths" }, { "number" : "6", "note" : "A preliminary version appeared in Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "type" : "Publication", "author" : [ "Karger, David R.", "Koller, Daphne", "Phillips, Steven J." ], "uri" : "urn:014364d38bc00d07e9f83b8d4993fac7", "cat" : "Theory", "label" : "Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths", "pages" : "1199--1217", "year" : "1993", "journal" : "SIAM Journal on Computing", "id" : "014364d38bc00d07e9f83b8d4993fac7", "ps" : "http://people.csail.mit.edu/karger/Papers/path.journal.ps", "abstract" : "The all-pairs shortest-paths problem in weighted graphs is investigated. An algorithm?the Hidden-Paths Algorithm?that finds these paths in time $O(m^ * n + n^2 \\log n)$, where $m^ * $ is the number of edges participating in shortest paths, is presented. The algorithm is a practical substitute for Dijkstra\'s algorithm. It is argued that $m^ * $ is likely to be small in practice since $m^ * = O(n\\log n)$ with high probability for many probability distributions on edge weights. An $\\Omega (mn)$ lower bound on the running time of any path-comparison-based algorithm for the all-pairs shortest-paths problem is also proved. Path-comparison-based algorithms form a natural class containing the Hidden-Paths Algorithm, as well as the algorithms of E. W. Dijkstra [Numer. Math., 1 (1959), pp. 269?271] and R. W. Floyd [Comm. ACM, 5 (1962), p. 345]. Lastly, generalized forms of the shortest-paths problem are considered, and it is shown that many of the standard shortest-paths algorithms are effective in this more general setting.", "volume" : "22", "pub-type" : "article", "date" : "1993-12", "month" : "December", "key" : "Karger:Paths-Journal" }, { "crossref" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "note" : "Journal version appears in SIAM Journal on Computing 22(6)", "type" : "Publication", "author" : [ "Karger, David R.", "Koller, Daphne", "Phillips, Steven J." ], "uri" : "urn:021da62bff30599c42e2845b5bd33f08", "cat" : "Theory", "label" : "Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths", "venue" : "FOCS", "place" : "San Juan, Puerto Rico", "pages" : "560--568", "year" : "1991", "booktitle" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "id" : "021da62bff30599c42e2845b5bd33f08", "publisher" : "{IEEE} Computer Society Press", "ps" : "http://people.csail.mit.edu/karger/Papers/path.focs.ps", "abstract" : "The all-pairs shortest paths problem in weighted graphs is investigated. An algorithm called the hidden paths algorithm, which finds these paths in time O(m*+n n2 log n), where m* is the number of edges participating in shortest paths, is presented. It is argued that m* is likely to be small in practice, since m*=O(n log n) with high probability for many probability distributions on edge weights. An O(mn) lower bound on the running time of any path-comparison-based algorithm for the all-pairs shortest paths problem is proved", "pub-type" : "inproceedings", "date" : "1991-10", "month" : "October", "organization" : "IEEE", "key" : "Karger:Paths-Conf" }, { "confurl" : "http://iptps03.cs.berkeley.edu/", "crossref" : "2nd International Workshop on Peer to Peer Systems", "type" : "Publication", "author" : [ "Li, Jinyang", "Loo, Book Thau", "Hellerstein, Joe", "Kaashoek, M. Frans", "Karger, David R.", "Morris, Robert" ], "address" : "Berkeley, CA", "editor" : "M. Frans Kaashoek and Ion Stoica", "uri" : "urn:012df9991d2c35a0aa66247535843068", "cat" : [ "Systems", "P2P" ], "label" : "On the Feasibility of Peer-to-Peer Web Indexing and Search", "venue" : "IPTPS", "series" : "LNCS Hot Topics", "pages" : "207--215", "year" : "2003", "booktitle" : "2nd International Workshop on Peer to Peer Systems", "publisher" : "Springer", "abstract" : "This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of queries over an overlay network (as in Gnutella), and intersection of index lists stored in a distributed hash table. We present a simple feasibility analysis based on the resource constraints and search workload. Our study suggests that the peer-to-peer network does not have enough capacity to make naive use of either of search techniques attractive for Web search. The paper presents a number of existing and novel optimizations for P2P search based on distributed hash tables, estimates their effects on performance, and concludes that in combination these optimizations would bring the problem to within an order of magnitude of feasibility. The paper suggests a number of compromises that might achieve the last order of magnitude.", "pub-type" : "inproceedings", "pdf" : "http://pdos.csail.mit.edu/ rtm/papers/search_feasibility.pdf", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2003-01", "month" : "January", "key" : "Karger:P2P-search" }, { "type" : "Publication", "author" : [ "Liben-Nowell, David", "Balakrishnan, Hari", "Karger, David R." ], "address" : "Monterey, CA", "uri" : "urn:7d30c03d42cc88e9b4824518d1a83190", "cat" : [ "Theory", "Applications of Theory", "P2P" ], "label" : "Analysis of the Evolution of Peer to Peer Systems", "venue" : "PODC", "pages" : "233--242", "year" : "2002", "booktitle" : "ACM Symposium on Principles of Distributed Computing", "ps" : "http://pdos.lcs.mit.edu/chord/papers/podc2002.ps", "abstract" : "In this paper, we give a theoretical analysis of peer-to-peer (P2P) networks operating in the face of concurrent joins and unexpected departures. We focus on Chord, a recently developed P2P system that implements a distributed hash table abstraction, and study the process by which Chord maintains its distributed state as nodes join and leave the system. We argue that traditional performance measures based on run-time are uninformative for a continually running P2P network, and that the rate at which nodes in the network need to participate to maintain system state is a more useful metric. We give a general lower bound on this rate for a network to remain connected, and prove that an appropriately modified version of Chord\'s maintenance rate is within a logarithmic factor of the optimum rate.", "pub-type" : "inproceedings", "pdf" : "http://pdos.lcs.mit.edu/chord/papers/podc2002.pdf", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2002-07", "month" : "July", "key" : "Karger:P2P-Evol" }, { "booktitle" : "Proceedings of the First International Workshop on Peer-to-Peer Systems", "pub-type" : "inproceedings", "venue" : "IPTPS", "crossref" : "Proceedings of the First International Workshop on Peer-to-Peer Systems", "uri" : "urn:7baa6b91ccd654f92d61b7944a426781", "date" : "2002-03", "author" : [ "Liben-Nowell, David", "Balakrishnan, Hari", "Karger, David R." ], "studentwork" : "\\asteriskit{\\labelwidth} ", "month" : "March", "type" : "Publication", "year" : "2002", "cat" : [ "Theory", "Applications of Theory", "P2P" ], "abstract" : "A fundamental theoretical challenge in peer-to-peer systems is proving statements about the evolution of the system while nodes are continuously joining and leaving. Because the system will operate for an infinite time, performance measures based on runtime are uninformative; instead, we must study the rate at which nodes consume resources in order to maintain the system state. This ?maintenance bandwidth? depends on the rate at which nodes tend to enter and leave the system. In this paper, we formalize this dependence. Having done so, we analyze the Chord peer-to-peer protocol. We show that Chord\'s maintenance bandwidth to handle concurrent node arrivals and departures is near optimal, exceeding the lower bound by only a logarithmic factor. We also outline and analyze an algorithm that converges to a correct routing state from an arbitrary initial condition.", "label" : "Observations on the Dynamic Evolution of Peer to Peer Systems", "address" : "Cambridge, MA", "key" : "Karger:P2P-Evol-IPTPS" }, { "crossref" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "note" : "Journal version appears in Journal of Computer and System Sciences 55", "type" : "Publication", "author" : [ "Karger, David R.", "Koller, Daphne" ], "editor" : "Shafi Goldwasser", "uri" : "urn:88e150407ee1b75733ceb9f79c52186b", "cat" : "Theory", "label" : "(De)Randomized Construction of Small Sample Spaces in {$\\NC$}", "venue" : "FOCS", "place" : "Santa Fe, NM", "pages" : "252--263", "year" : "1994", "booktitle" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "publisher" : "{IEEE} Computer Society Press", "ps" : "http://people.csail.mit.edu/karger/Papers/proc-random.ps", "abstract" : "Koller and Megiddo introduced the paradigm of constructing compact distributions that satisfy a given set of constraints and showed how it can be used to efficiently derandomize certain types of algorithms. In this paper, we significantly extend their results in two ways. First, we show how their approach can be applied to deal with more general expectation constraints.More importantly, we provide the first parallel (𝒩𝒞) algorithmfor constructing a compact distribution that satisfies the constraintsup to a small relative error. This algorithm deals with constraintsover any event that can be verified by finite automata, includingall independence constraints as well as constraints over eventsrelating to the parity or sum of a certain set of variables.Our construction relies on a new and independently interestingparallel algorithm for converting a solution to a linear systeminto an almost basic approximate solution to the same system.We use these techniques in the first 𝒩𝒞 derandomization of analgorithm for constructing large independent sets in d-uniformhypergraphs for arbitrary d. We also show how the linear programmingperspective suggests new proof techniques which might be usefulin general probabilistic analysis.", "pub-type" : "inproceedings", "date" : "1994-11", "month" : "November", "organization" : "IEEE", "key" : "Karger:Random-Conf" }, { "number" : "3", "type" : "Publication", "author" : [ "Karger, David R.", "Koller, Daphne" ], "uri" : "urn:26610b2769fedf192c890ce8c4f9d21d", "cat" : "Theory", "label" : "{(De)randomized} Construction of Small Sample Spaces in {$\\mathcal{NC}$}", "pages" : "402--413", "brag" : "Special issue of selected papers from Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "year" : "1997", "journal" : "Journal of Computer and System Sciences", "ps" : "http://people.csail.mit.edu/karger/Papers/random.ps", "abstract" : "Koller and Megiddo introduced the paradigm of constructing compact distributions that satisfy a given set of constraints and showed how it can be used to efficiently derandomize certain types of algorithms. In this paper, we significantly extend their results in two ways. First, we show how their approach can be applied to deal with more generalexpectation constraints. More importantly, we provide the firstparallel(NC) algorithm for constructing a compact distribution that satisfies the constraints up to a smallrelativeerror. This algorithm deals with constraints over any event that can be verified by finite automata, including allindependence constraintsas well as constraints over events relating to the parity or sum of a certain set of variables. Our construction relies on a new and independently interesting parallel algorithm for converting a solution to a linear system into an almost basic approximate solution to the same system. We use these techniques in the first NC derandomization of an algorithm for constructing large independent sets ind-uniform hypergraphs forarbitrary d. We also show how the linear programming perspective suggests new proof techniques which might be useful in general probabilistic analysis.", "preliminary" : "focs::KargerK1994", "volume" : "55", "pub-type" : "article", "date" : "1997-12", "month" : "December", "key" : "Karger:Random" }, { "journal" : "Journal of Parallel and Distributed Computing", "pub-type" : "article", "uri" : "urn:1f5114909892b72a2d1ff92907dcb2d5", "pages" : "122--133", "date" : "1997-09", "number" : "2", "author" : [ "Fizzano, Perry", "Karger, David R.", "Stein, Cliff", "Wein, Joel" ], "volume" : "45", "month" : "September", "type" : "Publication", "year" : "1997", "note" : "A preliminary version appeared in Proceedings of the {$6^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "abstract" : "We give a distributed approximation algorithm for job scheduling in a ring architecture. In contrast to many other parallel scheduling models, the model we consider captures the influence of the underlying communications network by specifying that task migration from one processor to another takes time proportional to the distance between those two processors in the network. As a result, our algorithm must balance computational load and communication time. The algorithm is simple, requires no global control, and yields schedules of length at most 4.22 times optimal. We also give a lower bound on the performance of any distributed algorithm and the results of simulation experiments which suggest better performance than does our worst-case analysis.", "cat" : "Theory", "label" : "Job Scheduling in Rings", "key" : "Karger:Ring" }, { "crossref" : "Proceedings of the {$6^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "note" : "Journal version appears in Journal of Parallel and Distributed Computing 45(2)", "type" : "Publication", "author" : [ "Fizzano, Perry", "Karger, David R.", "Stein, Cliff", "Wein, Joel" ], "uri" : "urn:cc012100621c64fe216f5c6a29578143", "cat" : "Theory", "label" : "Job Scheduling in Rings", "venue" : "SPAA", "pages" : "210--219", "year" : "1994", "booktitle" : "Proceedings of the {$6^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "id" : "cc012100621c64fe216f5c6a29578143", "ps" : "Papers/ring.ps", "abstract" : "We give a distributed approximation algorithm for job scheduling in a ring architecture. In contrast to many other parallel scheduling models, the model we consider captures the influence of the underlying communications network by specifying that task migration from one processor to another takes time proportional to the distance between those two processors in the network. As a result, our algorithm must balance computational load and communication time. The algorithm is simple, requires no global control, and yields schedules of length at most 4.22 times optimal. We also give a lower bound on the performance of any distributed algorithm and the results of simulation experiments which suggest better performance than does our worst-case analysis.", "pub-type" : "inproceedings", "date" : "1994-06", "month" : "June", "organization" : "ACM", "key" : "Karger:Ring-Conf" }, { "label" : "0701d55027a974f817f28f4850e29f19", "key" : "Karger:MST", "type" : "Publication", "pub-type" : "article", "note" : "see Karger:MST-Journal", "uri" : "urn:0701d55027a974f817f28f4850e29f19" }, { "ps" : "http://people.csail.mit.edu/karger/Papers/mst.ps", "url" : "http://doi.acm.org/10.1145/201019.201022", "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:d918c972bdcbdb9f424039a0248ab606", "pages" : "321--328", "date" : "1995-03", "number" : "2", "author" : [ "Karger, David R.", "Klein, Philip N.", "Tarjan, Robert E." ], "volume" : "42", "month" : "March", "type" : "Publication", "year" : "1995", "abstract" : "We present a randomized linear-time algorithm to find a minimum spanning tree in a connected graph with edge weights. The algorithm uses random sampling in combination with a recently discovered linear-time algorithm for verifying a minimum spanning tree. Our computational model is a unit-cost random-access machine with the restriction that the only operations allowed on edge weights are binary comparisons.", "cat" : "Theory", "label" : "A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees", "key" : "Karger:MST-Journal" }, { "crossref" : "Proceedings of the {$30^{th}$} {ACM} Symposium on Theory of Computing", "type" : "Publication", "author" : [ "Karger, David R.", "Klein, Philip N.", "Stein, Clifford", "Thorup, Mikkel", "Young, Neal" ], "uri" : "urn:be3d0ea3c7da42fe62422f68abf815f4", "cat" : "Theory", "label" : "Optimal Rounding Algorithms for a Geometric Embedding of the Multiway Cut Problem", "venue" : "STOC", "place" : "Philadelphia, PA", "pages" : "668--677", "year" : "1999", "booktitle" : "Proceedings of the {$30^{th}$} {ACM} Symposium on Theory of Computing", "publisher" : "ACM Press", "ps" : "http://people.csail.mit.edu/karger/Papers/kcut.ps", "abstract" : "Given an undirected graph with edge costs and a subset of k 2 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each terminal from the others. The multiway cut problem is to find a minimum-cost multiway cut. This problem is Max-SNP hard. Recently Calinescu, Karloff, end Rabbi (STOC?98) gave a novel geometric relaxation of the problem and a rounding scheme that produced a (312 - l/k)-approximation algorithm. In this paper. we study their geometric relaxation. In particular, we study the worst-case ratio between the value of the relaxation and the value of the minimum multicut (the so-called integrality gap of the relaxation). For k = 3, we show the integrality gap is 12/11. giving tight upper and lower bounds. That is, we exhibit a graph with integrality gap 12/11 and give an algorithm that finds a cut of value 12/11 times the relaxation value. This is the best possible perfom ance guarantee for any algorithm based purely on the value of the relaxation and improves on Calinescu et al.?s factor of 716. We also improve the upper hounds for all larger values of k. Fork = 4,5, our best upper bounds are based on computer constructed and analyzed rounding schemes, while fork > 6 we give an algorithm with performance ratio 1.3438 - a. Our results were discovered with the help of computational experiments that we also describe here. ", "pub-type" : "inproceedings", "date" : "1999-05", "month" : "May", "organization" : "ACM", "key" : "Karger:Multicut" }, { "id" : "00a152c52c30db76a612bc8263501f67", "pdf" : "http://people.csail.mit.edu/karger/Papers/kcut-journal.pdf", "journal" : "Mathematics of Operations Research", "pub-type" : "article", "uri" : "urn:00a152c52c30db76a612bc8263501f67", "pages" : "436--461", "date" : "2004", "number" : "3", "author" : [ "Karger, David R.", "Klein, Philip N.", "Stein, Clifford", "Thorup, Mikkel", "Young, Neal" ], "volume" : "29", "type" : "Publication", "year" : "2004", "abstract" : "Given an undirected graph with edge costs and a subset of k = 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each terminal from the others. The multiway cut problem is to .nd a minimum-cost multiway cut. This problem is Max-SNP hard. Recently, Calinescu et al. (Calinescu, G., H. Karloff, Y. Rabani. 2000. An improved approximation algorithm for Multiway Cut. J. Comput. System Sci. 60(3) 564-574) gave a novel geometric relaxation of the problem and a rounding scheme that produced a (3/2-1/k)-approximation algorithm. In this paper, we study their geometric relaxation. In particular, we study the worst-case ratio between the value of the relaxation and the value of the minimum multicut (the so-called integrality gap of the relaxation). For k =3, we show the integrality gap is 12/11, giving tight upper and lower bounds. That is, we exhibit a family of graphs with integrality gaps arbitrarily close to 12/11 and give an algorithm that .nds a cut of value 12/11 times the relaxation value. Our lower bound shows that this is the best possible performance guarantee for any algorithm based purely on the value of the relaxation. Our upper bound meets the lower bound and improves the factor of 7/6 shown by Calinescu et al. For all k, we show that there exists a rounding scheme with performance ratio equal to the integrality gap, and we give explicit constructions of polynomial-time rounding schemes that lead to improved upper bounds. For k = 4 and 5, our best upper bounds are based on computer-constructed rounding schemes (with computer proofs of correctness). For general k we give an algorithm with performance ratio 1.3438-ek. Our results were discovered with the help of computational experiments that we also describe here.", "cat" : "Theory", "label" : "Optimal Rounding Algorithms for a Geometric Embedding of the Multiway Cut Problem", "key" : "Karger:Multicut-Journal" }, { "crossref" : "Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing", "type" : "Publication", "author" : [ "Karger, David R.", "Plotkin, Serge" ], "uri" : "urn:945abe20ba88c60d7f51545940317a55", "cat" : "Theory", "label" : "Adding Multiple Cost Constraints to Combinatorial Optimization Problems, with Applications to Multicommodity Flows", "venue" : "STOC", "place" : "Las Vegas, NV", "pages" : "18--25", "year" : "1995", "booktitle" : "Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing", "publisher" : "ACM Press", "ps" : "Papers/packing.ps", "abstract" : "Minimum cost multicommodity flow is an instance of a simpler problem (multicommodity flow) to which a cost constraint has been added. In this paper we present a general scheme for solving a large class of such ?cost-added? problems?even if more than one cost is added. One of the main applications of this method is a new deterministic algorithm for approximately solving the minimumcost multicommodity flow problem. Our algorithm finds a (1 + e) approximation to the minimum cost flow in 0(e-3kmn) time, where k is the number of commodities, m is the number of edges, and n is the number vertices in the input problem. This improves the previous best deterministic bounds of O(e-4kmn2 ) [9] and 6(e-2k2m2) [15] by f ctors of n/6 and ekm/n respectively. In fact, it even dominates the best randomized bound of 0(e-2km2) [15]. The algorithm presented in this paper efficiently solves several other interesting generalizations of rein-cost flow problems, such as one in which each commodity can have its own distinct shipping cost per edge, or one in which there is more than one cost measure on the flows and all costs must be kept small simultaneously. Our approach is based on an extension of the approximate packing techniques in [15] and a generalization of the round-robin approach of [16] to multicommodity flow without costs.", "pub-type" : "inproceedings", "date" : "1995-05", "month" : "May", "organization" : "ACM", "key" : "Karger:Packing" }, { "issn" : "0302-9743", "type" : "Publication", "author" : [ "Engels, Daniel W.", "Karger, David R.", "Kolliopoulos, S. G.", "Sengupta, S.", "Uma, R. N.", "Wein, Joel" ], "uri" : "urn:90fb28fff8091520e0f0c7c5b962865a", "cat" : "Theory", "label" : "Techniques for Scheduling with Rejection", "venue" : "ESA", "pages" : "490", "year" : "1998", "booktitle" : "European Symposium on Algorithms (Lecture Notes in Computer Science) ", "ps" : "Papers/rejection.ps", "abstract" : "We consider the general problem of scheduling a set of jobs where we may choose not to schedule certain jobs, and thereby incur a penalty for each rejected job. More specifically, we focus on choosing a set of jobs to reject and constructing a schedule for the remaining jobs so as to optimize the sum of the weighted completion times of the jobs scheduled plus the sum of the penalties of the jobs rejected. We give several techniques for designing scheduling algorithms under this criterion. Many of these techniques show how to reduce a problem with rejection to a (potentially more complex) scheduling problem without re- jection. Some of the reductions are based on general properties of certain kinds of linear-programming relaxations of optimization problems, and therefore are applicable to problems outside of scheduling; we demon- strate this by giving an approximation algorithm for a variant of the facility-location problem. In the last section of the paper we consider a different notion of rejec- tion in the context of scheduling: scheduling jobs with due dates so as to maximize the number of jobs that complete by their due dates, or equivalently to minimize the number of jobs that do not complete by their due date and that thus can be considered \\rejected.\" We inves- tigate the approximability of a simple version of this problem, giving approximation algorithms and characterizing integrality gaps of a class of linear-programming relaxations. ", "volume" : "1461", "pub-type" : "inproceedings", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "1998", "coden" : "LNCSD9", "key" : "Karger:Rejection" }, { "crossref" : "Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing", "note" : "Journal version appears in SIAM Journal on Computing 29(2)", "type" : "Publication", "author" : "Karger, David R.", "uri" : "urn:83624c7ccfd27668f44b73b2fa8c424c", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "A Randomized Fully Polynomial Approximation Scheme for the All Terminal Network Reliability Problem", "venue" : "STOC", "place" : "Las Vegas, NV", "pages" : "11--17", "year" : "1995", "booktitle" : "Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing", "publisher" : "ACM Press", "ps" : "http://people.csail.mit.edu/karger/Papers/reliability.ps", "abstract" : "The classic all-terminal network reliability problem posits a graph, each of whose edges fails independently with some given probability. The goal is to determine the probability that the network becomes disconnected due to edge failures. This problem has obvious applications in the design of communication networks. Since the problem is $\\SP$-complete and thus believed hard to solve exactly, a great deal of research has been devoted to estimating the failure probability. In this paper, we give a fully polynomial randomized approximation scheme that, given any n-vertex graph with specified failure probabilities, computes in time polynomial in n and $1/\\epsilon$ an estimate for the failure probability that is accurate to within a relative error of $1\\pm\\epsilon$ with high probability. We also give a deterministic polynomial approximation scheme for the case of small failure probabilities. Some extensions to evaluating probabilities of k-connectivity, strong connectivity in directed Eulerian graphs and r-way disconnection, and to evaluating the Tutte polynomial are also described.", "pub-type" : "inproceedings", "date" : "1995-05", "month" : "May", "organization" : "ACM", "key" : "Karger:Reliability-Conf" }, { "number" : "2", "note" : "A preliminary version appeared in Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing. A corrected version was published in SIAM Review 43(3)", "type" : "Publication", "author" : "Karger, David R.", "uri" : "urn:ce0cbac6bcd115b51c84f91faece544f", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "A Randomized Fully Polynomial Approximation Scheme for the All Terminal Network Reliability Problem", "pages" : "492--514", "brag" : "Winner, SIAM Outstanding Paper Prize, 2000", "year" : "1999", "journal" : "SIAM Journal on Computing", "id" : "ce0cbac6bcd115b51c84f91faece544f", "ps" : "http://people.csail.mit.edu/karger/Papers/reliability-journal.ps", "abstract" : "The classic all-terminal network reliability problem posits a graph, each of whose edges fails independently with some given probability. The goal is to determine the probability that the network becomes disconnected due to edge failures. This problem has obvious applications in the design of communication networks. Since the problem is $\\SP$-complete and thus believed hard to solve exactly, a great deal of research has been devoted to estimating the failure probability. In this paper, we give a fully polynomial randomized approximation scheme that, given any n-vertex graph with specified failure probabilities, computes in time polynomial in n and $1/\\epsilon$ an estimate for the failure probability that is accurate to within a relative error of $1\\pm\\epsilon$ with high probability. We also give a deterministic polynomial approximation scheme for the case of small failure probabilities. Some extensions to evaluating probabilities of k-connectivity, strong connectivity in directed Eulerian graphs and r-way disconnection, and to evaluating the Tutte polynomial are also described.", "volume" : "29", "pub-type" : "article", "date" : "1999", "key" : "Karger:Reliability" }, { "number" : "3", "note" : "A preliminary version appeared in Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing. This corrects a version published in SICOMP", "type" : "Publication", "author" : "Karger, David R.", "uri" : "urn:b990f66dd1b52b09d3f14e1fdee6d5f3", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "A Randomized Fully Polynomial Approximation Scheme for the All Terminal Network Reliability Problem", "pages" : "499--522", "brag" : "Winner, SIAM Outstanding Paper Prize, 2000", "year" : "2001", "journal" : "SIAM Review", "id" : "b990f66dd1b52b09d3f14e1fdee6d5f3", "ps" : "http://people.csail.mit.edu/karger/Papers/reliability-sirev.ps", "abstract" : "The classic all-terminal network reliability problem posits a graph, each of whose edges fails independently with some given probability. The goal is to determine the probability that the network becomes disconnected due to edge failures. This problem has obvious applications in the design of communication networks. Since the problem is ?P-complete and thus believed hard to solve exactly, a great deal of research has been devoted to estimating the failure probability. In this paper, we give a fully polynomial randomized approximation scheme that, given any n-vertex graph with specified failure probabilities, computes in time polynomial in n and 1/e an estimate for the failure probability that is accurate to within a relative error of 1 ? e with high probability. We also give a deterministic polynomial approximation scheme for the case of small failure probabilities. Some extensions to evaluating probabilities of k-connectivity, strong connectivity in directed Eulerian graphs and r-way disconnection, and to evaluating the Tutte polynomial are also described. This version of the paper corrects several errata that appeared in the previous journal publication [D. R. Karger, SIAM J. Comput., 29 (1999), pp. 492-514].", "volume" : "43", "pub-type" : "article", "date" : "2001", "key" : "Karger:Reliability-SIREV" }, { "crossref" : "618afa550bd05e89de4bd9fa6f5a8106", "type" : "Publication", "author" : [ "Afrati, Foto", "Bampis, Evripidis", "Chekuri, Chandra", "Karger, David", "Kenyon, Claire", "Khanna, Sanjeev", "Milis, Ioannis", "Queyranne, Maurice", "Skutella, Martin", "Stein, Cliff", "Sviridenko, Maxim" ], "uri" : "urn:322003530be72e0ceb09f086b4fa2214", "cat" : "Theory", "label" : "Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates", "venue" : "FOCS", "place" : "New York, NY", "pages" : "32--43", "year" : "1999", "booktitle" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "publisher" : "{IEEE} Computer Society Press", "ps" : "release.ps", "abstract" : "We consider the problem of scheduling jobs with release dates on parallel machines so as to minimize average weighted completion time. While constant factor approximation algorithms for many variants have been developed in the last few years, we present the first known polynomial time approximation schemes for several of them. Our results include PTASs for the case of identical parallel machines and a constant number of unrelated machines with and without preemption allowed. Our PTASs are also efficient. For most variants, the running time for a (1+e)-approximation on an instance with n jobs and m machines is O(nlog n) for each fixed e, and for all variants the running time\'s dependence on n is a fixed polynomial whose degree is independent of e and m.", "pub-type" : "inproceedings", "date" : "1999-10", "month" : "October", "organization" : "IEEE", "key" : "Karger:Release" }, { "label" : "857c2d21aef70174269bbbda4c6d5237", "key" : "ScatterGather", "type" : "Publication", "pub-type" : "inproceedings", "note" : "see karger:scatter", "uri" : "urn:857c2d21aef70174269bbbda4c6d5237" }, { "location" : "Copenhagen, Denmark", "type" : "Publication", "author" : [ "Cutting, Douglas", "Karger, David R.", "Pedersen, Jan", "Tukey, John W." ], "isbn" : "0-89791-523-2", "uri" : "urn:5d51c236c8ecd219f63dc1b3ced09b11", "cat" : "Information Retrieval", "label" : "Scatter/Gather: A Cluster-based Approach to Browsing Large Document Collections", "venue" : "SIGIR", "pages" : "318-329", "year" : "1992", "booktitle" : "Proceedings of the {$15^{th}$} Annual International {ACM} {SIGIR} Conference on Research and Development in Information Retrieval", "publisher" : "ACM Press", "ps" : "http://people.csail.mit.edu/karger/Papers/sigir92.ps", "abstract" : "Document clustering has not been well received as an information retrieval tool. Objections to its use fall into two main categories: first, that clustering is too slow for large corpora (with running time often quadratic in the number of documents); and second, that clustering does not appreciably improve retrieval. We argue that these problems arise only when clustering is used in an attempt to improve conventional search techniques. However, looking at clustering as an information access tool in its own right obviates these objections, and provides a powerful new access paradigm. We present a document browsing technique that employs document clustering as its primary operation. We also present fast (linear time) clustering algorithms which support this interactive browsing paradigm.", "pub-type" : "inproceedings", "doi" : "http://doi.acm.org/10.1145/133160.133214", "date" : "1992", "key" : "Karger:Scatter" }, { "ps" : "http://people.csail.mit.edu/karger/Papers/sigir93.ps", "booktitle" : "Proceedings of the {$16^{th}$} Annual International {ACM} {SIGIR} Conference on Research and Development in Information Retrieval", "pub-type" : "inproceedings", "venue" : "SIGIR", "uri" : "urn:0a749e9524edcb971175895d9d3239aa", "pages" : "126--134", "date" : "1993-07", "author" : [ "Cutting, Douglas", "Karger, David R.", "Pedersen, Jan" ], "month" : "July", "type" : "Publication", "year" : "1993", "note" : "Pittsburgh, PA", "cat" : "Information Retrieval", "abstract" : "The Scatter/Gather document browsing method uses fast document clustering to produce table-of-contents-like outlines of large document collections. Previous work [1] developed linear-time document clustering algorithms to establish the feasibility of this method over moderately large collections. However, even linear-time algorithms are too slow to support interactive browsing of very large collections such as Tipster, the DARPA standard text retrieval evaluation collection. We present a scheme that supports constant interaction-time Scatter/Gather of arbitrarily large collections after near-linear time preprocessing. This involves the construction of a cluster hierarchy. A modification of Scatter/Gather employing this scheme, and an example of its use over the Tipster collection are presented.", "label" : "Constant Interaction-Time Scatter/Gather Browsing of Very Large Document Collections", "key" : "Karger:Scatter2" }, { "ps" : "ftp://parcftp.xerox.com/pub/hearst/knowlnav95.ps", "booktitle" : "Proceedings of the AAAI Fall Symposium on Knowledge Navigation", "pub-type" : "inproceedings", "venue" : "AAAI", "uri" : "urn:d49fa873e4c0f5185d9f3a060fecd2bf", "date" : "1995", "author" : [ "Hearst, Marti A.", "Karger, David R.", "Pedersen, Jan O." ], "type" : "Publication", "year" : "1995", "cat" : "Information Retrieval", "abstract" : " An important information access problem arises when the user is confronted with a very large number of documents that have been retrieved in response to a query. In this paper we explore the use of a technique, called Scatter/Gather, for the navigation of large collections of retrieved documents. Scatter/Gather clusters the documents into semantically coherent groups on-the-fly and presents descriptive summaries of the groups to the user. These groups can be used in several ways: to indentify useful subsets of documents to be perused with other tools, to eliminate subsets whose contents appear nonrelevant, or to select promising document subsets for reclustering into more refined groups. This paper describes the Scatter/Gather algorithm and illustrates its application to retrieval results via two examples.", "label" : "Scatter/Gather as a Tool for Navigating Search Results", "key" : "Karger:ScatterResults" }, { "publisher" : "CRC Press", "booktitle" : "Algorithms and Theory of Computation Handbook", "pub-type" : "incollection", "uri" : "urn:52113118578f3856c6df492a9ed464db", "date" : "1998", "author" : [ "Karger, David R.", "Stein, Clifford", "Wein, Joel" ], "editor" : "Mikhail J. Atallah", "type" : "Publication", "year" : "1998", "cat" : "Theory", "isbn" : "0849326494", "label" : "Scheduling Algorithms", "key" : "Karger:Scheduling" }, { "crossref" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "note" : "Journal version appears in Mathematics of Operation Research 24(2), 1999", "type" : "Publication", "author" : "Karger, David R.", "uri" : "urn:5f3830e9ebf933dfc8c0955ecd1c70ed", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "Random Sampling in Cut, Flow, and Network Design Problems", "venue" : "STOC", "place" : "Montreal, Quebec, Canada", "pages" : "648--657", "year" : "1994", "booktitle" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "publisher" : "ACM Press", "ps" : "http://people.csail.mit.edu/karger/Papers/skeleton.ps", "abstract" : "We explore random sampling as a tool for solving undirected graph problems. We show that the sparse graph\'s or skeleton, which arises when we randomly sample a graph\'s edges will accurately approximate the value of all cuts in the original graph. This makes sampling effective for problems involving cuts in graphs. We apply these tools in fast randomized (Monte Carlo and Las Vegas) algorithms for approximating and exactly finding cuts and flows in an unweighted, undirected graph. We also give weighted-graph versions of these algorithms which use a form of scaling to achieve a sublinear dependence on the maximum edge weight. Our methods also reduce the work done by some parallel cut algorithms. Our sampling theorems also yield faster algorithms for several other cut based problems, including approximating the best balanced cut of a graph, finding a k-connected orientation of a 2k-connected graph, and finding integral multicommodity flows in graphs with a great deal of excess capacity. Our sampling theorems apply even when the sampling probabilities are different for different edges. Using this fact, we show how to use randomized rounding in (1+0(1))-approximation algorithm for the NP-complete minimum $k$-connected subgraph problem when $k > log n$; the best previous approximation factor was $\\log k$. Our techniques generalize to many other survivable network design problems.", "pub-type" : "inproceedings", "date" : "1994-05", "month" : "May", "organization" : "ACM", "key" : "Karger:Skeleton-Conf" }, { "number" : "2", "note" : "A preliminary version appeared in Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "type" : "Publication", "author" : "Karger, David R.", "uri" : "urn:e905a0ee1bea51d869219fa15fa5ce31", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "Random Sampling in Cut, Flow, and Network Design Problems", "pages" : "383--413", "year" : "1999", "journal" : "Mathematics of Operations Research", "id" : "e905a0ee1bea51d869219fa15fa5ce31", "ps" : "http://people.csail.mit.edu/karger/Papers/skeleton-journal.ps", "abstract" : "We use random sampling as a tool for solving undirected graph problems. We show that the sparse graph, or skeleton, that arises when we randomly sample a graph\'s edges will accurately approximate the value of all cuts in the original graph with high probability. This makes sampling effective for problems involving cuts in graphs. We present fast randomized (Monte Carlo and Las Vegas) algorithms for approximating and exactly finding minimum cuts and maximum flows in unweighted, undirected graphs. Our cut-approximation algorithms extend unchanged to weighted graphs while our weighted-graph flow algorithms are somewhat slower. Our approach gives a general paradigm with potential applications to any packing problem. It has since been used in a near-linear time algorithm for finding minimum cuts, as well as faster cut and flow algorithms. Our sampling theorems also yield faster algorithms for several other cut-based problems, including approximating the best balanced cut of a graph, finding a k-connected orientation of a 2k-connected graph, and finding integral multicommodity flows in graphs with a great deal of excess capacity. Our methods also improve the efficiency of some parallel cut and flow algorithms. Our methods also apply to the network design problem, where we wish to build a network satisfying certain connectivity requirements between vertices. We can purchase edges of various costs and wish to satisfy the requirements at minimum total cost. Since our sampling theorems apply even when the sampling probabilities are different for different edges, we can apply randomized rounding to solve network design problems. This gives approximation algorithms that guarantee much better approximations than previous algorithms whenever the minimum connectivity requirement is large. As a particular example, we improve the best approximation bound for the minimum k-connected subgraph problem from 1.85 to [math not displayed].", "volume" : "24", "pub-type" : "article", "date" : "1999-05", "month" : "May", "key" : "Karger:Skeleton" }, { "crossref" : "Proceedings of the {$9^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "type" : "Publication", "author" : "Karger, David R.", "editor" : "Howard Karloff", "uri" : "urn:1fbdf7e84541d6c19a324381c8287f91", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "Better Random Sampling Algorithms for Flows in Undirected Graphs", "venue" : "SODA", "place" : "San Fransisco, CA", "pages" : "490--499", "year" : "1998", "booktitle" : "Proceedings of the {$9^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "ps" : "http://people.csail.mit.edu/karger/Papers/flow2.ps", "abstract" : "We present better random sampling algorithms for maximum flows in undirected graphs. Our algorithms apply to capacitated or uncapacitated graphs, and find a maximum flow of value v in O( p mnv) time. This improves on a previous bound of O(m 2=3 n 1=3 v) given by the author recently, which in turn improved on the O(mv) time bound for a typical augmenting path algorithm. In uncapacitated graphs without parallel edges, the bound is no worse than O(n 5=2 ). We give another algorithm that finds a (1 \\Gamma ffl) times maximum flow in time O(m p n=ffl), regardless of v. ", "pub-type" : "inproceedings", "date" : "1998-01", "month" : "January", "organization" : "ACM-SIAM", "key" : "Karger:SmoothFlow" }, { "crossref" : "Proceedings of the {$33^{rd}$} {ACM} Symposium on Theory of Computing", "type" : "Publication", "author" : [ "Karger, David R.", "Levine, Matthew S." ], "uri" : "urn:6287ddbf8b6d8525a5876f25183a9717", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "Random Sampling from Residual Graphs", "venue" : "STOC", "place" : "Montreal, Canada", "pages" : "63--66", "year" : "2002", "booktitle" : "Proceedings of the {$33^{rd}$} {ACM} Symposium on Theory of Computing", "publisher" : "ACM Press", "ps" : "Papers/resflow.ps", "abstract" : " Consider an n-vertex, m-edge, undirected graph with maximum flow value v. We give a new ?(m+nv)-time maximum flow algorithm based on finding augmenting paths in random samples of the edges of residual graphs. After assigning certain special sampling probabilities to edges in ?(m) time, our algorithm is very simple: repeatedly find an augmenting path in a random sample of edges from the residual graph. ", "psgz" : "Papers/resflow.ps.gz", "pub-type" : "inproceedings", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2002-05", "month" : "May", "organization" : "ACM", "key" : "Karger:AugmentingPath" }, { "crossref" : "6d0df7fe6c2a810e01136e60fabb2543", "type" : "Publication", "author" : [ "Karger, David R.", "Levine, Matthew" ], "address" : "New York", "isbn" : "0-89791-962-9", "uri" : "urn:975620d713bb2bc4c62aea5f45e992ca", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "Finding Maximum Flows in Simple Undirected Graphs Seems Faster than Bipartite Matching", "venue" : "STOC", "place" : "Dallas, TX", "pages" : "69--78", "year" : "1998", "booktitle" : "Proceedings of the {$29^{th}$} {ACM} Symposium on Theory of Computing", "publisher" : "ACM Press", "ps" : "http://people.csail.mit.edu/karger/Papers/stoc98.ps", "abstract" : "Considear nr r-vertex, m-edge, undirected graph with maximum llow value v. We give a method to find augmenting paths in such a graph in amortized sub-linear (O(n@) time per path. This lets us improve the time bound of the classic augmenting path algorithm to O(m + nvsi2) on simple graphs. The addition of a blocking flow subroutine gives a simple, deterministic O(nm2/3v1/6)-time algorithm, We also use our technique to improve known randomized algorithms, giving @rtr+nv5/4)-time and d(m+-nt? gv)-time algorithms for capacitated undirected graphs.- For simple graphs, in which v s II, the last bound is a(n2s2), improving on the best previous bound of O(n2*5), which is also the best known time bound for bipartite matching.", "pub-type" : "inproceedings", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "1998-05", "month" : "May 23--26", "organization" : "ACM", "key" : "Karger:SimpleFlow" }, { "crossref" : "Proceedings of the {$28^{th}$} {ACM} Symposium on Theory of Computing", "type" : "Publication", "author" : [ "Bencz?r, Andr?s A.", "Karger, David R." ], "editor" : "Gary Miller", "uri" : "urn:7ff4409e2c5d5f4f47c8c65c26419143", "cat" : [ "Theory", "Cuts and Flows" ], "label" : "Approximate $s$--$t$ Min-Cuts in {$\\Olog(n^2)$} Time", "venue" : "STOC", "place" : "Philadelphia, PA", "pages" : "47--55", "year" : "1996", "booktitle" : "Proceedings of the {$28^{th}$} {ACM} Symposium on Theory of Computing", "publisher" : "ACM Press", "ps" : "http://people.csail.mit.edu/karger/Papers/stcut.ps", "pub-type" : "inproceedings", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "1996-05", "month" : "May", "organization" : "ACM", "key" : "Karger:Stcut" }, { "ps" : "http://people.csail.mit.edu/karger/Papers/thesis.ps", "pub-type" : "phdthesis", "uri" : "urn:e2e9b50abde8efe9c507bd9f98fd7f78", "date" : "1994", "school" : "Stanford University", "author" : "Karger, David R.", "type" : "Publication", "note" : "Contact at {\\tt karger@lcs.mit.edu.} Available from {\\tt http://theory.lcs.mit.edu/\\ {}karger}", "year" : "1994", "cat" : [ "Theory", "Cuts and Flows" ], "abstract" : "The representative random sample is a central concept of statistics. It is often possible to gather a great deal of information about a large population by examining a small sample randomly drawn from it. This approach has obvious advantages in reducing the investiga tor\'s work, both in gathering and in analyzing the data. We apply the concept of a representative sample to combinatorial optimization. Our general technique is to generate small random representative subproblems and solve them in lieu of the original ones, producing approximately correct answers which may then be refined to correct ones at little additional cost. Our focus is optimization problems on undirected graphs. Highlights of our results include \\begin{itemize} \\item The first (randomized) linear time minimum spanning tree algorithm \\item A (randomized) minimum cut algorithm with running time roughly $O(n^2)$ as compared to previous roughly $O(n^3)$ time bounds, as well as the first algorithm for finding all approximately minimal cuts and multiway cuts \\item An efficient parallelization of the minimum cut algorithm, providing the first parallel (RNC) algorithm for minimum cuts \\item The first proof that minimum cuts can be found deterministically in parallel (NC) \\item Reliability theorems tightly bounding the connectivities and bandwidths in networks with random edge failures, and a fully polynomial time approximation scheme for estimating all-terminal reliability---the probability a particular graph remains connected under edge failures \\item A linear time algorithm for approximating minimum cuts to within $1+\\epsilon$ and a linear processor parallel algorithm for $1+\\epsilon$ approximation, and fast algorithms for approximat ing $s$-$t$ minimum cuts and maximum Flows", "label" : "Random Sampling in Graph Optimization Problems", "address" : "Stanford, CA 94305", "key" : "Karger:Thesis", "brag" : "Winner, ACM Doctoral Dissertation Award, 1995. To be published by Springer Verlag" }, { "crossref" : "48477c6b4049a76b364a0b41f8d35114", "type" : "Publication", "author" : [ "Feldman, Jon", "Karger, David R." ], "uri" : "urn:c16a105f792d4c78df619e3514ddf4e6", "cat" : [ "Theory", "Coding", "Cuts and Flows" ], "label" : "Decoding Turbo-Like Codes via Linear Programming", "venue" : "FOCS", "place" : "Vancouver, Canada", "year" : "2002", "booktitle" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "publisher" : "{IEEE} Computer Society Press", "abstract" : "We introduce a novel algorithm for decoding turbo-like codes based on linear programming. We prove that for the case of Repeat-Accumulate (RA) codes, under the binary symmetric channel with a certain constant threshold bound on the noise, the error probability of our algorithm is bounded by an inverse polynomial in the code length. Our linear program (LP) minimizes the distance between the received bits and binary variables representing the code bits. Our LP is based on a representation of the code where code words are paths through a graph. Consequently, the LP bears a strong resemblance to the min-cost flow LP. The error bounds are based on an analysis of the probability, over the random noise of the channel, that the optimum solution to the LP is the path corresponding to the original transmitted code word.", "psgz" : "Papers/LpTurboDecoding.ps.gz", "pub-type" : "inproceedings", "pdf" : "Papers/LpTurboDecoding.pdf", "doi" : "doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181948", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2002-11", "month" : "November", "organization" : "IEEE", "key" : "Karger:Turbo" }, { "pdf" : "allerton02.pdf", "booktitle" : "Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing", "pub-type" : "inproceedings", "venue" : "Allerton", "uri" : "urn:fb3688da1c69171b84025f8af481db39", "date" : "2002-10", "author" : [ "Feldman, Jon", "Karger, David R.", "Wainwright, Martin J." ], "month" : "October", "psgz" : "Papers/allerton02.ps.gz", "type" : "Publication", "year" : "2002", "cat" : [ "Theory", "Coding" ], "abstract" : "In recent work (Feldman and Karger [8]), we introduced a new approach to decoding turbo-like codes based on linear programming (LP). We gave a precise characterization of the noise patterns that cause decoding error under the binary symmetric and additive white Gaussian noise channels. We used this characterization to prove that the word error rate is bounded by an inverse polynomial in the code length. Furthermore, for any turbo-like code, our algorithm has the ML certificate property: whenever it outputs a code word, it is guaranteed to be the maximum-likelihood (ML) code word. In this paper we extend these results and give an iterative decoder whose output is equivalent to that of the LP decoder. We also extend the MLcertificate property to the more efficient iterative tree reweighted max-product message-passing algorithm developed by Wainwright, Jaakkola, and Willsky [13]: we show that whenever this algorithm converges to a code word, it must be the ML code word. Finally, we demonstrate experimentally that the noise patterns that cause decoding error in the LP decoder also cause decoding error in the standard iterative sum-product and max-product (min-sum) message-passing algorithms. Consequently, the deterministically constructible interleaver used by the LP decoder to achieve its bounds on error rate is useful in practice not only for the LP decoder, but for these standard iterative decoders as well.", "label" : "Linear Programming-Based Decoding of Turbo-Like Codes and its Relation to Iterative Approaches", "key" : "Karger:IterativeDecoding" }, { "number" : "4", "note" : "Special Issue of Best Papers from FOCS 2002.", "type" : "Publication", "author" : [ "Feldman, Jon", "Karger, David R." ], "uri" : "urn:8e9aa6e5f107400f54efef7fd256526c", "cat" : [ "Theory", "Coding", "Cuts and Flows" ], "label" : "Decoding Turbo-Like Codes via Linear Programming", "pages" : "733--752", "year" : "2004", "journal" : "Journal of Computer and System Sciences", "id" : "8e9aa6e5f107400f54efef7fd256526c", "abstract" : "We introduce a novel algorithm for decoding turbo-like codes based on linear programming. We prove that for the case of Repeat-Accumulate (RA) codes, under the binary symmetric channel with a certain constant threshold bound on the noise, the error probability of our algorithm is bounded by an inverse polynomial in the code length. Our linear program (LP) minimizes the distance between the received bits and binary variables representing the code bits. Our LP is based on a representation of the code where code words are paths through a graph. Consequently, the LP bears a strong resemblance to the min-cost flow LP. The error bounds are based on an analysis of the probability, over the random noise of the channel, that the optimum solution to the LP is the path corresponding to the original transmitted code word.", "volume" : "68", "pub-type" : "article", "pdf" : "http://www.columbia.edu/ jf2189/pubs/LpTurboDecoding.pdf", "studentwork" : "\\asteriskit{\\labelwidth} ", "doi" : "http://dx.doi.org/10.1016/j.jcss.2003.11.005", "date" : "2004", "key" : "Karger:Turbo-Journal" }, { "pdf" : "Papers/ciss03.pdf", "booktitle" : "37th annual Conference on Information Sciences and Systems (CISS)", "pub-type" : "inproceedings", "venue" : "CISS", "uri" : "urn:9fb1b5507abcef0feec4e1102e548852", "date" : "2003-03", "author" : [ "Feldman, Jon", "Karger, David", "Wainwright, Martin" ], "studentwork" : "\\asteriskit{\\labelwidth} ", "month" : "March", "psgz" : "Papers/ciss03.ps.gz", "type" : "Publication", "year" : "2003", "cat" : [ "Theory", "Coding" ], "abstract" : "Given a linear code and observations from a noisy channel, the decoding problem is to de- termine the most likely (ML) codeword. We describe a method for approximate ML decoding of an arbi- trary binary linear code, based on a linear program- ming (LP) relaxation that is defined by a factor graph or parity check representation of the code. The result- ing LP decoder, which generalizes our previous work on turbo-like codes [FK02, FWK02], has the ML cer- tificate property: it either outputs the ML codeword with a guarantee of correctness, or acknowledges an error. We provide a precise characterization of when the LP decoder succeeds, based on the cost of pseu- docodewords associated with the factor graph. We in- troduce the notion of the fractional distance of a code, defined with respect to a particular LP relax- ation, and prove that the LP decoder will correct up to $()$ errors. For the BEC, we prove that the performance of LP decoding is equivalent to standard iterative decoding.", "label" : "Using Linear Programming to Decode Linear Codes", "address" : "Baltimore, MD", "key" : "Karger:LDPC" }, { "number" : "3", "type" : "Publication", "author" : [ "Feldman, Jon", "Karger, David", "Wainwright, Martin" ], "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.", "uri" : "urn:e93fd59cfe13f783a0c5d06d9ba1c306", "cat" : [ "Theory", "Coding" ], "label" : "Using Linear Programming to Decode Linear Codes", "pages" : "954-972", "year" : "2005", "journal" : "IEEE Transactions on Information Theory", "id" : "e93fd59cfe13f783a0c5d06d9ba1c306", "abstract" : "Abstract: A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based on observations received from any discrete memoryless symmetric channel. The decoding algorithm is based on a linear programming (LP) relaxation that is defined by a factor graph or parity-check representation of the code. The resulting \\emph{LP decoder} generalizes our previous work on turbo-like codes. A precise combinatorial characterization of when the LP decoder succeeds is provided, based on pseudocodewords associated with the factor graph. Our definition of a pseudocodeword unifies other such notions known for iterative algorithms, including \\emph{stopping sets,} \\emph{irreducible closed walks,} \\emph{trellis cycles,} \\emph{deviation sets,} and \\emph{graph covers.} The fractional distance frac of a code is introduced, which is a lower bound on the classical distance. It is shown that the efficient LP decoder will correct up to frac 2 1 errors and that there are codes with frac = ( 1 ). An efficient algorithm to compute the fractional distance is presented. Experimental evidence shows a similar performance on low-density parity-check (LDPC) codes between LP decoding and the min-sum and sum-product algorithms. Methods for tightening the LP relaxation to improve performance are also provided. Index Terms: Belief propagation (BP), iterative decoding, low density parity-check (LDPC) codes, linear codes, linear programming (LP), LP decoding, minimum distance, pseudocodewords.", "volume" : "51", "pub-type" : "article", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2005-03", "month" : "March", "key" : "Karger:LDPC-Journal" }, { "pdf" : "Papers/allerton03.pdf", "booktitle" : "Proceedings of the 41st Annual Allerton Conference on Communication, Control, and Computing", "pub-type" : "inproceedings", "venue" : "Allerton", "uri" : "urn:d374149c199faf3886da4a60391bad49", "date" : "2003-10", "author" : [ "Feldman, Jon", "Karger, David R.", "Wainwright, Martin J." ], "month" : "October", "psgz" : "Papers/allerton03.ps.gz", "type" : "Publication", "year" : "2003", "cat" : [ "Theory", "Coding" ], "abstract" : "Linear programming (LP) relaxation is a common technique used to find good solutions to complex optimization problems. We present the method of ?LP decoding?: applying LP relaxation to the problem of maximum-likelihood (ML) decoding. An arbitrary binary-input memoryless channel is considered. This treatment of the LP decoding method places our previous work on turbo codes [6] and low-density parity-check (LDPC) codes [8] into a generic framework. We define the notion of a proper relaxation, and show that any LP decoder that uses a proper relaxation exhibits many useful properties. We describe the notion of pseudocodewords under LP decoding, unifying many known characterizations for specific codes and channels. The fractional distance of an LP decoder is defined, and it is shown that LP decoders correct a number of errors equal to half the fractional distance. We also discuss the application of LP decoding to binary linear codes. We define the notion of a relaxation being symmetric for a binary linear code. We show that if a relaxation is symmetric, one may assume that the all-zeros codeword is transmitted.", "label" : "LP Decoding", "key" : "Karger:LPDecoding" }, { "journal" : "IEEE Transactions on Computer Aided Design", "pub-type" : "article", "uri" : "urn:1203ae4f636588bf84335950e82e9d87", "pages" : "890--895", "date" : "1995-07", "number" : "7", "author" : [ "Alpert, C. J.", "Hu, T. C.", "Huang, J. H.", "Kahng, A. B.", "Karger, David" ], "volume" : "14", "month" : "July", "type" : "Publication", "year" : "1995", "abstract" : "Analysis of Elmore delay in distributed RC tree structures shows the influence of both tree cost and tree radius on signal delay in VLSI interconnects. We give new and efficient interconnection tree constructions that smoothly combine the minimum cost and the minimum radius objectives, by combining respectively optimal algorithms due to Prim and Dijkstra. Previous \"shallow-light\" techniques [2, 3, 8, 13] are both less direct and less effective: in practice, our methods achieve uniformly superior cost-radius tradeoffs. Detailed timing simulations for a range of IC and MCM interconnect technologies show that our wirelength savings yield reduced signal delays when compared to shallow-light or standard minimum spanning tree and Steiner tree routing.", "cat" : "Applications of Theory", "label" : "Prim-{D}ijkstra Tradeoffs for Improved Performance-Driven Routing Tree Design", "key" : "Karger:VLSI" }, { "crossref" : "Proceedings of the {$29^{th}$} {ACM} Symposium on Theory of Computing", "type" : "Publication", "author" : [ "Karger, David R.", "Lehman, Eric", "Leighton, Tom", "Levine, Matthew", "Lewin, Daniel", "Panigrahy, Rina" ], "uri" : "urn:e9d540d2f1bb8289b5829545f8a79c73", "cat" : [ "Theory", "Applications of Theory" ], "label" : "Consistent Hashing and Random Trees: Distributed Caching protocols for Relieving Hot Spots on the World Wide Web", "venue" : "STOC", "place" : "El Paso, TX", "pages" : "654--663", "year" : "1997", "booktitle" : "Proceedings of the {$29^{th}$} {ACM} Symposium on Theory of Computing", "publisher" : "ACM Press", "ps" : "http://people.csail.mit.edu/karger/Papers/web.ps", "abstract" : "We describe a family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for use with very large networks such as the Internet, where delays caused by hot spots can be severe, and where it is not feasible for every server to have complete information about the current state of the entire network. The protocols are easy to implement using existing network protocols such as TCP/IP, and require very little overhead. The protocols work with local control, make efficient use of existing resources, and scale gracefully as the network grows. Our caching protocols are based on a special kind of hashing that we call consistent hashing. Roughly speaking, a consistent hash function is one which changes minimally as the range of the function changes. Through the development of good consistent hash functions, we are able to develop caching protocols which do not require users to have a current or even consistent view of the network. We believe that consistent hash functions may eventually prove to be useful in other applications such as distributed name servers and/or quorum systems. ", "pub-type" : "inproceedings", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "1997-05", "month" : "May", "organization" : "ACM", "key" : "Karger:Web" }, { "journal" : "Communications of the ACM", "pub-type" : "article", "uri" : "urn:54d922b12e68c440d3216c2eeb7392d7", "pages" : "77-82", "date" : "2006-01", "number" : "1", "author" : [ "Karger, David R.", "Jones, William" ], "volume" : "49", "doi" : "http://doi.acm.org/10.1145/1107458.1107496", "month" : "January", "type" : "Publication", "year" : "2006", "abstract" : "Users need ways to unify, simplify, and consolidate information too often fragmented by location, device, and software application.", "cat" : "Information Retrieval", "label" : "Data Unification in Personal Information Management", "key" : "Karger:CACM-Data" }, { "pdf" : "http://www.its.caltech.edu/ tho/itrandom-final.pdf", "journal" : " IEEE Transactions on Information Theory", "pub-type" : "article", "uri" : "urn:de137dca676551189bc61b2bb01b5036", "pages" : " 4413-4430", "date" : "2006", "number" : "10", "author" : [ "Ho, Tracey", "M?dard, Muriel", "Koetter, Ralf", "Karger, David R.", "Effros, Michelle", "Shi, J.", "Leong, B." ], "volume" : "52", "type" : "Publication", "year" : "2006", "cat" : [ "Theory", "Coding", "Cuts and Flows" ], "abstract" : "We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. We show that this achieves capacity with probability exponentially approaching 1 with the code length. We also demonstrate that random linear coding performs compression when necessary in a network, generalizing error exponents for linear Slepian?Wolf coding in a natural way. Benefits of this approach are decentralized operation and robustness to network changes or link failures. We show that this approach can take advantage of redundant network capacity for improved success probability and robustness. We illustrate some potential advantages of random linear network coding over routing in two examples of practical scenarios: distributed network operation and networks with dynamically varying connections. Our derivation of these results also yields a new bound on required field size for centralized network coding on general multicast networks.", "label" : "A Random Linear Network Coding Approach to Multicast", "key" : "Ho:RandomLinearCoding" }, { "pdf" : "http://www.its.caltech.edu/ tho/isit04.ps", "booktitle" : "International Symposium on Information Theory (ISIT)", "pub-type" : "inproceedings", "venue" : "ISIT", "uri" : "urn:9cb3652bd75e5dd3fad57db125a4938e", "date" : "2004", "author" : [ "Ho, Tracey", "Leong, B.", "Koetter, Ralf", "M?dard, Muriel", "Effros, Michelle", "Karger, David R." ], "type" : "Publication", "year" : "2004", "cat" : [ "Theory", "Coding" ], "abstract" : "Distributed randomized network coding, a robust approach to multicasting in distributed network settings, can be extended to provide Byzantine modification detection without the use of cryptographic functions is presented in this paper.", "label" : "Byzantine Modification Detection in Multicast Networks Using Randomized Network Coding", "key" : "Ho:Byzantine" }, { "journal" : "IEEE Transactions on Information Theory", "pub-type" : "article", "uri" : "urn:ad663fffb4124a116437fb2f467002e9", "pages" : "2608-2623", "date" : "2006", "number" : "6", "author" : [ "Lun, Desmond S.", "Ratnakar, Niranjan", "M?dard, Muriel", "Koetter, Ralf", "Karger, David R.", "Ho, Tracey", "Ahmed, Ebad", "Zhao, Fang" ], "volume" : "52", "type" : "Publication", "year" : "2006", "cat" : [ "Theory", "Coding", "Cuts and Flows" ], "abstract" : "We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e. packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as both static multicast (where membership of the multicast group remains constant for the duration of the connection) and dynamic multicast (where membership of the multicast group changes in time, with nodes joining and leaving the group). For static multicast, we reduce the problem to a polynomial-time solvable optimization problem, and we present decentralized algorithms for solving it. These algorithms, when coupled with existing decentralized schemes for constructing network codes, yield a fully decentralized approach for achieving minimum-cost multicast. By contrast, establishing minimum-cost static multicast connections over routed packet networks is a very difficult problem even using centralized computation, except in the special cases of unicast and broadcast connections. For dynamic multicast, we reduce the problem to a dynamic programming problem and apply the theory of dynamic programming to suggest how it may be solved.", "label" : "Minimum-cost multicast over coded packet networks", "key" : "Karger:MinCostMulticast" }, { "pdf" : "http://www.its.caltech.edu/ tho/allerton.pdf", "booktitle" : "$41^{st}$ Allerton Annual Conference on Communication, Control, and Signal Processing", "pub-type" : "inproceedings", "venue" : "Allerton", "uri" : "urn:5fd463e0c8804cd107f154a25253546d", "date" : "2003", "author" : [ "Ho, Tracey", "M?dard, Muriel", "Shi, J.", "Effros, Michelle", "Karger, David R." ], "type" : "Publication", "year" : "2003", "note" : "Invited paper", "cat" : [ "Theory", "Applications of Theory", "Coding", "Cuts and Flows" ], "abstract" : "We consider a randomized network coding approach for multicasting from several sources over a network, in which nodes independently and randomly select linear mappings from inputs onto output links over some field. This approach was first described in [3], which gave, for acyclic delay-free networks, a bound on error probability, in terms of the number of receivers and random coding output links, that decreases exponentially with code length. The proof was based on a result in [2] relating algebraic network coding to network flows. In this paper, we generalize these results to networks with cycles and delay. We also show, for any given acyclic network, a tighter bound in terms of the probability of connection feasibility in a related network problem with unreliable links. From this we obtain a success probability bound for randomized network coding in link-redundant networks with unreliable links, in terms of link failure probability and amount of redundancy.", "label" : "On Randomized Network Coding", "key" : "Karger:NCoding1" }, { "pdf" : "http://www.its.caltech.edu/ tho/allertonM03.pdf", "booktitle" : "$41^{st}$ Allerton Annual Conference on Communication, Control, and Signal Processing", "pub-type" : "inproceedings", "venue" : "Allerton", "uri" : "urn:c2879055e29abd549484ee0003359fdd", "date" : "2003", "author" : [ "M?dard, Muriel", "Effros, Michelle", "Ho, Tracey", "Karger, David" ], "type" : "Publication", "year" : "2003", "note" : "Invited paper", "cat" : [ "Theory", "Applications of Theory", "Coding", "Cuts and Flows" ], "abstract" : "We consider the issue of coding for non-multicast networks. For multicast networks, it is known that linear operations over a field no larger than the number of receivers are sufficient to achieve all feasible connections. In the case of nonmulticast networks, necessary and sufficient conditions are known, if we restrict ourselves to linear codes over a finite field [1]. However, no linearity sufficiency results exist for non-multicast networks. Indeed, [2] shows that linearity over a field is not sufficient in general. We present a coding theorem that provides necessary and sufficient conditions, in terms of receiver entropies, for an arbitrary set of connections to be achievable on any network. We conjecture that linearity is sufficient to satisfy the coding theorem, when linear operations are performed over vectors rather than scalars in a field. We illustrate the intuition of this conjecture with an example. This work is part of an ongoing cooperation with R. Koetter.", "label" : "On Coding for Non-Multicast Networks", "key" : "Karger:NonMulticast" }, { "confurl" : "http://www.isit2003.org/", "crossref" : "IEEE International Symposium on Information Theory", "type" : "Publication", "author" : [ "Ho, Tracey", "Koetter, Ralf", "M\\\'edard, Muriel", "Karger, David R.", "Effros, Michelle" ], "address" : "Yokohama, Japan", "uri" : "urn:8a1a32cb8878a8a5ebb871bd9f6d0923", "cat" : [ "Theory", "Applications of Theory", "Coding", "Cuts and Flows" ], "label" : "The Benefits of Network Coding over Routing in a Randomized Setting", "venue" : "ISIT", "year" : "2003", "booktitle" : "IEEE International Symposium on Information Theory", "abstract" : "We present a novel randomized network coding approach for robust, distributed transmission and compression of information in networks, and demonstrate its advantages over routing-based approaches.", "pub-type" : "inproceedings", "pdf" : "http://www.its.caltech.edu/ tho/isit03-1.pdf", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2003-06", "month" : "June", "organization" : "IEEE", "key" : "Karger:NetworkCoding2" }, { "pdf" : "http://www.its.caltech.edu/ tho/dimacs03.pdf", "booktitle" : "DIMACS workshop on network information theory", "pub-type" : "inproceedings", "venue" : "DIMACS", "uri" : "urn:989d80f12a803a17c6fe7c6ff12e7084", "date" : "2003", "author" : [ "Effros, Michelle", "M?dard, Muriel", "Ho, Tracey", "Ray, S.", "Karger, David", "Koetter, Ralf", "Hassibi, B." ], "type" : "Publication", "year" : "2003", "note" : "Invited Paper", "cat" : [ "Theory", "Coding", "Cuts and Flows" ], "abstract" : "We examine the issue of separation and code design for network data transmission environments. We demonstrate that source-channel sep- aration holds for several canonical network channel models when the whole network operates over a common ?nite ?eld. Our approach uses linear codes. This simple, unifying framework allows us to re-establish with economy the optimality of linear codes for single transmitter channels and for Slepian-Wolf source coding. It also enables us to establish the optimality of linear codes for multiple access channels and for erasure broadcast channels. Moreover, we show that source-channel separation holds for these networks. This robustness of separation we show to be strongly predicated on the fact that noise and inputs are independent. The linearity of source, channel, and network coding blurs the delineation between these codes, and thus we explore joint linear de- sign. Finally, we illustrate the fact that design for individual network modules may yield poor results when such modules are concatenated, demonstrating that end-to-end coding is necessary. Thus, we argue, it is the lack of decom- posability into canonical network modules, rather than the lack of separation between source and channel coding, that presents major challenges for coding in networks.", "label" : "Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding", "key" : "Karger:NCoding4" }, { "label" : "2cf8f70c9a0a556e25013ac0169113f5", "key" : "Karger:NCoding3", "type" : "Publication", "pub-type" : "inproceedings", "note" : "see karger:networkcoding2", "uri" : "urn:2cf8f70c9a0a556e25013ac0169113f5" }, { "confurl" : "http://www.isit2003.org/", "crossref" : "IEEE International Symposium on Information Theory", "type" : "Publication", "author" : [ "Ho, Tracey", "Karger, David R.", "M?dard, Muriel", "Koetter, Ralf" ], "address" : "Yokohama, Japan", "uri" : "urn:300546a82b635156f370ddf9747b1cfb", "cat" : [ "Theory", "Applications of Theory", "Coding", "Cuts and Flows" ], "label" : "Network Coding from a Network Flow Perspective", "venue" : "ISIT", "year" : "2003", "booktitle" : "IEEE International Symposium on Information Theory", "abstract" : "We make precise connections between algebraic network coding and network flows. Our combinatorial formulations offer new insights, mathe- matical simplicity, and lead to a substantially tighter upper bound on the coding field size required for a given connection problem than that in [5].", "pub-type" : "inproceedings", "pdf" : "http://www.its.caltech.edu/ tho/isit03-2.pdf", "studentwork" : "\\asteriskit{\\labelwidth} ", "date" : "2003-06", "month" : "June", "organization" : "IEEE", "key" : "Karger:NetworkCoding" }, { "crossref" : "The $16^{th}$ Annual Symposium on User Interface Software and Technology", "type" : "Publication", "author" : [ "Quan, Dennis", "Huynh, David", "Karger, David R.", "Miller, Robert" ], "address" : "Vancouver, BC", "uri" : "urn:b733c224bb11b2f275614f7552ec0172", "cat" : [ "Information Retrieval", "Haystack", "Semantic Web", "CHI" ], "label" : "User Interface Continuations", "venue" : "UIST", "year" : "2003", "booktitle" : "The $16^{th}$ Annual Symposium on User Interface Software and Technology", "abstract" : "Dialog boxes that collect parameters for commands often create ephemeral, unnatural interruptions of a program?s normal execution flow, encouraging the user to complete the dialog box as quickly as possible in order for the program to process that command. In this paper we examine the idea of turning the act of collecting parameters from a user into a first class object called a user interface continuation. Programs can create user interface continuations by specifying what information is to be collected from the user and supplying a callback (i.e., a continuation) to be notified with the collected information. A partially completed user interface continuation can be saved as a new command, much as currying and partially evaluating a function with a set of parameters produces a new function. Furthermore, user interface continuations, like other continuation-passing paradigms, can be used to allow program execution to continue uninterrupted while the user determines a command?s parameters at his or her leisure.", "pdfkb" : "111", "conferenceurl" : "http://www.uist.org/", "pub-type" : "inproceedings", "pdf" : "http://haystack.lcs.mit.edu/papers/uist2003-uicont.pdf", "pdfurl" : "http://haystack.csail.mit.edu/papers/uist2003-uicont.pdf", "date" : "2003-11", "month" : "November", "organization" : "ACM", "key" : "Karger:UIContinuations" }, { "label" : "a6241ef1d3c10e4ed27947017146751b", "key" : "Karger:UIContinuation", "type" : "Publication", "pub-type" : "inproceedings", "note" : "see karger:UIContinuations", "uri" : "urn:a6241ef1d3c10e4ed27947017146751b" }, { "booktitle" : "Proceedings of the ACM CHI Conference on Human Factors in Computing Systems", "pub-type" : "inproceedings", "venue" : "CHI", "uri" : "urn:3ddb1e9cb48c1a0674d49629164d825f", "date" : "2004", "author" : [ "Quan, Dennis", "Karger, David R." ], "doi" : "http://doi.acm.org/10.1145/985921.985931", "type" : "Publication", "year" : "2004", "note" : "Demo", "cat" : [ "CHI", "Information Retrieval", "Haystack", "Semantic Web" ], "abstract" : " Much past HCI research has examined the usability concerns of information management software for specific domains such as object-oriented software design, e-mail, and the Web. We believe that many of the results uncovered by these studies are applicable across multiple domains but that more broadly-scoped experiments require a system that can integrate multiple data sources. Haystack is a general-purpose information management environment designed to attack this very problem. Haystack\'s user interface, which incorporates capabilities from previous research such as context-specific visualization paradigms and attribute-based categorization, is built upon a highly expressive semistructured data model and data integration capabilities. In our demonstration we show how combination of a direct-manipulation-based UI paradigm and an expressive, federated data model can begin to address many of the information management problems plaguing general desktop computing today and can serve as a basis for further, yet unexplored, crossover information interaction experiments. ", "label" : "Haystack: A User Interface for Creating, Browsing and Organizing Arbitrary Semistructured Information", "key" : "Karger:HaystackDemo" }, { "location" : "Baltimore, Maryland", "type" : "Publication", "author" : [ "Sinha, Vineet", "Karger, David R." ], "address" : "New York, NY, USA", "isbn" : "1-59593-060-4", "uri" : "urn:73f24af32aecff770d1aee0ce07e6293", "cat" : [ "Semantic Web", "Information Retrieval" ], "label" : "Magnet: supporting navigation in semistructured data environments", "venue" : "SIGMOD", "pages" : "97--106", "year" : "2005", "booktitle" : "SIGMOD \'05: Proceedings of the 2005 ACM SIGMOD international conference on Management of data", "publisher" : "ACM Press", "abstract" : "With the growing importance of systems containing arbitrary semistructured relationships, the need for supporting users searching in such repositories has grown. Currently support for users? search needs either has required domain-specific user interfaces or has required users to be schema experts. We have developed a generalpurpose tool that offers users helpful navigation and refinement options for seeking information in these semistructured repositories. We show how a tool can be built without requiring domain-specific assumptions about the information being explored. In addition to describing a general approach to the problem, we provide a set of natural, general-purpose refinement tactics, many generalized from past work on textual information retrieval.", "pub-type" : "inproceedings", "pdf" : "http://haystack.lcs.mit.edu/papers/magnet-sigmod2005.pdf", "doi" : "http://doi.acm.org/10.1145/1066157.1066169", "date" : "2005", "key" : "Karger:Magnet" }, { "label" : "61de8c7df9259b6389fdc584bc94e9f7", "key" : "Karger:SpamIAm", "type" : "Publication", "pub-type" : "inproceedings", "note" : "see karger:spam", "uri" : "urn:61de8c7df9259b6389fdc584bc94e9f7" }, { "pdf" : "http://ramp.ucsd.edu/conferences/HotNets-III/HotNets-III%20Proceedings/spamiam.pdf", "booktitle" : "Proceedings of the Third Annual ACM SIGCOMM Workshop on Hot Topics in Networking ({HotNets-III})", "pub-type" : "inproceedings", "venue" : "HotNets", "uri" : "urn:f758ce2b38c00664a3f18cf7e40d3578", "date" : "2004-11", "author" : [ "Balakrishnan, Hari", "Karger, David R." ], "editor" : "Alex Snoeren", "month" : "November", "type" : "Publication", "year" : "2004", "cat" : [ "Systems", "P2P" ], "abstract" : "Email spam has reached alarming proportions because it costs virtually nothing to send email; even a small number of people responding to a spam message is adequate incentive for a spammer to send as many messages as possible. Since spammers need to send messages at high rates to as many recipients as they can, quotas on email senders could throttle spam. We argue for separating the allocation of quotas, a relatively rare activity, from the enforcement of quotas, a frequent activity that must scale to the billions of messages sent daily. This paper tackles the quota enforcement problem, where the goal is to ensure that no sender can grossly violate its quota. The challenge is to design an enforcement scheme that is scalable, is robust against malicious attackers or participants, and preserves the privacy of communication, in a large, distributed, and untrusted environment. We discuss the design of such a system, Spam-Iam, based on a managed distributed hash table (DHT) interface, showing that it can be used in conjunction with electronic stamps (for quota allocation) to ensure that any non-negligible reuse of stamps will be detected.", "label" : "{Spam-I-am}: A Proposal for Spam Control Using Distributed Quota Management", "address" : "San Diego, CA", "key" : "Karger:Spam" }, { "pdf" : "http://nms.csail.mit.edu/papers/dqe-nsdi06.pdf", "booktitle" : "NSDI: Networking Systems Design and Implementation", "pub-type" : "inproceedings", "venue" : "NSDI", "uri" : "urn:5ab979a931817a0e895bd7e97389a0fd", "date" : "2006", "author" : [ "Walfish, Michael", "Zamfirescu, J. D.", "Balakrishnan, Hari", "Karger, David R.", "Shenker, Scott" ], "type" : "Publication", "year" : "2006", "cat" : [ "Systems", "P2P" ], "label" : "Distributed Quota Enforcement for Spam Control", "key" : "Karger:DQE" }, { "confurl" : "http://www.sigir.org/sigir2006/", "crossref" : "$29^{th}$ Internationl ACM SIGIR Conference", "type" : "Publication", "author" : [ "Chen, Harr", "Karger, David R." ], "uri" : "urn:5cbf316b769b4550ca8e6cfcd4dbca8f", "cat" : "Information Retrieval", "label" : "Less is more: probabilistic models for retrieving fewer relevant documents", "venue" : "SIGIR", "pages" : "429-436", "year" : "2006", "booktitle" : "$29^{th}$ Internationl ACM SIGIR Conference", "publisher" : "ACM", "abstract" : "Traditionally, information retrieval systems aim to maximize the number of relevant documents returned to a user within some window of the top. For that goal, the probability ranking principle, which ranks documents in decreasing order of probability of relevance, is provably optimal. However, there are many scenarios in which that ranking does not optimize for the user?s information need. One example is when the user would be satisfied with some limited number of relevant documents, rather than needing all relevant documents. We show that in such a scenario, an attempt to return many relevant documents can actually reduce the chances of finding any relevant documents. We consider a number of information retrieval metrics from the literature, including the rank of the first relevant result, the %no metric that penalizes a system only for retrieving no relevant results near the top, and the diversity of retrieved results when queries have multiple interpretations. We observe that given a probabilistic model of relevance, it is appropriate to rank so as to directly optimize these metrics in expectation. While doing so may be computationally intractable, we show that a simple greedy optimization algorithm that approximately optimizes the given objectives produces rankings for TREC queries that outperform the standard approach based on the probability ranking principle.", "pub-type" : "inproceedings", "pdf" : "http://www.csail.mit.edu/ harr/papers/sigir2006.pdf", "date" : "2006-07", "month" : "July", "organization" : "ACM SIGIR", "key" : "Karger:LessIsMore" }, { "pdf" : "http://www-db.cs.wisc.edu/cidr/cidr2005/papers/P02.pdf", "booktitle" : "Conference on Innovative Database Research (CIDR)", "pub-type" : "inproceedings", "venue" : "CIDR", "uri" : "urn:2afc4712f36bd1a47f16036eb7c30b6d", "pages" : "13--26", "date" : "2005", "author" : [ "Karger, David R.", "Bakshi, Karun", "Huynh, David", "Quan, Dennis", "Sinha, Vineet" ], "type" : "Publication", "confurl" : "http://www-db.cs.wisc.edu/cidr/cidr2005/", "year" : "2005", "cat" : [ "Haystack", "Information Retrieval" ], "abstract" : "We posit that a semistructured data model offers the right balance of rich structure and flexible (or lack of) schema allowing naive end users to record information in whatever form makes it easy for them to manage. We describe our Haystack system, which exposes the richness and flexibility of the data model while offering the user natural, traditional interfaces that shield them from the specifics of schemas, tuples, and database queries. We outline research challenges that remain to be addressed.", "label" : "Haystack: A General Purpose Information Management Tool for End Users of Semistructured Data", "work-done-at" : "MIT CSAIL", "key" : "karger:Haystack-CIDR" }, { "pub-type" : "techreport", "institution" : "MIT AI Lab", "uri" : "urn:e46ce355406da59790c24c38359e63f2", "date" : "2001", "author" : [ "Shih, Lawrence", "Karger, David" ], "year" : "2001", "type" : "Publication", "cat" : [ "Information Retrieval", "Machine Learning" ], "abstract" : "Trees are a common way of organizing large amounts of information by placing items with similar characteristics near one another in the tree. We introduce a classification problem where a given tree structure gives us information on the best way to label nearby elements. We suggest there are many practical problems that fall under this domain. We propose a way to map the classification problem onto a standard Bayesian inference problem. We also give a fast, specialized inference algorithm that incrementally updates relevant probabilities. We apply this algorithm to web-classification problems and show that our algorithm empirically works well.", "label" : "Learning Classes Correlated to a Hierarchy", "key" : "shih2001" }, { "pub-type" : "unpublished", "uri" : "urn:4ecdcb5b63153e42aa9936431cd36913", "date" : "1997", "author" : [ "Karger, David", "Stein, Lynn" ], "type" : "Publication", "year" : "1997", "cat" : [ "Information Retrieval", "Haystack" ], "label" : "Haystack: Per-User Information Environments.", "key" : "Karger97" }, { "publisher" : "ACM Press", "booktitle" : "Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval", "pub-type" : "inproceedings", "venue" : "SIGIR", "uri" : "urn:1c4053f083cea170ae6d84a6fec21e5d", "pages" : "76--84", "date" : "1996", "author" : [ "Hearst, Marti A.", "Pedersen, Jan O." ], "doi" : "http://doi.acm.org/10.1145/243199.243216", "type" : "Publication", "year" : "1996", "cat" : "Information Retrieval", "isbn" : "0-89791-792-8", "label" : "Reexamining the cluster hypothesis: scatter/gather on retrieval results", "location" : "Zurich, Switzerland", "key" : "ScatterGatherClusterHypothesis" }, { "pdf" : "fresnelISWC06.pdf", "booktitle" : "$5^{th}$ International Semantic Web Conference (ISWC)", "pub-type" : "inproceedings", "venue" : "ISWC", "crossref" : "$5^{th}$ International Semantic Web Conference (ISWC)", "uri" : "urn:6a784df3d22d488d20212c256c9510e5", "pages" : "158--171", "date" : "2006-11", "author" : [ "Pietriga, Emmanuel", "Bizer, Chris", "Karger, David", "Lee, Ryan" ], "month" : "November", "type" : "Publication", "year" : "2006", "cat" : [ "Information Retrieval", "Haystack", "Semantic Web" ], "abstract" : "Semantic Web browsers and other tools aimed at displaying RDF data to end users are all concerned with the same problem: presenting content primarily intended for machine consumption in a human-readable way. Their solutions differ but in the end address the same two high-level issues, no matter the underlying representation paradigm: specifying (i) what information contained in RDF models should be presented (content selection) and (ii) how this information should be presented (content formatting and styling). However, each tool currently relies on its own ad hoc mechanisms and vocabulary for specifying RDF presentation knowledge, making it difficult to share and reuse such knowledge across applications. Recognizing the general need for presenting RDF content to users and wanting to promote the exchange of presentation knowledge, we designed Fresnel as a browser-independent vocabulary of core RDF display concepts. In this paper we describe Fresnel\'s main concepts and present several RDF browsers and visualization tools that have adopted the vocabulary so far.", "label" : "Fresnel: A Browser-Independent Presentation Vocabulary for RDF", "key" : "Karger:Fresnel-ISWC06" }, { "pdf" : "http://simile.mit.edu/papers/iswc05.pdf", "booktitle" : "International Semantic Web Conference (ISWC)", "pub-type" : "inproceedings", "venue" : "ISWC", "uri" : "urn:183c5e1158d1b1119aa9e1957983b948", "date" : "2005", "author" : [ "Huynh, David", "Mazzochi, Stefano", "Karger, David" ], "type" : "Publication", "year" : "2005", "cat" : [ "Haystack", "Semantic Web", "Information Retrieval" ], "abstract" : "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.
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.
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.
", "label" : "Piggy Bank: Experience the Semantic Web Inside your Web Browser", "key" : "Karger:Piggy", "pdfkb" : "2400" }, { "id" : "e4946c9fe936d4b353dca57496520234", "pdf" : "http://simile.mit.edu/papers/iswc05.pdf", "journal" : "Journal of Web Semantics", "pub-type" : "article", "uri" : "urn:e4946c9fe936d4b353dca57496520234", "pages" : "16-27", "date" : "2007", "number" : "1", "author" : [ "Huynh, David", "Mazzochi, Stefano", "Karger, David" ], "volume" : "5", "type" : "Publication", "year" : "2007", "abstract" : "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.
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.
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.
", "cat" : [ "Haystack", "Semantic Web", "Information Retrieval" ], "label" : "Piggy Bank: Experience the Semantic Web Inside your Web Browser", "key" : "Karger:Piggy-Journal", "pdfkb" : "2400" }, { "location" : "Vienna, Austria", "type" : "Publication", "author" : [ "Teevan, Jaime", "Alvarado, Christine", "Ackerman, Mark S.", "Karger, David R." ], "isbn" : "1-58113-702-8", "uri" : "urn:c634aeeaebfa997592e9acaea5d42550", "cat" : [ "Information Retrieval", "CHI" ], "label" : "The Perfect Search Engine is not Enough: a Study of Orienteering Behavior in Directed Search", "venue" : "CHI", "pages" : "415--422", "year" : "2004", "booktitle" : "CHI \'04: Proceedings of the SIGCHI conference on Human factors in computing systems", "publisher" : "ACM Press", "abstract" : " This paper presents a modified diary study that investigated how people performed personally motivated searches in their email, in their files, and on the Web. Although earlier studies of directed search focused on keyword search, most of the search behavior we observed did not involve keyword search. Instead of jumping directly to their information target using keywords, our participants navigated to their target with small, local steps using their contextual knowledge as a guide, even when they knew exactly what they were looking for in advance. This stepping behavior was especially common for participants with unstructured information organization. The observed advantages of searching by taking small steps include that it allowed users to specify less of their information need and provided a context in which to understand their results. We discuss the implications of such advantages for the design of personal information management tools. ", "pub-type" : "inproceedings", "pdf" : "http://people.csail.mit.edu/teevan/work/publications/papers/chi04.pdf", "doi" : "http://doi.acm.org/10.1145/985692.985745", "date" : "2004", "key" : "Karger:Orienteering" }, { "booktitle" : "2nd Annual Student Oxygen Workshop, Gloucester, MA, USA", "pub-type" : "inproceedings", "venue" : "Oxygen", "uri" : "urn:4255ed38c5b328b330c18b76e34f130f", "date" : "2002", "author" : [ "Quan, Dennis", "Huynh, David F.", "Sinha, Vineet", "Zhurakhinskaya, Marina", "Karger, David" ], "type" : "Publication", "year" : "2002", "label" : "Basic Concepts for Managing Semi-structured Information in Haystack", "key" : "Quan" }, { "label" : "4ac7981304929a62bf5314f21627abca", "key" : "Karger:JournalDone", "type" : "Publication", "pub-type" : "unpublished", "note" : "{\\bf Finished Journals}", "uri" : "urn:4ac7981304929a62bf5314f21627abca" }, { "label" : "0a5e58587d04a8dc967e959bca0e1ca6", "key" : "Karger:JournalAppear", "type" : "Publication", "pub-type" : "unpublished", "note" : "{\\bf Journals to appear}", "uri" : "urn:0a5e58587d04a8dc967e959bca0e1ca6" }, { "label" : "f7a4d2b9f7f49a53ee38f6d2b48c996a", "key" : "Karger:ConfDone", "type" : "Publication", "pub-type" : "unpublished", "note" : "{\\bf Conference Proceedings}", "uri" : "urn:f7a4d2b9f7f49a53ee38f6d2b48c996a" }, { "label" : "e9afd14d26f6bc1128db16b7cb34a263", "key" : "Karger:ConfAppear", "type" : "Publication", "pub-type" : "unpublished", "note" : "{\\bf Conf To appear}", "uri" : "urn:e9afd14d26f6bc1128db16b7cb34a263" }, { "pub-type" : "phdthesis", "uri" : "urn:de81c48c62bf37cfd6d66db021c05fa9", "date" : "1998", "school" : "MIT", "author" : "Lewin, Daniel", "note" : "Available at the MIT Library, {\\tt http://thesis.mit.edu}", "type" : "Publication", "year" : "1998", "label" : "Consistent Hashing and Random Trees: Algorithms for Caching in Distributed Networks", "key" : "Lewin:Thesis" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$30^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$30^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:3bcf6458dc8f79af0c36d2ade78c11fc", "date" : "1997-10", "place" : "Miami, FL", "author" : [ "Karloff, Howard", "Zwick, Uri" ], "month" : "October", "type" : "Publication", "year" : "1997", "label" : "A $7/8 -\\epsilon$ approximation for MAX-3SAT?", "key" : "Karloff:3SAT" }, { "pub-type" : "mastersthesis", "uri" : "urn:3617820cb282eca3430cf0d8ea5a71db", "date" : "2004-06", "school" : "Massachusetts Institute of Technology", "author" : "Bakshi, Karun", "month" : "June", "year" : "2004", "type" : "Publication", "abstract" : "In this thesis, we advocate breaking the rigidity of applications by allowing users to create and customize their own task-oriented interfaces that aggregate and present task-specific information and tools on the same screen.", "label" : "Tools for End-User Creation and Customization of Interfaces for Information Management Tasks", "key" : "Bakshi:Thesis" }, { "url" : "citeseer.ist.psu.edu/jerrum93polynomialtime.html", "booktitle" : "Automata, Languages and Programming", "pub-type" : "inproceedings", "uri" : "urn:35209fa5d35458890f8a554e24e212d2", "pages" : "462-475", "date" : "1990", "author" : [ "Jerrum, Mark", "Sinclair, Alistair" ], "year" : "1990", "type" : "Publication", "label" : "Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract)", "key" : "Jerrum:Ising" }, { "journal" : "Combinatorica", "pub-type" : "article", "uri" : "urn:5194840d10b97dc0a9bbce1571c25014", "pages" : "39--60", "date" : "2001", "number" : "1", "author" : "Jain, Kamal", "volume" : "21", "type" : "Publication", "year" : "2001", "label" : "A factor 2 approximation algorithm for the generalized Steiner network problem", "key" : "Jain:NetworkDesign" }, { "publisher" : "ACM/SIAM", "booktitle" : "Proceedings of the Seventh Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "uri" : "urn:1a16fc8b4f622f86bcda2e50ca596ec8", "pages" : "547--553", "date" : "1996-01", "author" : [ "Aingworth, Donald", "Chekuri, Chandra", "Motwani, Rajeev" ], "month" : "January 28--30", "type" : "Publication", "year" : "1996", "isbn" : "0-89871-366-8", "label" : "Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)", "address" : "New York/Philadelphia", "key" : "Aingworth:Diameter" }, { "journal" : "Combinatorial Optimization and Application", "pub-type" : "article", "uri" : "urn:739b85231cf4e9586e4cdbcec18e0de6", "pages" : "195--210", "date" : "1998", "author" : [ "Akra, M. A.", "Bazzo, Louay M." ], "volume" : "10", "type" : "Publication", "year" : "1998", "label" : "On the Solution of Linear Recurrence Relations", "key" : "Akra:Recurrence" }, { "crossref" : "Proceedings of the {$28^{th}$} {ACM} Symposium on Theory of Computing", "type" : "Publication", "author" : [ "Alon, Noga", "Matias, Yossi", "Szegedy, Mario" ], "editor" : "Gary Miller", "url" : "citeseer.nj.nec.com/alon96space.html", "uri" : "urn:ced7bacd1732d589205918c89b0b1341", "label" : "The space complexity of approximating the frequency moments", "venue" : "STOC", "place" : "Philadelphia, PA", "pages" : "20--29", "year" : "1996", "booktitle" : "Proceedings of the {$28^{th}$} {ACM} Symposium on Theory of Computing", "publisher" : "ACM Press", "pub-type" : "inproceedings", "date" : "1996-05", "month" : "May", "organization" : "ACM", "key" : "Alon:Moments" }, { "organization" : "IEEE", "booktitle" : "37th Annual Symposium on Foundations of Computer Science", "pub-type" : "inproceedings", "uri" : "urn:d949025bee3091bc2595afb7933d5f33", "pages" : "452--461", "date" : "1996", "author" : [ "Dor, Dorit", "Halperin, Shay", "Zwick, Uri" ], "month" : "14--16 October", "type" : "Publication", "year" : "1996", "label" : "All Pairs Almost Shortest Paths", "address" : "Burlington, Vermont", "references" : "\\cite{SODA::AingworthCM1996} \\cite{FOCS::AlonGM1991} \\cite{FOCS::AlonGMN1992} \\cite{JACM::Awerbuch1985} \\cite{FOCS::AwerbuchBCP1993} \\cite{FOCS::Cohen1993} \\cite{STOC::Cohen1994} \\cite{JSYMC::CoppersmithW1990} \\cite{STOC::FederM1991} \\cite{JACM::FredmanT1987} \\cite{JCOMP::GalilM1993} \\cite{JACM::Johnson1977} \\cite{STOC::Seidel1992} \\cite{SICOMP::UllmanY1991}", "key" : "Dor:Diameter" }, { "journal" : "Proceedings of 31st Annual ACM Symposium on Theory of Computing", "pub-type" : "article", "uri" : "urn:3b3d4f3207f928d401bd14e95741ac02", "pages" : "1--10", "date" : "1999", "author" : [ "Charikar, M.", "Guha, S.", "Tardos, E.", "Shmoys, David B." ], "year" : "1999", "type" : "Publication", "label" : "A constant-factor approximation algorithm for the $k$-median problem", "key" : "Char99" }, { "journal" : "Proceedings of 40th Symposium on Foundations of Computer Science", "pub-type" : "article", "uri" : "urn:60644adef35ebbf8e8af1072f132e1ec", "date" : "1999", "author" : [ "Jain, Kamal", "Vazirani, Vijay V." ], "type" : "Publication", "year" : "1999", "label" : "Primal-Dual Approximation Algorithms for Metric Facility Location and $k$-Median Problems", "key" : "Jain99" }, { "publisher" : "ACM/SIAM", "booktitle" : "Proceedings of the Seventh Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "uri" : "urn:c5f981bd57420fe97c047188957f1e3c", "pages" : "68--74", "date" : "1996-01", "author" : [ "Awerbuch, Baruch", "Azar, Yossi", "Bartal, Yair" ], "month" : "January 28--30", "type" : "Publication", "year" : "1996", "isbn" : "0-89871-366-8", "label" : "On-line Generalized Steiner Problem", "address" : "New York/Philadelphia", "key" : "Awerbuch:Steiner" }, { "source" : "http://theory.lcs.mit.edu/ dmjones/STOC/stoc.bib", "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "uri" : "urn:4ef38aecda0aad003f4f5e8fe69b6b02", "venue" : "STOC", "crossref" : "Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing", "pages" : "499--508", "date" : "1995-05", "place" : "Las Vegas, NV", "author" : [ "Galil, Zvi", "Yu, Xiangdong" ], "month" : "May", "type" : "Publication", "year" : "1995", "label" : "Short Length Versions of {Menger\'s} Theorem (Extended Abstract)", "key" : "GalilY95" }, { "pub-type" : "techreport", "institution" : "Digital Systems Research Center", "uri" : "urn:1ba0aa0966c490d1bb664cf19a5ac7b5", "date" : "1997", "number" : "1997-022", "author" : [ "Henzinger, Monika Rauch", "Kleinberg, Jon", "Rao, Satish" ], "type" : "Publication", "year" : "1997", "label" : "Short-Length {M}enger Theorems", "address" : "130 Lytton Ave., Palo Alto, CA 94301", "key" : "Henzinger:Menger" }, { "pub-type" : "techreport", "institution" : "Massachusetts Institute of Technology Laboratory for Computer Science", "uri" : "urn:658df782967070d2118496e74120cd47", "date" : "1982-01", "number" : "272", "author" : "Smith, Brian Cantwell", "month" : "January", "type" : "Publication", "year" : "1982", "label" : "Reflection and Semantics in a Procedural Language", "address" : "Cambridge, Massachusetts", "key" : "3lisp" }, { "pub-type" : "misc", "uri" : "urn:2e16c6e2a049c6496d25f7a2269f73d6", "date" : "1996-05", "author" : [ "Weivel, Stuart L.", "Miller, Eric J." ], "month" : "May", "year" : "1996", "type" : "Publication", "howpublished" : "{\\tt http://www.oclc.org:5046/research/dublin\\_core/}", "label" : "Dublin Core MetaData Element Set", "key" : "DublinCore" }, { "journal" : "DLIB Magazine", "pub-type" : "article", "uri" : "urn:8d5d60d5a90638e8d34d763d70bf4844", "date" : "1996-08", "author" : "Lagoze, Carl", "month" : "August", "type" : "Publication", "note" : "{\\tt http://www.dlib.org/dlib/july96/lagoze/07lagoze.html}", "year" : "1996", "label" : "The Warwick MetaData Workshop", "key" : "WarwickFramework" }, { "label" : "What\'sHot Information Broker", "howpublished" : "{\\tt http://www.dstc.edu.au/BDU/APAP/WhatsHot/WhatsHot.html}", "key" : [ "DSTC", "What\'s Hot" ], "type" : "Publication", "pub-type" : "misc", "author" : "DSTC", "uri" : "urn:2af91078b0fbd24598982fb9d20ef253" }, { "organization" : "{Apple Computer, Inc.}", "label" : "Cyberdog", "howpublished" : "{\\tt http://www.cyberdog.apple.com/overview}", "key" : [ "Cyperdog", "Cyberdog" ], "type" : "Publication", "pub-type" : "misc", "uri" : "urn:4818927021245109ec3b03a56dae04be" }, { "label" : "MetaContent Format", "howpublished" : "{\\tt http://mcf.research.apple.com/}", "key" : [ "MCF", "MetaContent Format" ], "type" : "Publication", "pub-type" : "misc", "uri" : "urn:c3dd80202715245812551493a7589484" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:418614ab4e7cae54068a013ebfd29954", "pages" : "632--641", "date" : "1993-05", "place" : "San Diego, CA", "author" : [ "Aiello, W.", "Awerbuch, Baruch", "Maggs, Bruce", "Rao, Satish" ], "editor" : "Alok Aggarwal", "month" : "May", "type" : "Publication", "year" : "1993", "label" : "Approximate Load Balancing on Dynamic and Asynchronous Networks", "key" : "AielloAMR93" }, { "journal" : "Journal of Parallel and Distributed Computing", "pub-type" : "article", "uri" : "urn:4ee5747116812d4f4c5a36b392c96ae0", "pages" : "617-640", "date" : "1988", "author" : [ "Allen, F.", "Burke, M.", "Charles, P.", "Cytron, R.", "Ferrante, J." ], "volume" : "5", "type" : "Publication", "year" : "1988", "label" : "An overview of the PTRAN analysis system for multiprocessing", "key" : "AllenBCCF88" }, { "journal" : "Combinatorica", "pub-type" : "article", "uri" : "urn:6eaac1abea34ac202c69fc3a9f331bf1", "pages" : "1--12", "date" : "1988", "author" : [ "Aggarwal, Alok", "Anderson, R. J." ], "volume" : "8", "type" : "Publication", "year" : "1988", "label" : "A Random {$\\NC$} Algorithm for Depth First Search", "key" : "Aggarwal:DFS" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:87829e86e734ffe4f4629664c686d9ca", "pages" : "440--456", "date" : "1995-06", "number" : "3", "author" : [ "Agrawal, Ajit", "Klein, Philip", "Ravi, R." ], "volume" : "24", "month" : "June", "type" : "Publication", "year" : "1995", "note" : "A preliminary version appeared in Proceedings of the {$23^{rd}$} {ACM} Symposium on Theory of Computingpp. 134--144", "label" : "When Trees Collide: An Approximation Algorithm for the Generalized {S}teiner Problem on Networks", "key" : "Agrawal:Steiner" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$5^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "venue" : "SODA", "crossref" : "Proceedings of the {$5^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "uri" : "urn:3f79eb51c9092907e2e87ea073554350", "pages" : "233--240", "date" : "1994-01", "place" : "Arlington, VA", "author" : [ "Aggarwal, Manica", "Garg, Naveen" ], "editor" : "Daniel D. Sleator", "month" : "January", "type" : "Publication", "year" : "1994", "label" : "A Scaling Technique for Better Network Design", "key" : "Aggarwal:Steiner" }, { "publisher" : "Addison Wesley", "pub-type" : "book", "uri" : "urn:8697bfb55cb47931b1574063e20cfc5a", "date" : "1983", "author" : [ "Aho, Alfred V.", "Hopcroft, John E.", "Ullman, Jeffrey D." ], "type" : "Publication", "year" : "1983", "label" : "Data Structures and Algorithms", "key" : "Aho:DataStructures" }, { "publisher" : "Prentice Hall", "pub-type" : "book", "uri" : "urn:b8005213e0147c75d0d3279d87181185", "date" : "1993", "author" : [ "Ahuja, Ravindra K.", "Magnanti, Thomas L.", "Orlin, James B." ], "type" : "Publication", "year" : "1993", "label" : "Network Flows: Theory, Algorithms, and Applications", "address" : "Englewood Cliffs, New Jersey", "key" : "Ahuja:Flow" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$19^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$19^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:91467a36ceb623225948b55c1832b3f6", "pages" : "132--140", "date" : "1987", "author" : [ "Ajtai, Miklos", "Koml?s, J.", "Szemer?di, Endre" ], "type" : "Publication", "year" : "1987", "label" : "Deterministic Simulation in Logspace", "key" : "Ajtai:Expander" }, { "publisher" : "Springer-Verlag", "pub-type" : "book", "uri" : "urn:222e6771e6256ebbc2bad1f1c7d5f112", "date" : "1989", "author" : "Aldous, David", "type" : "Publication", "year" : "1989", "label" : "Probability Approximations via the Poisson Clumping Heuristic", "address" : "New York", "key" : "Aldous" }, { "journal" : "Algorithmica", "pub-type" : "article", "uri" : "urn:494cfac7c14f6c621ad9aee9541f3967", "pages" : "388--412", "date" : "1998", "author" : "Aldous, David", "volume" : "22", "type" : "Publication", "year" : "1998", "label" : "A Metropolis-Type Optimization Algorithm on the Infinite Tree", "key" : "Aldous:MetropolisTree" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:f42577069b5224c2f7c4dc491ebf6b85", "pages" : "492--501", "date" : "1994-05", "place" : "Montreal, Quebec, Canada", "author" : [ "Aldous, David", "Vazirani, Umesh" ], "month" : "May", "type" : "Publication", "year" : "1994", "label" : "Go With the Winners Algorithms", "key" : "Aldous:Winners" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "{IEEE}", "booktitle" : "Proceedings of the {$20^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$20^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:ee12210cfe4ac038cfadfe8eeb8b0a16", "pages" : "218--223", "date" : "1979-10", "place" : "San Juan, Puerto Rico", "author" : [ "Aleliunas, R.", "Karp, Richard M.", "Lipton, Richard J.", "Lov?sz, L?szl?", "Rackoff, C." ], "month" : "October", "type" : "Publication", "year" : "1979", "label" : "Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems", "key" : "Aleliunas:Walks" }, { "journal" : "Siam Journal on Optimization", "pub-type" : "article", "uri" : "urn:89fd950b44638f61ae3c4ed4e7653da3", "pages" : "13--51", "date" : "1995", "number" : "1", "author" : "Alizadeh, Farid", "volume" : "5", "type" : "Publication", "year" : "1995", "note" : "Preliminary version appeared in IPCO 1992", "label" : "Interior point methods in semidefinite programming with applications to combinatorial optimization", "key" : "Alizadeh" }, { "id" : "096bc87ab09c012d506023d1e505ca60", "booktitle" : "Proceedings of the 2nd MPS Conference on Integer Programming and Combinatorial Optimization", "pub-type" : "inproceedings", "uri" : "urn:096bc87ab09c012d506023d1e505ca60", "date" : "1992", "author" : "Alizadeh, Farid", "type" : "Publication", "note" : "Journal version in {\\em SIAM Journal on Optimization}.", "year" : "1992", "label" : "Interior point methods in semidefinite programming with applications to combinatorial optimization", "address" : "Carnegie-Mellon University", "key" : "Alizadeh-conf" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:9093448737a5b358c631c37788cb2b0f", "pages" : "70--122", "date" : "1998", "number" : "1", "author" : [ "Arora, Sanjeev", "Safra, Shmuel" ], "volume" : "45", "type" : "Publication", "year" : "1998", "note" : "A preliminary version appeared in Proceedings of the {$33^{rd}$} Annual Symposium on the Foundations of Computer Science", "label" : "Probabilistic checking of proofs: A new characterization of {NP}", "key" : "AS" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$33^{rd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "5ed72fd951313adbaa6f4fea39148a0b", "uri" : "urn:d5a7c5148a7f5d78d452128d94b1bb45", "pages" : "14--23", "date" : "1992-10", "place" : "Pittsburgh, PA", "author" : [ "Arora, Sanjeev", "Lund, Carsten", "Motwani, Rajeev", "Sudan, Madhu", "Szegedy, Mario" ], "month" : "October", "type" : "Publication", "year" : "1992", "label" : "Proof Verification and Hardness of Approximation Problems", "key" : "almss" }, { "organization" : "IEEE", "booktitle" : "37th Annual Symposium on Foundations of Computer Science", "pub-type" : "inproceedings", "uri" : "urn:dd1af9bb020cfd11d80a8a65d499c6c5", "pages" : "21--30", "date" : "1996", "author" : [ "Arora, Sanjeev", "Frieze, Alan", "Kaplan, Haim" ], "month" : "14--16 October", "type" : "Publication", "year" : "1996", "label" : "A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems", "address" : "Burlington, Vermont", "references" : "\\cite{FOCS::Arora1996} \\cite{STOC::AroraKK1995} \\cite{FOCS::AroraLMSS1992} \\cite{JACM::Baker1994} \\cite{FOCS::FriezeK1996} \\cite{JACM::IbarraK1975} \\cite{FOCS::KarmarkarK1982} \\cite{STOC::KhannaM1996} \\cite{FOCS::LeightonR1988} \\cite{STOC::LubyN1993} \\cite{JACM::SahniG1976} \\cite{JACM::Yannakakis1985}", "key" : "Arora:Assignment" }, { "pub-type" : "techreport", "institution" : "IBM", "uri" : "urn:3dc5be35f2b1acea3494ad24d0feefd6", "date" : "1992", "number" : "RJ 8744", "author" : [ "Alon, Noga", "Galil, Zvi", "Margalit, Oded", "Naor, Moni" ], "type" : "Publication", "year" : "1992", "label" : "Witnesses for Boolean Matrix Multiplication and for Shortest Paths", "key" : "Alon:Witnesses" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:2d4b9168d87923bc6a4f740752c9a304", "pages" : "24--35", "date" : "1994-11", "place" : "Santa Fe, NM", "author" : [ "Alon, Noga", "Frieze, Alan", "Welsh, Dominic" ], "editor" : "Shafi Goldwasser", "month" : "November", "type" : "Publication", "year" : "1994", "label" : "Polynomial Time Randomized Approximation Schemes for the {T}utte Polynomial of Dense Graphs", "key" : "Alon:Tutte" }, { "pub-type" : "misc", "uri" : "urn:12a55fb2da852f72ac12188b6be8bcf8", "date" : "1994-08", "author" : "Alon, Noga", "month" : "August", "type" : "Publication", "year" : "1994", "label" : "Personal Communication", "key" : "alon:comm" }, { "journal" : "Mathematical Programming", "pub-type" : "article", "uri" : "urn:34bea184c3181cca48488bd5146432bf", "pages" : "253--264", "date" : "1998", "author" : [ "Alon, Noga", "Kahale, Nabil" ], "volume" : "80", "type" : "Publication", "year" : "1998", "label" : "Approximation the Independence Number via the $\\theta$-function", "key" : "Alon:Independent" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:97646a587b4876b74a381eaf9c99ff93", "pages" : "346--355", "date" : "1994-05", "place" : "Montreal, Quebec, Canada", "author" : [ "Alon, Noga", "Kahale, Nabile" ], "month" : "May", "type" : "Publication", "year" : "1994", "label" : "A Spectral Technique for Coloring Random $3$-Colorable Graphs", "key" : "Alon:Coloring" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$22^{nd}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$22^{nd}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:2ff623e1007a0c93f64510fc43fbe52b", "pages" : "293-299", "date" : "1990-05", "author" : [ "Alon, Noga", "Seymour, Paul", "R., Thomas" ], "month" : "May", "mynote" : "The paper by Alon Seymour and Thomas is beautiful stuff. (We use essentially the same proof in Plotkin Rao Smith..with a (I think) clearer explanation.)", "type" : "Publication", "year" : "1990", "label" : "A Separator Theorem for Graphs with an Excluded Minor and its Applications.", "key" : "Alon:ExcludedMinors" }, { "id" : "e2d61f1b48f20ce7950eb65c50f843cb", "pub-type" : "misc", "uri" : "urn:e2d61f1b48f20ce7950eb65c50f843cb", "date" : "1994-08", "author" : [ "Alon, Noga", "Kahale, Nabil", "Szegedy, Mario" ], "month" : "August", "year" : "1994", "type" : "Publication", "label" : "Personal Communication", "key" : "AKS:comm" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:de59d9fa44dd5274b20e95def0fff392", "pages" : "569--575", "date" : "1991-10", "place" : "San Juan, Puerto Rico", "author" : [ "Alon, Noga", "Galil, Zvi", "Margalit, Oded" ], "month" : "October", "type" : "Publication", "year" : "1991", "label" : "On the Exponent of the All Pairs Shortest Path Problem", "key" : "Alon:Paths" }, { "pub-type" : "techreport", "uri" : "urn:baa045c28b9bf8dc61e5a374229bd5ad", "institution" : "Tel Aviv University", "date" : "1987", "author" : [ "Alon, Noga", "Schieber, Baruch" ], "type" : "Publication", "year" : "1987", "label" : "Optimal Preprocessing for Answering Online Product Queries", "key" : "Alon:Trees" }, { "publisher" : "John Wiley \\& Sons, Inc.", "pub-type" : "book", "uri" : "urn:7ab13869452686e90535ac80f0574c82", "date" : "1992", "author" : [ "Alon, Noga", "Spencer, Joel H." ], "type" : "Publication", "year" : "1992", "label" : "The Probabilistic Method", "address" : "New York, NY", "key" : "Alon:ProbabilisticMethod" }, { "pub-type" : "misc", "uri" : "urn:941c21148007cdc7205cbc592dbcd104", "date" : "1992", "author" : "Applegate, David", "note" : "Personal Communication.", "type" : "Publication", "year" : "1992", "howpublished" : "AT\\&T Bell Labs", "label" : "941c21148007cdc7205cbc592dbcd104", "key" : "Applegate:Private" }, { "pub-type" : "misc", "uri" : "urn:b7d24d52adbbbabb63f3d7c35e44cf12", "date" : "1996", "author" : "Applegate, David", "note" : "Personal Communication.", "type" : "Publication", "year" : "1996", "howpublished" : "AT\\&T Bell Labs", "label" : "b7d24d52adbbbabb63f3d7c35e44cf12", "key" : "Applegate:Private96" }, { "pub-type" : "techreport", "institution" : "DIMACS", "uri" : "urn:a69419438bbff62e06a477e45461b7f5", "date" : "1995", "number" : "95-05", "author" : [ "Appelgate, David", "Bixby, Robert", "Chv\\\'a{a}tal, Va\\v{s}ek", "Cook, William" ], "year" : "1995", "type" : "Publication", "label" : "Finding Cuts in the TSP", "address" : "Rutgers University, New Brunswick, NJ", "key" : "Applegate:TSP" }, { "journal" : "Algorithmica", "pub-type" : "article", "uri" : "urn:b4d307b9fd1cab73872fcafa6538d36f", "pages" : "464--497", "date" : "1996-10", "number" : "4/5", "author" : [ "Seidel, Raimund", "Aragon, C. R." ], "volume" : "16", "month" : "October/November", "type" : "Publication", "year" : "1996", "label" : "Randomized Search Trees", "references" : "\\cite{FOCS::AnderssonO1991} \\cite{SODA::BaumgartenJM1992} \\cite{ACTAI::BayerM1972} \\cite{SICOMP::BentST1985} \\cite{JACM::Brent1976} \\cite{JACM::Devroye1986} \\cite{SODA::GalperinR1993} \\cite{FOCS::GuibasS1978} \\cite{IC::HoffmanMRT1986} \\cite{SICOMP::McCreight1985} \\cite{SICOMP::NievergeltR1973} \\cite{POPL::PughT1989} \\cite{JACM::DleatorT1985}", "key" : "Aragon:Treaps" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:efbc8b731a6bc01878e8523c2980bcb2", "pages" : "291--301", "date" : "1998", "number" : "1", "author" : [ "Aumann, Yonatan", "Rabani, Yuval" ], "volume" : "27", "type" : "Publication", "year" : "1998", "label" : "An {$O(\\log k)$} Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm", "key" : "Aumann:MultiCut" }, { "journal" : "IEEE Transactions on Computers", "pub-type" : "article", "uri" : "urn:f0c25a2bab82801d6c8b00106a6bc4f2", "pages" : "1258--1263", "date" : "1987-10", "number" : "10", "author" : [ "Awerbuch, Baruch", "Shiloach, Y." ], "volume" : "C-36", "month" : "October", "type" : "Publication", "year" : "1987", "label" : "New Connectivity and {MSF} Algorithms for Shuffle-Exchange Network and {PRAM}", "key" : "Awerbuch:MST" }, { "source" : "http://theory.lcs.mit.edu/ dmjones/STOC/stoc.bib", "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "uri" : "urn:df87116b0e694ee613f4a4938416fb96", "venue" : "STOC", "crossref" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "pages" : "487--496", "date" : "1994-05", "place" : "Montreal, Quebec, Canada", "author" : [ "Awerbuch, Baruch", "Leighton, Tom" ], "month" : "May", "type" : "Publication", "year" : "1994", "label" : "Improved Approximation Algorithms for the Multi-Commodity Flow Problem and Local Competitive Routing in Dynamic Networks", "key" : "Awerbuch:Flow" }, { "publisher" : "AMS", "booktitle" : "{Network Flows and Matching: First DIMACS Implementation Challenge}", "pub-type" : "incollection", "uri" : "urn:0a30ce8b64a337a293bde224fb69c604", "pages" : "43--64", "date" : "1993", "author" : [ "Badics, T.", "Boros, R." ], "editor" : "D. S. Johnson and C. C. McGeoch", "type" : "Publication", "year" : "1993", "label" : "{Implementing a Maximum Flow Algorithm: Experiments with Dynamic Trees}", "key" : "BB-93" }, { "journal" : "Journal of Computer and System Sciences", "pub-type" : "article", "uri" : "urn:df44131373fb2e88c34a78617744588d", "pages" : "204--232", "date" : "1992", "number" : "2", "author" : [ "Babai, L.", "Nisan, Noam", "Szegedy, Mario" ], "volume" : "45", "type" : "Publication", "year" : "1992", "label" : "Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-offs", "key" : "BNS" }, { "journal" : "The New Yorker", "pub-type" : "article", "uri" : "urn:66977810632f80805334b2845fabc90e", "pages" : "68,81-83", "date" : "1994-04", "author" : "Baker, Nicholson", "month" : "April", "type" : "Publication", "year" : "1994", "day" : "4", "label" : "Discards", "key" : "Baker:Discards" }, { "pub-type" : "techreport", "institution" : "Stanford University", "uri" : "urn:6820c908d39ff6f1dfe1253bb74962c0", "date" : "1997", "number" : "CS-TN-97-52", "author" : [ "Balabanovic, Marko", "Shoham, Yoav", "Yun, Yeogirl" ], "type" : "Publication", "year" : "1997", "label" : "An Adaptive Agent for Automated Web Browsing", "key" : "Balabanovic:BrosweAgent" }, { "pub-type" : [ "techreport", "Stanford Digital Library Project" ], "institution" : "Stanford University", "uri" : "urn:8d2a128b67b843149f4a5a56c6966b17", "date" : "1997", "number" : "SIDL-WP-1996-0048", "author" : [ "Baldonado, Michelle Q Wang", "Winograd, Terry" ], "year" : "1997", "note" : "also available at {\\tt http://www-diglib.stanford.edu/cgi-bin/WP/get/SIDL-WP-1996-0048}", "type" : "Publication", "label" : "SenseMaker: An Information-Exploration Interface Supporting the Contextual Evolution of a User\'s Interests", "key" : "Baldonado:SenseMaker" }, { "journal" : "Operations Research Letters", "pub-type" : "article", "uri" : "urn:2f0b2ce7a62be3394de6c2d569a56e49", "pages" : "201--203", "date" : "1992", "author" : "Barahona, Francisco", "volume" : "12", "type" : "Publication", "year" : "1992", "label" : "Separating from the Dominant of the Spanning Tree Polytope", "key" : "Barahona:SparseQuotient" }, { "journal" : "Mathematics of Operation Research", "pub-type" : "article", "uri" : "urn:b14e493ed9d37697af9cb41d6310b7fa", "pages" : "104--115", "date" : "1995-02", "number" : "1", "author" : "Barahona, Francisco", "volume" : "20", "month" : "February", "type" : "Publication", "year" : "1995", "label" : "Packing Spanning Trees", "key" : "Barahona:TreePacking" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$23^{rd}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$23^{rd}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:e0a3d57dda9701205fadee7c8e7b4d16", "pages" : "48--53", "date" : "1991-05", "author" : [ "Barnes, Greg", "Ruzzo, Walter L." ], "month" : "May", "type" : "Publication", "year" : "1991", "abstract" : "The $s$-$t$ connectivity problem for undirected graphs is to decide whether two designated vertices, $s$ and $t$, are in the same connected component. This paper presents the first known deterministic algorithms solving undirected $s$-$t$ connectivity using sublinear space and polynomial time. There is some evidence that such algorithms are impossible for the analogous problem on directed graphs. Our algorithms provide a nearly smooth time-space tradeoff between depth-first search and Savitch\'s algorithm. For $n$ vertex, $m$ edge graphs, the simplest of our algorithms uses space $s$, $O(n^{1/2} \\log n) \\le s \\le O(n\\log n)$, and time $O(((m + n)n^{2}\\log^{2} n)/s)$. We give a variant of this method that is faster at the higher end of the space spectrum. For example, with space $\\Theta(n\\log n)$, its time bound is $O((m+n)\\log n)$, close to the optimal time for the problem. Another generalization uses less space, but more time: space $O((n^{\\epsilon}\\log{n})/\\epsilon)$, for $1/\\log{n}\\leq\\epsilon\\le 1/2$, and time $n^{O(\\xfrac{1}{\\epsilon})}$. For constant $\\epsilon$ the time remains polynomial.", "label" : "Deterministic algorithms for undirected {$s$-$t$} connectivity using polynomial time and sublinear space", "key" : "Barnes:stConnectivity" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:9b595d9f0160de3ef5bf1719cfdca5bf", "pages" : "728--737", "date" : "1993-05", "place" : "San Diego, CA", "author" : [ "Barnes, Greg", "Feige, Uri" ], "editor" : "Alok Aggarwal", "month" : "May", "type" : "Publication", "year" : "1993", "label" : "Short Random Walks on Graphs", "key" : "Barnes:Walks" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$24^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$24^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:cd40a306c9f87863f6a66d06c035d5e9", "pages" : "51-58", "date" : "1992-05", "place" : "Victora, BC, Canada", "author" : [ "Bartal, Y.", "Fiat, Amos", "Karloff, Howard", "Vohra, R." ], "month" : "May", "type" : "Publication", "year" : "1992", "label" : "New Algorithms for an Ancient Scheduling Problem", "key" : "Bartal:Scheduling" }, { "journal" : "Computational Complexity", "pub-type" : "article", "uri" : "urn:65034281d14ad90a53235c093fe60adc", "pages" : "319--354", "date" : "1993", "author" : [ "Bellare, Mihir", "Goldreich, Oded", "Goldwasser, Shafi" ], "volume" : "3", "type" : "Publication", "year" : "1993", "note" : "A preliminary version appeared in Proceedings of the {$31^{st}$} Annual Symposium on the Foundations of Computer Science", "label" : "Randomness in Interactive Proofs", "key" : "Bellare:Expander" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:abb9dadecd2bf94fb0fd44c4b0fa24a5", "pages" : "276--287", "date" : "1994-11", "place" : "Santa Fe, NM", "author" : [ "Bellare, Mihir", "Rompel, John" ], "editor" : "Shafi Goldwasser", "month" : "November", "type" : "Publication", "year" : "1994", "label" : "Randomness-Efficient Oblivious Sampling", "key" : "Bellare:Sampling" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:4689d84ce51060820fed989fcffcb70d", "pages" : "184--193", "date" : "1994-05", "place" : "Montreal, Quebec, Canada", "author" : [ "Bellare, Mihir", "Sudan, Madhu" ], "month" : "May", "type" : "Publication", "year" : "1994", "label" : "Improved Non-approximability Results", "key" : "bellare" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:e13c890d3e490a63a202d29eb33834d1", "pages" : "658--667", "date" : "1994-05", "place" : "Montreal, Quebec, Canada", "author" : "Bencz?r, Andr?s A.", "month" : "May", "type" : "Publication", "year" : "1994", "note" : "Journal version in preparation", "label" : "Augmenting Undirected Connectivity in {$\\RNC$} and in Randomized {$\\Olog(n^3)$} Time", "key" : "Benczur:Augmentation" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$36^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "4f92a6a10a0562a42ae5d18c125dff20", "uri" : "urn:5588372de8c3e50069d15c01ba101696", "pages" : "92--102", "date" : "1995-10", "place" : "Milwaukie, WI", "author" : "Bencz?r, Andr?s A.", "month" : "October", "type" : "Publication", "year" : "1995", "label" : "A representation of cuts within 6/5 times the edge connectivity with applications", "key" : "Benczur:ApproxCut" }, { "pub-type" : "phdthesis", "uri" : "urn:75a39795ae1e7718b0e2fb393f3ef60e", "date" : "1997", "school" : "Massachusetts Institute of Technology", "author" : "Bencz?r, Andr?s A.", "note" : "Available at {{\\tt http://pele.ilab.sztaki.hu/\\ {}benczur/\\ {}Mypapers/Thesis.ps.gz}}", "type" : "Publication", "year" : "1997", "label" : "Cut structures and randomized algorithms in edge-connectivity problems", "key" : "Benczur:Thesis" }, { "publisher" : "North-Holland", "pub-type" : "book", "uri" : "urn:1492f03fbfb56fbc74aba705a6f399e6", "date" : "1973", "author" : "Berge, C.", "type" : "Publication", "year" : "1973", "label" : "Graphs and Hypergraphs", "address" : "Amsterdam", "key" : "berge" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:a2a08618d1beb3d7c2064cf675f67e4a", "pages" : "221--242", "date" : "1993-04", "number" : "2", "author" : [ "Berkman, Omer", "Vishkin, Uzi" ], "volume" : "22", "month" : "April", "type" : "Publication", "year" : "1993", "label" : "Recursive Star-Tree Parallel Data Structure", "key" : "Berkman:LCA" }, { "publisher" : "Holden-Day", "pub-type" : "book", "uri" : "urn:5c549bc47fb322e23255973356c0d749", "date" : "1977", "author" : [ "Bickel, P. J.", "Doksum, K. A." ], "type" : "Publication", "year" : "1977", "label" : "Mathematical Statistics: Basic Ideas and Selected Topics", "address" : "Oakland, CA.", "key" : "Bickel:Statistics" }, { "pub-type" : "techreport", "institution" : "Department of Computer Science, State University of New York at Albany", "uri" : "urn:39bb1b7ca068ab56f6bf9cc8aa0a6a51", "date" : "1980-08", "number" : "80-3", "author" : "Bloniarz, P. A.", "month" : "August", "type" : "Publication", "year" : "1980", "label" : "A Shortest-path Algorithm with Expected Time {$O(n^2\\log n \\log^* n)$}", "key" : "Bloniarz:Paths" }, { "journal" : "Journal of Computer and System Sciences", "pub-type" : "article", "uri" : "urn:3f0b1acc28f7b6c62feb676d35f9b6c7", "pages" : "448-461", "date" : "1973", "author" : [ "Blum, Manuel", "Floyd, Robert W.", "Pratt, V. R.", "Rivest, Ronald L.", "Tarjan, Robert E." ], "volume" : "7", "type" : "Publication", "year" : "1973", "label" : "Time Bounds for Selection", "key" : "Blum:Median" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$21^{st}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$21^{st}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:f3f21f2a2f8c44f1308f64e568b5498e", "pages" : "535--542", "date" : "1989", "author" : "Blum, Avrim", "type" : "Publication", "year" : "1989", "label" : "An {$O(n^{0.4})$}-Approximation Algorithm for 3-Coloring (and Improved Approximation Algorithms for $k$-Coloring)", "key" : "blum89" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$31^{st}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$31^{st}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:d7c6a33e7dc3e4b8d0332409bc0557e2", "pages" : "554--562", "date" : "1990-10", "author" : "Blum, Avrim", "month" : "October", "type" : "Publication", "year" : "1990", "label" : "Some tools for approximate 3-coloring", "key" : "blum90" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:6bfb2809366c1371973a0374fc673551", "pages" : "470--516", "date" : "1994-05", "number" : "3", "author" : "Blum, Avrim", "volume" : "41", "month" : "May", "type" : "Publication", "year" : "1994", "label" : "New Approximation Algorithms for Graph Coloring", "key" : "Blum:Coloring" }, { "publisher" : "Harcourt Brace Janovich", "pub-type" : "book", "uri" : "urn:b77da7f62668a6e768efb45b8905291f", "date" : "1985", "author" : "Bollob?s, B?la", "type" : "Publication", "year" : "1985", "label" : "Random Graphs", "key" : "Bollobas" }, { "publisher" : "American Mathematical Society", "pub-type" : "book", "uri" : "urn:7357a46983494318f0bb16ce5785e523", "date" : "1986", "number" : "62", "author" : "Bollob?s, B?la", "series" : "Regional Conference Series in Mathematics", "type" : "Publication", "year" : "1986", "label" : "Extremal Graph Theory with Emphasis on Probabilistic Methods", "address" : "Providence, RI", "key" : "Bollobas:ExtremalBook" }, { "publisher" : "Elsevier Science Publishing Company", "booktitle" : "Random Graphs", "pub-type" : "incollection", "uri" : "urn:af42bf377ab74885ce75c72ab39b926a", "pages" : "47-97", "date" : "1987", "number" : "33", "author" : [ "Bollob?s, B?la", "Thomason, A. G." ], "series" : "Annals of Discrete Mathematics", "editor" : "Michal Karnoski and Zbignew Palka", "type" : "Publication", "year" : "1987", "label" : "Random Graphs of Small Order", "key" : "Bollobas:kConnectivity" }, { "journal" : "BIT", "pub-type" : "article", "uri" : "urn:b9196bf09455cf3d78692acb71c1fe6c", "pages" : "180--196", "date" : "1992", "author" : [ "Boppana, R. B.", "Halldorsson, Magnus M." ], "volume" : "32", "type" : "Publication", "year" : "1992", "label" : "Approximating maximum independent sets by excluding subgraphs", "key" : "boppana:IS" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$28^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "article", "venue" : "FOCS", "crossref" : "Proceedings of the {$28^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:1d6d1d260240ab7fe9df56e8ddca0dfe", "pages" : "280--285", "date" : "1987", "author" : "Boppana, R. B.", "type" : "Publication", "year" : "1987", "label" : "Eigenvalues and graph bisection: an average-case analysis", "key" : "Boppana:Bisection" }, { "journal" : "Pr?ca Moravsk? P{\\v{r}}?rodov{\\v{e}}deck? Spol{\\v{c}}nosti", "pub-type" : "article", "uri" : "urn:2492b5c1d2b607127ccfab3d95f5b0b7", "pages" : "37-58", "date" : "1926", "author" : "Bor\\o{u}vka, O.", "language" : "Czech", "volume" : "3", "type" : "Publication", "year" : "1926", "label" : "O Jist?m Probl?mu Minim?ln?m", "key" : "Boruvka:MST" }, { "booktitle" : "Proceedings of the {$16^{th}$} Annual International {ACM} {SIGIR} Conference on Research and Development in Information Retrieval", "pub-type" : "inproceedings", "uri" : "urn:6b0df0e6110f3c2bda79fdd8bfa477eb", "pages" : "116--125", "date" : "1993-06", "author" : "Botafogo, Rodrigo A.", "month" : "June", "type" : "Publication", "year" : "1993", "label" : "Cluster Analysis for Hypertext Systems", "key" : "Botafogo:Hypertext" }, { "booktitle" : "Proceedings of the SIGPLAN 89 Conference on Programming Language Design and Implementation", "pub-type" : "inproceedings", "uri" : "urn:d690c538969f8dccf95a8ed9cec462b7", "pages" : "275--274", "date" : "1989", "author" : [ "Briggs, P.", "Cooper, K. D.", "Kennedy, K.", "Torczon, L." ], "type" : "Publication", "year" : "1989", "label" : "Coloring heuristics for register allocation", "key" : "briggs" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:b44708d005fd6d7f6d53d60c493f3acb", "pages" : "594--614", "date" : "1980", "author" : [ "Brown, Mark", "Tarjan, Robert E." ], "volume" : "9", "type" : "Publication", "year" : "1980", "label" : "Design and Analysis of a Data Structure for Representing Sorted Lists", "key" : "Brown:Finger" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:8aa4bbf5c9d9860b701b02172e38e9b1", "pages" : "211--226", "date" : "1979-04", "number" : "2", "author" : [ "Brown, Mark", "Tarjan, Robert E." ], "volume" : "26", "month" : "April", "type" : "Publication", "year" : "1979", "label" : "A Fast Merging Algorithm", "key" : "Brown:MergeTrees" }, { "journal" : "Networks", "pub-type" : "article", "uri" : "urn:b91e4a0ebd00ca00af141c645383b87a", "pages" : "151--172", "date" : "1989", "author" : [ "Cai, G--P.", "Sun, Y--G." ], "volume" : "19", "type" : "Publication", "year" : "1989", "label" : " The minimum augmentation of any graph to a $k$-edge-connected graph", "key" : "Cai:Augmentation" }, { "journal" : "Journal of Algorithms", "pub-type" : "article", "uri" : "urn:8c42a6d7c7a13cbc7e956cc397c848ec", "pages" : "258--273", "date" : "1992-06", "number" : "2", "author" : [ "Camerini, P. M.", "Galbiati, G.", "Maffioli, F." ], "volume" : "13", "month" : "June", "type" : "Publication", "year" : "1992", "label" : "Random Pseudo-Polynomial Algorithms for Exact Matroid Problems", "key" : "Camerini:Matroid" }, { "booktitle" : "Proceedings of the SIGPLAN 89 Conference on Programming Language Design and Implementation", "pub-type" : "inproceedings", "uri" : "urn:a3c6a428d5d18382d2f71ad32ecf555c", "pages" : "98--101", "date" : "1982", "author" : "Chaitin, G. J.", "type" : "Publication", "year" : "1982", "label" : "Register allocation and spilling via graph coloring", "key" : "chaitin" }, { "journal" : "Computer Languages", "pub-type" : "article", "uri" : "urn:fb5f7c3c4cfc76617fb904af2b6b681c", "pages" : "47--57", "date" : "1981", "author" : [ "Chaitin, G. J.", "Auslander, M. A.", "Chandra, A. K.", "Cocke, J.", "Hopkins, M. E.", "Markstein, P. W." ], "volume" : "6", "type" : "Publication", "year" : "1981", "label" : "Register allocation via coloring", "key" : "chandra" }, { "publisher" : "Springer-Verlag", "booktitle" : "Languages and Compilers for Parallel Computing", "pub-type" : "inproceedings", "uri" : "urn:a277632b95eb352a585585baa7658881", "pages" : "76--91", "date" : "1996", "author" : [ "Chaterjee, S.", "Gilver, J. R.", "Schreiber, R.", "Sheffler, T. J." ], "series" : "Lecture Notes in Computer Science series", "volume" : "369", "type" : "Publication", "year" : "1996", "label" : "Array Distribution in Parallel Programs", "key" : "Chaterjee:Personal" }, { "journal" : "Algorithmica", "pub-type" : "article", "uri" : "urn:781b7e4d2fddce86ab7cf771b7a4b75b", "pages" : "337-361", "date" : "1987", "number" : "3", "author" : "Chazelle, Bernard", "volume" : "2", "type" : "Publication", "year" : "1987", "label" : "Computing on a Free Tree via Complexity-Preserving Mappings", "key" : "Chazelle:Trees" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:0578ee83aa3867bdc3d7c5e0efc24898", "pages" : "427--461", "date" : "1988-06", "number" : "3", "author" : "Chazelle, Bernard", "volume" : "17", "month" : "June", "type" : "Publication", "year" : "1988", "label" : "A Functional Approach to Data Structures and its Use in Multidimensional Searching", "key" : "Chazelle:RangeSearch" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:c76403acd8308ff5ca7bdd624c9b9c31", "pages" : "203--226", "date" : "1995-04", "number" : "2", "author" : [ "Cheriyan, Joseph", "Hagerup, Torben" ], "volume" : "24", "month" : "April", "type" : "Publication", "year" : "1995", "note" : "A preliminary version appeared in Proceedings of the {$31^{st}$} Annual Symposium on the Foundations of Computer Science", "label" : "A Randomized Maximum-flow Algorithm", "key" : "Cheriyan:Maxflow" }, { "publisher" : "Springer-Verlag", "booktitle" : "Automata, Languages and Programming. {$17^{th}$} International Colloquium Proceedings", "pub-type" : "incollection", "uri" : "urn:9e1fdb84df205a60629d03a7ee88e6de", "pages" : "135--48", "date" : "1990", "author" : [ "Cheriyan, Joseph", "Hagerup, T.", "Mehlhorn, Kurt" ], "editor" : "Michael S. Patterson", "type" : "Publication", "year" : "1990", "label" : "Can a maximum flow be computed in {$o(nm)$} time?", "address" : "Berlin", "key" : "Cheriyan:DenseMaxflow" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$23^{rd}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$23^{rd}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:c8989a441c9c4ac4aaed35be2494c5cb", "pages" : "391--401", "date" : "1991-05", "author" : [ "Cheriyan, Joseph", "Thurimella, Ramki" ], "month" : "May", "type" : "Publication", "year" : "1991", "label" : "Algorithms for Parallel {$k$}-Vertex Connectivity and Sparse Certificates\\typeout{SUPERSEDED BY JOURNAL?}", "key" : "Cheriyan:Paths" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:c06f873eb0aadf8726fa642c9bde1b70", "pages" : "157--174", "date" : "1993-02", "number" : "1", "author" : [ "Cheriyan, Joseph", "Kao, Ming Yang", "Thurimella, Ramki" ], "volume" : "22", "month" : "February", "type" : "Publication", "year" : "1993", "label" : "Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for $k$-vertex Connectivity", "key" : "Cheriyan:Connectivity" }, { "journal" : "Annals of Mathematical Statistics", "pub-type" : "article", "uri" : "urn:1fbc0a8a7a5eed4cdc4d2ab915b2a7d4", "pages" : "493--509", "date" : "1952", "author" : "Chernoff, H.", "volume" : "23", "type" : "Publication", "year" : "1952", "label" : "A measure of the Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations", "key" : "Chernoff" }, { "journal" : "Communications of the ACM", "pub-type" : "article", "uri" : "urn:809e5ae5c236866485785db5f62fdb96", "pages" : "659--665", "date" : "1982-09", "number" : "9", "author" : [ "Chin, F. Y.", "Lam, J.", "Chen, I. N." ], "volume" : "25", "month" : "September", "type" : "Publication", "year" : "1982", "label" : "Efficient Parallel Algorithms for some Graph Problems", "key" : "CLC" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "venue" : "SODA", "crossref" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "uri" : "urn:abc07f5079b91ad3a887475a4504de05", "pages" : "11-20", "date" : "1993-01", "place" : "Austin, TX", "author" : [ "Chong, Ka Wong", "Lam, Tak Wah" ], "month" : "January", "type" : "Publication", "year" : "1993", "note" : "To appear in {\\it Algorithmica}\\typeout{CL93 appeared yet?}", "label" : "Connected Components in {$O(\\log n\\log\\log n)$} Time on the {EREW} {PRAM}", "key" : "Chong:Proc-Connectivity" }, { "journal" : "Journal of Algorithms", "pub-type" : "article", "uri" : "urn:4f8875aa18d2e06180333ef9821b9779", "pages" : "378--402", "date" : "1995-05", "number" : "3", "author" : [ "Chong", "Lam" ], "volume" : "18", "month" : "May", "type" : "Publication", "year" : "1995", "note" : "A preliminary version appeared in Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "label" : "Finding Connected Components in {$O(\\log n \\log \\log n)$} Time on the {EREW} {PRAM}", "key" : "Chong:Connectivity" }, { "journal" : "Journal of Complexity", "pub-type" : "article", "uri" : "urn:fe8d72f7f96ec320b07ce2327fb154b7", "pages" : "96--106", "date" : "1989", "author" : [ "Chor, B.", "Goldreich, Oded" ], "volume" : "5", "type" : "Publication", "year" : "1989", "label" : "On the power of two-point sampling", "key" : "Chor:pairwise" }, { "journal" : "Transactions on Programming Languages and Systems", "pub-type" : "article", "uri" : "urn:25e0f79267e2c58734428af1c2fec41b", "pages" : "501--536", "date" : "1990-10", "number" : "4", "author" : [ "Chow, Fred C.", "Hennessy, John L." ], "volume" : "12", "month" : "October", "type" : "Publication", "year" : "1990", "label" : "The Priority Based Coloring Approach to Register Allocation", "key" : "Chow:RegisterAllocation" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:1cc6705f3501f1a5bbd0605ef400192a", "pages" : "488--499", "date" : "1995", "number" : "2", "author" : "Clarkson, Ken L.", "volume" : "42", "type" : "Publication", "year" : "1995", "label" : "{L}as {V}egas Algorithms for Linear and Integer Programming when the Dimension is Small", "key" : "Clarkson:LP" }, { "journal" : "Discrete and Computational Geometry", "pub-type" : "article", "uri" : "urn:ddcf6e0187bb77b255ee18381e5d4eca", "pages" : "195--222", "date" : "1987", "author" : "Clarkson, Ken L.", "volume" : "2", "type" : "Publication", "year" : "1987", "label" : "New Applications of Random Sampling in Computational Geometry", "key" : "Clarkson:Sampling" }, { "journal" : "Discrete and Computational Geometry", "pub-type" : "article", "uri" : "urn:c6022079daa4db9e3c1378aabb8d75cb", "pages" : "387--421", "date" : "1987", "number" : "5", "author" : [ "Clarkson, Ken L.", "Shor, Peter W." ], "volume" : "4", "type" : "Publication", "year" : "1987", "label" : "Applications of Random Sampling in Computational Geometry, {II}", "key" : "Clarkson:SamplingII" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$30^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "d67d268055bde95f8913385c120a0ea3", "uri" : "urn:2c4c9e5aefebe5d3822e37cb492868ed", "pages" : "14--19", "date" : "1989", "author" : [ "Cohen, A.", "Wigderson, Avi" ], "type" : "Publication", "year" : "1989", "label" : "Dispersers, deterministic amplification, and weak random sources", "key" : "Cohen:Expander" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:aad51ce900f56979f3593c935e96427c", "pages" : "194--200", "date" : "1993-05", "place" : "San Diego, CA", "author" : [ "Cohen, Robert F.", "Battista, Giuseppe Di", "Kanevsky, Arkady", "Tamassia, Roberto" ], "editor" : "Alok Aggarwal", "month" : "May", "type" : "Publication", "year" : "1993", "label" : "Reinventing the Wheel: An Optimal Data Structure for Connectivity Queries", "key" : "Cohen:Wheel" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:ccf5facc9c990d7dd38da8daf5b7a200", "pages" : "579--599", "date" : "1995-06", "number" : "3", "author" : "Cohen, Edith", "volume" : "24", "month" : "June", "type" : "Publication", "year" : "1995", "label" : "Approximate Max-Flows in Small-Depth Networks", "key" : "Cohen:Round" }, { "crossref" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "type" : "Publication", "author" : "Cohen, Edith", "editor" : "Shafi Goldwasser", "uri" : "urn:d98fa12ee0b4ee4bd0d482992c3eb89e", "label" : "Estimating the Size of the Transitive Closure in Linear Time", "venue" : "FOCS", "place" : "Santa Fe, NM", "pages" : "190--200", "year" : "1994", "booktitle" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "publisher" : "{IEEE} Computer Society Press", "source" : "http://theory.lcs.mit.edu/ dmjones/FOCS/focs.bib", "pub-type" : "inproceedings", "date" : "1994-11", "month" : "November", "organization" : "IEEE", "key" : "Cohen:TransitiveClosure" }, { "publisher" : "Oxford University Press", "pub-type" : "book", "uri" : "urn:92dd7f16f8193d53ef5a99195394467c", "date" : "1987", "author" : "Colbourn, Charles J.", "series" : "The International Series of Monographs on Computer Science", "volume" : "4", "editors" : "John E. Hopcroft and Gordon D. Plotkin and Jacob T. Schwartz and Dana S. Scott and Jean Vuillemin", "type" : "Publication", "year" : "1987", "label" : "The Combinatorics of Network Reliability", "key" : "Colbourn" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:cd011bc07541f8922d0257e593f78d30", "pages" : "770-785", "date" : "1988-08", "number" : "4", "author" : "Cole, Richard", "volume" : "17", "month" : "August", "type" : "Publication", "year" : "1988", "label" : "Parallel Merge-Sort", "key" : "Cole:Sort" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$27^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$27^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:2eaa64835147dd1eb6e6ea3fb57e9398", "date" : "1986", "author" : [ "Cole, Richard", "Vishkin, Uzi" ], "type" : "Publication", "year" : "1986", "label" : "Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems", "key" : "Cole:Connectivity" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:a70daa65c908a58b3251b7610469421f", "pages" : "128--142", "date" : "1988", "number" : "1", "author" : [ "Cole, Richard", "Vishkin, Uzi" ], "volume" : "17", "type" : "Publication", "year" : "1988", "label" : "Approximate Parallel Scheduling, Part {I}: he Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time", "key" : "Cole:ParallelSchedulingI" }, { "journal" : "Information and Computation (formerly Information and Control)", "pub-type" : "article", "uri" : "urn:a91c811a40e3f8febd41f4d1f068f8e3", "pages" : "1--47", "date" : "1991-05", "number" : "1", "author" : [ "Cole, Richard", "Vishkin, Uzi" ], "volume" : "92", "month" : "May", "type" : "Publication", "year" : "1991", "label" : "Approximate Parallel Scheduling. {II}. {A}pplications to Logarithmic-Time Optimal Parallel Graph Algorithms", "key" : "Cole:ParallelSchedulingII" }, { "organization" : "ACM", "booktitle" : "Proceedings of the {$6^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "pub-type" : "inproceedings", "venue" : "SPAA", "crossref" : "Proceedings of the {$6^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "uri" : "urn:57fba65988b28b9add8e2e0d7bf02f4b", "pages" : "11--16", "date" : "1994-06", "author" : [ "Cole, Richard", "Klein, Philip N.", "Tarjan, Robert E." ], "month" : "June", "type" : "Publication", "year" : "1994", "label" : "A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees", "key" : "Cole:MST" }, { "publisher" : "Addison-Wesley", "pub-type" : "book", "uri" : "urn:37b4abb54419ed1cb73de1af0d5807a9", "date" : "1989", "author" : [ "Graham, Ronald L.", "Knuth, Donald E.", "Patashnik, Oren" ], "type" : "Publication", "year" : "1989", "label" : "Concrete Mathematics", "address" : "Reading, Massachusetts", "key" : "ConcreteMathematics" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:e5eb98567e48debb0285f598808fe3d7", "pages" : "87--97", "date" : "1986-02", "number" : "1", "author" : [ "Cook, Stephen", "Dwork, Cynthia", "Reischuk, Rudiger" ], "volume" : "15", "month" : "February", "type" : "Publication", "year" : "1986", "label" : "Upper and Lower Bounds for Parallel Random Access Machines Without Simultaneous Writes", "key" : "Cook:EREW" }, { "pub-type" : "misc", "uri" : "urn:558e0cc5df1ee8b903bf22ce6acbe603", "date" : "1994-03", "author" : "Coppersmith, Dan", "month" : "March", "note" : "Personal Communication.", "year" : "1994", "type" : "Publication", "howpublished" : "IBM T. J. Watson Laboratories", "label" : "558e0cc5df1ee8b903bf22ce6acbe603", "key" : "copper" }, { "journal" : "Journal of Symbolic Computation", "pub-type" : "article", "uri" : "urn:dee1f770dfb58f34cb19223a87a73f80", "pages" : "251-280", "date" : "1990", "author" : [ "Coppersmith, Dan", "Winograd, Shmuel" ], "volume" : "9", "type" : "Publication", "year" : "1990", "label" : "Matrix Multiplication via Arithmetic Progressions", "key" : "Coppersmith:Matrix" }, { "publisher" : "{MIT} Press", "pub-type" : "book", "uri" : "urn:014143d9e672b40b23c831b7a61a0118", "date" : "1990", "author" : [ "Cormen, Thomas H.", "Leiserson, Charles E.", "Rivest, Ronald L." ], "type" : "Publication", "year" : "1990", "label" : "Introduction to Algorithms", "address" : "Cambridge, MA", "key" : "Cormen:Algorithms" }, { "journal" : "Operations Research", "pub-type" : "article", "uri" : "urn:3836b299b63fea7a1ed25b3b1f54e6a3", "pages" : "393--410", "date" : "1954", "author" : [ "Dantzig, George B.", "Fulkerson, Delbert R.", "Johnson, S. M." ], "volume" : "2", "type" : "Publication", "year" : "1954", "label" : "Solution of a Large-Scale Traveling Salesman Problem", "key" : "Dantzig:TSP" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:fd8142083d46af48c3107bb9ec03f8e4", "pages" : "864--894", "date" : "1994", "number" : "4", "author" : [ "Dahlhaus, E.", "Johnson, David S.", "Papadimitriou, Christos H.", "Seymour, Paul D.", "Yannakakis, Mihalis" ], "volume" : "23", "type" : "Publication", "year" : "1994", "note" : "A preliminary version appeared in Proceedings of the {$24^{th}$} {ACM} Symposium on Theory of Computing", "label" : "The Complexity of Multiterminal Cuts", "key" : "Dahlhaus:NPComplete" }, { "journal" : "Communications of the ACM", "pub-type" : "article", "uri" : "urn:9fdd9a37b72aa23d5c8a398da08f6873", "pages" : "632--633", "date" : "1969", "author" : "Dial, R. B.", "volume" : "12", "type" : "Publication", "year" : "1969", "label" : "Algorithm 360: Shortest Path Forest with Topological Ordering", "key" : "Dial" }, { "journal" : "Algorithmica", "pub-type" : "article", "uri" : "urn:afe9a5d17f517c97c527787d91c382cf", "date" : "1995", "number" : "2", "author" : [ "Dietz", "Mehlhorn, Kurt", "Raman", "Uhrig" ], "volume" : "14", "type" : "Publication", "year" : "1995", "note" : "gives a bound of $q+n\\sqrt{q}$ for performing n set updates and q intersection queries. Does not rule out runtime proportional to output set size, since their bound applies to large sets.", "label" : "Lower Bounds for Set Intersection Queries", "key" : "DietzEtAl95" }, { "journal" : "Journal of Computer and System Sciences", "pub-type" : "article", "uri" : "urn:16ad727bb0ff10092da22d512011dd8d", "pages" : "231--254", "date" : "1994-04", "number" : "2", "author" : [ "Dietzfelbinger, M.", "Kutylowski, M.", "Reischuk, Rudiger" ], "volume" : "48", "month" : "April", "type" : "Publication", "year" : "1994", "note" : "A preliminary version appeared in Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "label" : "Exact Lower Time Bounds for Computing Boolean Functions on {CREW} {PRAM}s", "key" : "Dietzfelbinger:EW" }, { "journal" : "Numerische Mathematik", "pub-type" : "article", "uri" : "urn:5ab2405b25dfec57cf80d3a541bd4130", "pages" : "260--271", "date" : "1959", "author" : "Dijkstra, E. W.", "volume" : "1", "type" : "Publication", "year" : "1959", "label" : "A Note on Two Problems in Connection with Graphs", "key" : "Dijkstra" }, { "publisher" : "Nauka Publishers", "booktitle" : "Studies in Discrete Optimization", "pub-type" : "incollection", "uri" : "urn:0a003fa1d20f61d2606572d81ce834ca", "pages" : "290-306", "date" : "1976", "author" : [ "Dinitz, Efim A.", "Karzanov, Alexander V.", "Lomonosov, Micael V." ], "editor" : "A. A. Fridman", "type" : "Publication", "year" : "1976", "label" : "On the Structure of a Family of Minimum Weighted Cuts in a Graph", "address" : "Moscow", "key" : "Dinitz:Cactus" }, { "publisher" : " Nauka Publishers", "booktitle" : "Studies in Discrete Mathematics", "pub-type" : "incollection", "uri" : "urn:80dbc7932ff564dbad43e6f295965ad0", "pages" : "46--57", "date" : "1973", "city" : " Moscow", "author" : "Dinic, E.A.", "editor" : "A. A. Fridman", "notes" : "in Russian", "type" : "Publication", "year" : "1973", "label" : "The bitwise residual decreasing method and transportation type problems", "key" : "Dinic:Scaling" }, { "journal" : "Soviet Math. Dokl.", "pub-type" : "article", "uri" : "urn:a4cf75e6ae14244548118c42717d3e2e", "pages" : "1277-1280", "date" : "1970", "author" : "Dinitz, E. A.", "volume" : "11", "type" : "Publication", "year" : "1970", "label" : "{Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation}", "key" : "Dinitz:BlockingFlow" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:aed19fb9a4a4e4d2add6abcb57b88f6e", "pages" : "1184-1192", "date" : "1992", "number" : "6", "author" : [ "Dixon, Brandon", "Rauch, Monika", "Tarjan, Robert E." ], "volume" : "21", "type" : "Publication", "year" : "1992", "label" : "Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time", "key" : "Dixon:MST" }, { "journal" : "Journal of the American Society for Information Science", "pub-type" : "article", "uri" : "urn:1dc4fef6c044b28b46378de46ed4c715", "pages" : "391--407", "date" : "1990", "number" : "6", "author" : [ "Deerwester, Scott", "Dumais, Susan", "Furnas, George", "Landauer, Thomas K.", "Harshman, Richard" ], "volume" : "41", "type" : "Publication", "year" : "1990", "label" : "Indexing by Latent Semantic Analysis", "key" : "Dumais:LSI" }, { "url" : "citeseer.ist.psu.edu/alon95colorcoding.html", "journal" : "Electronic Colloquium on Computational Complexity (ECCC)", "pub-type" : "article", "uri" : "urn:a9ce9c87880bb5bde66e1e1468d00b3e", "date" : "1994", "number" : "009", "author" : [ "Alon, Noga", "Yuster, Raphy", "Zwick, Uri" ], "volume" : "1", "type" : "Publication", "year" : "1994", "note" : "Full paper appears in J.ACM 42:4, July 1995, 844-856", "label" : "Color-Coding", "key" : "Alon:ColorCoding" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:f880c5c4e8fb6ead3fe39f0488cb65ed", "pages" : "1--17", "date" : "1991", "author" : [ "Dyer, M. E.", "Frieze, Alan M.", "Kannan, Ravi" ], "volume" : "38", "type" : "Publication", "year" : "1991", "label" : "A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies", "key" : "Dyer:Volume" }, { "journal" : "{IRE} Transactions on Information Theory {IT-2}", "pub-type" : "article", "uri" : "urn:f3e46e0c7976e2d73d881751362b0102", "pages" : "117-199", "date" : "1956", "author" : [ "Elias, P.", "Feinstein, A.", "Shannon, C. E." ], "year" : "1956", "type" : "Publication", "label" : "Note on Maximum Flow Through a Network", "key" : "Elias:Maxflow" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:8a9c78dc18f3eab1fb7908761f04543f", "pages" : "248--264", "date" : "1972", "author" : [ "Edmonds, Jack", "Karp, Richard M." ], "volume" : "19", "type" : "Publication", "year" : "1972", "label" : "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems", "key" : "Edmonds:Flow" }, { "journal" : "Mathematical Programming", "pub-type" : "article", "uri" : "urn:6d67d57c62c0ca65575e4c25fac3e4c2", "pages" : "126--136", "date" : "1971", "author" : "Edmonds, Jack", "volume" : "1", "type" : "Publication", "year" : "1971", "label" : "Matroids and the Greedy Algorithm", "key" : "Edmonds:Matroid" }, { "journal" : "Journal of Research of the National Bureau of Standards", "pub-type" : "article", "uri" : "urn:25de4bb27277987ea81eceac9f6b3d48", "pages" : "67--72", "date" : "1965", "author" : "Edmonds, Jack", "series" : "B", "volume" : "69", "type" : "Publication", "year" : "1965", "label" : "Minimum Partition of a Matroid into Independents Subsets", "key" : "Edmonds:Packing" }, { "publisher" : "Algorithmics Press", "booktitle" : "Combinatorial Algorithms", "pub-type" : "incollection", "uri" : "urn:61c7e1dff59a4374508da4d3f90935d3", "pages" : "91--96", "date" : "1972", "author" : "Edmonds, Jack", "editor" : "R. Rustin", "type" : "Publication", "year" : "1972", "label" : "Edge-disjoint Branchings", "address" : "New York", "key" : "Edmonds:Branchings" }, { "journal" : "Theoretical Computer Science", "pub-type" : "article", "uri" : "urn:b6274c293559f5431afea198c1065219", "pages" : "337--343", "date" : "1986", "author" : "Edwards, Keith", "volume" : "43", "type" : "Publication", "year" : "1986", "label" : "The Complexity of Colouring Problems on Dense Graphs", "key" : "Edwards:Coloring" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$33^{rd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "5ed72fd951313adbaa6f4fea39148a0b", "uri" : "urn:10b650b9ec1fc08b737a901bfb74ca05", "pages" : "60-69", "date" : "1992-10", "place" : "Pittsburgh, PA", "author" : [ "Eppstein, David", "Galil, Zvi", "Italiano, Giuseppe F.", "Nissenzweig, Amnon" ], "month" : "October", "type" : "Publication", "year" : "1992", "label" : "Sparsification---A Technique for Speeding up Dynamic Graph Algorithms", "key" : "Eppstein:Sparsification" }, { "journal" : "Publ. Math. Debrecen", "pub-type" : "article", "uri" : "urn:8450697100bedb66f3dc966e4f154e2e", "pages" : "290-297", "date" : "1959", "author" : [ "Erd?s, P?l", "R?nyi, A." ], "volume" : "6", "type" : "Publication", "year" : "1959", "label" : "On Random Graphs {I}", "key" : "Erdos:RandomGraphs" }, { "journal" : "Acta Mathematica Acad. Sci. Hungar.", "pub-type" : "article", "uri" : "urn:82082872af7786faa633d7bba8964b5a", "optnote" : "", "pages" : "261--267", "date" : "1961", "author" : [ "Erd?s, P?l", "R?nyi, A." ], "volume" : "12", "optannote" : "", "type" : "Publication", "year" : "1961", "label" : "On the Strength of Connectedness of a Random Graph ", "key" : "Erdos:Connectivity" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:d63a73142af4ce06a7f46bf0e91aa0a1", "pages" : "653--665", "date" : "1976", "author" : [ "Eswaran, K. P.", "Tarjan, Robert E." ], "volume" : "5", "type" : "Publication", "year" : "1976", "label" : "Augmentation Problems", "key" : "Eswaran:Augmentation" }, { "publisher" : "Computer Science Press", "pub-type" : "book", "uri" : "urn:da935a913f90e3860ee67a77a19c36c9", "date" : "1979", "author" : "Even, Shimon", "type" : "Publication", "year" : "1979", "label" : "Graph Algorithms", "address" : "Potomac, MD", "key" : "Even:GraphAlgorithms" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:399e4d5ed11b1271750c1077f0f02e13", "pages" : "507-518", "date" : "1975", "author" : [ "Even, Shimon", "Tarjan, Robert E." ], "volume" : "4", "type" : "Publication", "year" : "1975", "label" : "{Network Flow and Testing Graph Connectivity}", "key" : "Even:Flow" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$23^{rd}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$23^{rd}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:bc0f98b5a5882f2eee4d7af815b16439", "pages" : "123--133", "date" : "1991-05", "author" : [ "Feder, Tomas", "Motwani, Rajeev" ], "month" : "May", "type" : "Publication", "year" : "1991", "note" : "Journal version in {\\em Journal of Computer and System Sciences}.", "label" : "Clique Partitions, Graph Compression and Speeding-up Algorithms", "key" : "Feder:Compression" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$24^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$24^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:d1d9200f686465e10505cf0b131d4c87", "pages" : "26--38", "date" : "1992-05", "place" : "Victora, BC, Canada", "author" : [ "Feder, Tomas", "Mihail, Milena" ], "month" : "May", "type" : "Publication", "year" : "1992", "label" : "Balanced Matroids", "key" : "Feder:Matroid" }, { "publisher" : "John Wiley \\& Sons", "pub-type" : "book", "uri" : "urn:c50b377de13c167286d4d4a905079dae", "date" : "1968", "author" : "Feller, William", "volume" : "1", "edition" : "third", "type" : "Publication", "year" : "1968", "label" : "An Introduction to Probability Theory and its Applications", "address" : "New York", "key" : "Feller" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:1e7667df159066f5ea387f519e1eaa3d", "pages" : "2--12", "date" : "1991-10", "place" : "San Juan, Puerto Rico", "author" : [ "Feige, U.", "Goldwasser, Shafi", "Lov?sz, L?szl?", "Safra, S.", "Szegedy, Mario" ], "month" : "October", "type" : "Publication", "year" : "1991", "label" : "Approximating clique is almost {NP}-complete", "key" : "FGLSS" }, { "booktitle" : "Proceedings of theIsraeli Symposium on Theoretical Computer Science", "pub-type" : "inproceedings", "uri" : "urn:8ae91e031c1130122549bac842bea2fa", "pages" : "182--189", "date" : "1995", "author" : [ "Feige, U.", "Goemans, Michel X." ], "type" : "Publication", "year" : "1995", "label" : " Approximating the value of 2-Prover proof systems, with applications to MAX-2SAT and MAX-DICUT", "key" : "Feige:2SAT" }, { "journal" : "Communications of the ACM", "pub-type" : "article", "uri" : "urn:c07034209f184519298762586d3cde7b", "pages" : "345", "date" : "1962", "author" : "Floyd, Robert W.", "volume" : "5", "type" : "Publication", "year" : "1962", "label" : "Algorithm 97: Shortest path", "key" : "Floyd" }, { "journal" : "Communications of the ACM", "pub-type" : "article", "uri" : "urn:53b0880396b299f7f21dfc897271ef76", "pages" : "165-172", "date" : "1975", "number" : "3", "author" : [ "Floyd, Robert W.", "Rivest, Ronald L." ], "volume" : "18", "type" : "Publication", "year" : "1975", "label" : "Expected Time Bounds for Selection", "key" : "Floyd:Median" }, { "journal" : "IBM Journal of Research and Development", "pub-type" : "article", "uri" : "urn:d39c50168896cb27e627a4d4f28a3a0f", "pages" : "743--765", "date" : "1991", "author" : [ "Hummel, S. Flynn", "Schonberg, E." ], "volume" : "35(5/6)", "type" : "Publication", "year" : "1991", "label" : "Low-Overhead Scheduling of Nested Parallelism", "key" : "FlynnHS91" }, { "journal" : "Communications of the ACM", "pub-type" : "article", "uri" : "urn:67c2957db9f480d42f6ca224f1a496e8", "pages" : "90--101", "date" : "1992", "number" : "8", "author" : [ "Hummel, S. Flynn", "Schonberg, E.", "Flynn, L. E." ], "volume" : "35", "type" : "Publication", "year" : "1992", "label" : "Factoring: A Practical and Robust Method for Scheduling Parallel Loops", "key" : "FlynnHS92" }, { "journal" : "Canadian Journal of Mathematics", "pub-type" : "article", "uri" : "urn:9498a6c312afbc363154009d4a05c6a6", "pages" : "399-404", "date" : "1956", "author" : [ "Ford, Jr., Lester R.", "Fulkerson, Delbert R." ], "volume" : "8", "type" : "Publication", "year" : "1956", "label" : "Maximal Flow Through a Network", "key" : "Ford:Maxflow" }, { "publisher" : "Princeton University Press", "pub-type" : "book", "uri" : "urn:7613bd31eacb545c0a42a7102a59bfa8", "date" : "1962", "author" : [ "Ford, Jr., Lester R.", "Fulkerson, Delbert R." ], "type" : "Publication", "year" : "1962", "label" : "Flows in Networks", "address" : "Princeton, New Jersey", "key" : "Ford:FlowBook" }, { "journal" : "SIAM Journal on Discrete Mathematics", "pub-type" : "article", "uri" : "urn:6373419de93589d9a79781482bfc14f7", "pages" : "25--53", "date" : "1992", "number" : "1", "author" : "Frank, Andras", "volume" : "5", "type" : "Publication", "year" : "1992", "note" : "A preliminary version appeared in Proceedings of the {$31^{st}$} Annual Symposium on the Foundations of Computer Science", "label" : "Augmenting graphs to meet edge connectivity requirements", "key" : "Frank:Augmentation" }, { "journal" : "Transactions of the American Mathematical Society", "pub-type" : "article", "uri" : "urn:6288ca87a7624fafc789f90a1b5bb95d", "pages" : "259--286", "date" : "1994", "author" : [ "Frankl, P.", "Rodl, V." ], "volume" : "300", "type" : "Publication", "year" : "1994", "label" : "Forbidden Intersections", "key" : "FranklRodl" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:39cdbfe1e7dede276f9863764c437ec3", "pages" : "596--615", "date" : "1987", "number" : "3", "author" : [ "Fredman, Michael L.", "Tarjan, Robert E." ], "volume" : "34", "type" : "Publication", "year" : "1987", "label" : "Fibonacci Heaps and their Uses in Improved Network Optimization Algorithms", "key" : "Fredman:Fibonacci" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$31^{st}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$31^{st}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:296cf4f1f1e02e19b62431ecb66039ef", "pages" : "719--725", "date" : "1990-10", "author" : [ "Fredman, Michael", "Willard, D. E." ], "month" : "October", "type" : "Publication", "year" : "1990", "label" : "Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths", "key" : "Fredman:MST" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:6d719011d3487b3ebb4a534b7b44f434", "pages" : "83--89", "date" : "1976", "author" : "Fredman, Michael L.", "volume" : "5", "type" : "Publication", "year" : "1976", "label" : "New Bounds on the Complexity of the Shortest Path Problem", "key" : "Fredman:Paths" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:675ebd1a19eb0ed4954a17b8d6caca2e", "pages" : "781--798", "date" : "1984", "author" : "Frederickson, G. N.", "volume" : "14", "type" : "Publication", "year" : "1984", "label" : "Data Structures for On-line Updating of Minimum Spanning Trees", "key" : "Frederickson:MST" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:57d36e68809e56af06c679c77e1f02c3", "pages" : "1004-1022", "date" : "1987-12", "number" : "6", "author" : "Frederickson, Greg N.", "volume" : "16", "month" : "December", "type" : "Publication", "year" : "1987", "label" : "Fast Algorithms for Shortest Paths in Planar Graphs, with Applications", "key" : "Frederickson:ShortestPaths" }, { "publisher" : "Prentice Hall", "pub-type" : "book", "uri" : "urn:18b2c411170208e779d62d333c258d34", "date" : "1992", "editor" : "William B. Frakes and Ricardo Baeza-Yates", "type" : "Publication", "year" : "1992", "label" : "Information Retrieval: Data Structures and Algorithms", "address" : "Englewood Cliffs, New Jersey", "key" : "Frakes:IR" }, { "pub-type" : "unpublished", "uri" : "urn:6771a6dc667bc0d413971c0ebde42f2f", "date" : "1994-03", "author" : "Frank, Andras", "month" : "March", "note" : "Labarotoire Artemis, IMAG, Universit\\\'e J. Fourier, Grenoble", "type" : "Publication", "year" : "1994", "label" : "On the Edge-Connectivity Algorithm of {Nagamochi} and {Ibaraki}", "key" : "Frank:Mincut" }, { "publisher" : "Cambridge", "booktitle" : "Surveys in Combinatorics", "pub-type" : "incollection", "uri" : "urn:53127195a8e547e233a0b86c4424b34d", "pages" : "85--36", "date" : "1993", "number" : "187", "author" : "Frank, Andras", "series" : "London Math. Society Lecture Notes", "editor" : "K. Walker", "type" : "Publication", "year" : "1993", "label" : "Applications of submodular functions", "key" : "Frank:Submodularity" }, { "publisher" : "Springer-Verlag", "chapter" : "4", "booktitle" : "Paths, Flows, and VLSI Layout", "pub-type" : "incollection", "uri" : "urn:ca3506b2470c5119b784ad703842c39e", "date" : "1990", "author" : "Frank, Andr\\\'as", "series" : "Algorithms and Combinatorics", "volume" : "9", "editor" : "Bernhard Korte and L?szl? Lov?sz and Hans J\\\"urgen Pr\\\"omel and Alexander Schrijver", "type" : "Publication", "year" : "1990", "label" : "Packing Paths, Circuits, and Cuts---A Survey", "address" : "Heidelberg", "key" : "Frank:PathSurvey" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:b6646e4184eb350dfc97e403b8fbc133", "pages" : "162--204", "date" : "1991", "number" : "1", "author" : "Frederickson, Gary N.", "volume" : "38", "type" : "Publication", "year" : "1991", "label" : "Planar Graph Decomposition and All Pairs Shortest Paths", "key" : "Frederickson" }, { "publisher" : "Pergamon Press", "journal" : "Operations Research Quarterly", "pub-type" : "article", "uri" : "urn:89a64cf1901694ec24c0f285162ea3b2", "date" : "1977", "author" : "Frieze, Alan M.", "volume" : "28", "type" : "Publication", "year" : "1977", "label" : "Minimum Paths in Directed Graphs", "key" : "Frieze:Paths" }, { "journal" : "Random Structures and Algorithms", "pub-type" : "article", "uri" : "urn:11df44be2a376db90bf38b092e431068", "pages" : "157--165", "date" : "1995", "author" : "Jerrum, Mark R.", "volume" : "7", "type" : "Publication", "year" : "1995", "label" : "A very simple algorithm for estimating the number of $k$-colourings of a low-degree graph", "key" : "Jerrum:EasyColoring" }, { "pub-type" : "unpublished", "uri" : "urn:1a67253e554924b86d55c98c8d4bc64a", "date" : "1994-06", "author" : [ "Frieze, Allan", "Jerrum, Mark" ], "month" : "June", "note" : "Manuscript.", "type" : "Publication", "year" : "1994", "label" : "Improved Approximation Algorithms for {MAX} {$k$-CUT} and {MAX} {BISECTION}", "key" : "FriJer" }, { "journal" : "Discrete Applied Mathematics", "pub-type" : "article", "uri" : "urn:f7f18e6ab0c39bc0e1c4cce4b49ec014", "pages" : "57--77", "date" : "1985", "author" : [ "Frieze, Alan M.", "Grimmet, G. R." ], "volume" : "10", "type" : "Publication", "year" : "1985", "label" : "The Shortest-path Problem for Graphs with Random Arc-lengths", "key" : "FriezeGrimmet:Paths" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$37^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "c439f573bd84581fc9bf33f6e82e6008", "uri" : "urn:f1a425a18475ca9e3a8278c1d756db55", "pages" : "12--20", "date" : "1996-10", "place" : "Burlington, VT", "author" : [ "Frieze, Alan M.", "Kannan, Ravi" ], "month" : "October", "type" : "Publication", "year" : "1996", "label" : "The Regularity Lemma and Approximation Schemes for Dense Problems", "references" : "\\cite{JALGO::AlonDLRY1994} \\cite{STOC::AroraKK1995} \\cite{FOCS::AroraLMSS1992} \\cite{STOC::Broder1986} \\cite{SODA::DyerFJ1994} \\cite{TCS::GareyJS1976} \\cite{SICOMP::JerrumS1989} \\cite{JCSS::PapadimitriouY1991}", "key" : "Frieze:Regularity" }, { "pub-type" : "unpublished", "uri" : "urn:1e58b0bd908edc1f505f303c6fc6bf3f", "date" : "1994", "author" : "F?rer, Martin", "note" : "Private Communication\\typeout{find Furer Paper}", "type" : "Publication", "year" : "1994", "howpublished" : "Pennsylvania State University", "label" : "Improved Hardness Results for Approximating the Chromatic Number", "key" : "Furer:Coloring" }, { "publisher" : "W. H. Freeman and Company", "pub-type" : "book", "uri" : "urn:743f2926ee3c298a6c93ae6d5b97eeb9", "date" : "1979", "author" : [ "Garey, Michael R.", "Johnson, David S." ], "type" : "Publication", "year" : "1979", "label" : "Computers and Intractability: A Guide to the Theory of {NP}-Completeness", "address" : "San Francisco", "key" : "Garey:NP" }, { "journal" : "Journal of Computer and System Sciences", "pub-type" : "article", "uri" : "urn:14c97624bc6fb01344a9ce0b4d126900", "pages" : "407--420", "date" : "1981", "author" : [ "Gabber, O.", "Galil, Zvi" ], "volume" : "22", "type" : "Publication", "year" : "1981", "label" : "Explicit Construction of Linear-Sized Superconcentrators", "key" : "Gabber" }, { "journal" : "Journal of Computer and System Sciences", "pub-type" : "article", "uri" : "urn:f958712c40e4163f66c8b689c4b6ab2c", "pages" : "259--273", "date" : "1995-04", "number" : "2", "author" : "Gabow, Harold N.", "volume" : "50", "month" : "April", "type" : "Publication", "year" : "1995", "note" : "A preliminary version appeared in Proceedings of the {$23^{rd}$} {ACM} Symposium on Theory of Computing", "label" : "A Matroid Approach to Finding Edge Connectivity and Packing Arborescences", "key" : "Gabow:Connectivity" }, { "journal" : "Journal of Computer and System Sciences", "pub-type" : "article", "uri" : "urn:a771d1dbb090d9a524c5e69c1ed6b73f", "pages" : "209--221", "date" : "1985", "author" : [ "Gabow, Harold N.", "Tarjan, Robert E." ], "volume" : "30", "type" : "Publication", "year" : "1985", "label" : "A Linear Time Algorithm for a Special Case of Disjoint Set Union", "key" : "Gabow:LCA" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$25^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$25^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:8d9ef45dc39ae76e716c0bbbcbba2343", "pages" : "347--357", "date" : "1984", "author" : [ "Gabow, Harold N.", "Galil, Zvi", "Spencer, T. H." ], "type" : "Publication", "year" : "1984", "label" : "Efficient Implementation of Graph Algorithms Using Contraction", "key" : "Gabow:MST0" }, { "journal" : "Combinatorica", "pub-type" : "article", "uri" : "urn:9a3ac71deea38fd477b07487c77f06f4", "pages" : "109-122", "date" : "1986", "author" : [ "Gabow, Harold N.", "Galil, Zvi", "Spencer, T. H.", "Tarjan, Robert E." ], "volume" : "6", "type" : "Publication", "year" : "1986", "label" : "Efficient Algorithms for Finding Minimum Spanning Tree in Undirected and Directed Graphs", "key" : "Gabow:MST" }, { "publisher" : "Springer-Verlag New York Inc.", "journal" : "Algorithmica", "pub-type" : "article", "uri" : "urn:034cd094ca73c5f3d230d437352aef66", "pages" : "465--497", "date" : "1992", "number" : "5", "author" : [ "Gabow, Harold N.", "Westermann, Herbert H." ], "volume" : "7", "type" : "Publication", "year" : "1992", "label" : "Forests, Frames, and Games: Algorithms for Matroid Sums and Applications", "key" : "Gabow:Packing" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:58b3736b45a216e4e016e3bf4aec2124", "pages" : "812-821", "date" : "1991-10", "place" : "San Juan, Puerto Rico", "author" : "Gabow, Harold N.", "month" : "October", "type" : "Publication", "year" : "1991", "label" : "Applications of a Poset Representation to Edge Connectivity and Graph Rigidity", "key" : "Gabow:Poset" }, { "id" : "5afa16aef5cee269423006021e753a12", "pub-type" : "techreport", "institution" : "University of Colorado Department of Computer Science", "uri" : "urn:5afa16aef5cee269423006021e753a12", "date" : "1991", "number" : "CU--CS--545--91", "author" : "Gabow, Harold N.", "year" : "1991", "type" : "Publication", "label" : "Applications of a Poset Representation to Edge Connectivity and Graph Rigidity", "key" : "Gabow:Poset-tech" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:d6c9fdf18e99e0616856777664aa95d9", "pages" : "696--705", "date" : "1994-05", "place" : "Montreal, Quebec, Canada", "author" : "Gabow, Harold N.", "month" : "May", "type" : "Publication", "year" : "1994", "label" : "Efficient Splitting Off Algorithms for Graphs", "key" : "Gabow:Splitting" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:afa8dd00df31cc24d2d9ee6a774039a6", "pages" : "1013--1036", "date" : "1989", "number" : "5", "author" : [ "Gabow, Harold N.", "Tarjan, Robert E." ], "volume" : "18", "type" : "Publication", "year" : "1989", "label" : "Faster Scaling Algorithms for Network Problems", "key" : "Gabow:Scaling" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$34^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$34^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:04ce1705f5c9dd21a6a8f4677985fb0b", "pages" : "449-458", "date" : "1993-11", "place" : "Palo Alto, CA", "author" : "Gabow, Harold N.", "editor" : "Leonidas Guibas", "month" : "November", "type" : "Publication", "year" : "1993", "label" : "A Framework for Cost-scaling Algorithms for Submodular Flow Problems", "key" : "Gabow:SubmodularScaling" }, { "booktitle" : "Proceedings of the Third {MPS} Conference on Integer Programming and Combinatorial Optimization", "pub-type" : "inproceedings", "uri" : "urn:c64d495b7088b9c0cd2ea3e826389ffe", "pages" : "57-74", "date" : "1993", "author" : [ "Gabow, Harold N.", "Goemans, Michel X.", "Williamson, David P." ], "type" : "Publication", "year" : "1993", "label" : "An Efficient Approximation Algorithm for the Survivable Network Design Problem", "key" : "Gabow:SurvivableNetwork" }, { "journal" : "Combinatorica", "pub-type" : "article", "uri" : "urn:0e1e276c75578b41bf869647d134ffb8", "pages" : "189-200", "date" : "1988", "author" : [ "Galil, Zvi", "Pan, Victor" ], "volume" : "8", "type" : "Publication", "year" : "1988", "label" : "Improved Processor Bounds for Combinatorial Problems in {$\\RNC$}", "key" : "GalilPan" }, { "publisher" : "{IEEE} Computer Society Press", "booktitle" : "Proceedings of the {$27^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "uri" : "urn:321674dc43a54c56c30f820abdb49665", "date" : "1986", "author" : "Gazit, H.", "type" : "Publication", "year" : "1986", "label" : "An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph\\typeout{GAZIT PAGES}", "key" : "Gazit:Proc-Connectivity" }, { "id" : "54b5d90310f6e0dca00a4e533e594f4d", "pub-type" : "misc", "uri" : "urn:54b5d90310f6e0dca00a4e533e594f4d", "date" : "1997-10", "author" : "Goldberg, Andrew", "month" : "October", "year" : "1997", "type" : "Publication", "label" : "Personal Communication", "key" : "Goldberg:comm" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$30^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$30^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:8c15aebe2b0f02c0c3eaa419001a486f", "pages" : "2--11", "date" : "1997-10", "place" : "Miami, FL", "author" : [ "Goldberg, Andrew", "Rao, Satish" ], "month" : "October", "type" : "Publication", "year" : "1997", "label" : "Beyond the Flow Decomposition Barrier", "key" : "Goldberg:CapacitatedBlocking" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$30^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$30^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:eaf761bf16463cd4bc1aa257b61592a8", "pages" : "32--35", "date" : "1997-10", "place" : "Miami, FL", "author" : [ "Goldberg, Andrew", "Rao, Satish" ], "month" : "October", "type" : "Publication", "year" : "1997", "label" : "Flows in Undirected Unit Capacity Networks", "key" : "Goldberg:SparseBlocking" }, { "journal" : "Communications of the ACM", "pub-type" : "article", "uri" : "urn:7ce728f74808907d9ef4bc0dd2600c7b", "pages" : "61--70", "date" : "1992-12", "number" : "12", "author" : [ "Goldberg, David", "Oki, Brian", "Nichols, David", "Terry, Douglas B." ], "volume" : "35", "month" : "December", "type" : "Publication", "year" : "1992", "label" : "Using Collaborative Filtering to Weave an Information Tapestry", "key" : "Goldberg:Tapestry" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:37c4755f1cea7999e0fb31c9e28b69bc", "pages" : "1046--1067", "date" : "1991", "number" : "6", "author" : "Gazit, H.", "volume" : "20", "type" : "Publication", "year" : "1991", "note" : "A preliminary version appeared in Proceedings of the {$27^{th}$} Annual Symposium on the Foundations of Computer Science", "abstract" : "The expected running time of this algorithm is $O(\\log{n})$ with $O((m+n)/\\log{n})$ processors, where $n$ is the number of vertices and $m$ is the number of edges. It uses $O(m+n)$ space. The algorithm is optimal in the time-processor product sense, as well as in space complexity.", "label" : "An Optimal Randomized Parallel Algorithm for Finding the Connected Components of a Graph", "key" : "Gazit:Connectivity" }, { "booktitle" : "27th VLDB Conference", "pub-type" : "inproceedings", "uri" : "urn:3aa9f7a08875daab63199b6d2edd6dd3", "date" : "2001", "author" : "Gibbons, Phillip", "type" : "Publication", "year" : "2001", "label" : "Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports", "key" : "Gibbons:Distinct" }, { "pub-type" : "techreport", "institution" : "AT\\&T Bell Laboratories", "uri" : "urn:ae613d67628d0d897bc8b4b3157653a7", "date" : "1993", "number" : "BL011211-930331-05TM", "author" : [ "Gibbons, Phillip B.", "Ramachandran, Vijaya" ], "type" : "Publication", "year" : "1993", "label" : "{QRQW}: Accounting for concurrency in {PRAM}s and asynchronous {PRAM}s", "key" : "Gibbons:QRQW" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$34^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$34^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:47a67379204fb99beb26ccd64c3b9a2d", "pages" : "680--691", "date" : "1993-11", "place" : "Palo Alto, CA", "author" : "Gillman, D.", "editor" : "Leonidas Guibas", "month" : "November", "type" : "Publication", "year" : "1993", "label" : "A {Chernoff} Bound for Random Walks on Expanders", "key" : "Gillman:Expander" }, { "pub-type" : "misc", "uri" : "urn:2f88e70ac4e9555ccfc23d4ee1764ae5", "date" : "1994", "author" : [ "Goemans, Michel X.", "Tardos, ?va", "Williamson, David P." ], "type" : "Publication", "year" : "1994", "note" : "Personal Communication.", "label" : "2f88e70ac4e9555ccfc23d4ee1764ae5", "key" : "Goemans:Private" }, { "publisher" : "PWS Publishing Co.", "booktitle" : "Approximation Algorithms for NP-hard Problems", "pub-type" : "incollection", "uri" : "urn:6be69c14b70f9ffb88982d6c971202bf", "date" : "1997", "author" : [ "Goemans, Michel X.", "Williamson, David P." ], "editor" : "Dorit S. Hochbaum", "type" : "Publication", "year" : "1997", "label" : "The primal-dual method for approximation algorithms and its application to network design problems", "address" : "Boston, MA", "key" : "Goemans:PrimalDual" }, { "journal" : "Mathematical Programming", "pub-type" : "article", "uri" : "urn:2cd03bc687d0885b7836543bd7a31370", "pages" : "145--166", "date" : "1993", "author" : [ "Goemans, Michel X.", "Bertsimas, Dimitris J." ], "volume" : "60", "type" : "Publication", "year" : "1993", "label" : "Survivable Networks, Linear Programming Relaxations and the Parsimonious Property", "key" : "Goemans:Parsimonious" }, { "journal" : "Journal of Algorithms", "pub-type" : "article", "uri" : "urn:dc5252ee8c3711e66370624de58de215", "pages" : "375-390", "date" : "1984", "author" : [ "Gilbert, John R.", "Hutchinson, Joan P.", "Tarjan, Robert E." ], "volume" : "5", "type" : "Publication", "year" : "1984", "label" : "A separator theorem for graphs of bounded genus", "key" : "Gilbert:Separator" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:d4d93a684b0374538cbfe23d84f248ef", "pages" : "1115--1145", "date" : "1995-05", "number" : "6", "author" : [ "Goemans, Michel X.", "Williamson, David P." ], "volume" : "42", "month" : "May", "type" : "Publication", "year" : "1995", "note" : "A preliminary version appeared in Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing pages 422--431. ACM, ACM Press, May 1994", "label" : "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming", "key" : "GW:maxcut" }, { "issn" : "0097-5397 (print), 1095-7111 (electronic)", "number" : "3", "type" : "Publication", "author" : "Goldberg, Andrew V.", "url" : "http://epubs.siam.org/sam-bin/dbq/article/23117", "uri" : "urn:2cdc0db2762447dc8f7ff2758cb58ff9", "label" : "Scaling Algorithms for the Shortest Paths Problem", "pages" : "494--504", "year" : "1995", "journal" : "SIAM Journal on Computing", "mrnumber" : "96c:68151", "acknowledgement" : "ack-nhfb", "volume" : "24", "pub-type" : "article", "date" : "1995-06", "bibdate" : "Sat Dec 5 17:26:53 MST 1998", "month" : "June", "coden" : "SMJCAT", "mrclass" : "68R10 (05C85 68Q20)", "key" : "Goldberg:Paths" }, { "pub-type" : "techreport", "institution" : "Department of Computer Science, Stanford University", "uri" : "urn:6942d72115dc7f876d2721d1fee7f604", "date" : "1994", "number" : "STAN-CS-94-1509", "author" : [ "Goldberg, A. V.", "Kennedy, Robert" ], "year" : "1994", "note" : "To appear in SIAM J.\\ on Discrete Math.", "type" : "Publication", "label" : "{Global Price Updates Help}", "key" : "Goldberg:GlobalUpdates" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:ed18a7e6e45d2d21bb55e792caa0619c", "pages" : "921-940", "date" : "1988", "author" : [ "Goldberg, Andrew V.", "Tarjan, Robert E." ], "volume" : "35", "type" : "Publication", "year" : "1988", "label" : "A New Approach to the Maximum Flow Problem", "key" : "Goldberg:Maxflow" }, { "organization" : "IEEE", "booktitle" : "37th Annual Symposium on Foundations of Computer Science", "pub-type" : "inproceedings", "uri" : "urn:582e43c032bc3c543ab2c56292bbd35d", "pages" : "339--348", "date" : "1996", "author" : [ "Goldreich, Oded", "Goldwasser, Shafi", "Ron, Dana" ], "month" : "14--16 October", "type" : "Publication", "year" : "1996", "label" : "Property Testing and its Connection to Learning and Approximation", "address" : "Burlington, Vermont", "references" : "\\cite{JALGO::AlonDLRY1994} \\cite{FOCS::AroraFK1996} \\cite{STOC::AroraKK1995} \\cite{FOCS::AroraLMSS1992} \\cite{FOCS::AroraS1992} \\cite{STOC::BabaiFLS1991} \\cite{FOCS::BellareCHKS1995} \\cite{FOCS::BellareGS1995} \\cite{STOC::BellareGLR1993} \\cite{STOC::BellareS1994} \\cite{STOC::Ben-David1992} \\cite{JCSS::BlumLR1993} \\cite{JACM::BlumerEHW1989} \\cite{TCS::Edwards1986} \\cite{FOCS::FeigeGLSS1991} \\cite{FOCS::FriezeK1996} \\cite{STOC::GemmellLRSW1991} \\cite{STOC::KearnsMRRSS1994} \\cite{JACM::PittV1988} \\cite{JACM::PittW1993} \\cite{TCS::RivestV1976} \\cite{FOCS::Rubinfeld1994} \\cite{SICOMP::RubinfeldS1996} \\cite{CACM::Valiant1984} \\cite{FOCS::Yao1987}", "key" : "Goldreich:Regularity" }, { "journal" : "Theoretical Computer Science", "pub-type" : "article", "uri" : "urn:f3c40bb2d0d2ec5a98717240d09861d8", "pages" : "105-111", "date" : "1982", "author" : [ "Goldschlager, L. M.", "Shaw, R. A.", "Staples, J." ], "volume" : "21", "type" : "Publication", "year" : "1982", "label" : "The Maximum Flow Problem is Logspace Complete for {P}", "key" : "Goldschlager:PComplete" }, { "publisher" : "{IEEE} Computer Society Press", "booktitle" : "Proceedings of the {$29^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "uri" : "urn:60fcadb61c9c815503aaaf0f82b8678e", "pages" : "444-451", "date" : "1988", "author" : [ "Goldschmidt, Oliver", "Hochbaum, Dorit" ], "year" : "1988", "type" : "Publication", "label" : "Polynomial Algorithm for the {$k$}-cut Problem", "key" : "Goldschmidt:Multicut" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "venue" : "SODA", "crossref" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "uri" : "urn:cf98ce3d7ec0d7e7741130a98b6106c4", "date" : "1993-01", "place" : "Austin, TX", "author" : [ "Schmidt, Jeanette", "Siegel, Alan", "Srinivasan, Aravind" ], "month" : "January", "type" : "Publication", "year" : "1993", "label" : "Chernoff-Hoeffding Bounds for Applications with Limited Independence", "key" : "Schmidt:Kway" }, { "publisher" : "Johns Hopkins University Press", "pub-type" : "book", "uri" : "urn:d70ec57819117da26239258d85e22cf4", "date" : "1983", "author" : [ "Golub, Gene H.", "Loan, C. F. Van" ], "type" : "Publication", "year" : "1983", "label" : "Matrix Computations", "address" : "Baltimore, MD", "key" : "Golub:Matrix" }, { "journal" : "Journal of the Society of Industrial and Applied Mathematics", "pub-type" : "article", "uri" : "urn:b99e5682602d0bd3b6c34ce13bf05739", "pages" : "551-570", "date" : "1961-12", "number" : "4", "author" : [ "Gomory, Ralph E.", "Hu, Tien Chung" ], "volume" : "9", "month" : "December", "type" : "Publication", "year" : "1961", "label" : "Multi-Terminal Network Flows", "key" : "Gomory:FlowTree" }, { "journal" : "Annals of the History of Computing", "pub-type" : "article", "uri" : "urn:f926807d133095ef0f119e70e45cbf98", "pages" : "43--57", "date" : "1985", "author" : [ "Graham, R. L.", "Hell, P." ], "volume" : "7", "type" : "Publication", "year" : "1985", "label" : "On the History of the Minimum Spanning Tree Problem", "key" : "Graham:MST" }, { "publisher" : "Springer-Verlag", "pub-type" : "book", "uri" : "urn:d7337a7342e88730fc3a9df5a88691ea", "date" : "1988", "author" : [ "Gr?tschel, Martin", "Lov?sz, L?szl?", "Schrijver, Alexander" ], "series" : "Algorithms and Combinatorics", "volume" : "2", "editors" : "R. L. Graham and B. Korte and L?szl? Lov{\\\'}asz", "type" : "Publication", "year" : "1988", "label" : "Geometric Algorithms and Combinatorial Optimization", "address" : "Berlin", "key" : "Grotschel:Optimization" }, { "journal" : "Combinatorica", "pub-type" : "article", "uri" : "urn:32e3cde9a2c6d6e79e2488055882b841", "pages" : "169--197", "date" : "1981", "author" : [ "Gr?tschel, Martin", "Lov?sz, L?szl?", "Schrijver, Alexander" ], "volume" : "1", "type" : "Publication", "year" : "1981", "label" : "The ellipsoid method and its consequences in combinatorial optimization", "key" : "GLS" }, { "journal" : "ipl", "pub-type" : "article", "uri" : "urn:8acba96aa7fb2d42cde9009b470469ec", "optnote" : "", "pages" : "87--89", "date" : "1983", "author" : "Gusfield, Dan", "volume" : "16", "type" : "Publication", "year" : "1983", "label" : "Connectivity and Edge Disjoint Spanning Trees", "key" : "Gusfield:TreePacking", "optmonth" : "" }, { "publisher" : "Springer-Verlag", "booktitle" : "Automata, Languages and Programming. {$22^{nd}$} International Colloquium Proceedings", "pub-type" : "inproceedings", "venue" : "ICALP", "crossref" : "47863bc2831cdc2f7eed3bb9af4130fe", "uri" : "urn:ab5bfa9e5ff6eecda839ea1f445b9fc7", "pages" : "280--291", "date" : "1995-07", "author" : "Henzinger, Monika Rauch", "series" : "Lecture Notes in Computer Science", "volume" : "944", "month" : "July", "type" : "Publication", "year" : "1995", "label" : "Approximating Minimum Cuts under Insertions", "key" : "Henzinger:DynamicMincut" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:6b0b32d719f48cf13c9dd2b867dd1a50", "pages" : "519--527", "date" : "1995-05", "place" : "Las Vegas, NV", "author" : [ "Henzinger, Monika Rauch", "King, Valerie" ], "month" : "May", "type" : "Publication", "year" : "1995", "label" : "Randomized Dynamic Graph Algorithms with PolyLogarithmic Time per Operation", "key" : "Henzinger:DynamicConnectivity-Conf" }, { "id" : "6434ea2a54a02cfe3f3c5e9986c2518d", "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:6434ea2a54a02cfe3f3c5e9986c2518d", "pages" : "502-516", "number" : "4", "author" : [ "Henzinger, Monika Rauch", "King, Valerie" ], "volume" : "46", "month" : "July", "type" : "Publication", "label" : "Randomized Dynamic Graph Algorithms with PolyLogarithmic Time per Operation", "key" : "Henzinger:DynamicConnectivity" }, { "organization" : "ACM", "booktitle" : "Proceedings of the {$6^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "pub-type" : "inproceedings", "venue" : "SPAA", "crossref" : "Proceedings of the {$6^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "uri" : "urn:9eb52eca39f8bca5688ee332dcb58d23", "pages" : "1-10", "date" : "1994-06", "author" : [ "Halperin, Shay", "Zwick, Uri" ], "month" : "June", "type" : "Publication", "year" : "1994", "label" : "An Optimal Randomized Logarithmic Time Connectivity Algorithm for the {EREW PRAM}", "key" : "Halperin:Connectivity" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$7^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "venue" : "SODA", "crossref" : "Proceedings of the {$7^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "uri" : "urn:c9a6a8442851532717d1ace7b00a81b7", "pages" : "438--447", "date" : "1996-01", "place" : "Atlanta, GA", "author" : [ "Halperin, Shay", "Zwick, Uri" ], "month" : "January", "type" : "Publication", "year" : "1996", "label" : "Optimal Randomized {EREW} {PRAM} Algorithms for Finding Spanning Forests and Other Basic Graph Connectivity Problems", "key" : "Halperin:Forests" }, { "journal" : "Information Processing Letters", "pub-type" : "article", "uri" : "urn:5b9e5dfb9cfb1b500dd5e61b68f57b15", "pages" : "19--23", "date" : "1993", "author" : "Halld?rsson, Magnus M.", "volume" : "45", "type" : "Publication", "year" : "1993", "label" : "A Still Better Performance Guarantee for Approximate Graph Coloring", "key" : "halldorsson" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$3^{rd}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "venue" : "SODA", "crossref" : "Proceedings of the {$3^{rd}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "uri" : "urn:500c7905b1536163ea55e0489834a401", "pages" : "165-174", "date" : "1992-01", "author" : [ "Hao, Jianxiu", "Orlin, James B." ], "month" : "January", "type" : "Publication", "year" : "1992", "label" : "A Faster algorithm for finding the minimum cut in a graph", "key" : "Hao:Mincut-conf" }, { "journal" : "Journal of Algorithms", "pub-type" : "article", "uri" : "urn:41ba737da9f2ecce34d549dfb1e15c6d", "pages" : "424-446", "date" : "1994", "number" : "3", "author" : [ "Hao, Jianxiu", "Orlin, James B." ], "volume" : "17", "type" : "Publication", "year" : "1994", "note" : "A preliminary version appeared in Proceedings of the {$3^{rd}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "label" : "A Faster Algorithm for Finding the Minimum Cut in a Directed Graph", "key" : "Hao:Mincut" }, { "publisher" : "JAI Press", "journal" : "Advances in Computing Research", "pub-type" : "article", "uri" : "urn:02d78c3631671e6490de2070bb685cf2", "pages" : "143--170", "date" : "1989", "author" : "Hastad", "volume" : "5", "editor" : "S. Miscale", "type" : "Publication", "year" : "1989", "note" : "A preliminary version appeared in Proceedings of the {$28^{th}$} {ACM} Symposium on Theory of Computing", "label" : "Almost Optimal Lower Bounds for Small Depth Circuits", "address" : "Greenwich, CT", "key" : "Hastad:CRCW" }, { "pub-type" : "mastersthesis", "uri" : "urn:adf5747661d2f267f3df8aafcc75aabd", "date" : "2004-05", "school" : "M.I.T.", "author" : "Hogue, Andrew", "month" : "May", "year" : "2004", "type" : "Publication", "label" : "Tree Pattern Inference and Matching for Wrapper Induction on the World Wide Web", "key" : "Hogue:Thesis" }, { "pub-type" : "mastersthesis", "uri" : "urn:daa1b5907822801981b5e5935f1cdae8", "date" : "2004-05", "school" : "Massachusetts Institute of Technology", "author" : "Hogue, A.", "month" : "May", "year" : "2004", "type" : "Publication", "label" : "Tree Pattern Inference and Matching for Wrapper Induction on the {W}orld {W}ide {W}eb", "key" : "hogue2004" }, { "journal" : "Mathematics of Operations Research", "pub-type" : "article", "uri" : "urn:00a95ec0eda1dc2a4ab5ce4021c93f1a", "pages" : "557--564", "date" : "1985-11", "number" : "4", "author" : [ "Hassin, Refael", "Zemel, Eitan" ], "volume" : "10", "month" : "November", "type" : "Publication", "year" : "1985", "label" : "On Shortest Paths in Graphs with Random Weights", "key" : "Hassin:paths" }, { "organization" : "ACM", "booktitle" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "pub-type" : "inproceedings", "venue" : "SPAA", "crossref" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "uri" : "urn:8d134b04f41c431b0cc69a34886c1b16", "pages" : "219--227", "date" : "1992-06", "place" : "San Diega, CA", "author" : [ "Herlihy, Maurice", "Lim, B.", "Shavit, Nir" ], "month" : "June", "type" : "Publication", "year" : "1992", "label" : "Low contention load-balancing on large-scale multiprocessors", "key" : "HerlihyLS92" }, { "organization" : "ACM", "booktitle" : "Proceedings of CHI 92 Conference on Human Factors in Computing Systems", "pub-type" : "inproceedings", "uri" : "urn:5891aab4a963bd1580d66efec8967f30", "pages" : "3--9", "date" : "1992", "author" : [ "Hill, W.C.", "Hollan, J.D.", "Wroblewski, D.", "McCandless, T." ], "type" : "Publication", "year" : "1992", "label" : "Edit Wear and Read Wear", "address" : "New York", "key" : "Hill:ReadWear" }, { "journal" : "Communications of the ACM", "pub-type" : "article", "uri" : "urn:04eb65a82300635b7563af5cb61db342", "pages" : "461--464", "date" : "1979-08", "number" : "8", "author" : [ "Hirschberg, D S", "Chandra, A. K.", "Sarwate, D. V." ], "volume" : "22", "month" : "August", "type" : "Publication", "year" : "1979", "label" : "Computing Connected Components on Parallel Computers", "key" : "HCS" }, { "journal" : "Computer Journal", "pub-type" : "article", "uri" : "urn:778eb3792d41ddd496648d27e41c2745", "pages" : "10--15", "date" : "1962", "number" : "1", "author" : "Hoare, C. A. R.", "volume" : "5", "type" : "Publication", "year" : "1962", "label" : "Quicksort", "key" : "Hoare:Quicksort" }, { "journal" : "Discrete Applied Mathematics", "pub-type" : "article", "uri" : "urn:69cf135e1493a90a89f31258d815af89", "pages" : "243-254", "date" : "1983", "author" : "Hochbaum, Dorit S.", "volume" : "6", "type" : "Publication", "year" : "1983", "label" : "Efficient bounds for the Stable Set, Vertex Cover, and Set Packing Problems", "key" : "Hochbaum:Packing" }, { "journal" : "Journal of the American Statistical Association", "pub-type" : "article", "uri" : "urn:035e6f3de1bcec04da7220f5ff7c23a4", "pages" : "13--30", "coden" : "JSTNAL", "date" : "1964-03", "number" : "301", "author" : "Hoeffding, W.", "volume" : "58", "month" : "March", "type" : "Publication", "year" : "1964", "label" : "Probability inequalities for sums of bounded random variables", "issn" : "0162-1459", "key" : "Hoeffding:Bound" }, { "publisher" : "Addison-Wesley", "pub-type" : "book", "uri" : "urn:4e97c4c8eda341e0a4d342d42caff6d2", "date" : "1979", "author" : [ "Hopcroft, John E.", "Ullman, Jeffrey D." ], "series" : "Series in Computer Science", "type" : "Publication", "year" : "1979", "label" : "Introduction to Automata Theory, Languages and Computation", "key" : "Hopcroft:Automata" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$5^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "venue" : "SODA", "crossref" : "Proceedings of the {$5^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "uri" : "urn:e12f7d571d7e4148193dbc564a24bbce", "date" : "1994-01", "place" : "Arlington, VA", "author" : [ "Hoppe, Bruce", "Tardos, Eva" ], "editor" : "Daniel D. Sleator", "month" : "January", "type" : "Publication", "year" : "1994", "label" : "Polynomial Time Algorithms for Some Evacuation Problems", "key" : "Hoppe:Evacuation" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:35c9f893cfc63a596f0ab01e7d4f16de", "pages" : "463--468", "date" : "1975", "number" : "4", "author" : [ "Ibarra, O. H.", "Kim, C. E." ], "volume" : "22", "type" : "Publication", "year" : "1975", "label" : "Fast Approximation Algorithms for the Knapsack and Sum of Subsets Problems", "key" : "Ibarra:Knapsack" }, { "booktitle" : "Proceedings of the {$30^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "uri" : "urn:6a11cca46482ef73c5a5efeddb04def4", "pages" : "222--227", "date" : "1989", "author" : [ "Impagliazzo, Russel", "Zuckerman, David" ], "type" : "Publication", "year" : "1989", "label" : "How to Recycle Random Bits", "key" : "Impagliazzo:Expander" }, { "journal" : "Information Processing Letters", "pub-type" : "article", "uri" : "urn:ba1feac5a5dd327e2e2f96af0d5236bd", "pages" : "57--60", "date" : "1986", "author" : [ "Israeli, Amos", "Shiloach, Y." ], "volume" : "22", "type" : "Publication", "year" : "1986", "label" : "An Improved Parallel Algorithm for Maximal Matching", "key" : "Israeli:Matching" }, { "journal" : "Information and Control", "pub-type" : "article", "uri" : "urn:0ef7b24de47de07e4eca76d749ef8238", "pages" : "43--59", "date" : "1988", "author" : [ "Itai, A.", "Rodeh, M." ], "volume" : "79", "type" : "Publication", "year" : "1988", "label" : "The Multi-tree Approach to Reliability in Distributed Networks", "key" : "Itai:Routing" }, { "booktitle" : "Proceedings of the 10th {ACM} Symposium on Principles of Database Systems", "pub-type" : "inproceedings", "uri" : "urn:ebb0d15e7d38d34fc0753422ded95d99", "pages" : "199--205", "date" : "1991", "author" : "Jakobsson, Hakan", "type" : "Publication", "year" : "1991", "label" : "Mixed-approach Algorithms for Transitive Closure\\typout{J:PAGES?}", "key" : "Jakobsson" }, { "journal" : "Theoretical Computer Science", "pub-type" : "article", "uri" : "urn:146c3ff84d6ca59e39c296ac0e7ba927", "pages" : "169--188", "date" : "1986", "author" : [ "Jerrum, Mark", "Valiant, Leslie", "Vazirani, Vijay" ], "volume" : "43", "type" : "Publication", "year" : "1986", "label" : "Random Generation of Combinatorial Structures from a Uniform Distribution", "key" : "Jerrum:RandomGeneration" }, { "journal" : "Journal of Computer and System Sciences", "pub-type" : "article", "uri" : "urn:406cf6c84a68e69171a830ed00d7f522", "pages" : "256--278", "date" : "1974", "author" : "Johnson, David S.", "volume" : "9", "type" : "Publication", "year" : "1974", "label" : "Approximation Algorithms for Combinatorial Problems", "key" : "Johnson:SetCover" }, { "journal" : "Journal of Algorithms", "pub-type" : "article", "uri" : "urn:02f81b44fa3242602ac4bd5013fd2335", "pages" : "285--303", "date" : "1987", "number" : "2", "author" : "Johnson, David S.", "volume" : "8", "type" : "Publication", "year" : "1987", "label" : "The {NP}-Completeness Column: An Ongoing Guide", "key" : "Johnson:StrongPoly" }, { "booktitle" : "Proceedings of the 5th Southeastern Conference on Combinatorics, Graph Theory and Computing", "pub-type" : "incollection", "uri" : "urn:1ba5f7d676c470b9127f253de3a6dfeb", "pages" : "513--527", "date" : "1974", "number" : "X", "author" : "Johnson, David S.", "series" : "Congressus Numerantium", "type" : "Publication", "year" : "1974", "label" : "Worst Case Behavior of Graph Coloring Algorithms", "key" : "Johnson:Coloring" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:47f538ab6d5041f83d3ec9ea55968e21", "pages" : "688-697", "date" : "1991-10", "place" : "San Juan, Puerto Rico", "author" : [ "Johnson, Donald B.", "Metaxas, Panagiotis" ], "month" : "October", "type" : "Publication", "year" : "1991", "label" : "Connected Components in {$O(\\log^{3/2} |V|)$} Parallel Time for the {CREW} {PRAM}", "key" : "Johnson:Connectivity" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:299183e1cb145afbe9231957b4ffd21a", "pages" : "1--13", "date" : "1977", "number" : "1", "author" : "Johnson, Donald B.", "volume" : "24", "type" : "Publication", "year" : "1977", "label" : "Efficient Algorithms for Shortest Paths in Sparse Networks", "key" : "Johnson" }, { "organization" : "ACM", "booktitle" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "pub-type" : "inproceedings", "venue" : "SPAA", "crossref" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "uri" : "urn:1310a46be188661c31eb2fb120ba3d84", "pages" : "363-372", "date" : "1992-06", "place" : "San Diega, CA", "author" : [ "Johnson, Donald B.", "Metaxas, Panagiotis" ], "month" : "June", "type" : "Publication", "year" : "1992", "label" : "A Parallel Algorithm for Computing Minimum Spanning Trees", "key" : "Johnson:MST" }, { "journal" : "SIGIR Forum", "pub-type" : "article", "uri" : "urn:ba433e1c2dfb6970f0d3dfe3f2249f03", "pages" : "5--6", "date" : "1996", "number" : "3", "author" : "Jones, Karen Sparck", "volume" : "30", "type" : "Publication", "year" : "1996", "label" : "Report on Building and Using Test Collections Panel, SIGIR 1996", "key" : "Jones:Corpus" }, { "organization" : "IEEE", "booktitle" : "9th International Conference on Network Protocols", "pub-type" : "inproceedings", "uri" : "urn:b60226877ec8e0d386f95a9b67fe36bb", "date" : "2001-11", "author" : [ "Kommareddy, Christopher", "Shankar, Narendar", "Bhattacharjee, Bobby" ], "editor" : "Magda El Zarki and Klara Nahrstedt", "month" : "November", "type" : "Publication", "year" : "2001", "note" : "To appear", "label" : "Finding close friends on the internet", "address" : "Riverside, CA", "key" : "Kommareddy:Neighbor" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:f98dd9bbd5e8d9a9f08de38d2df93172", "pages" : "656--671", "date" : "1994-11", "place" : "Santa Fe, NM", "author" : "Kannan, Ravi", "editor" : "Shafi Goldwasser", "month" : "November", "type" : "Publication", "year" : "1994", "label" : "Markov Chains and Polynomial Time Algorithms", "key" : "Kannan:Counting" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$22^{nd}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$22^{nd}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:5b261e568d41eceb6195af76f8b8f1d1", "pages" : "181--192", "date" : "1990-05", "author" : [ "Kao, Min-Yang", "Klein, Philip N." ], "month" : "May", "type" : "Publication", "year" : "1990", "label" : "Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs", "key" : "Kao:TransClosure-conf" }, { "journal" : "Journal of Computer and System Sciences", "pub-type" : "article", "uri" : "urn:88d653c51f07db3074b564cbcb1abbff", "pages" : "459-500", "date" : "1993-12", "number" : "3", "author" : [ "Kao, Min-Yang", "Klein, Philip N." ], "volume" : "47", "month" : "December", "type" : "Publication", "year" : "1993", "note" : "A preliminary version appeared in Proceedings of the {$22^{nd}$} {ACM} Symposium on Theory of Computing", "label" : "Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs", "key" : "Kao:TransClosure" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$33^{rd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$33^{rd}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:e98d0d7876fcf38ecc4b1f4029b3a906", "date" : "2000-11", "place" : "Rodondo Beach, CA", "author" : [ "Kannan, Ravi", "Vempala, Santosh", "Vetta, Adrian" ], "month" : "November", "type" : "Publication", "year" : "2000", "label" : "On Clusterings. Good, Bad and Spectral", "key" : [ "Kannan:Clustering", "367--377" ] }, { "label" : "Toward Hierarchical Decomposition for Planning in Uncertain Environments", "key" : "Kaelbling:HierarchicalPlanning", "type" : "Publication", "pub-type" : "inproceedings", "author" : [ "Lane, Terran", "Kaelbling, Leslie Pack" ], "note" : "To appear", "uri" : "urn:5646a908f9aa85cf37ad393e759c88bf", "booktitle" : "Workshop on Planning under Uncertainty and Incomplete Information At the 2001 International Joint Conference on Artificial Intelligence (IJCAI-2001)" }, { "journal" : "Dokladi (Reports) of the Academy of Science of the Armenian Soviet Socialist Republic", "pub-type" : "article", "uri" : "urn:eb92ff63f0dee93e1016b1984f73d359", "pages" : "306--311", "date" : "1980", "number" : "5", "author" : "Karapetian, Iskandar A.", "volume" : "70", "type" : "Publication", "year" : "1980", "label" : "On Coloring of Arc Graphs", "key" : "Karapetian:Coloring" }, { "booktitle" : "Proceedings of the ACM Symposium on User Interface Software and Technology (UIST)", "pub-type" : "inproceedings", "uri" : "urn:8af19d2156aac0dd690310d742bac76b", "date" : "2006", "author" : [ "Little, Greg", "Miller, Robert C." ], "type" : "Publication", "year" : "2006", "label" : "Translating Keyword Commands into Executable Code", "key" : "Little06" }, { "pub-type" : "mastersthesis", "uri" : "urn:79d5bb554cf1af5a3be4c45493ee9b86", "date" : "2003-09", "school" : "M.I.T.", "author" : "Sinha, Vineet", "month" : "September", "year" : "2003", "type" : "Publication", "label" : "Dynamically Expoloiting Available Metadata for Browsing and Information Retrieval", "key" : "Sinha:Thesis" }, { "pub-type" : "misc", "uri" : "urn:4acad6243da4fe773703c226527544b4", "date" : "2005", "author" : "Bose, Vanu", "type" : "Publication", "year" : "2005", "note" : "Private Communication", "label" : "4acad6243da4fe773703c226527544b4", "key" : "Bose:Private" }, { "url" : "citeseer.ist.psu.edu/bose98virtual.html", "pub-type" : "phdthesis", "uri" : "urn:7404d0ef3e00223b98f390c05f15593a", "date" : "1999", "school" : "{MIT}", "author" : "Bose, Vanu", "type" : "Publication", "year" : "1999", "label" : "Virtual Radios", "key" : "Bose:Thesis" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$16^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "venue" : "SODA", "crossref" : "Proceedings of the {$16^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "uri" : "urn:5dfb3bde9c53cd3863827a62d6e4d4b3", "date" : "2005-01", "place" : "Vancouver, BC", "author" : [ "Feldman, Jon", "Stein, Cliff" ], "month" : "January", "type" : "Publication", "year" : "2005", "label" : "LP Decoding Achieves Capacity", "key" : "Feldman:LPTurboCapacity" }, { "url" : "citeseer.ist.psu.edu/veksler99efficient.html", "pub-type" : "phdthesis", "uri" : "urn:7b1b49ec33bdda4d5dd872d688adb068", "date" : "1999", "school" : "Department of Computer Science, Cornell University", "author" : "Veksler, Olga", "type" : "Publication", "year" : "1999", "label" : "Efficient graph-based energy minimization methods in computer vision", "key" : "Veksler:Thesis" }, { "url" : "citeseer.ist.psu.edu/article/boykov99fast.html", "booktitle" : "{ICCV} (1)", "pub-type" : "inproceedings", "uri" : "urn:72cabe91de57a2d34f18df65b4f4d1e6", "pages" : "377-384", "date" : "1999", "author" : [ "Boykov, Yuri", "Veksler, Olga", "Zabih, Ramin" ], "year" : "1999", "type" : "Publication", "label" : "Fast Approximate Energy Minimization via Graph Cuts", "key" : "Boykov:Mincuts" }, { "booktitle" : "INFOCOM", "pub-type" : "inproceedings", "uri" : "urn:283f050fe3e9dfa9695c753d3eb35208", "date" : "2002", "author" : [ "Koetter, Ralf", "M?dard, Muriel" ], "type" : "Publication", "year" : "2002", "label" : "An Algebraic Approach to Network Coding", "key" : "Medard:NetworkCoding" }, { "booktitle" : "The Forty-Third Annual Allerton Conference on Communication, Control, and Computing", "pub-type" : "inproceedings", "uri" : "urn:2df75034dd39986ed6f0a405e6a0443f", "date" : "2005", "author" : [ "Katti, Sachin", "Katabi, Dina", "Hu, Wenjun", "Rahul, Hariharan", "M?dard, Muriel" ], "type" : "Publication", "year" : "2005", "label" : "The Importance of Being Opportunistic: Practical Network Coding For Wireless Environments", "key" : "Katti:NetworkCoding" }, { "booktitle" : "$17^{th}$ Conference on Uncertainty in Artificial Intelligence (UAI)", "pub-type" : "inproceedings", "uri" : "urn:73779c28de2b2f140296de4aee09d247", "date" : "2001", "author" : "Srebro, Nati", "note" : "Best student paper", "type" : "Publication", "year" : "2001", "label" : "Maximum Lielihood Bounded Tree-Width Markov Networks", "key" : "Srebro:Markov" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$23^{rd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$23^{rd}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:f262a7b44d9f763432f048daa4254b5c", "pages" : "312--320", "date" : "1982", "author" : [ "Karmarkar, N.", "Karp, Richard M." ], "type" : "Publication", "year" : "1982", "label" : "An efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem", "key" : "Karmarkar:BinPack" }, { "journal" : "Combinatorica", "pub-type" : "article", "uri" : "urn:f60b68f02c949b49d249ebbc1f0e11e2", "pages" : "373--395", "date" : "1984", "number" : "4", "author" : "Karmarkar, N.", "volume" : "4", "type" : "Publication", "year" : "1984", "label" : "{A New Polynomial-Time Algorithm for Linear Programming}", "key" : "Karmarkar:LP" }, { "publisher" : "MIT Press", "booktitle" : "Handbook of Theoretical Computer Science", "pub-type" : "incollection", "crossref" : "Handbook of Theoretical Computer Science", "uri" : "urn:0ea980fc84f503324aa0d564fbccc86b", "pages" : "869--932", "date" : "1990", "author" : [ "Karp, Richard M.", "Ramachandran, Vijaya" ], "volume" : "A", "editor" : "van Leeuwen, Jan", "type" : "Publication", "year" : "1990", "label" : "Parallel Algorithms for Shared Memory Machines", "address" : "Cambridge, MA", "key" : "Karp:Parallel" }, { "journal" : "Combinatorica", "pub-type" : "article", "uri" : "urn:87510a4f95aac495cb60a562e74dfdee", "pages" : "35--48", "date" : "1986", "number" : "1", "author" : [ "Karp, Richard M.", "Upfal, Eli", "Wigderson, Avi" ], "volume" : "6", "type" : "Publication", "year" : "1986", "label" : "Constructing a Perfect Matching is in Random {$\\NC$}", "key" : "Karp:Matching" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$23^{rd}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$23^{rd}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:7466dc0e3cbbcbdb1b41bc2b152525a9", "pages" : "190--197", "date" : "1991-05", "author" : "Karp, Richard M.", "month" : "May", "type" : "Publication", "year" : "1991", "label" : "Probabilistic Recurrence Relations", "key" : "Karp:Recurrence" }, { "journal" : "Journal of Complexity", "pub-type" : "article", "uri" : "urn:b4491cb4e22f6ba8e34a412a44e8ab84", "pages" : "45--64", "date" : "1985", "author" : [ "Karp, Richard M.", "Luby, Michael G." ], "volume" : "1", "type" : "Publication", "year" : "1985", "label" : "Monte Carlo Algorithms for Planar Multiterminal Network Reliability Problems", "key" : "Karp:Reliability" }, { "journal" : "Journal of Complexity", "pub-type" : "article", "uri" : "urn:dbfe72c66ca306f031dc4ec7850f2f3a", "pages" : "45--64", "date" : "1985", "author" : [ "Karp, Richard M.", "Luby, Michael" ], "volume" : "1", "type" : "Publication", "year" : "1985", "label" : "{M}onte {C}arlo Algorithms for Planar Multiterminal Network Reliability Problems", "key" : "Karp:DNF0" }, { "publisher" : "Elsevier Science Publishers Ltd.", "journal" : "Artif. Intell.", "pub-type" : "article", "uri" : "urn:30f35643418116c8912f1a4aa170eb45", "pages" : "141--153", "date" : "1993", "number" : "1", "author" : [ "Dagum, Paul", "Luby, Michael" ], "volume" : "60", "doi" : "http://dx.doi.org/10.1016/0004-3702(93)90036-B", "type" : "Publication", "year" : "1993", "label" : "Approximating probabilistic inference in Bayesian belief networks is NP-hard", "issn" : "0004-3702", "address" : "Essex, UK", "key" : "Dagum:BayesNets" }, { "journal" : "Random Structures and Algorithms", "pub-type" : "article", "uri" : "urn:98c1a2520ced1c431d7c4317d32e16db", "pages" : "461--479", "date" : "2004", "number" : "4", "author" : [ "Dyer, Martin", "Sinclair, Alistair", "Vigoda, Eric", "Weitz, Dror" ], "volume" : "24", "type" : "Publication", "year" : "2004", "label" : "Mixing in time and space for lattice spin systems: A combinatorial view", "key" : "Dyer:Gibbs" }, { "publisher" : "ACM Press", "booktitle" : "SODA \'06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm", "pub-type" : "inproceedings", "uri" : "urn:2eeea10ef9f729956f4c01b25b24f133", "pages" : "153--161", "date" : "2006", "author" : [ "Svitkina, Zoya", "Tardos, Eva" ], "doi" : "http://doi.acm.org/10.1145/1109557.1109576", "type" : "Publication", "year" : "2006", "isbn" : "0-89871-605-5", "label" : "Facility location with hierarchical facility costs", "location" : "Miami, Florida", "address" : "New York, NY, USA", "key" : "Tardos:HierarchicalFacilityLocation" }, { "journal" : "Journal of Algorithms", "pub-type" : "article", "uri" : "urn:33833e1b9e7fd8bd03def00231f25c2b", "pages" : "429--448", "date" : "1989-09", "number" : "3", "author" : [ "Karp, Richard M.", "Luby, Michael", "Madras, N." ], "volume" : "10", "month" : "September", "type" : "Publication", "year" : "1989", "label" : "{M}onte {C}arlo Approximation Algorithms for Enumeration Problems", "key" : "Karp:DNF" }, { "journal" : "Cybernetics", "pub-type" : "article", "uri" : "urn:950035c1884902a7539d66619545c628", "pages" : "156--162", "date" : "1986", "author" : [ "Karzanov, Alexander V.", "Timofeev, E. A." ], "volume" : "22", "type" : "Publication", "year" : "1986", "label" : "Efficient Algorithm for Finding All Minimal Edge Cuts of a Non-Oriented Graph", "key" : "Karzanov:cactus" }, { "publisher" : "Moscow State University Press, Moscow", "booktitle" : "Matematicheskie Voprosy Upravleniya Proizvodstvom", "pub-type" : "incollection", "uri" : "urn:091b480d9b6e94bdfdabe2e379e295b9", "date" : "1973", "author" : "Karzanov, Alexander V.", "volume" : "5", "year" : "1973", "type" : "Publication", "note" : "In Russian; title translation: On Finding Maximum Flows in a Network with Special Structure and Some Applications", "label" : "O Nakhozhdenii Maksimal$\'$nogo Potoka v Setyakh Spetsial$\'$nogo Vida i Nekotorykh Prilozheniyakh", "key" : "Karzanov:Flow" }, { "pub-type" : "phdthesis", "uri" : "urn:59157b8f90e6a478414707b62f2c4a39", "date" : "1970", "school" : "Cornell University", "author" : "Kerr, L. R.", "type" : "Publication", "year" : "1970", "label" : "The Effect of Algebraic Structure on the Computational Complexity of Matrix Multiplications", "key" : "Kerr" }, { "booktitle" : "Proceedings $2^{nd}$ Israeli Symposium on Theory and Computing Systems", "pub-type" : "inproceedings", "uri" : "urn:1eb46b43d09073deb6f0d5d06061c2e4", "pages" : "250--260", "date" : "1992", "author" : [ "Khanna, Sanjeev", "Linial, Natan", "Safra, S." ], "type" : "Publication", "year" : "1992", "label" : "On the Hardness of Approximating the Chromatic Number", "key" : "sanjeev" }, { "booktitle" : "Proceedings of the Twenty-Ninth Annual {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "uri" : "urn:1c4cd9ca6eccf560e8c37c40bedceaeb", "pages" : "11--20", "date" : "1997", "author" : [ "Khanna, Sanjeev", "Sudan, Madhu", "Williamson, David P." ], "month" : "4--6 May", "type" : "Publication", "year" : "1997", "label" : "A Complete Classification of the Approximability of Maximization Problems Derived from {Boolean} Constraint Satisfaction", "address" : "El Paso, Texas", "references" : "\\cite{FOCS::AroraLMSS1992} \\cite{JCSS::Creignou1995} \\cite{STOC::FederV1993} \\cite{JACM::GoemansW1995} \\cite{STOC::KhannaM1996} \\cite{FOCS::KhannaMSV1994} \\cite{JACM::Ladner1975} \\cite{JCSS::PapadimitriouY1991} \\cite{STOC::Schaefer1978} \\cite{FOCS::TrevisanSSW1996} \\cite{JALGO::Yannakakis1994}", "key" : "Khanna:ApproxCSP" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:33a299aecc8dbb6eabe3f594f9fb611f", "pages" : "352--375", "date" : "1991-04", "number" : "2", "author" : [ "Khuller, Samir", "Schieber, Baruch" ], "volume" : "20", "month" : "April", "type" : "Publication", "year" : "1991", "label" : "Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint {$s$-$t$} Paths in Graphs", "key" : "Khuller:Connectivity" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:95369f98edfcd4f1eb1a508a8de735d2", "pages" : "214-235", "date" : "1994-03", "number" : "2", "author" : [ "Khuller, Samir", "Vishkin, Uzi" ], "volume" : "41", "month" : "March", "type" : "Publication", "year" : "1994", "note" : "A preliminary version appeared in Proceedings of the {$24^{th}$} {ACM} Symposium on Theory of Computing", "label" : "Biconnectivity Approximations and Graph Carvings", "key" : "Khuller:Steiner" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:5217d423bf6f1c21a0ec36e2e4cac5e7", "pages" : "1--10", "date" : "1995-05", "place" : "Las Vegas, NV", "author" : [ "Khuller, Samir", "Raghavachari, Balaji" ], "month" : "May", "type" : "Publication", "year" : "1995", "label" : "Improved Approximation Algorithms for Uniform Connectivity Problems", "key" : "Khuller:UniformConnectivity" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$3^{rd}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "venue" : "SODA", "crossref" : "Proceedings of the {$3^{rd}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "uri" : "urn:0d077da504766bda221774ab9ab4241d", "pages" : "157--164", "date" : "1992-01", "author" : [ "King, Valerie", "Rao, Satish", "Tarjan, Robert E." ], "month" : "January", "type" : "Publication", "year" : "1992", "label" : "A Faster Deterministic Maximum Flow Algorithm", "key" : "King:Flow-conf" }, { "id" : "cfe6f551afe4ea59ee39119dcd0cab55", "journal" : "Journal of Algorithms", "pub-type" : "article", "uri" : "urn:cfe6f551afe4ea59ee39119dcd0cab55", "pages" : "447-474", "date" : "1994-11", "number" : "3", "author" : [ "King, Valerie", "Rao, Satish", "Tarjan, Robert E." ], "volume" : "17", "month" : "November", "type" : "Publication", "year" : "1994", "note" : "A preliminary version appeared in Proceedings of the {$3^{rd}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "label" : "A Faster Deterministic Maximum Flow Algorithm", "key" : "King:Flow" }, { "pub-type" : "unpublished", "uri" : "urn:ceea5b942d18ea104aa1c7c7781c24ee", "date" : "1993", "author" : "King, Valerie", "type" : "Publication", "year" : "1993", "note" : "Manuscript.", "label" : "A Simpler Algorithm for Verifying Minimum Spanning Trees", "key" : "King:MST" }, { "crossref" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "type" : "Publication", "author" : [ "Klein, Philip", "Rao, Satish", "Plotkin, Serge" ], "editor" : "Alok Aggarwal", "uri" : "urn:f2e76c6ac373a71230a2bb336e1a17cc", "label" : "Excluded Minors, Network Decomposition, and Multicommodity Flow", "venue" : "STOC", "place" : "San Diego, CA", "pages" : "682--690", "year" : "1993", "booktitle" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "publisher" : "ACM Press", "pub-type" : "inproceedings", "annote" : " Proves some results regarding max-flow min-cut for multicommodity flow on minor-excluded graphs... This, in turn, gives some results on finding seps in such graphs.", "date" : "1993-05", "month" : "May", "organization" : "ACM", "key" : "Klein:ExcludedMinors" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$22^{nd}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$22^{nd}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:58ed4ad2fd790aa7e0ef920b9eaad20b", "pages" : "310-321", "date" : "1990-05", "author" : [ "Klein, Philip N.", "Stein, Clifford", "Tardos, ?va" ], "month" : "May", "type" : "Publication", "year" : "1990", "label" : "{L}eighton-{R}ao Might be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities", "key" : "Klein:Concurrent" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:c74bd59af7e4ac45cefa45579ddb7ebd", "pages" : "466--487", "date" : "1994", "number" : "3", "author" : [ "Klein, Philip", "Plotkin, Serge A.", "Stein, Clifford", "Tardos, ?va" ], "volume" : "23", "type" : "Publication", "year" : "1994", "note" : "A preliminary version appeared in Proceedings of the {$22^{nd}$} {ACM} Symposium on Theory of Computing", "label" : "Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts", "key" : "Klein:Flow" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:320d3012480a8c2aadd4b7da948163f4", "pages" : "9--15", "date" : "1994-05", "place" : "Montreal, Quebec, Canada", "author" : [ "Klein, Philip N.", "Tarjan, Robert E." ], "month" : "May", "type" : "Publication", "year" : "1994", "label" : "A Randomized Linear-time Algorithm for Finding Minimum Spanning Trees", "key" : "Klein:MST" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:f4431b26267959f546918763f1798283", "pages" : "27--37", "date" : "1994-05", "place" : "Montreal, Quebec, Canada", "author" : [ "Klein, Philip N.", "Rao, Satish", "Rauch, Monika H.", "Subramanian, S." ], "month" : "May", "type" : "Publication", "year" : "1994", "label" : "Faster shortest-path algorithms for planar graphs", "key" : "Klein:PlanarShortestPaths" }, { "journal" : "Jber. Deutsch. Math.-Verein.", "pub-type" : "article", "uri" : "urn:3c5ce6e80412284673593904491be6cc", "date" : "1955", "author" : "Kneser, M.", "volume" : "58", "year" : "1955", "type" : "Publication", "label" : "Aufgabe 300", "key" : "kneser" }, { "journal" : "Combinatorica", "pub-type" : "article", "uri" : "urn:7ec00264bce80b2bf85ff2d22dc8f807", "pages" : "57--65", "date" : "1985", "number" : "1", "author" : "Koml?s, J.", "volume" : "5", "type" : "Publication", "year" : "1985", "label" : "Linear Verification for Spanning Trees", "key" : "Komlos:MST" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$34^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$34^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:29793e45a2b310215d21cff29ece92c7", "pages" : "692--701", "date" : "1993-11", "place" : "Palo Alto, CA", "author" : [ "Kortsarz, Guy", "Peleg, David" ], "editor" : "Leonidas Guibas", "month" : "November", "type" : "Publication", "year" : "1993", "label" : "On Choosing a Dense Subgraph", "key" : "Kortsarz:DenseGraph" }, { "pub-type" : "techreport", "institution" : "Stanford University", "uri" : "urn:6beedb905a889d6b3964a709a9e85019", "date" : "1973", "number" : "STAN-CS-73-342", "author" : "Knuth, Donald E.", "type" : "Publication", "year" : "1973", "label" : "Matroid Partitioning", "key" : "Knuth:Matroid" }, { "publisher" : "Academic Press", "booktitle" : "Algorithms and Complexity: New Directions and Recent Results", "pub-type" : "incollection", "uri" : "urn:74d8fd8c87437f7011d65408bcb7f5e4", "pages" : "357--428", "date" : "1976", "author" : [ "Knuth, Donald E.", "Yao, Andrew C." ], "editor" : "Joseph F. Traub", "type" : "Publication", "year" : "1976", "label" : "The Complexity of Nonuniform Random Number Generation", "address" : "New York", "key" : "Knuth:NonuniformRandom" }, { "journal" : "Information Processing Letters", "pub-type" : "article", "uri" : "urn:5b8cdd09c399e5f32910c0c78a849e08", "pages" : "1--5", "date" : "1977", "author" : "Knuth, Donald E.", "volume" : "6", "type" : "Publication", "year" : "1977", "label" : "A Generalization of {D}ijkstra\'s Algorithm", "key" : "Knuth:Paths" }, { "pub-type" : "techreport", "institution" : "Stanford University", "uri" : "urn:a13e64f6e01054503c3c55a074dac1d7", "date" : "1974", "number" : "STAN-CS-74-453", "author" : "Knuth, Donald E.", "type" : "Publication", "year" : "1974", "label" : "Random Matroids", "key" : "Knuth:RandomMatroid" }, { "publisher" : "Addison-Wesley Publishing Company", "pub-type" : "book", "uri" : "urn:97b11537d9cb2c40f8978224e86a87ae", "date" : "1973", "author" : "Knuth, Donald E.", "series" : "The Art of Computer Programming", "volume" : "1", "edition" : "2nd", "type" : "Publication", "year" : "1973", "label" : "Fundamental Algorithms", "address" : "Reading, MA", "key" : "Knuth:Book1" }, { "publisher" : "Addison-Wesley Publishing Company", "pub-type" : "book", "uri" : "urn:5f7db191fd2d536da672f8fd1580cb2e", "date" : "1981", "author" : "Knuth, Donald E.", "series" : "The Art of Computer Programming", "volume" : "2", "edition" : "2nd", "type" : "Publication", "year" : "1981", "label" : "Seminumerical Algorithms", "address" : "Reading, MA", "key" : "Knuth:Book2" }, { "journal" : "The Electronic Journal of Combinatorics", "pub-type" : "article", "uri" : "urn:71ebecfd22b4d4413309c8538f701d19", "pages" : "1--48", "date" : "1994", "author" : "Knuth, Donald E.", "volume" : "1", "type" : "Publication", "year" : "1994", "label" : "The Sandwich Theorem", "key" : "Knuth:Sandwich" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:91959a23712c4ecd50c1c66379bea95e", "pages" : "260--274", "date" : "1994-05", "number" : "2", "author" : [ "Koller, D.", "Megiddo, N." ], "volume" : "7", "month" : "may", "type" : "Publication", "year" : "1994", "label" : "Constructing Small Sample Spaces Satisfying Given Constraints", "key" : "Koller:SampleSpace" }, { "journal" : "Information Processing Letters", "pub-type" : "article", "uri" : "urn:46e5cb54587e73447744f6214c63ba2a", "pages" : "53--55", "date" : "1992", "number" : "1", "author" : [ "Koutsoupias, E.", "Papadimitriou, Christos H." ], "volume" : "43", "type" : "Publication", "year" : "1992", "label" : " On the greedy heuristic for satisfiability", "key" : "Koutsoupias:SAT" }, { "publisher" : "Springer-Verlag", "pub-type" : "book", "uri" : "urn:0f39d9ea0e409343bc805666a8742e30", "date" : "1991", "author" : [ "Korte, Bernhard H.", "Lov?sz, L?szl?", "Schrader, Rainer" ], "type" : "Publication", "year" : "1991", "label" : "Greedoids", "address" : "Berlin", "key" : "Korte:Greedoid" }, { "journal" : "Proceedings of the American Mathematical Society", "pub-type" : "article", "uri" : "urn:fb12bf89f652c9116ae209e95c6a39aa", "pages" : "48-50", "date" : "1956", "number" : "1", "author" : "Kruskal, Jr., J. B.", "volume" : "7", "type" : "Publication", "year" : "1956", "label" : "On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem", "key" : "Kruskal:MST" }, { "publisher" : "John Wiley \\& Sons", "pub-type" : "book", "uri" : "urn:53f65f17076a7b102a9636963468f96b", "date" : "1985", "editor" : "Eugene L. Lawler and J. K. Lenstra and A. H. G. Rinooy Kan and David B. Shmoys", "type" : "Publication", "year" : "1985", "label" : "The Traveling Salesman Problem", "key" : "Lawler:TSP" }, { "publisher" : "Holt, Reinhardt and Winston", "pub-type" : "book", "uri" : "urn:0dfda5b6a2fedd52a5da1f5f378b63d0", "date" : "1976", "author" : "Lawler, Eugene L.", "type" : "Publication", "year" : "1976", "label" : "Combinatorial Optimization: Networks and Matroids", "address" : "New York", "key" : "Lawler:Optimization" }, { "journal" : "ORSA Journal on Computing", "pub-type" : "article", "uri" : "urn:6f280613843f52de97c3f46bc65b8201", "pages" : "70--96", "date" : "1992", "number" : "1", "author" : [ "Lee, Jon", "Ryan, Jennifer" ], "volume" : "4", "type" : "Publication", "year" : "1992", "label" : "Matroid Applications and Algorithms", "key" : "Lee:Matroid" }, { "booktitle" : "Automata, Languages and Programming. {$18^{th}$} International Colloquium Proceedings", "pub-type" : "inproceedings", "uri" : "urn:916efb86dfd3400e6976d588443b2b5e", "pages" : "314--326", "date" : "1991", "author" : [ "Lengauer, T.", "Theune, D." ], "type" : "Publication", "year" : "1991", "label" : "Efficient Algorithms for Path Problems with General Cost Criteria", "key" : "Lengauer:Paths" }, { "pub-type" : "unpublished", "uri" : "urn:7ea36c8cd1c857fc2d5aee86d220fe6e", "date" : "1996", "author" : "Leighton, Tom", "type" : "Publication", "year" : "1996", "note" : "\\tt ftp://theory.lcs.mit.edu/pub/classes/6.042/fall96/handouts/master\\_thms.ps", "label" : "Notes on Better Master Theorems for Divide-and-Conquer Recurrences", "key" : "Leighton:Recurrence" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$29^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$29^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:e62c5acb53e064e38880eaa38260a7d5", "pages" : "422-431", "date" : "1988-10", "author" : [ "Leighton, Tom", "Rao, Satish" ], "month" : "October", "type" : "Publication", "year" : "1988", "label" : "An Approximate Max-flow Min-cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms", "key" : "Leighton:Quotient" }, { "journal" : "Combinatorica", "pub-type" : "article", "uri" : "urn:f99bcb0dd361af77b207422153d42289", "pages" : "215--246", "date" : "1995", "number" : "2", "author" : [ "Linial, Natan", "London, E.", "Rabinovich, Y." ], "volume" : "15", "type" : "Publication", "year" : "1995", "note" : "A preliminary version appeared in Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "label" : "The Geometry of Graphs and some of its Algorithmic Applications", "key" : "Linial:Embedding" }, { "label" : "3a1a457e472e49dab38b7f9f7e926af9", "key" : "Linial:Private", "type" : "Publication", "pub-type" : "misc", "author" : "Linial, Natan", "note" : "Personal Communication", "uri" : "urn:3a1a457e472e49dab38b7f9f7e926af9" }, { "journal" : "Probability in the Engineering and Informational Sciences", "pub-type" : "article", "uri" : "urn:3c7bee52f9e2b3cc56ea46cd82894983", "pages" : "245--264", "date" : "1994", "author" : "Lomonosov, Micael V.", "volume" : "8", "type" : "Publication", "year" : "1994", "label" : "On {M}onte {C}arlo Estimates in Network Reliability", "key" : "Lomonosov:Mincut" }, { "journal" : "Problems of Information Transmission", "pub-type" : "article", "uri" : "urn:84f10254023771a277cedd6d95f8c969", "pages" : "118-123", "date" : "1971", "author" : [ "Lomonosov, Micael V.", "Polesskii, V. P." ], "volume" : "7", "type" : "Publication", "year" : "1971", "label" : "Lower Bound of Network Reliability", "key" : "Lomonosov:Reliability" }, { "journal" : "Problems of Information Transmission", "pub-type" : "article", "uri" : "urn:80140b1c443fef45478c9441462aae40", "pages" : "73-81", "date" : "1974", "author" : "Lomonosov, Micael V.", "volume" : "10", "type" : "Publication", "year" : "1974", "label" : "Bernoulli Scheme with Closure", "key" : "Lomonosov:MatroidSampling" }, { "publisher" : "North-Holland", "pub-type" : "book", "uri" : "urn:9d0e81c711818f022d768d97cc248577", "date" : "1993", "author" : "Lov?sz, L?szl?", "edition" : "2nd", "year" : "1993", "type" : "Publication", "label" : "Combinatorial Problems and Exercises", "address" : "Amsterdam", "key" : "Lovasz:Exercises" }, { "journal" : "IEEE Transactions on Information Theory", "pub-type" : "article", "uri" : "urn:c7697ab9d0ce62081f239b3d5e6a926d", "pages" : "1--7", "date" : "1979", "author" : "Lov?sz, L?szl?", "volume" : "IT-25", "type" : "Publication", "year" : "1979", "label" : "On the Shannon capacity of a graph", "key" : "Lovasz:Shannon" }, { "pub-type" : "misc", "uri" : "urn:555a8132be3cafed7236d25f1fb8a4ef", "date" : "1994-03", "author" : "Lov?sz, L?szl?", "month" : "March", "note" : "Personal Communication.", "type" : "Publication", "year" : "1994", "label" : "555a8132be3cafed7236d25f1fb8a4ef", "key" : "Lovasz:Personal" }, { "journal" : "Discrete Mathematics", "pub-type" : "article", "uri" : "urn:393fcd54b50f873473d384943bec9f07", "pages" : "383-390", "date" : "1975", "author" : "Lov?sz, L?szl?", "volume" : "13", "type" : "Publication", "year" : "1975", "label" : "On the Ratio of Optimal Integral and Fractional Covers", "key" : "Lovasz:SetCover" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:3d0492ce3c83fbd764a7a352bdf3dd9c", "pages" : "1036--1053", "date" : "1986", "author" : "Luby, Michael G.", "volume" : "15", "type" : "Publication", "year" : "1986", "label" : "A Simple Parallel Algorithm for the Maximal Independent Set Problem", "key" : "Luby:pairwise" }, { "journal" : "Algorithmica", "pub-type" : "article", "uri" : "urn:37a3bd2eb79fd4fa91fca0d7cbdae76d", "pages" : "551--567", "date" : "1989", "author" : [ "Luby, Michael G.", "Ragde, Prabakar" ], "volume" : "4", "type" : "Publication", "year" : "1989", "label" : "A Bidirectional Shortest-path Algorithm with Good Average Case Behavior", "key" : "Luby:Paths" }, { "pub-type" : "techreport", "institution" : "International Computer Science Institute", "uri" : "urn:6575061270af3fc30577baab81f5c944", "date" : "1993-02", "number" : "TR-093-007", "author" : [ "Luby, Michael G.", "Naor, Joseph", "Naor, Moni" ], "month" : "February", "year" : "1993", "type" : "Publication", "label" : "On Removing Randomness from a Parallel Algorithm for Minimum Cuts", "key" : "Luby:Mincut" }, { "journal" : "TAMS: Transactions of the American Mathematical Society", "pub-type" : "article", "uri" : "urn:772339611bee052ae88bdfa9b4ddc83c", "date" : "1994", "author" : [ "Luczak", "Pittel, Boris", "Wierman" ], "volume" : "341", "year" : "1994", "type" : "Publication", "label" : "The Structure of a Random Graph at the Point of the Phase Transition", "key" : "Luczak:PhaseTransition" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:b6ada4c1e2328bcf90e039bd51979c1c", "pages" : "286--293", "date" : "1993-05", "place" : "San Diego, CA", "author" : [ "Lund, Carsten", "Yannakakis, Mihalis" ], "editor" : "Alok Aggarwal", "month" : "May", "type" : "Publication", "year" : "1993", "label" : "On the Hardness of Approximating Minimization Problems", "key" : "LuYa" }, { "crossref" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "type" : "Publication", "author" : [ "Lund, Carsten", "Yannakakis, Mihalis" ], "editor" : "Alok Aggarwal", "uri" : "urn:61d66dd73492ad08273779475b9294ca", "label" : "On the Hardness of Approximating Minimization Problems", "venue" : "STOC", "place" : "San Diego, CA", "pages" : "286--293", "year" : "1993", "booktitle" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "id" : "61d66dd73492ad08273779475b9294ca", "publisher" : "ACM Press", "pub-type" : "inproceedings", "date" : "1993-05", "month" : "May", "organization" : "ACM", "key" : "LY" }, { "crossref" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "type" : "Publication", "author" : [ "Lund, Carsten", "Yannakakis, Mihalis" ], "editor" : "Alok Aggarwal", "uri" : "urn:f06d3c6f0789479871e7daece6999d19", "label" : "On the Hardness of Approximating Minimization Problems", "venue" : "STOC", "place" : "San Diego, CA", "pages" : "286--293", "year" : "1993", "booktitle" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "id" : "f06d3c6f0789479871e7daece6999d19", "publisher" : "ACM Press", "pub-type" : "inproceedings", "date" : "1993-05", "month" : "May", "organization" : "ACM", "key" : "Lund:Coloring" }, { "journal" : "Annales Discr. Math.", "pub-type" : "article", "uri" : "urn:84ade2c9fe40ae3df650a222fd35bd5b", "pages" : "145--164", "date" : "1978", "author" : "Mader, W.", "volume" : "3", "type" : "Publication", "year" : "1978", "label" : "A reduction method for edge-connectivity in graphs", "key" : "Mader:Connectivity" }, { "journal" : "Math. Ann.", "pub-type" : "article", "uri" : "urn:02694d75c812b4cca371d858b4f9e07c", "pages" : "154--168", "date" : "1968", "author" : "Mader, W.", "volume" : "178", "type" : "Publication", "year" : "1968", "label" : "Homomorphies?tze f?r Graphen", "key" : "Mader:CliqueMinors" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$36^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "4f92a6a10a0562a42ae5d18c125dff20", "uri" : "urn:bb8d8f8df3ab4920bcc7f7d74fd9e181", "pages" : "162--169", "date" : "1995-10", "place" : "Milwaukie, WI", "author" : [ "Mahajan, Sanjeev", "Ramesh, H." ], "month" : "October", "type" : "Publication", "year" : "1995", "label" : "Derandomizing Semidefinite Programming Based Approximation Algorithms", "key" : "Mahajan:DerandomizeSemidefinite" }, { "publisher" : "Plenum Press", "journal" : "Problems in Information Transmission", "pub-type" : "article", "uri" : "urn:71c8b147da0567790c980bba59c5ac33", "pages" : "325-332", "date" : "1975", "author" : "Margulis, G. A.", "volume" : "9", "type" : "Publication", "year" : "1975", "label" : "Probabilistic Characteristics of Graphs with Large Connectivity (translated from Russian)", "address" : "New York", "key" : "Margulis" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$28^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$28^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:a1db9941520adf058a556a26958aaf8b", "pages" : "249-251", "date" : "1987", "author" : "Matula, D. W.", "type" : "Publication", "year" : "1987", "label" : "Determining Edge Connectivity in {$O(nm)$}", "key" : "Matula:Connectivity" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "venue" : "SODA", "crossref" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "uri" : "urn:678b155b7bae650742cbb2a91baa2d49", "pages" : "500--504", "date" : "1993-01", "place" : "Austin, TX", "author" : "Matula, D. W.", "month" : "January", "type" : "Publication", "year" : "1993", "label" : "A Linear Time $2+\\epsilon$ Approximation Algorithm for Edge Connectivity", "key" : "Matula:Approxcut" }, { "pub-type" : "techreport", "institution" : "DIMACS", "uri" : "urn:ba9554b7673352596e4896a35d9cd007", "date" : "1991", "number" : "91-30", "author" : "McGeoch, C. C.", "year" : "1991", "note" : "to appear in Algorithmica.\\typeout{MCGEOCH:PATHS APPEARED?}", "type" : "Publication", "label" : "A New All-pairs Shortest-path Algorithm", "key" : "Mcgeoch:Paths" }, { "journal" : "Fundam. Math.", "pub-type" : "article", "uri" : "urn:5431f39bb90f2950b8538f59beac5f59", "pages" : "96--155", "date" : "1927", "author" : "Menger, K.", "vulome" : "10", "type" : "Publication", "year" : "1927", "label" : "Zur allgemeinem Kurventheorie", "key" : "Menger" }, { "journal" : "Journal of the London Mathematical Society", "pub-type" : "article", "uri" : "urn:f122e3946bd193c9727a3eb3438c3662", "pages" : "204--206", "date" : "1968", "author" : "Milner, E. C.", "volume" : "43", "type" : "Publication", "year" : "1968", "label" : "A Combinatorial Theorem on Systems of Sets", "key" : "milner" }, { "journal" : "Management Science", "pub-type" : "article", "uri" : "urn:2431a821db08afd9fd77e7b1a01d4c26", "pages" : "102--109", "date" : "1968", "author" : "Moore, J. M.", "volume" : "15", "type" : "Publication", "year" : "1968", "label" : "An {$n$}-Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs", "key" : "Moore:1.Lmax" }, { "pub-type" : "unpublished", "uri" : "urn:460b2851fba535f0bdb5b5c913cccdd7", "date" : "1993", "author" : [ "Motwani, Rajeev", "Naor, Joseph" ], "type" : "Publication", "year" : "1993", "note" : "Manuscript.", "label" : "On Exact and Approximate Cut Covers of Graphs", "key" : "cutcover" }, { "publisher" : "Cambridge University Press", "id" : "f9a835b4b18f329464ea1eea3b5252ba", "pub-type" : "book", "uri" : "urn:f9a835b4b18f329464ea1eea3b5252ba", "date" : "1995", "author" : [ "Motwani, Rajeev", "Raghavan, Prabhakar" ], "year" : "1995", "type" : "Publication", "label" : "Randomized Algorithms", "address" : "New York, NY", "key" : "Motwani:RandomizedAlgorithms" }, { "journal" : "Journal of Computer and System Sciences", "pub-type" : "article", "uri" : "urn:4d5965cf7c6a8a2a04dc1cff261b3332", "date" : "1994", "author" : [ "Motwani, Rajeev", "Naor, Joseph", "Naor, Moni" ], "volume" : "49", "year" : "1994", "type" : "Publication", "label" : "The Probabilistic Method Yields Deterministic Parallel Algorithms", "key" : "Motwani:DerandomizeLogWay" }, { "publisher" : "Prentice Hall", "pub-type" : "book", "uri" : "urn:d665183b567625dd5aa2e634da2e4ef2", "date" : "1994", "author" : "Mulmuley, Ketan", "type" : "Publication", "year" : "1994", "label" : "Computational Geometry", "address" : "Englewood Cliffs, New Jersey", "key" : "Mulmuley" }, { "journal" : "Combinatorica", "pub-type" : "article", "uri" : "urn:05005d3664783834d82f8a5aac1efa81", "pages" : "105-113", "date" : "1987", "number" : "1", "author" : [ "Mulmuley, Ketan", "Vazirani, Umesh V.", "Vazirani, Vijay V." ], "volume" : "7", "type" : "Publication", "year" : "1987", "label" : "Matching is as Easy as Matrix Inversion", "key" : "Mulmuley:Matching" }, { "pub-type" : "techreport", "uri" : "urn:0bd5630230246d6255868970d4cf76be", "date" : "1994", "number" : "94007", "place" : "Kyoto University, Kyoto, Japan", "author" : [ "Nagamochi, Hiroshi", "Nishimura, Kazuhiro", "Ibaraki, Toshihide" ], "type" : "Publication", "year" : "1994", "label" : "A Tight Upper Bound on the Number of Small Cuts in a Graph", "key" : "Nagamochi:Approxcut" }, { "pub-type" : "techreport", "institution" : "Kyoto University", "uri" : "urn:1f71898d80d4bd10ea9f3ae67d12e786", "date" : "1994", "number" : "94007", "author" : [ "Nagamochi, Hiroshi", "Nishimura, Kazuhiro", "Ibaraki, Toshihide" ], "year" : "1994", "type" : "Publication", "label" : "Computing all Small Cuts in an Undirected Network", "address" : "Kyoto, Japan", "key" : "Nagamochi:CountCuts" }, { "journal" : "Mathematical Programming", "pub-type" : "article", "uri" : "urn:cc1ae848a0b596db016513c5f5d2c955", "pages" : "297--324", "date" : "1994", "author" : [ "Nagamochi, Hiroshi", "Ono, T.", "Ibaraki, Toshihide" ], "volume" : "67", "type" : "Publication", "year" : "1994", "label" : "Implementing an Efficient Minimum Capacity Cut Algorithm", "key" : "Nagamochi:Implementation" }, { "journal" : "Algorithmica", "pub-type" : "article", "uri" : "urn:8ca9b3d6e97deb0159593504d4e5d37f", "pages" : "583-596", "date" : "1992", "author" : [ "Nagamochi, Hiroshi", "Ibaraki, Toshihide" ], "volume" : "7", "type" : "Publication", "year" : "1992", "label" : "Linear Time Algorithms for Finding {$k$}-Edge Connected and {$k$}-Node Connected Spanning Subgraphs", "key" : "Nagamochi:Connectivity" }, { "journal" : "{SIAM} Journal on Discrete Mathematics", "pub-type" : "article", "uri" : "urn:283984406dd5d61c04f6618c069a01df", "pages" : "54-66", "date" : "1992-02", "number" : "1", "author" : [ "Nagamochi, Hiroshi", "Ibaraki, Toshihide" ], "volume" : "5", "month" : "February", "type" : "Publication", "year" : "1992", "label" : "Computing Edge Connectivity in Multigraphs and Capacitated Graphs", "key" : "Nagamochi:Mincut" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$28^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$28^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:d2271c6ecf8b3533e5c61a0d527d77e5", "pages" : "64--73", "date" : "1996-05", "place" : "Philadelphia, PA", "author" : [ "Nagamochi, Hiroshi", "Ibaraki, T." ], "editor" : "Gary Miller", "month" : "May", "type" : "Publication", "year" : "1996", "label" : "Deterministic {$\\Olog(nm)$}-time edge splitting in undirected graphs", "key" : "Nagamochi:Splitting" }, { "journal" : "Information Processing Letters", "pub-type" : "article", "uri" : "urn:c4509aae16b3fd85f5ca56471a0676fe", "pages" : "279--285", "date" : "1989", "author" : [ "Nagamochi, Hiroshi", "Ibaraki, Toshihde" ], "volume" : "31", "type" : "Publication", "year" : "1989", "label" : "On max-flow min-cut and integral flow properties for multicommodity flows in directed networks", "key" : "Nagamochi:MultiFlow" }, { "publisher" : "Springer-Verlag", "booktitle" : "Proceedings of the $2^{nd}$ Workshop on Algorithms and Data Structures", "pub-type" : "inproceedings", "uri" : "urn:862dc9015fb5c6c88a326e00e18b7d2a", "pages" : "273-285", "date" : "1991-08", "author" : [ "Naor, Dalit", "Vazirani, Vijay V." ], "series" : "Lecture Notes in Computer Science", "volume" : "519", "editor" : "F. Dehne and J. R. Sack and N. Santoro", "month" : "August", "type" : "Publication", "year" : "1991", "label" : "Representing and Enumerating Edge Connectivity Cuts in {$\\RNC$}", "key" : "Naor:Cactus" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$31^{st}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$31^{st}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:1f93acce448c4c181063f8a2d411662c", "pages" : "698--707", "date" : "1990-10", "author" : [ "Naor, Dalit", "Gusfield, Dan", "Martel, Charles" ], "month" : "October", "type" : "Publication", "year" : "1990", "label" : "A fast algorithm for optimally increasing the edge connectivity", "key" : "Naor:Augmentation" }, { "journal" : "Journal of the London Mathematical Society", "pub-type" : "article", "uri" : "urn:c4953f871b1a29c15f0bc090853a87f3", "pages" : "445-450", "date" : "1961", "author" : "Nash-Williams, C. St. J. A.", "volume" : "36", "type" : "Publication", "year" : "1961", "label" : "Edge Disjoint Spanning Trees of Finite Graphs", "key" : "Nash:Trees" }, { "publisher" : "Academic Press", "booktitle" : "Recent Progress in Combinatorics", "pub-type" : "incollection", "uri" : "urn:fa3c21e76569c13162dbdd14eb6e01e7", "pages" : "133-149", "date" : "1969", "author" : "Nash-Williams, C. St. J. A.", "editor" : "W. T. Tutte", "type" : "Publication", "year" : "1969", "label" : "Well-balanced Orientations of Finite Graphs and Unobtrusive Odd-vertex-pairings", "address" : "New York", "key" : "Nash:Orientation" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$33^{rd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "5ed72fd951313adbaa6f4fea39148a0b", "uri" : "urn:66ff1bfbb69002119293656304ae487f", "pages" : "24-29", "date" : "1992-10", "place" : "Pittsburgh, PA", "author" : [ "Nisan, Noam", "Szemeredi, Endre", "Wigderson, Avi" ], "month" : "October", "type" : "Publication", "year" : "1992", "label" : "Undirected Connectivity in {$O(\\log^{1.5} n)$} Space", "key" : "Nisan:Connectivity" }, { "journal" : "Theoretical Computer Science", "pub-type" : "article", "uri" : "urn:0f906e27f103dcb874818c67123bb53f", "pages" : "135--144", "date" : "1993", "author" : "Nisan, Noam", "volume" : "107", "type" : "Publication", "year" : "1993", "note" : "A preliminary version appeared in {\\it Proceedings of the $5^{th}$ IEEE Structure in Complexity Theory Conference}, 1990", "label" : "On Read-once vs. Multiple Access to Randomness in Logspace", "key" : "Nisan93" }, { "journal" : "Combinatorica", "pub-type" : "article", "uri" : "urn:7e87ea3da3e93b63fc209eaa17b861e7", "pages" : "449--461", "date" : "1992", "number" : "4", "author" : "Nisan, Noam", "volume" : "12", "type" : "Publication", "year" : "1992", "note" : "A preliminary version appeared in Proceedings of the {$22^{nd}$} {ACM} Symposium on Theory of Computing", "label" : "Pseudorandom Generators for Space-bounded Computation", "key" : "Nisan92" }, { "journal" : "Mathematical Programming", "pub-type" : "article", "uri" : "urn:58cc7c5b01a12d3a73551957998a4de1", "pages" : "19--39", "date" : "1990", "author" : [ "Padberg, Manfred", "Rinaldi, Giovanni" ], "volume" : "47", "type" : "Publication", "year" : "1990", "label" : "An Efficient Algorithm for the Minimum Capacity Cut Problem", "key" : "Padberg:Mincut" }, { "journal" : "I.N.F.O.R: Canadian Journal of Operations Research and Information Processing", "pub-type" : "article", "uri" : "urn:1206c8d30e37779eb5b1e4273b56aa13", "pages" : "394--422", "date" : "1982-11", "author" : [ "Picard, Jean-Claude", "Queyranne, Maurice" ], "volume" : "20", "month" : "November", "type" : "Publication", "year" : "1982", "label" : "Selected Applications of Minimum Cuts in Networks", "key" : "Picard:Mincut" }, { "journal" : "Networks", "pub-type" : "article", "uri" : "urn:f9b7563c4cd3428df5700d85426c9632", "pages" : "357-370", "date" : "1975", "author" : [ "Picard, Jean-Claude", "Ratliff, H.D." ], "volume" : "5", "type" : "Publication", "year" : "1975", "label" : "Minimum Cuts and Related Problems", "key" : "Picard:Stcut" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$24^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$24^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:9732c21c3f90072dc76688ed813caf9f", "pages" : "402--411", "date" : "1992-05", "place" : "Victora, BC, Canada", "author" : [ "Phillips, Steven", "Westbrook, Jeffrey" ], "month" : "May", "type" : "Publication", "year" : "1992", "label" : "Online Load Balancing and Network Flow", "key" : "Phillips:Flow" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:15ac84317be83249b6a3650ca5f4cc9e", "pages" : "495--504", "date" : "1991-10", "place" : "San Juan, Puerto Rico", "author" : [ "Plotkin, Serge", "Shmoys, David", "Tardos, ?va" ], "month" : "October", "type" : "Publication", "year" : "1991", "label" : "Fast Approximation Algorithms for Fractional Packing and Covering Problems", "key" : "Plotkin:Packing" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$5^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "venue" : "SODA", "crossref" : "Proceedings of the {$5^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "uri" : "urn:05ec26042155c2ace71f40c39f8ee3b1", "pages" : "462--470", "date" : "1994-01", "place" : "Arlington, VA", "author" : [ "Plotkin, Serge", "Rao, Satish", "Smith, W." ], "editor" : "Daniel D. Sleator", "month" : "January", "type" : "Publication", "year" : "1994", "label" : "Shallow excluded minors and improved decompositions", "key" : "Plotkin:ExcludedMinors", "annote" : "The paper by Alon Seymour and Thomas is beautiful stuff. We use essentially the same proof in Plotkin Rao Smith..with a (I think) clearer explanation." }, { "booktitle" : "Proceedings of the ACM SPAA", "pub-type" : "inproceedings", "uri" : "urn:8d278dc04ee1272e64a7cb7242a95cb2", "pages" : "311-320", "date" : "1997-06", "author" : [ "Plaxton, C.", "Rajaraman, R.", "Richa, A." ], "month" : "June", "type" : "Publication", "year" : "1997", "label" : "Accessing nearby copies of replicated objects in a distributed environment", "address" : "Newport, Rhode Island", "key" : "Plaxton:Neighbor" }, { "journal" : "Vopr. Kibern.", "pub-type" : "article", "uri" : "urn:af6a70c3bfe18d83e11d34dc6a6f1bee", "pages" : "136", "date" : "1973", "author" : "Podderyugin, V. D.", "volume" : "2", "type" : "Publication", "year" : "1973", "label" : "An Algorithm for finding the edge connectivity of graphs", "key" : "Podderyugin:Connectivity" }, { "journal" : "ieeetc", "pub-type" : "article", "uri" : "urn:6be4da2e2ddafdc02c1e7ed1645b9dba", "pages" : "1425--1439", "date" : "1987", "author" : [ "Polychronopoulos, C.", "Kuck, D." ], "volume" : "12", "type" : "Publication", "year" : "1987", "label" : "Guided self-scheduling: A practical scheduling scheme for parallel computers", "key" : "PolychronopoulosK87" }, { "journal" : "Problems of Information Transmition", "pub-type" : "article", "uri" : "urn:95bba2b11f571a0a8b38c416c5e97451", "pages" : "86--97", "date" : "1990", "author" : "Polesskii, V. P.", "volume" : "27", "type" : "Publication", "year" : "1990", "label" : "Bounds on the Connectedness Probability of a Random Graph", "key" : "Polesskii:MatroidReliability", "no" : "2" }, { "journal" : "Problems of Information Transmission (translated from Problemy Peredachi Informatsii (Russian))", "pub-type" : "article", "uri" : "urn:f7c10b4c7c536a2abbddfd6bc3772c6c", "date" : "1994", "author" : "Polesski, V. P.", "volume" : "29", "year" : "1994", "type" : "Publication", "label" : "Lower Bounds on Full Rank Probability in Random Matroids", "key" : "Polesski94" }, { "journal" : "Discrete Mathematics", "pub-type" : "article", "uri" : "urn:6b52ee3e0f1707de2d546af59e5431d2", "pages" : "359--364", "date" : "1976", "author" : "P\\`osa, L.", "volume" : "14", "type" : "Publication", "year" : "1976", "label" : "Hamiltonian Circuits in Random Graphs", "key" : "Posa:Hamiltonian" }, { "journal" : "Bell System Technical Journal", "pub-type" : "article", "uri" : "urn:09dce54f5f608e979a1bc30483966acc", "pages" : "1389-1401", "date" : "1957", "author" : "Prim, R. C.", "volume" : "36", "type" : "Publication", "year" : "1957", "label" : "Shortest Connection Networks and Some Generalizations", "key" : "Prim:MST" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:b7839a06b8cf84030e41195604dc1369", "pages" : "777--788", "date" : "1983", "number" : "4", "author" : [ "Provan, J. Scott", "Ball, Michael O." ], "volume" : "12", "type" : "Publication", "year" : "1983", "label" : "The Complexity of Counting Cuts and of Computing the Probability that a Network Remains Connected", "key" : "Provan:Reliability" }, { "journal" : "Information and Computation", "pub-type" : "article", "uri" : "urn:87d5b821f8b9199e0b3c5cab479ed5fd", "pages" : "103--127", "date" : "1991", "number" : "1", "author" : [ "Pruhs, Kirk", "Manber, Udi" ], "volume" : "91", "type" : "Publication", "year" : "1991", "label" : "The Complexity of Controlled Selection", "key" : "Pruhs:Selection" }, { "pub-type" : [ "techreport", "Research Report" ], "institution" : "Computer Science/Mathematics IBM Research Division", "uri" : "urn:ce585078dfcedaeb00092c8f88e0864e", "date" : "1990", "number" : "RC 15340 (\\ # 68237)", "author" : "Raghavan, Prabhakar", "type" : "Publication", "year" : "1990", "label" : "Lecture Notes on Randomized Algorithms", "address" : "T. J. Watson Research Center, Yorktown Heights, NY", "key" : "Raghavan:Randomization" }, { "journal" : "Journal of Computer and System Sciences", "pub-type" : "article", "uri" : "urn:fcc18706339475ac8cd5af6d71ccbb66", "pages" : "130--43", "date" : "1988-10", "number" : "2", "author" : "Raghavan, Prabhakar", "volume" : "37", "month" : "October", "type" : "Publication", "year" : "1988", "label" : "Probabilistic Construction of Deterministic Algorithms: Approximate Packing Integer Programs", "key" : "Raghavan:DeterministicRounding" }, { "journal" : "Combinatorica", "pub-type" : "article", "uri" : "urn:cd9660ec7e08e9083cb858db9ec29ef3", "pages" : "365--374", "date" : "1987", "number" : "4", "author" : [ "Raghavan, Prabhakar", "Thompson, C. D." ], "volume" : "7", "type" : "Publication", "year" : "1987", "label" : "Randomized Rounding: a Technique for Provably Good Algorithms and Algorithmic Proofs", "key" : "Raghavan:RandomizedRounding" }, { "pub-type" : "unpublished", "uri" : "urn:6d5bf2f3b555b65f3727b855856f9544", "date" : "1987", "author" : "Ramachandran, Vijaya", "type" : "Publication", "year" : "1987", "note" : "Manuscript.", "label" : "Flow Value, Minimum Cuts and Maximum Flows", "key" : "Ramachandran:Flow" }, { "journal" : "Mathematical Programming", "pub-type" : "article", "uri" : "urn:4d630186395290afee22b6a49fb4a6ae", "pages" : "253--61", "date" : "1987-12", "number" : "3", "author" : [ "Ramanathan, A.", "Colbourn, Charles" ], "volume" : "39", "month" : "December", "type" : "Publication", "year" : "1987", "label" : "Counting Almost Minimum Cutsets with Reliability Applications", "key" : "Ramanathan:EnumerateCuts" }, { "publisher" : "Springer-Verlag", "pub-type" : "book", "uri" : "urn:8f90d0020eea2d5942ba716e0c4cded4", "date" : "1989", "number" : "6", "author" : "Recski, Andr?s", "series" : "Algorithms and Combinatorics", "type" : "Publication", "year" : "1989", "label" : "Matroid Theory and its Applications In Electric Network Theory and in Statics", "address" : "Berlin", "key" : "Recski:Matroid" }, { "id" : "ec4a1379a73bb192ba75c5054112a50c", "booktitle" : "Proceedings of the {$12^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "uri" : "urn:ec4a1379a73bb192ba75c5054112a50c", "pages" : "385-397", "date" : "1980", "author" : [ "Reif, John H.", "Spirakis, P." ], "type" : "Publication", "year" : "1980", "label" : "Random Matroids", "key" : "Reif:Matroid" }, { "publisher" : "ACM Press", "journal" : "ACM Trans. Comput.-Hum. Interact.", "pub-type" : "article", "uri" : "urn:0672ee4d4dbd7df97c0724846ecfff43", "pages" : "156--180", "date" : "2004", "number" : "2", "author" : [ "Ravasio, Pamela", "Sch\\\"ar, Sissel Guttormsen", "Krueger, Helmut" ], "volume" : "11", "doi" : "http://doi.acm.org/10.1145/1005361.1005363", "type" : "Publication", "year" : "2004", "label" : "In pursuit of desktop evolution: User problems and practices with modern desktop systems", "issn" : "1073-0516", "address" : "New York, NY, USA", "key" : "Ravasio:Desktops" }, { "booktitle" : "ACM 1994 Conference on Computer Supported Cooperative Work", "pub-type" : "inproceedings", "uri" : "urn:7e7420dace8a250c8eba98951120ef93", "pages" : "175--186", "date" : "1994", "author" : [ "Resnick, Paul", "Iacovou, Neophytos", "Bergstrom, Mitesh Suchak andPeter", "Riedl, John" ], "type" : "Publication", "note" : "server at {\\tt http://www.cs.umn.edu/Research/GroupLens/}", "year" : "1994", "label" : "GroupLens: An Open Architecture for Collaborative Filtering of Netnews", "address" : "Chapel Hill, NC", "key" : "Resnick:GroupLens" }, { "publisher" : "Elsevier", "pub-type" : "book", "uri" : "urn:9f851e82674bea91fdea50fc94b02af8", "date" : "1970", "author" : "R?nyi, A.", "type" : "Publication", "year" : "1970", "label" : "Probability Theory", "address" : "New York", "key" : "renyi" }, { "booktitle" : "Proceedings of the {$16^{th}$} Annual International {ACM} {SIGIR} Conference on Research and Development in Information Retrieval", "pub-type" : "inproceedings", "uri" : "urn:9242f0c67aafbbd16deb5fcd64e4752f", "pages" : "260--269", "date" : "1993-06", "author" : [ "Rose, Daniel E.", "Mander, Richer", "Oren, Tim", "Poncele\\\'on, Dulce B.", "Salomon, Gitta", "Wong, Yin Yin" ], "month" : "June", "type" : "Publication", "year" : "1993", "label" : "Content Awareness in a File System interface: Implementing the \'Pile\' Metaphor for Organizing Information", "key" : "Rose:Piles" }, { "journal" : "Communications of the ACM", "pub-type" : "article", "uri" : "urn:f9b09b6ab9bfa5474f521a66ca538da5", "pages" : "97--108", "date" : "1994-02", "number" : "2", "author" : [ "Salton, Gerard", "Allan, James", "Buckley, Chris" ], "volume" : "37", "month" : "February", "type" : "Publication", "year" : "1994", "label" : "Automatic Structuring and Retrieval of Large Text Files", "key" : "Salton:SMART-CACM" }, { "publisher" : "IEEE Computer Society Press", "booktitle" : "Proceedings of the 32nd Annual Symposium on Foundations of Computer Science", "pub-type" : "inproceedings", "uri" : "urn:3ed0f0205f6efd49a7db507aac44b17e", "pages" : "743--751", "date" : "1991-10", "author" : [ "Saran, H.", "Vazirani, V. V." ], "editor" : "IEEE", "month" : "October", "type" : "Publication", "year" : "1991", "isbn" : "0-8186-2445-0", "label" : "Finding $k$-Cuts Within Twice the Optimal", "address" : "San Juan, Porto Rico", "key" : "Saran:Multicut" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:2c4f9fccacabae6b2e7dc9d95aa44bd4", "pages" : "1253-1262", "date" : "1988-12", "author" : [ "Schieber, Baruch", "Vishkin, Uzi" ], "volume" : "17", "month" : "December", "type" : "Publication", "year" : "1988", "label" : "On Finding Lowest Common Ancestors: Simplification and Parallelization", "key" : "Schieber:LCA", "no" : "6" }, { "publisher" : "John Wiley \\& Sons", "pub-type" : "book", "uri" : "urn:1b80ca32818095e8c1e3ab94cb9c5c57", "cite" : "New York", "date" : "1986", "author" : "Schrijver, Alexander", "series" : "Wiley-Interscience Series in Discrete Mathematics", "type" : "Publication", "year" : "1986", "label" : "Theory of Linear and Integer Programming", "key" : "Schrijver:LP" }, { "publisher" : "Mathematical Centre", "pub-type" : "book", "uri" : "urn:65dec447d043bcba5625b58552fc9954", "date" : "1979", "number" : "106", "series" : "Mathematical Centre Tracts", "editor" : "Alexander Schrijver", "type" : "Publication", "year" : "1979", "label" : "Packing and Covering in Combinatorics", "address" : "Amsterdam", "key" : "Schrijver:Packing" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$24^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$24^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:2701006ff3e665f8fbffe9481d0e2696", "pages" : "745--749", "date" : "1992-05", "place" : "Victora, BC, Canada", "author" : "Seidel, Raimund", "month" : "May", "type" : "Publication", "year" : "1992", "label" : "On the All-Pairs-Shortest-Path Problem", "key" : "Seidel:Paths" }, { "journal" : "Journal of Algorithms", "pub-type" : "article", "uri" : "urn:a340f04362534419f2c78ad98b4c37ee", "pages" : "57-67", "date" : "1982", "author" : [ "Shiloach, Y.", "Vishkin, Uzi" ], "volume" : "3", "type" : "Publication", "year" : "1982", "label" : "An {$O(\\log n)$} Parallel Connectivity Algorithm", "key" : "Shiloach:Connectivity" }, { "journal" : "Journal of Algorithms", "pub-type" : "article", "uri" : "urn:cedf9b270bd748947369308bc5e3ef7b", "pages" : "128--146", "date" : "1982", "author" : [ "Shiloach, Y.", "Vishkin, Uzi" ], "volume" : "3", "type" : "Publication", "year" : "1982", "label" : "An ${O}(n^2 \\log n)$ Parallel Max-Flow Algorithm", "key" : "Shiloach:Flow" }, { "publisher" : "AMS", "booktitle" : "Computing Near-Optimal Solutions to Combinatorial Optimization Problems", "pub-type" : "incollection", "uri" : "urn:31032703a636fa4e8ba0782598e921fe", "pages" : "355--397", "date" : "1995", "author" : "Shmoys, David", "series" : " DIMACS Series in Discrete Math and Theoretical Computer Science", "editor" : "William Cook andL?szl? Lov?szand Paul D. Seymour", "type" : "Publication", "year" : "1995", "label" : "Combinatorial Optimization", "key" : "Shmoys:Approximation" }, { "journal" : "Journal of Computer and System Sciences", "pub-type" : "article", "uri" : "urn:bab9136e6cd92bcb574f12d62ba2afb0", "pages" : "362--391", "date" : "1983-06", "number" : "3", "author" : [ "Sleator, Daniel D.", "Tarjan, Robert E." ], "volume" : "26", "month" : "June", "type" : "Publication", "year" : "1983", "label" : "A Data Structure for Dynamic Trees", "key" : "Sleator:DynamicTrees" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:e70cc8d51214621dd27196de77656a00", "pages" : "28--32", "date" : "1973", "author" : "Spira, P. M.", "volume" : "2", "type" : "Publication", "year" : "1973", "label" : "A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time {$O(n^2 \\log^2 n)$}", "key" : "Spira:Paths" }, { "booktitle" : "Conference Record, IEEE 14th Annual Symposium on Switching and Automata Theory", "pub-type" : "inproceedings", "uri" : "urn:f2f9c298b1d2dc5e96b4df8e832c5a29", "date" : "1973", "author" : [ "Spira, P. M.", "Pan, A." ], "type" : "Publication", "year" : "1973", "label" : "On Finding and Updating Shortest Paths and Spanning Trees", "key" : "SpiraPan:Paths" }, { "references" : "\\cite{SICOMP::AhujaOT1989} \\cite{IPL::Alon1990} \\cite{ICALP::CheriyanHM1990} \\cite{JACM::FredmanT1987} \\cite{JACM::GoldbergT1988} \\cite{SODA::HaoO1992} \\cite{STOC::KargerS1993} \\cite{SODA::Matula1993} \\cite{CACM::MehlhornN1995} \\cite{ALGOR::NagamochiI1992} \\cite{SODA::Queyranne1995}", "number" : "4", "type" : "Publication", "author" : [ "Stoer, Mechthild", "Wagner, Frank" ], "uri" : "urn:a8986a1560a107c1b371a2900a8e135d", "label" : "A Simple Min-Cut Algorithm", "keywords" : "Min-Cut", "general-terms" : "Algorithms", "pages" : "585--591", "year" : "1997", "journal" : "Journal of the ACM", "volume" : "44", "pub-type" : "article", "area" : "Data Structures and Algorithms", "date" : "1997-07", "month" : "July", "cr-categories" : "G.1.2[graph algorithms]", "key" : "Stoer:Mincut" }, { "pub-type" : "misc", "uri" : "urn:be4e5eba28ee734f912f178c5606ff7e", "date" : "1994-03", "author" : "Szegedy, Mario", "month" : "March", "note" : "Personal Communication", "year" : "1994", "type" : "Publication", "howpublished" : "AT\\&T Bell Laboratories", "label" : "be4e5eba28ee734f912f178c5606ff7e", "key" : "Szegedy:Chromatic" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:0ca4d6aef4fc9ed18785a6fe270eaa95", "pages" : "36--39", "date" : "1994-11", "place" : "Santa Fe, NM", "author" : "Szegedy, Mario", "editor" : "Shafi Goldwasser", "month" : "November", "type" : "Publication", "year" : "1994", "label" : "A Note on the $\\theta$ Number of Lov\\\'asz and the Generalized Delsarte Bound", "key" : "Szegedy:Theta" }, { "pub-type" : "misc", "uri" : "urn:43637da1f4d01f1c385c11c7b89a0e25", "date" : "1994", "author" : "Ta-Shma, Amnon", "note" : "Personal Communication.", "type" : "Publication", "year" : "1994", "howpublished" : "Hebrew University, Jerusalem, Israel", "label" : "43637da1f4d01f1c385c11c7b89a0e25", "key" : "Ta-Shma:PComplete" }, { "booktitle" : "Proceedings of the 17th International Workshop on Graph-Theoretic Concepts in Computer Science", "pub-type" : "inproceedings", "uri" : "urn:9b1a10da17404ba9c17f2a782ca4df15", "pages" : "209--213", "date" : "1991", "author" : "Takaoka, T.", "type" : "Publication", "year" : "1991", "label" : "A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem", "key" : "Takaoka:Paths" }, { "publisher" : "{SIAM}", "pub-type" : "book", "uri" : "urn:cd46ec5a260536b15e5ee9efa949a3d6", "date" : "1983", "author" : "Tarjan, Robert E.", "series" : "CBMS-NSF Regional Conference Series in Applied Mathematics", "volume" : "44", "type" : "Publication", "year" : "1983", "label" : "Data Structures and Network Algorithms", "key" : "Tarjan:DataStructures" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:36b71c8e9270ec366361b16a2d6bb29b", "pages" : "690--715", "date" : "1979-10", "number" : "4", "author" : "Tarjan, Robert E.", "volume" : "26", "month" : "October", "type" : "Publication", "year" : "1979", "label" : "Applications of Path Compression on Balanced Trees", "key" : "Tarjan:PathCompression" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$6^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "venue" : "SODA", "crossref" : "Proceedings of the {$6^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "uri" : "urn:375a5e42d5e782a7a5e7d5201665a14b", "pages" : "305--313", "date" : "1995-01", "place" : "San Fransisco, CA", "author" : "Thorup, Mikkel", "month" : "January", "type" : "Publication", "year" : "1995", "label" : "Dynamic Decremental Connectivity", "key" : "Thorup:DecrementalConnectivity" }, { "publisher" : "The {MIT} Press", "booktitle" : "Advances in Neural Information Processing Systems", "pub-type" : "inproceedings", "uri" : "urn:fe7e65c10708293e0392818234cb3d88", "date" : "1998", "author" : "Tennebaum, Joshua B.", "volume" : "10", "year" : "1998", "type" : "Publication", "label" : "Mapping a Manifold of Perceptual Observations", "key" : "Tenenbaum:Manifold" }, { "journal" : "Science", "pub-type" : "article", "uri" : "urn:fd494d4d92e0095cebade87e46c00591", "pages" : "2319--2323", "date" : "2000-12", "number" : "5500", "author" : [ "Tenenbaum, Joshua B.", "de Silva, Vin", "Langford, John C." ], "volume" : "290", "month" : "dec", "type" : "Publication", "year" : "2000", "note" : "See also {\\tt http://isomap.stanford.edu}", "label" : "A Global Geometric Framework for Nonlinear Dimensionality Reduction", "key" : "Tenenbaum:Dimensionality" }, { "crossref" : "6d0df7fe6c2a810e01136e60fabb2543", "type" : "Publication", "author" : [ "Holm, Jacob", "Lichtenberg, Kristian de", "Thorup, Mikkel" ], "address" : "New York", "isbn" : "0-89791-962-9", "uri" : "urn:afdef5ae0b22a919d43b30a371b3ef72", "label" : "Poly-logarithmic Deterministic Fully-dynamic Algorithms for Connectivity, Minimum Spanning tree, 2-edge and Biconnectivity", "venue" : "STOC", "place" : "Dallas, TX", "pages" : "79--89", "year" : "1998", "booktitle" : "Proceedings of the {$29^{th}$} {ACM} Symposium on Theory of Computing", "publisher" : "ACM Press", "pub-type" : "inproceedings", "date" : "1998-05", "month" : "May 23--26", "organization" : "ACM", "key" : "Thorup:DynamicConnectivity" }, { "organization" : "National Institute of Standards and Technology", "pub-type" : "proceedings", "uri" : "urn:db1fbbe080286ef78adaadc5ce8605f6", "date" : "1995", "editor" : "Donna Harman", "note" : "NIST SP 500-236. Web access at {\\tt http://www-nlpir.nist.gov/TREC/}", "type" : "Publication", "year" : "1995", "label" : "The Fourth Text REtrieval Conference", "key" : "TREC4" }, { "publisher" : "MIT Press", "chapter" : "2", "booktitle" : "Handbook of Theoretical Computer Science", "pub-type" : "incollection", "crossref" : "Handbook of Theoretical Computer Science", "uri" : "urn:f1bbbc01110d9555195b97fa075d76ba", "pages" : "3-66", "date" : "1990", "author" : "Boas, Peter van Emde", "volume" : "A", "editor" : "van Leeuwen, Jan", "type" : "Publication", "year" : "1990", "label" : "Machine Models and Simulations", "address" : "Cambridge, MA", "key" : "VEB:MachineModels" }, { "publisher" : "Springer", "pub-type" : "book", "uri" : "urn:89056aa78deff8d810471abbaab57299", "date" : "1937", "author" : "Van Der Waerden, B. L.", "type" : "Publication", "year" : "1937", "label" : "Moderne Algebra", "address" : "Berlin", "key" : "Waerden:Matroid" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:3b3da3de0fe6882c6477e9e59698acab", "pages" : "410--421", "date" : "1979", "author" : "Valiant, Leslie", "volume" : "8", "type" : "Publication", "year" : "1979", "label" : "The Complexity of Enumeration and Reliability Problems", "key" : "Valiant:SharpP" }, { "publisher" : "Springer-Verlag", "booktitle" : "Automata, Languages and Programming. {$19^{th}$} International Colloquium Proceedings", "pub-type" : "inproceedings", "venue" : "ICALP", "crossref" : "e0a43503495b262a9ee9a6f6014384d6", "uri" : "urn:9664e657653067dc1b4f33c865b23e89", "pages" : "366-377", "date" : "1992-07", "author" : [ "Vazirani, Vijay V.", "Yannakakis, Mihalis" ], "series" : "Lecture Notes in Computer Science", "volume" : "623", "month" : "July", "type" : "Publication", "year" : "1992", "label" : "Suboptimal Cuts: Their Enumeration, Weight, and Number", "key" : "Vazirani:EnumerateCuts" }, { "journal" : "Random Structures and Algorithms", "pub-type" : "article", "uri" : "urn:451a5a64a29c0a8f54c9c66bf1c1dca8", "pages" : "187--198", "date" : "1996", "number" : "3", "author" : "Fernandez de la Vega, W.", "volume" : "8", "type" : "Publication", "year" : "1996", "note" : "A preliminary manuscript appeared in 1994", "label" : "{MAXCUT} has a Randomized Approximation Scheme in Dense Graphs", "key" : "Vega:Maxcut" }, { "journal" : "National Bureau of Standards, Applied Math Series", "pub-type" : "article", "uri" : "urn:2581f39c4e58ae3ad73a04022b624a74", "pages" : "36--38", "date" : "1951", "author" : "Neumann, J. Von", "volume" : "12", "type" : "Publication", "year" : "1951", "label" : "Various Techniques Used in connection with random digits", "key" : "VonNeumann:Random" }, { "journal" : "Journal of Computer and System Sciences", "pub-type" : "article", "uri" : "urn:41cc483f3cf16dcbb8b0147434d59925", "pages" : "96--144", "date" : "1987", "author" : [ "Watanabe, T.", "Nakamura, A." ], "volume" : "53", "type" : "Publication", "year" : "1987", "label" : "Edge connectivity augmentation problems", "key" : "Watanabe:Augmentation" }, { "publisher" : "Academic Press", "pub-type" : "book", "uri" : "urn:77dcefc626975e4826f6ab4bcfa0467d", "date" : "1976", "author" : "Welsh, D. J. A.", "series" : "London Mathematical Society Monographs", "editors" : "P. M. Cohn and G. E. H. Reuter", "type" : "Publication", "year" : "1976", "label" : "Matroid Theory", "address" : "London", "key" : "Welsh:Matroid" }, { "journal" : "American Journal of Mathematics", "pub-type" : "article", "uri" : "urn:998dbca4ac8657912db8019bf3cc7815", "pages" : "509--533", "date" : "1935", "author" : "Whitney, Hassler", "volume" : "57", "type" : "Publication", "year" : "1935", "label" : "On the Abstract Properties of Linear Independence", "key" : "Whitney:Matroid" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "inproceedings", "venue" : "STOC", "crossref" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "uri" : "urn:ebb07baab605e865b974204408793639", "pages" : "708-717", "date" : "1993-05", "place" : "San Diego, CA", "author" : [ "Williamson, David", "Goemans, Michel X.", "Mihail, Milena", "Vazirani, Vijay V." ], "editor" : "Alok Aggarwal", "month" : "May", "type" : "Publication", "year" : "1993", "label" : "A Primal-Dual Approximation Algorithm for Generalized {S}teiner Problems", "key" : "Williamson:Steiner1" }, { "journal" : "Information Processing Letters", "pub-type" : "article", "uri" : "urn:734faa6b1676411490922fe9b2302ba4", "pages" : "41--44", "date" : "1996", "author" : [ "Henzinger, Monika", "Williamson, David P." ], "volume" : "59", "type" : "Publication", "year" : "1996", "label" : "On the Number of Small Cuts in a Graph", "key" : "Williamson:CountCuts" }, { "journal" : "Journal of the ACM", "pub-type" : "article", "uri" : "urn:c75952a33c7428b81f1b9ede19656e89", "pages" : "729--735", "date" : "1983", "author" : "Wigderson, Avi", "volume" : "30", "type" : "Publication", "year" : "1983", "label" : "Improving the Performance Guarantee for Approximate Graph Coloring", "key" : "wigderson" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$5^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "venue" : "SODA", "crossref" : "Proceedings of the {$5^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "uri" : "urn:f6b156242a7920277211667a69cdcd3c", "pages" : "223-232", "date" : "1994-01", "place" : "Arlington, VA", "author" : [ "Goemans, Michel X.", "Goldberg, Andrew", "Plotkin, Serge", "Shmoys, David", "Tardos, ?va", "Williamson, David" ], "editor" : "Daniel D. Sleator", "month" : "January", "type" : "Publication", "year" : "1994", "label" : "Improved Approximation Algorithms for Network Design Problems", "key" : "Williamson:Steiner2" }, { "pub-type" : "phdthesis", "uri" : "urn:a0ff9a4739e271c57b83d309e701cb50", "date" : "1993", "school" : "MIT", "author" : "Williamson, David P.", "note" : "published as technical report MIT-LCS-TR-584.", "type" : "Publication", "year" : "1993", "label" : "On the Design of Approximation Algorithms for a Class of Graph Problems", "key" : "Williamson:Thesis" }, { "journal" : "Networks", "pub-type" : "article", "uri" : "urn:ec73d9842f9784b7c39df669aa710dda", "pages" : "129-167", "date" : "1987", "author" : "Winter, Pawel", "volume" : "17", "type" : "Publication", "year" : "1987", "label" : "Generalized {S}teiner Problem in Outerplanar Networks", "key" : "Winter:Steiner" }, { "journal" : "Computer Journal", "pub-type" : "article", "uri" : "urn:e365a8206f6cc03a7f83155fba439c0b", "pages" : "317", "date" : "1969", "author" : "Wood, D. C.", "volume" : "12", "type" : "Publication", "year" : "1969", "label" : "A Technique for Coloring a Graph Applicable to Large-Scale Optimization Problems", "key" : "wood" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$3^{rd}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "inproceedings", "venue" : "SODA", "crossref" : "Proceedings of the {$3^{rd}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "uri" : "urn:19c09e385b13ff9f0dfddda9404a8bb8", "pages" : "1--9", "date" : "1992-01", "author" : "Yannakakis, Mihalis", "month" : "January", "type" : "Publication", "year" : "1992", "label" : "On the Approximation of Maximum Satisfiability", "key" : "Yannakakis:3SAT" }, { "publisher" : "North-Holland Publishing Company", "chapter" : "8", "pub-type" : "book", "uri" : "urn:2356cb141386d39966392889b0ab9b37", "date" : "1981", "author" : "Zimmerman, U.", "series" : "Annals of Discrete Mathematics", "volume" : "10", "type" : "Publication", "year" : "1981", "label" : "Linear and Combinatorial Optimization in Ordered Algebraic Structures", "key" : "Zimmerman" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$25^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$25^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:c0038a265475a42154a4eaa92e7f503e", "pages" : "181--192", "date" : "1984", "author" : [ "Bui, T.", "Chaudhuri, S.", "Leighton, Tom", "Sipser, Michael" ], "type" : "Publication", "year" : "1984", "label" : "Graph Bisection algorithms with good average case behavior", "key" : "BCLS" }, { "journal" : "SIAM Journal on Computing", "pub-type" : "article", "uri" : "urn:5da164089a83f0a2b8e87d5b8ff5ccb1", "pages" : "1149--1178", "date" : "1989", "number" : "6", "author" : [ "Jerrum, M.", "Sinclair, A." ], "volume" : "18", "type" : "Publication", "year" : "1989", "label" : "Approximating the Permanent", "key" : "JS:matching" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$34^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$34^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:d5e9d932bd2915735507a0a6f4214618", "pages" : "94--103", "date" : "1993-11", "place" : "Palo Alto, CA", "author" : [ "Jerrum, M.", "Sorkin, G. B." ], "editor" : "Leonidas Guibas", "month" : "November", "type" : "Publication", "year" : "1993", "label" : "Simulated Annealing for Graph Bisection", "key" : "JS:annealing" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$29^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "inproceedings", "venue" : "FOCS", "crossref" : "Proceedings of the {$29^{th}$} Annual Symposium on the Foundations of Computer Science", "uri" : "urn:91f8d83fb5d749b6c058318b6eb8fc21", "pages" : "422--431", "date" : "1988-10", "author" : [ "Leighton, Tom", "Rao, Satish" ], "month" : "October", "type" : "Publication", "year" : "1988", "label" : "An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms", "key" : "LR" }, { "journal" : "JCSS", "pub-type" : "article", "uri" : "urn:9a50c5b1e10aa0195dbd392f7d7f3078", "pages" : "425--440", "date" : "1991", "number" : "3", "author" : [ "Papadimitriou, Christos", "Yannakakis, Mihalis" ], "volume" : "43", "type" : "Publication", "year" : "1991", "note" : "A preliminary version appeared in Proceedings of the {$20^{th}$} {ACM} Symposium on Theory of Computing", "label" : "Optimization, approximation and complexity classes", "key" : "PY:maxsnp" }, { "optedition" : "", "optvolume" : "", "opteditor" : "", "type" : "Publication", "author" : "Papadimitriou, Christos", "optnote" : "", "uri" : "urn:7ec0d518ef9135ca547f9a9f7ce91675", "optseries" : "", "label" : "Computational Complexity", "optaddress" : "", "year" : "1994", "publisher" : "Addison-Wesley", "optannote" : "", "pub-type" : "book", "optmonth" : "", "date" : "1994", "optnumber" : "", "key" : "Papadimitriou:Complexity", "optkey" : "" }, { "booktitle" : "Proc.\\ 26th STOC", "pub-type" : "inproceedings", "uri" : "urn:e16a0917539a6b3439bc47095660b5ab", "pages" : "422-431", "date" : "1994", "author" : [ "Goemans, M.", "Williamson, D." ], "type" : "Publication", "year" : "1994", "label" : "A 0.878 approximation algorithm for {MAX-2SAT} and {MAX-CUT}", "key" : "GW" }, { "journal" : "Scientific American", "pub-type" : "article", "uri" : "urn:91064226a3a2c31d906cddca0f608f2d", "date" : "2001-05", "author" : [ "Berners-Lee, Tim", "Hendler, James", "Lasilla, Ora" ], "month" : "May", "year" : "2001", "type" : "Publication", "label" : "The Semantic Web", "key" : "Berners-Lee:SemanticWeb" }, { "booktitle" : "Proceedings of the ACM CHI Conference on Human Factors in Computing Systems", "pub-type" : "inproceedings", "uri" : "urn:09656e737348b39a8a953880ea5e0f92", "date" : "1996", "author" : [ "Whittaker, Steve", "Sidner, C." ], "type" : "Publication", "year" : "1996", "label" : "Email Overload: Exploring Personal Information Management of Email", "key" : "Whittaker:Email" }, { "booktitle" : "Proceedings of the ACM CHI Conference on Human Factors in Computing Systems", "pub-type" : "inproceedings", "uri" : "urn:1abe995b09ff999681a174c19cf8364c", "date" : "2003", "author" : [ "Storey, M.", "Best, C.", "Michaud, J.", "Rayside, D.", "Litoiu, M.", "Musen, M." ], "type" : "Publication", "year" : "2003", "label" : "{SHriMP} Views: An Interactive Environment for Information Visualization and Navigation", "key" : "Storey:Shrimp" }, { "booktitle" : "Proceedings of the ACM CHI Conference on Human Factors in Computing Systems", "pub-type" : "inproceedings", "uri" : "urn:73cbea433caf5c5f6db5ba2068450239", "pages" : "41-48", "date" : "1998", "author" : [ "Abrams, D.", "Baecker, R.", "Chignell, M." ], "type" : "Publication", "year" : "1998", "label" : "Information Archiving with Bookmarks: Personal Web Space Construction and Organization", "key" : "Abrams:Bookmarks" }, { "journal" : "ACM Transactions on Information Systems", "pub-type" : "article", "uri" : "urn:7dab32d6d9f1e8e2d876bd90e93d3365", "pages" : "140-170", "date" : "2000-04", "number" : "2", "author" : [ "Dourish, Paul", "Edwards, W. Keith", "LaMarca, Anthony", "Lamping, John", "Petersen, Karin", "Salisbury, Michael", "Terry, Douglas B.", "Thornton, James" ], "volume" : "18", "month" : "April", "type" : "Publication", "year" : "2000", "label" : "Extending Document Management Systems with User-Specific Active Properties", "key" : "Dourish:Presto" }, { "journal" : "ACM Transactions on Office Information Systems", "pub-type" : "article", "uri" : "urn:ff831d6dd1a4d66b8eebd7b31a9d9355", "date" : "1988", "number" : "4", "author" : [ "Lai, Kum-Yew", "Malone, Thomas W." ], "volume" : "6", "type" : "Publication", "year" : "1988", "label" : "ObjectLens: a spreadsheet for cooperative work", "key" : "Lai:ObjectLens" }, { "journal" : "{ACM} Transactions on Information Systems", "pub-type" : "article", "uri" : "urn:62aafb6237328496f531ba3797a0db26", "pages" : "177--205", "date" : "1995-04", "number" : "2", "author" : [ "Malone, Thomas W.", "Lai, Kum-Yew", "Fry, Christopher" ], "volume" : "13", "month" : "April", "type" : "Publication", "year" : "1995", "label" : "Experiments with OVAL: A Radically Tailorable Tool for Cooperative Work", "key" : "Malone:OVAL" }, { "journal" : "SIGMOD Record", "pub-type" : "article", "uri" : "urn:6cbd080106a55303042803f5b04c48dc", "pages" : "80-86", "date" : "1996", "number" : "1", "author" : [ "Freeman, E.", "Gelernter, D." ], "volume" : "25", "type" : "Publication", "year" : "1996", "label" : "Lifestreams: A Storage Model for Personal Data", "key" : "Freeman:LifeStreams" }, { "booktitle" : "Proceedings of the ACM CHI Conference on Human Factors in Computing Systems", "pub-type" : "inproceedings", "uri" : "urn:6a9ba75ff4d5cbe43d87d7ee2bd43551", "date" : "2003", "author" : [ "Kang, H.", "Shneiderman, Ben" ], "type" : "Publication", "year" : "2003", "label" : "MediaFinder: An Interface for Dynamic Personal Media Management with Semantic Regions", "key" : "Kang:MediaFinder" }, { "publisher" : "ACM Press", "booktitle" : "K-CAP \'01: Proceedings of the 1st international conference on Knowledge capture", "pub-type" : "inproceedings", "uri" : "urn:81f4b37b4f10919b0cc777a9e8d83e00", "pages" : "155--162", "date" : "2001-10", "author" : [ "Stojanovic, Nenad", "Maedche, Alexander", "Staab, Steffen", "Studer, Rudi", "Sure, York" ], "doi" : "http://doi.acm.org/10.1145/500737.500762", "month" : "October", "type" : "Publication", "year" : "2001", "isbn" : "1-58113-380-4", "label" : "{SEAL}: a framework for developing SEmantic PortALs", "location" : "Victoria, British Columbia, Canada", "address" : "New York, NY, USA", "key" : "Stojanovic:Seal" }, { "booktitle" : "Proceedings of the World Wide Web Conference", "pub-type" : "inproceedings", "uri" : "urn:39ce38bb5f8ab7003e62259f0ca7cacc", "date" : "2003", "author" : [ "Guha, R.", "McCool, R.", "Miller, Eric" ], "type" : "Publication", "year" : "2003", "label" : "Semantic Search", "key" : "Guha:SemanticSearch" }, { "pub-type" : "unpublished", "uri" : "urn:a34545cb49708f3bab8e27f9ffd95804", "date" : "2002", "author" : [ "Werner, P.", "Liefield, T.", "Gilman, T.", "Apgar, S. Bacon J." ], "type" : "Publication", "year" : "2002", "note" : "http://www.i3c.org/workgroups/technical\\_architecture/resources/lsid/docs/LSIDSyntax9-20-02.htm", "label" : "URN Namespace for Life Science Identifiers", "key" : "Werner:LSID" }, { "pub-type" : "mastersthesis", "uri" : "urn:7e039d10186e7aa37220570113c68835", "date" : "2003-05", "school" : "M.I.T.", "author" : "Huynh, David", "month" : "May", "year" : "2003", "type" : "Publication", "label" : "A User Interface Framework for Supporting Information Management Tasks in Haystack", "key" : "Huynh:Thesis" }, { "pub-type" : "phdthesis", "uri" : "urn:36fb8980317a1cb5d14adf7b50fdf2b5", "date" : "2004-05", "school" : "M.I.T.", "author" : "Quan, Dennis", "month" : "May", "year" : "2004", "type" : "Publication", "label" : "Designing End User Information Environments Built on Semistructured Data Models", "key" : "Quan:Thesis" }, { "pub-type" : "unpublished", "uri" : "urn:07468831c1845d55922f3bf09c41f754", "date" : "2003", "author" : [ "McGuinness, Deborah L.", "Harmelen, Frank van" ], "type" : "Publication", "year" : "2003", "note" : "http://www.w3.org/TR/owl-features/", "label" : "OWL Web Ontology Language Overview", "key" : "McGuinness:OWL" }, { "pub-type" : "unpublished", "uri" : "urn:ae7681299344cfd48df82ce760aa2e52", "date" : "2003", "author" : [ "Manola, Frank", "Miller, Eric" ], "type" : "Publication", "year" : "2003", "note" : "http://www.w3.org/TR/rdf-primer/", "label" : "RDF Primer", "key" : "Manola:RDF" }, { "pub-type" : "unpublished", "uri" : "urn:34e5d4f405bff95d76996c5855db7122", "date" : "2001", "author" : [ "Connolly, Dan", "Harmelen, Frank van", "Horrocks, Ian", "McGuinness, Deborah L.", "Patel-Schneider, Peter F.", "Stein, Lynn Andrea" ], "type" : "Publication", "year" : "2001", "note" : "http://www.w3.org/TR/daml+oil-reference", "label" : "DAML+OIL (March 2001) Reference Description", "key" : "Conolly:DAML" }, { "label" : "IsaViz", "key" : "Pietriga:IsaViz", "type" : "Publication", "pub-type" : "unpublished", "author" : "Pietriga, Emmanuel", "note" : "http://www.w3.org/2001/11/IsaViz/", "uri" : "urn:913b36daab24f9b05ea9bfa0775f9c8a" }, { "booktitle" : "Proceedings of the Third International Conference on Autonomous Agents (Agents \'99)", "pub-type" : "inproceedings", "uri" : "urn:6583d40f775146df1f2f49acf367abc5", "date" : "1999", "author" : [ "Muslea, Ion", "Minton, S.", "Knoblock, Craig" ], "type" : "Publication", "year" : "1999", "label" : "A Hierarchical Approach to Wrapper Induction", "key" : "Muslea:WrapperInduction" }, { "journal" : "SIGMOD Record", "pub-type" : "article", "uri" : "urn:cafa295c487865639822cea0e606549f", "date" : "2001", "number" : "1", "author" : [ "Bosc, P.", "Motro, A.", "Pasi, G." ], "volume" : "30", "type" : "Publication", "year" : "2001", "label" : "Report on the Fourth International Conference on Flexible Query Answering Systems", "key" : "Bosc:FuzzyQuery" }, { "journal" : "CACM", "pub-type" : "article", "uri" : "urn:bf8b60215c88b137a352331dcaa5a24a", "pages" : "377-387", "date" : "1970", "number" : "6", "author" : "Codd, E. F.", "volume" : "13", "type" : "Publication", "year" : "1970", "label" : "A Relational Model of Data for Large Shared Data Banks", "key" : "Codd:Relational" }, { "publisher" : "ACM Press", "booktitle" : "WWW \'02: Proceedings of the 11th international conference on World Wide Web", "pub-type" : "inproceedings", "uri" : "urn:69eb1b96cf46680464a0335f0eba0ea7", "pages" : "704--712", "date" : "2002", "author" : [ "Anderson, Corin R.", "Horvitz, Eric" ], "doi" : "http://doi.acm.org/10.1145/511446.511537", "type" : "Publication", "year" : "2002", "isbn" : "1-58113-449-5", "label" : "Web montage: a dynamic personalized start page", "location" : "Honolulu, Hawaii, USA", "address" : "New York, NY, USA", "key" : "Montage" }, { "publisher" : "ACM Press", "journal" : "ACM Trans. Graph.", "pub-type" : "article", "uri" : "urn:eb93d56ece261d25ded5b4ef5a46c740", "pages" : "211--243", "date" : "1986", "number" : "3", "author" : [ "Henderson, Jr., D. Austin", "Card, Stuart" ], "volume" : "5", "doi" : "http://doi.acm.org/10.1145/24054.24056", "type" : "Publication", "year" : "1986", "label" : "Rooms: the use of multiple virtual workspaces to reduce space contention in a window-based graphical user interface", "issn" : "0730-0301", "address" : "New York, NY, USA", "key" : "Rooms" }, { "booktitle" : "Proceedings of the 12th Banff Knowledge Acquisition Workshop ", "pub-type" : "inproceedings", "uri" : "urn:8a81f8b34b0571eb67dc4fc7b28f9153", "date" : "1999", "author" : [ "Eriksson, H.", "Fergerson, R.", "Shahar, Y.", "Musen, M." ], "type" : "Publication", "year" : "1999", "label" : "Automatic Generation of Ontology Editors", "key" : "Eriksson:Protege" }, { "booktitle" : "Proceedings of ACM CHI Conference on Human Factors in Computing", "pub-type" : "inproceedings", "uri" : "urn:00ce57e1153f514e76b26abf495252e9", "date" : "2003", "author" : [ "Yee, Ping", "Swearingen, Kirsten", "Li, Kevin", "Hearst, Marti" ], "type" : "Publication", "year" : "2003", "label" : "Faceted Metadata for Image Search and Browsing", "key" : "Yee:Faceted" }, { "journal" : "SIAM J. Computing", "pub-type" : "article", "uri" : "urn:7d721eebc03165217f6a1644a67c9ba3", "pages" : "1245--1262", "date" : "1989-12", "number" : "6", "author" : [ "Zhang, K.", "Shasha, Dennis" ], "volume" : "18", "month" : "December", "type" : "Publication", "year" : "1989", "label" : "Simple fast algorithms for the editing distance between trees and related problems", "key" : "zhang1989" }, { "journal" : "J. Association of Computing Machinery", "pub-type" : "article", "uri" : "urn:72a79e35ace22309f57de0de37338f44", "pages" : "68--95", "date" : "1982-01", "number" : "1", "author" : [ "Hoffmann, C. M.", "O\'Donnell, M. J." ], "volume" : "29", "month" : "January", "type" : "Publication", "year" : "1982", "label" : "Pattern matching in trees", "key" : "hoffmann1982" }, { "journal" : "J. Association of Computing Machinery", "pub-type" : "article", "uri" : "urn:19b5598928f78be5d25a220c5b406d55", "pages" : "422--433", "date" : "1979-07", "number" : "3", "author" : "Tai, Kuo--Chung", "volume" : "26", "month" : "July", "type" : "Publication", "year" : "1979", "label" : "The tree--to--tree correction problem", "key" : "tai1979" }, { "id" : "74907b9087636c23c73326d8cc1cb84b", "journal" : "Scientific American", "pub-type" : "article", "uri" : "urn:74907b9087636c23c73326d8cc1cb84b", "pages" : "35", "date" : "2001-05", "number" : "5", "author" : [ "Berners--Lee, T.", "Hendler, J.", "Lassila, O." ], "volume" : "284", "month" : "May", "type" : "Publication", "year" : "2001", "label" : "The Semantic Web", "key" : "bernerslee2001" }, { "booktitle" : "Proceedings of the 13th International Conference on the World Wide Web", "pub-type" : "inproceedings", "uri" : "urn:97085bd0a84c127d1c2fc47e90ab1837", "pages" : "502--511", "date" : "2004", "author" : [ "Reis, D. C.", "Golgher, P. B.", "Silva, A. S.", "Laender, A. F." ], "year" : "2004", "type" : "Publication", "label" : "Automatic Web News Extraction Using Tree Edit Distance", "address" : "New York, NY", "key" : "reis04" }, { "booktitle" : "Proceedings of 13th International Conference on Knowledge Engineering and Knowledge Management", "pub-type" : "inproceedings", "uri" : "urn:de25373efa8246a313f6aa32d1836cc2", "date" : "2002-10", "author" : [ "Golbeck, J.", "Grove, M.", "Parsia, Bijan", "Kalyanpur, A.", "Hendler, J." ], "month" : "Oct", "type" : "Publication", "year" : "2002", "label" : "New tools for the semantic web", "key" : "golbeck02" }, { "booktitle" : "Proceedings of the 11th International World Wide Web Conference", "pub-type" : "inproceedings", "uri" : "urn:a39da749b52e4173b7b1c6df271b0b88", "date" : "2003", "author" : [ "Handschuh, S.", "Staab, S." ], "type" : "Publication", "year" : "2003", "label" : "Authoring and Annotation of Web Pages in CREAM", "key" : "handschuh02" }, { "url" : "citeseer.ist.psu.edu/kahan01annotea.html", "booktitle" : "World Wide Web", "pub-type" : "inproceedings", "uri" : "urn:42c1b59b811759606bae18b4be0b1ed1", "pages" : "623-632", "date" : "2001", "author" : [ "Kahan, Jose", "Koivunen, Marja-Ritta" ], "year" : "2001", "type" : "Publication", "label" : "Annotea: an open {RDF} infrastructure for shared Web annotations", "key" : "kahan01annotea" }, { "url" : "citeseer.nj.nec.com/cole00tree.html", "booktitle" : "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)", "pub-type" : "inproceedings", "uri" : "urn:12ba5cace6725bc3ccea63dd07917970", "date" : "1999", "author" : [ "Cole", "Hariharan", "Indyk" ], "type" : "Publication", "year" : "1999", "label" : "Tree Pattern Matching and Subset Matching in Deterministic ${O}(n \\log^3 n)$-Time", "key" : "cole1999" }, { "journal" : "J. Association of Computing Machinery", "pub-type" : "article", "uri" : "urn:3e3803af983da11bb7475db916e17702", "pages" : "205--213", "date" : "1994-03", "number" : "2", "author" : [ "Dubiner, Moshe", "Galil, Zvi", "Magen, Edith" ], "volume" : "41", "month" : "March", "type" : "Publication", "year" : "1994", "label" : "Faster Tree Pattern Matching", "key" : "dubiner1994" }, { "booktitle" : "Symposium on Principles of Database Systems", "pub-type" : "inproceedings", "uri" : "urn:21797cc50d06f26d928cbd9298609107", "pages" : "39--52", "date" : "2002", "author" : [ "Shasha, Dennis", "Wang, Jason Tsong-Li", "Giugno, Rosalba" ], "type" : "Publication", "year" : "2002", "label" : "Algorithmics and applications of tree and graph searching", "key" : "shasha2002" }, { "publisher" : "ACM Press", "booktitle" : "Proc. of the Third International Conference on Autonomous Agents", "pub-type" : "inproceedings", "uri" : "urn:5e52359aadb0b7bcd7f6eedb84d77b4d", "pages" : "190--197", "date" : "1999", "author" : [ "Muslea, Ion", "Minton, Steven", "Knoblock, Craig" ], "editor" : "Oren Etzioni and J?rg P. M?ller and Jeffrey M. Bradshaw", "type" : "Publication", "year" : "1999", "label" : "A hierarchical approach to wrapper induction", "address" : "Seattle, WA, USA", "key" : "muslea1999" }, { "booktitle" : "Proc. of USENIX 1999 Annual Technical Conference", "pub-type" : "inproceedings", "uri" : "urn:a4558230323275953c9dd91b013d452d", "pages" : "131--144", "date" : "1999-06", "author" : [ "Miller, Robert C.", "Meyers, Brad A." ], "month" : "June", "type" : "Publication", "year" : "1999", "label" : "Lightweight Structured Text Processing", "address" : "Monterey, CA, USA", "key" : "miller1999" }, { "publisher" : "Springer Verlag", "booktitle" : "Handbook on Ontologies in Information Systems", "pub-type" : "incollection", "uri" : "urn:9f151470e435dedabe2c3e72ad3a60c3", "date" : "2003", "author" : [ "Domingue, John", "Dzbor, Martin", "Motta, Enrico" ], "editor" : "S. Staab and R. Studer", "year" : "2003", "type" : "Publication", "label" : "Semantic Layering with Magpie", "key" : "domingue2003" }, { "label" : "Dublin Core Metadata Initiative", "howpublished" : "http://purl.org/metadata/dublin\\_core", "date" : "1997", "key" : "dublin1997", "type" : "Publication", "pub-type" : "misc", "year" : "1997", "uri" : "urn:ba414397eb114e02fc0c59e5e8ce3910" }, { "label" : "Simile: {S}emantic {I}nteroperability of {M}etadata and {I}nformation in un{L}ike {E}nvironments", "howpublished" : "http://simile.mit.edu", "date" : "2004", "key" : "simile2004", "type" : "Publication", "pub-type" : "misc", "year" : "2004", "uri" : "urn:f15cd4475d07e5731bbe39bb45db6ade" }, { "label" : "Resource {D}escription {F}ramework ({RDF}) Specification", "howpublished" : "http://www.w3.org/RDF", "date" : "1999", "key" : "rdf1999", "type" : "Publication", "pub-type" : "misc", "year" : "1999", "uri" : "urn:531d59df2a4e4bd5a95f3afc896def8c" }, { "label" : "The {CGI} Specification, {V}ersion 1.1", "howpublished" : "http://hoohoo.ncsa.uiuc.edu/cgi/interface.html", "key" : "cgi", "type" : "Publication", "pub-type" : "misc", "uri" : "urn:41ecadc8c62e8eecddbf1dd66d4df402" }, { "url" : "citeseer.nj.nec.com/freitag98information.html", "booktitle" : "{AAAI}/{IAAI}", "pub-type" : "inproceedings", "uri" : "urn:7ffb7ecfe7ca69fcdf6254ce0fec119f", "pages" : "517-523", "date" : "1998", "author" : "Freitag, Dayne", "year" : "1998", "type" : "Publication", "label" : "Information Extraction from {HTML}: Application of a General Machine Learning Approach", "key" : "freitag1998" }, { "url" : "citeseer.nj.nec.com/kushmerick97wrapper.html", "booktitle" : "Intl. Joint Conference on Artificial Intelligence ({IJCAI})", "pub-type" : "inproceedings", "uri" : "urn:5b1ed35562d127818019f907d35e881d", "pages" : "729--737", "date" : "1997", "author" : [ "Kushmerick, Nicholas", "Weld, Daniel S.", "Doorenbos, Robert B." ], "year" : "1997", "type" : "Publication", "label" : "Wrapper Induction for Information Extraction", "key" : "kushmerick1997" }, { "url" : "citeseer.nj.nec.com/crescenzi01roadrunner.html", "booktitle" : "Proceedings of 27th International Conference on Very Large Data Bases", "pub-type" : "inproceedings", "uri" : "urn:067cb323bc3aebbdb0e391fab402c292", "pages" : "109-118", "date" : "2001", "author" : [ "Crescenzi, Valter", "Mecca, Giansalvatore", "Merialdo, Paolo" ], "year" : "2001", "type" : "Publication", "label" : "RoadRunner: Towards Automatic Data Extraction from Large Web Sites", "key" : "crescenzi2001" }, { "url" : "citeseer.nj.nec.com/soderland99learning.html", "journal" : "Machine Learning", "pub-type" : "article", "uri" : "urn:2e1889aa9c0a032c156c25bf9ab9c6fb", "pages" : "233-272", "date" : "1999", "number" : "1-3", "author" : "Soderland, Stephen", "volume" : "34", "type" : "Publication", "year" : "1999", "label" : "Learning Information Extraction Rules for Semi-Structured and Free Text", "key" : "soderland1999" }, { "url" : "citeseer.nj.nec.com/article/collins97semantic.html", "booktitle" : "Proceedings of 6th Workshop on Very Large Corpora", "pub-type" : "inproceedings", "uri" : "urn:3d458dfc557b79ae9f509b5847a76e61", "date" : "1997", "author" : [ "Collins, Michael", "Miller, Scott" ], "type" : "Publication", "year" : "1997", "label" : "Semantic tagging using a probabilistic context free grammar", "address" : "Montreal, Canada", "key" : "collins1997" }, { "url" : "citeseer.nj.nec.com/freund93efficient.html", "pub-type" : "inproceedings", "uri" : "urn:651171226becf7ba6cc3b15345ff9869", "pages" : "315--324", "date" : "1993", "author" : [ "Freund, Yoav", "Kearns, Michael", "Ron, Dana", "Rubinfeld, Ronitt", "Schapire, Robert E.", "Sellie, Linda" ], "type" : "Publication", "year" : "1993", "label" : "Efficient learning of typical finite automata from random walks", "key" : "freund1993" }, { "url" : "citeseer.nj.nec.com/seymore99learning.html", "booktitle" : "{AAAI} 99 Workshop on Machine Learning for Information Extraction", "pub-type" : "inproceedings", "uri" : "urn:75c9f843f40584c70d65ea35dac37b2f", "date" : "1999", "author" : [ "Seymore, Kristie", "McCallum, Andrew", "Rosenfeld, Roni" ], "type" : "Publication", "year" : "1999", "label" : "Learning Hidden {Markov} Model Structure for Information Extraction", "key" : "seymore1999" }, { "url" : "citeseer.nj.nec.com/freitag00information.html", "booktitle" : "{AAAI}/{IAAI}", "pub-type" : "inproceedings", "uri" : "urn:15f6bc9bdf2ba60f90bcb7f71effa357", "pages" : "584-589", "date" : "2000", "author" : [ "Freitag, Dayne", "McCallum, Andrew" ], "year" : "2000", "type" : "Publication", "label" : "Information Extraction with {HMM} Structures Learned by Stochastic Optimization", "key" : "freitag2000" }, { "publisher" : "Cambridge University Press", "pub-type" : "book", "uri" : "urn:6de8b15b7b24fb500cd7d16429d929b5", "date" : "1997", "author" : "Gusfield, D.", "type" : "Publication", "year" : "1997", "label" : "Algorithms on Strings, Trees, and Sequences", "address" : "New York", "key" : "gusfield97" }, { "booktitle" : "Proc. 4th Annual Symposium on Combinatorial Pattern Matching", "pub-type" : "inproceedings", "uri" : "urn:7344809032c668f2d8556de35172b483", "pages" : "229--242", "date" : "1993", "author" : "Ukkonen, Esko", "type" : "Publication", "year" : "1993", "label" : "Approximate String--Matching over Suffix Trees", "key" : "ukkonen93" }, { "publisher" : "Plenum Press", "booktitle" : "Complexity of Computer Computations", "pub-type" : "inbook", "uri" : "urn:342645f78b4b684d945fdc4b1eb7c478", "pages" : "131--152", "date" : "1972", "author" : [ "HopCroft, J. E.", "Tarjan, R. E." ], "editor" : "Raymond E. Miller and James W. Thatcher", "type" : "Publication", "year" : "1972", "label" : "Isomorphism of Planar Graphs", "key" : "hopcroft72" }, { "journal" : "SIAM Rev.", "pub-type" : "article", "uri" : "urn:935e1872dbd0f08f9d1efed601a1e96e", "pages" : "273--274", "date" : "1968", "author" : "Matula, D. W.", "volume" : "10", "type" : "Publication", "year" : "1968", "label" : "An Algorithm for Subtree Identification", "key" : "matula68" }, { "publisher" : "MIT Press", "id" : "de8ef7de413b982b7ee0d94521365840", "pub-type" : "book", "uri" : "urn:de8ef7de413b982b7ee0d94521365840", "pages" : "350--356", "date" : "2001", "author" : [ "Cormen, Tom H.", "Leiserson, Charles E.", "Rivest, Ron L.", "Stein, Cliff" ], "edition" : "Second", "type" : "Publication", "year" : "2001", "label" : "Introduction to Algorithms", "key" : "clr" }, { "url" : "citeseer.nj.nec.com/wu92agrep.html", "booktitle" : "Proceedings {USENIX} Winter 1992 Technical Conference", "pub-type" : "inproceedings", "uri" : "urn:3156326f07926a0decab1f79df2496cd", "pages" : "153--162", "date" : "1992", "author" : [ "Wu, S.", "Manber, Udi" ], "type" : "Publication", "year" : "1992", "label" : "Agrep -- a fast approximate pattern-matching tool", "address" : "San Francisco, CA", "key" : "wu1992" }, { "publisher" : "IEEE", "booktitle" : "Proceedings of the 30th annual {IEEE} Symposium on Foundations of Computer Science", "pub-type" : "inproceedings", "uri" : "urn:0f5f37a714d416f71a6ef75b1016ce86", "pages" : "178--183", "date" : "1989", "author" : "Kosaraju, S. R.", "type" : "Publication", "year" : "1989", "label" : "Efficient Tree Pattern Matching", "address" : "New York", "key" : "kosaraju1989" }, { "pub-type" : "misc", "uri" : "urn:e8a1e570b9c0a3afba36d363709061c8", "date" : "1999", "author" : [ "Clark, James", "DeRose, Steve" ], "type" : "Publication", "year" : "1999", "howpublished" : "http://www.w3.org/TR/xpath", "label" : "{XML} {P}ath Language ({XP}ath) Specification", "key" : "xpath1999" }, { "pub-type" : "misc", "uri" : "urn:139e659ff9dcd9867b7eec8648d3d558", "date" : "2003", "author" : "Nottingham, Mark", "type" : "Publication", "year" : "2003", "howpublished" : "http://www.mnot.net/xpath2rss/", "label" : "xpath2rss {HTML} to {RSS} Scraper", "key" : "nottingham03" }, { "pub-type" : "misc", "uri" : "urn:9209a997ffd02e38fac0e09725a59fc1", "date" : "2002", "author" : "Authority}, {Internet Assigned Numbers", "type" : "Publication", "year" : "2002", "howpublished" : "http://www.iana.org/assignments/uri-schemes", "label" : "The Official {IANA} Registry of {URI} Schemes", "key" : "iana-uri" }, { "pub-type" : "misc", "uri" : "urn:51fc2dcd5c03debb98271811ebfb1825", "date" : "2002", "author" : "Authority}, {Internet Assigned Numbers", "type" : "Publication", "year" : "2002", "howpublished" : "\\url{http://www.iana.org/assignments/urn-namespaces}", "label" : "The Official {IANA} Registry of {URN} Namespaces", "key" : "iana-urn" }, { "pub-type" : "misc", "uri" : "urn:128d6e39af06d885c1655523c82c87a3", "date" : "2004-11", "author" : [ "Smith, Michael K.", "Welty, Chris", "McGuinness, Deborah L." ], "month" : "November", "year" : "2004", "type" : "Publication", "howpublished" : "\\url{http://www.w3.org/TR/owl-guide/}", "label" : "{OWL} Web Ontology Language", "key" : "owl" }, { "pub-type" : "misc", "uri" : "urn:4efd09d9e08ffd503882ab8ad08412f0", "date" : "2004-11", "author" : "Consortium, The World Wide Web", "month" : "November", "year" : "2004", "type" : "Publication", "howpublished" : "\\url{http://www.w3.org/RDF/}", "label" : "{Resource Description Framework}", "key" : "rdf" }, { "pub-type" : "misc", "uri" : "urn:e67fc6ff83f1fd4320ca8f035203a9a8", "date" : "2004-11", "author" : "Nilsson, Martin", "month" : "November", "year" : "2004", "type" : "Publication", "howpublished" : "\\url{http://www.id3.org}", "label" : "ID3v2", "key" : "id3" }, { "pub-type" : "misc", "uri" : "urn:bb12ef80e0a688590b767f24e6e4a2ed", "date" : "2004-11", "author" : "Gracenote", "month" : "November", "year" : "2004", "type" : "Publication", "howpublished" : "\\url{http://www.gracenote.com/gn_products/cddb.html}", "label" : "Gracenote {CDDB}", "key" : "cddb" }, { "pub-type" : "misc", "uri" : "urn:caae2a176eafac4313aec1b36a41a6bc", "date" : "2004-11", "author" : "freedb.org", "month" : "November", "year" : "2004", "type" : "Publication", "howpublished" : "\\url{http://www.freedb.org}", "label" : "FreeDB Database", "key" : "freedb" }, { "publisher" : "Springer Verlag", "pub-type" : "book", "uri" : "urn:3d6ac250520d70515bce8fd6f6e6226a", "date" : "1996", "author" : "Jensen, F.", "keywords" : "knowledge representation bayesian networks da99", "type" : "Publication", "year" : "1996", "label" : "An Introduction to Bayesian Networks", "key" : "Jensen96" }, { "id" : "c4ff3af48bb189c62c629911874ec5c8", "journal" : "Scientific American", "pub-type" : "article", "uri" : "urn:c4ff3af48bb189c62c629911874ec5c8", "date" : "2001-05", "author" : [ "Tim Berners-Lee, James Hendler", "Lassila, Ora" ], "month" : "May", "type" : "Publication", "year" : "2001", "label" : "The Semantic Web", "key" : "Lee01" }, { "publisher" : "Morgan Kaufmann", "url" : "citeseer.ist.psu.edu/article/goldman97dataguide.html", "booktitle" : "Proceedings of 23rd International Conference on Very Large Data Bases", "pub-type" : "inproceedings", "uri" : "urn:740308d0291c17032bac2abe9bc06654", "pages" : "436--445", "date" : "1997", "author" : [ "Goldman, Roy", "Widom, Jennifer" ], "editor" : "Matthias Jarke and Michael J. Carey and Klaus R. Dittrich and Frederick H. Lochovsky and Pericles Loucopoulos and Manfred A. Jeusfeld", "type" : "Publication", "year" : "1997", "label" : "DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases", "key" : "goldman97" }, { "booktitle" : "Invited presentation to the National Academy of Sciences Workshop on Dynamic Social Network Modeling and Analysis", "pub-type" : "inproceedings", "uri" : "urn:43730df1745cecd3de654408a50da4c8", "date" : "2002-11", "city" : "Washington, DC", "author" : [ "Jensen, D.", "Neville, J." ], "month" : "November", "year" : "2002", "type" : "Publication", "label" : "Data mining in social networks", "key" : "jensen-neville-NAS02" }, { "publisher" : "The {MIT} Press", "url" : "citeseer.nj.nec.com/cohn96active.html", "booktitle" : "Advances in Neural Information Processing Systems", "pub-type" : "inproceedings", "uri" : "urn:54c6e3506e199866295e5306de875e40", "pages" : "705--712", "date" : "1995", "author" : [ "Cohn, David A.", "Ghahramani, Zoubin", "Jordan, Michael I." ], "volume" : "7", "editor" : "G. Tesauro and D. Touretzky and T. Leen", "type" : "Publication", "year" : "1995", "label" : "Active Learning with Statistical Models", "key" : "cohn95active" }, { "publisher" : "Morgan Kaufmann", "url" : "citeseer.ist.psu.edu/126680.html", "id" : "1b6f9a282d4f281185785da2e2b7eb7e", "booktitle" : "{VLDB}\'97, Proceedings of 23rd International Conference on Very Large Data Bases", "pub-type" : "inproceedings", "uri" : "urn:1b6f9a282d4f281185785da2e2b7eb7e", "pages" : "436--445", "date" : "1997", "author" : [ "Goldman, Roy", "Widom, Jennifer" ], "editor" : "Matthias Jarke and Michael J. Carey and Klaus R. Dittrich and Frederick H. Lochovsky and Pericles Loucopoulos and Manfred A. Jeusfeld", "type" : "Publication", "year" : "1997", "label" : "DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases", "key" : "lore" }, { "publisher" : "Willey", "pub-type" : "book", "uri" : "urn:809f064ac212bc554829052fc01b74f8", "pages" : "198", "date" : "1985", "author" : "Watanabe, S.", "year" : "1985", "type" : "Publication", "label" : "Pattern Recognition: Human and Mechanical", "address" : "New York", "key" : "watanabe85" }, { "publisher" : "Oxford University Press", "pub-type" : "book", "uri" : "urn:e5e339b3922b43ec75305718bf920461", "date" : "1988", "author" : "Newcombe, H.B.", "type" : "Publication", "year" : "1988", "note" : "Classic book reference. Covers some of the theory and much of the heuristics needed for good record linkage practice. Now out of print.", "label" : "Handbook of Record Linkage: Methods for Health and Statistical Studies, Administration, and Business", "key" : "newcombe88" }, { "journal" : "Science", "pub-type" : "article", "uri" : "urn:c7cf752a3ab21e1bc91f7a7c8b12e2cf", "pages" : "954--959", "date" : "1959", "author" : [ "Newcombe, H. B.", "Kennedy, J. M.", "Axford, S. J.", "James, A. P." ], "volume" : "130", "type" : "Publication", "year" : "1959", "label" : "Automatic Linkage for Vital Records", "key" : "newcombe59" }, { "journal" : "Journal of the American Statistical Association", "pub-type" : "article", "uri" : "urn:fd15c5efa7601eabe4ffce786e78551e", "pages" : "1183--1210", "date" : "1969", "author" : [ "Fellegi, I. P.", "Sunter, A. B." ], "volume" : "64", "type" : "Publication", "year" : "1969", "label" : "A Theory for Record Linkage", "key" : "fellegi-sunter" }, { "booktitle" : "European Conference on Digital Libraries", "pub-type" : "inproceedings", "uri" : "urn:d66074c6bd85bfe8e433a54e53118d34", "pages" : "55--71", "date" : "1997", "author" : [ "French, James C.", "Powell, Allison L.", "Schulman, Eric", "Pfaltz, John L." ], "type" : "Publication", "year" : "1997", "label" : "Automating the Construction of Authority Files in Digital Libraries: A Case Study", "key" : "french97" }, { "journal" : "Data Mining and Knowledge Discovery", "pub-type" : "article", "uri" : "urn:b92ed796499464f98e665414daf1dc75", "pages" : "9--37", "date" : "1998", "number" : "1", "author" : [ "Hernandez, Mauricio A.", "Stolfo, Salvatore J." ], "volume" : "2", "type" : "Publication", "year" : "1998", "label" : "Real-world Data is Dirty: Data Cleansing and The Merge/Purge Problem", "address" : "Boston", "key" : "hernandez98" }, { "publisher" : "Morgan Kaufmann, San Francisco, CA", "url" : "citeseer.ist.psu.edu/95071.html", "booktitle" : "Proc. 15th International Conf. on Machine Learning", "pub-type" : "inproceedings", "uri" : "urn:ca63eda2819d19177255a161a9045c5c", "pages" : "296--304", "date" : "1998", "author" : "Lin, Dekang", "year" : "1998", "type" : "Publication", "label" : "An information-theoretic definition of similarity", "key" : "lin98" }, { "booktitle" : "Neural Information Processing Systems", "pub-type" : "inproceedings", "uri" : "urn:e03e34f0318cd8ee559bc93470f4c706", "date" : "2002", "author" : [ "Pasula, Hanna", "Marthi, Bhaskara", "Milch, Brian", "Russell, Stuart", "Shpitser, Ilya" ], "type" : "Publication", "year" : "2002", "label" : "Identity Uncertainty and Citation Matching", "key" : "pasula02" }, { "booktitle" : "Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining", "pub-type" : "inproceedings", "uri" : "urn:b637ed55c0077bffaeb9505b02288014", "pages" : "39--48", "date" : "2003-08", "author" : [ "Bilenko, Mikhail", "Mooney, Raymond J." ], "month" : "August", "type" : "Publication", "year" : "2003", "label" : "Adaptive Duplicate Detection Using Learnable String Similarity Measures", "key" : "bilenko03" }, { "id" : "90401212bf6bc3ae5e46145c6a20db18", "journal" : "Scientific American", "pub-type" : "article", "uri" : "urn:90401212bf6bc3ae5e46145c6a20db18", "date" : "2001-05", "author" : [ "Tim Berners-Lee, James Hendler", "Lassila, Ora" ], "month" : "May", "type" : "Publication", "year" : "2001", "label" : "The Semantic Web", "key" : "lee01" }, { "id" : "205c2bb216d5ee986dea64cd6f74abf4", "pub-type" : "misc", "uri" : "urn:205c2bb216d5ee986dea64cd6f74abf4", "date" : "2002", "author" : "Authority}, {Internet Assigned Numbers", "note" : "http://www.iana.org/assignments/uri-schemes", "type" : "Publication", "year" : "2002", "label" : "The Official {IANA} Registry of {URI} Schemes", "key" : "iana-uri" }, { "id" : "76ccded54b94c692eaac8a20afae8adc", "pub-type" : "misc", "uri" : "urn:76ccded54b94c692eaac8a20afae8adc", "date" : "2002", "author" : "Authority}, {Internet Assigned Numbers", "note" : "http://www.iana.org/assignments/urn-namespaces", "type" : "Publication", "year" : "2002", "label" : "The Official {IANA} Registry of {URN} Namespaces", "key" : "iana-urn" }, { "booktitle" : "Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining", "pub-type" : "inproceedings", "uri" : "urn:0b4007ac09a298f50b41c1060cf7b0c4", "pages" : "255--259", "date" : "2000-08", "author" : [ "Cohen, William W.", "Kautz, Henry", "McAllester, David" ], "month" : "August", "type" : "Publication", "year" : "2000", "label" : "Hardening Soft Information Sources", "address" : "Boston, MA", "key" : [ "cohen00", "Hardening, Information integration" ] }, { "booktitle" : "Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining", "pub-type" : "inproceedings", "uri" : "urn:2f725bd918792ade61e8bcb93df8e009", "pages" : "169--178", "date" : "2000-08", "author" : [ "McCallum, Andrew K.", "Nigam, Kamal", "Ungar, Lyle" ], "month" : "August", "type" : "Publication", "year" : "2000", "label" : "Efficient Clustering of High-Dimensional Data Sets with Application to Reference Matching", "address" : "Boston, MA", "key" : "mccallum00" }, { "publisher" : "ACM Press", "booktitle" : "Proceedings of the Third International Conference on Autonomous Agents", "pub-type" : "inproceedings", "uri" : "urn:085fa80f036deda606340d54d9970457", "date" : "1999", "author" : [ "Lawrence, Steve", "Bollacker, Kurt", "Giles, C. Lee" ], "editor" : "Oren Etzioni", "type" : "Publication", "year" : "1999", "note" : "Error metric is percentage of true blocks with incorrect entries", "label" : "Autonomous Citation Matching", "address" : "New York", "key" : "lawrence99" }, { "publisher" : "Morgan Kaufmann, San Francisco, CA", "booktitle" : "Proc. 18th International Conf. on Machine Learning", "pub-type" : "inproceedings", "uri" : "urn:80e463e62bb326eb41b3f8b3320de4a0", "pages" : "282--289", "date" : "2001", "author" : [ "Lafferty, John", "McCallum, Andrew", "Pereira, Fernando" ], "year" : "2001", "type" : "Publication", "label" : "Conditional Random Fields: {P}robabilistic Models for Segmenting and Labeling Sequence Data", "key" : "lafferty01conditional" }, { "pub-type" : "phdthesis", "uri" : "urn:6efdf3b4dd68bbef873376114d0fbdb4", "date" : "2000", "school" : "Stanford", "author" : "Pfeffer, Avi", "type" : "Publication", "year" : "2000", "label" : "Probabilistic Reasoning for Complex Systems", "key" : "pfeffer00" }, { "booktitle" : "Proceedings of the 18th International Joint Conference on Artificial Intelligence", "pub-type" : "inproceedings", "uri" : "urn:b79d9cb87d29cb880b4320814767e443", "date" : "2003", "author" : [ "McCallum, Andrew", "Wellner, Ben" ], "type" : "Publication", "year" : "2003", "label" : "Toward Conditional Models of Identity Uncertainty with Application to Proper Noun Coreference", "key" : "mccallum03" }, { "booktitle" : "Extended Abstracts of Proceedings of ACM Human Factors in Computing Systems CHI 2004", "pub-type" : "inproceedings", "uri" : "urn:8f0dbe2df6f34dd16e82e94f6fad321a", "pages" : "1525-1528", "date" : "2004", "author" : [ "Tan, D. S.", "Meyers, B.", "Czerwinski, Mary" ], "type" : "Publication", "year" : "2004", "label" : "{WinCuts}: Manipulating arbitrary window regions for more effective use of screen space", "key" : "Tan:WinCuts" }, { "publisher" : "ACM Press", "booktitle" : "Proceedings of the SIGCHI conference on Human factors in computing systems", "pub-type" : "inproceedings", "uri" : "urn:294a6b1ad011386ca4a612f9b6a63b4d", "pages" : "277--284", "date" : "2001", "author" : [ "Dumais, Susan", "Cutrell, Edward", "Chen, Hao" ], "doi" : "http://doi.acm.org/10.1145/365024.365116", "type" : "Publication", "year" : "2001", "isbn" : "1-58113-327-8", "label" : "Optimizing search by showing results in context", "location" : "Seattle, Washington, United States", "key" : "Dumais01" }, { "booktitle" : "CHI 2002, Minneapolis, Minnesota, USA", "pub-type" : "inproceedings", "uri" : "urn:7ee6834ee8fd10c21dc52eaf2a72456f", "date" : "2002", "author" : [ "English, Jennifer", "Hearst, Marti", "Sinha, Rashmi", "Searingen, Kristen", "Yee, Ka-Ping" ], "type" : "Publication", "year" : "2002", "label" : "Hierarchical Faceted Metadata in Site Search Interfaces", "key" : "Engl" }, { "publisher" : "ACM Press", "journal" : "Communications of the ACM", "pub-type" : "article", "uri" : "urn:06dbb81e9fb6c6a7d48ff5d70776e17b", "pages" : "42--49", "date" : "2002", "number" : "9", "author" : [ "Hearst, Marti", "Elliott, Ame", "English, Jennifer", "Sinha, Rashmi", "Swearingen, Kirsten", "Yee, Ka-Ping" ], "volume" : "45", "doi" : "http://doi.acm.org/10.1145/567498.567525", "type" : "Publication", "year" : "2002", "label" : "Finding the flow in web site search", "issn" : "0001-0782", "key" : "Hearst02" }, { "publisher" : "ACM Press", "booktitle" : "CHI \'03: Proceedings of the SIGCHI conference on Human factors in computing systems", "pub-type" : "inproceedings", "uri" : "urn:cf33239d2c8a96d4d72c2abc7af917c0", "pages" : "401--408", "date" : "2003", "author" : [ "Yee, Ka-Ping", "Swearingen, Kirsten", "Li, Kevin", "Hearst, Marti" ], "doi" : "http://doi.acm.org/10.1145/642611.642681", "type" : "Publication", "year" : "2003", "isbn" : "1-58113-630-7", "label" : "Faceted metadata for image search and browsing", "location" : "Ft. Lauderdale, Florida, USA", "key" : "Hearst03" }, { "booktitle" : "Working Notes of the ACM SIGIR Workshop on XML and Information Retrieval", "pub-type" : "inproceedings", "uri" : "urn:2110e5b8fcdfe87bd9a2f26015509c6d", "date" : "2000", "author" : [ "Egnor, Daniel", "Lord, Robert" ], "type" : "Publication", "year" : "2000", "label" : "Structured Information Retrieval using {XML}", "location" : "Athens, Greece", "key" : "Egnor" }, { "journal" : "Scientific American", "pub-type" : "article", "uri" : "urn:b1bf486727338fe333dfb8121a358deb", "date" : "2001-05", "author" : [ "Berners-Lee, Tim", "Hendler, James", "Lassila, Ora" ], "month" : "May", "year" : "2001", "type" : "Publication", "label" : "{The Semantic Web}", "key" : "Lee01" }, { "url" : "http://www.w3.org/TR/1999/REC-rdf-syntax-19990222", "pdf" : "", "postscript" : "", "pub-type" : "misc", "uri" : "urn:936e00caa6af818ec7d7f12ff0d82e38", "date" : "1999-02", "author" : [ "Lassila, Ora", "Swick, Ralph" ], "keywords" : "XML", "month" : "February", "type" : "Publication", "year" : "1999", "note" : "W3C Recommendation", "howpublished" : "\\url{http://www.w3.org/TR/1999/REC-rdf-syntax-19990222}", "label" : "Resource Description Framework ({RDF}): Model and Syntax Specification", "key" : "RDF" }, { "url" : "http://www.w3.org/TR/2004/REC-xml-20040204/", "pdf" : "", "postscript" : "", "pub-type" : "misc", "uri" : "urn:deb9e48092649c675ded58969dc521e4", "date" : "2004-02", "author" : [ "Yergeau, Fran?ois", "Bray, Tim", "Paoli, Jean", "Sperberg-McQueen, C. M.", "Maler, Eve" ], "keywords" : "XML", "month" : "February", "type" : "Publication", "year" : "2004", "note" : "W3C Recommendation", "howpublished" : "\\url{http://www.w3.org/TR/2004/REC-xml-20040204/}", "label" : "Extensible Markup Language ({XML})", "key" : "XML" }, { "pub-type" : "proceedings", "uri" : "urn:6ba99a813afdef4522ab6b6651a25cfa", "date" : "2003-12", "editor" : "Norbert Fuhr and Mounia Lalmas and Saadia Malik", "month" : "December", "year" : "2003", "type" : "Publication", "howpublished" : "\\url{http://inex.is.informatik.uni-duisburg.de:2003/proceedings.pdf}", "label" : "{INitiative for the Evaluation of XML} Retrieval ({INEX}). Proceedings of the Second {INEX} Workshop", "location" : "Dagstuhl, Germany", "key" : "INEX" }, { "label" : "RDF Primer", "howpublished" : "\\url{http://www.w3.org/TR/rdf-primer/}", "key" : "RDFPrimer", "type" : "Publication", "pub-type" : "misc", "author" : [ "Manola, Frank", "Miller, Eric" ], "uri" : "urn:03a8b9bd434f98efc4ebde2a5060c421", "id" : "03a8b9bd434f98efc4ebde2a5060c421" }, { "label" : "mozilla.org: Resource Description Framework (RDF)", "howpublished" : "\\url{http://www.mozilla.org/rdf/doc/}", "key" : "MozRDF", "type" : "Publication", "pub-type" : "misc", "author" : "Organization, The Mozilla", "uri" : "urn:c97cecb7b75cff9e491218e0507bec74" }, { "label" : "Adobe Extensible Metadata Platform (XMP)", "howpublished" : "\\url{http://www.adobe.com/products/xmp/}", "key" : "AdobeXMP", "type" : "Publication", "pub-type" : "misc", "author" : "Inc., Adobe Systems", "uri" : "urn:5345a7a5d95479d8f9a9e80108bc4a79" }, { "label" : "{RDF Site Summary (RSS) 1.0 Specifcation}", "howpublished" : "\\url{http://purl.org/rss/1.0/spec}", "key" : "RSS10Spec", "type" : "Publication", "pub-type" : "misc", "author" : [ "Beged-Dov, Gabe", "Brickley, Dan", "Dornfest, Rael", "Davis, Ian", "Dodds, Leigh", "Eisenzopf, Jonathan", "Galbraith, David", "Guha, R.V.", "MacLeod, Ken", "Miller, Eric", "Swartz, Aaron", "Vlist, Eric van der" ], "uri" : "urn:fb1e1103aae573b92987b58b0ae3092a" }, { "label" : "The {L}ucene Search Engine", "howpublished" : "\\url{http://www.lucene.com/}", "key" : "Lucene", "type" : "Publication", "pub-type" : "misc", "author" : "Jakatra Project, The Apache Software Foundation", "uri" : "urn:1b4051c15f93badff9d28672aae4d7bb" }, { "label" : "Longwell suit of web-based {RDF} browsers", "howpublished" : "\\url{http://simile.mit.edu/longwell/}", "key" : "LongwellWeb", "type" : "Publication", "pub-type" : "misc", "author" : "Project, The Simile", "uri" : "urn:c6f962541c9b2490f27a48792eb2cd6e" }, { "label" : "The Universal Information Client", "howpublished" : "\\url{http://haystack.lcs.mit.edu/}", "key" : "Hayweb", "type" : "Publication", "pub-type" : "misc", "author" : "Haystack", "uri" : "urn:d3bec2b41bd5b051f2984d717c147883" }, { "label" : "Expert Users Move Away from Google", "howpublished" : "\\url{http://www.microdoc-news.info/home/2003/04/26.html}", "key" : "MicrodocSurvey", "type" : "Publication", "pub-type" : "misc", "author" : "News, Microdoc", "uri" : "urn:0bb8d9840bc6fedb28a2950d691b1cec" }, { "label" : "Google: How the Competition Stacks Up", "howpublished" : "\\url{http://microdoc-} \\url{news.info/home/2003/04/15.html}", "key" : "MicrodocPsych", "type" : "Publication", "pub-type" : "misc", "author" : "News, Microdoc", "uri" : "urn:94c624aa92adb9db191f3ff69b9ecf1b" }, { "label" : "Users Decide First; Move Second", "howpublished" : "\\url{http://www.uie.com/Articles/whatTheyWantArticle.htm}", "key" : "UIEDecideFirst", "type" : "Publication", "pub-type" : "misc", "author" : "Ojakaar, Erik", "uri" : "urn:0198545938c1111548c6b1f660009ab0" }, { "label" : "Users Don\'t Learn to Search Better", "howpublished" : "\\url{http://www.uie.com/Articles/not_learn_search.htm}", "key" : "UIEZeroResults", "type" : "Publication", "pub-type" : "misc", "author" : "Engineering, User Interface", "uri" : "urn:1ec615cde3579eb8c7e564319e90d9ea" }, { "publisher" : "ACM Press", "booktitle" : "SIGIR \'97: Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval", "pub-type" : "inproceedings", "uri" : "urn:d5786ab130ad237dff9ff562903a4e65", "pages" : "6--15", "date" : "1997-07", "author" : [ "V?lez, Bienvenido", "Weiss, Ron", "Sheldon, Mark A.", "Gifford, David K." ], "doi" : "http://doi.acm.org/10.1145/258525.258528", "month" : "July", "type" : "Publication", "year" : "1997", "isbn" : "0-89791-836-3", "label" : "Fast and effective query refinement", "location" : "Philadelphia, Pennsylvania, United States", "key" : "Velez97" }, { "journal" : "Atlantic Monthly", "pub-type" : "article", "uri" : "urn:3c85ebb0979ae1095cbd3ff78b0267ec", "pages" : "641--649", "date" : "1945-01", "number" : "1", "author" : "Bush, Vannevar", "volume" : "176", "month" : "January", "type" : "Publication", "year" : "1945", "label" : "Artificial Intelligence", "key" : "Bush45" }, { "journal" : "Online Review", "pub-type" : "article", "uri" : "urn:df898cc6f92475092a5bf6baaf805754", "pages" : "407--424", "date" : "1989-10", "number" : "5", "author" : "Bates, Marcia J.", "volume" : "13", "month" : "October", "type" : "Publication", "year" : "1989", "label" : "The design of browsing and berrypicking techniques for the online search interface", "key" : "Bates89" }, { "publisher" : "Pergamon Press, Inc.", "journal" : "Information Processing and Management", "pub-type" : "article", "uri" : "urn:f675d4710621c41388dbc923fdfacc25", "pages" : "575--591", "date" : "1990", "number" : "5", "author" : "Bates, Marcia J.", "volume" : "26", "type" : "Publication", "year" : "1990", "label" : "Where Should the Person Stop and the Information Search Interface Start?", "issn" : "0306-4573", "key" : "Bates90" }, { "journal" : "SIGCHI Bulletin", "pub-type" : "article", "uri" : "urn:a1f059b110a675e96906da5855fdf1d9", "pages" : "44--49", "date" : "1997-10", "number" : "4", "author" : [ "Jul, Susanne", "Furnas, George W." ], "ee" : "http://www.acm.org/sigchi/bulletin/1997.4/jul.html", "volume" : "29", "month" : "October", "type" : "Publication", "year" : "1997", "label" : "Navigation in Electronic Worlds: Workshop Report", "key" : "NavCHI97" }, { "publisher" : "ACM Press", "booktitle" : "Conference companion on Human factors in computing systems", "pub-type" : "inproceedings", "uri" : "urn:a7acc0843c0d8f52b6542ec93e608c86", "pages" : "179--180", "date" : "1995", "author" : [ "Mackinlay, Jock D.", "Zellweger, Polle T." ], "doi" : "http://doi.acm.org/10.1145/223355.223490", "type" : "Publication", "year" : "1995", "isbn" : "0-89791-755-3", "label" : "Browsing vs. search: can we find a synergy? (panel session)", "location" : "Denver, Colorado, United States", "key" : "BrowSEarch95" }, { "publisher" : "ACM Press", "chapter" : "10", "booktitle" : "Modern Information Retrieval", "pub-type" : "incollection", "uri" : "urn:e18ade40bd0488f9bf7df821d005fecb", "pages" : "257--323", "date" : "1999", "author" : "Hearst, Marti A.", "editor" : "Ricardo Baeza-Yates and Berthier Ribeiro-Neto", "type" : "Publication", "year" : "1999", "label" : "User interfaces and visualization", "key" : "HearstBook" }, { "publisher" : "APress", "booktitle" : "User Interface Design for Programmers", "pub-type" : "incollection", "uri" : "urn:d0f20b5a278a12b647acbb8d2246c995", "date" : "2001-06", "author" : "Spolsky, Joel", "month" : "June", "year" : "2001", "type" : "Publication", "label" : "User Interface Design for Programmers", "key" : "LostInSpace" }, { "publisher" : "Prentice-Hall, Inc.", "chapter" : "11", "booktitle" : "Information retrieval: data structures and algorithms", "pub-type" : "incollection", "uri" : "urn:9c371ee56fa457ca870c973f5f34a1ad", "pages" : "241--263", "date" : "1992", "author" : "Harman, Donna", "editor" : "William B. Frakes and Ricardo Baeza-Yates", "type" : "Publication", "year" : "1992", "isbn" : "0-13-463837-9", "label" : "Relevance feedback and other query modification techniques", "key" : "IRBook92" }, { "publisher" : "Prentice-Hall, Inc.", "chapter" : "14", "booktitle" : "Information retrieval: data structures and algorithms", "pub-type" : "incollection", "uri" : "urn:a89b9628bba9ed06987c55f80bfeb1cf", "pages" : "363--392", "date" : "1992", "author" : "Harman, Donna", "editor" : "William B. Frakes and Ricardo Baeza-Yates", "type" : "Publication", "year" : "1992", "isbn" : "0-13-463837-9", "label" : "Ranking Algorithms", "key" : "VSMIRBook92" }, { "publisher" : "Cambridge University Press", "pub-type" : "book", "uri" : "urn:d581b823db282ac7b92f72e81558a5d1", "date" : "1995", "author" : "Marchionini, Gary", "type" : "Publication", "year" : "1995", "isbn" : "0-521-44372-5", "label" : "Information seeking in electronic environments", "key" : "InfoSeekingBook" }, { "publisher" : "Wiley", "pub-type" : "book", "uri" : "urn:5ad7e6351564c0b7b884c42b13de401f", "date" : "2000", "author" : [ "Duda, Richard O.", "Hart, Peter E.", "Stork, David G." ], "edition" : "2nd", "year" : "2000", "type" : "Publication", "isbn" : "0-471-05669-3", "label" : "Pattern Classification", "address" : "New York", "key" : "PatternClassBook" }, { "pub-type" : "techreport", "institution" : "Stanford Research Institute", "uri" : "urn:1a49d4ce9e81aab47accbd27b42ae01b", "date" : "1962-10", "author" : "Engelbart, Douglas C.", "month" : "October", "year" : "1962", "type" : "Publication", "label" : "Augmenting Human Intellect: A Conceptual Framework", "address" : "Menlo Park, CA", "key" : "Eng62" }, { "booktitle" : "AAAI Fall Symposium: AI Applications in Knowledge Navigation and Retrieval", "pub-type" : "inproceedings", "uri" : "urn:6631884aec1af27537d6a5f521f87918", "date" : "1995-11", "author" : [ "Freeman, Eric T.", "Fertig, Scott J." ], "month" : "November", "year" : "1995", "type" : "Publication", "label" : "Lifestreams: Organizing your electronic life", "address" : "Cambridge, MA", "key" : "Fre95" }, { "publisher" : "ACM Press", "url" : "citeseer.nj.nec.com/376128.html", "booktitle" : "Proceedings of the third ACM conference on Digital libraries", "pub-type" : "inproceedings", "uri" : "urn:0db7071a36d365e43f351929d20589c6", "pages" : "79--88", "date" : "1998", "author" : [ "Furnas, George W.", "Rauch, Samuel J." ], "doi" : "http://doi.acm.org/10.1145/276675.276684", "type" : "Publication", "year" : "1998", "isbn" : "0-89791-965-3", "label" : "Considerations for Information Environments and the {NaviQue} Workspace", "location" : "Pittsburgh, Pennsylvania, United States", "key" : "Furnas98" }, { "publisher" : "ACM Press/Addison-Wesley Publishing Co.", "booktitle" : "Conference proceedings on Human factors in computing systems", "pub-type" : "inproceedings", "uri" : "urn:b0780a817c3bfeb9f86f75de72d1a841", "pages" : "51--58", "date" : "1995", "author" : [ "Pirolli, Peter", "Card, Stuart" ], "type" : "Publication", "year" : "1995", "isbn" : "0-201-84705-1", "label" : "Information foraging in information access environments", "location" : "Denver, Colorado, United States", "key" : "Pirolli95" }, { "publisher" : "ACM Press", "journal" : "ACM Transactions on Information Systems (TOIS)", "pub-type" : "article", "uri" : "urn:f852b4b1047849f34fed7df575df996f", "pages" : "320--341", "date" : "1999", "number" : "3", "author" : [ "Plaisant, Catherine", "Shneiderman, Ben", "Doan, Khoa", "Bruns, Tom" ], "volume" : "17", "doi" : "http://doi.acm.org/10.1145/314516.314522", "type" : "Publication", "year" : "1999", "label" : "Interface and data architecture for query preview in networked information systems", "issn" : "1046-8188", "key" : "Previews99" }, { "publisher" : "Morgan Kaufmann", "booktitle" : "VLDB\'96, Proceedings of 22th International Conference on Very Large Data Bases, September 3-6, 1996, Mumbai (Bombay), India", "pub-type" : "inproceedings", "uri" : "urn:47378bf9588ef192f462027284272d93", "pages" : "203-214", "date" : "1996", "author" : [ "Carey, Michael J.", "Haas, Laura M.", "Maganty, Vivekananda", "Williams, John H." ], "editor" : "T. M. Vijayaraman and Alejandro P. Buchmann and C. Mohan and Nandlal L. Sarda", "bibsource" : "DBLP, http://dblp.uni-trier.de", "type" : "Publication", "year" : "1996", "isbn" : "1-55860-382-4", "label" : "{PESTO}: An Integrated Query/Browser for Object Databases", "key" : "Pesto96" }, { "publisher" : "Morgan Kaufmann", "id" : "6c5a1e50c844832afe039fa8be35de94", "booktitle" : "VLDB\'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece", "pub-type" : "inproceedings", "uri" : "urn:6c5a1e50c844832afe039fa8be35de94", "pages" : "436-445", "date" : "1997", "author" : [ "Goldman, Roy", "Widom, Jennifer" ], "editor" : "Matthias Jarke and Michael J. Carey and Klaus R. Dittrich and Frederick H. Lochovsky and Pericles Loucopoulos and Manfred A. Jeusfeld", "type" : "Publication", "bibsource" : "DBLP, http://dblp.uni-trier.de", "year" : "1997", "isbn" : "1-55860-470-7", "label" : "DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases", "key" : "DataGuides97" }, { "journal" : "IBM Systems Journal", "pub-type" : "article", "uri" : "urn:292f61df57438e0813b299ddf9cc119d", "pages" : "342--342", "date" : "1977", "number" : "4", "author" : "Zloof, Mosh? M.", "volume" : "16", "type" : "Publication", "year" : "1977", "label" : "Query-by-{E}xample: a data base language", "key" : "QBE77" }, { "publisher" : "Academic Press Ltd.", "journal" : "International Journal of Man-Machine Studies", "pub-type" : "article", "uri" : "urn:d43eb71a459c0f38f9aa497dac5b0498", "pages" : "303--326", "date" : "1990", "number" : "3", "author" : [ "Greene, Sharon L.", "Devlin, Susan J.", "Cannata, Philip E.", "Gomez, Louis M." ], "volume" : "32", "type" : "Publication", "year" : "1990", "label" : "{No IFs, ANDs, or ORs: A study of databases querying}", "issn" : "0020-7373", "key" : "Greene90" }, { "publisher" : "Morgan Kaufmann", "booktitle" : "Eigth International Conference on Very Large Data Bases, September 8-10, 1982, Mexico City, Mexico, Proceedings", "pub-type" : "inproceedings", "uri" : "urn:25b131df3ab3bddf50ce6f8e1d4ad901", "pages" : "22-32", "date" : "1982", "author" : [ "Wong, Harry K. T.", "Kuo, Ivy" ], "ee" : "db/conf/vldb/WongK82.html", "bibsource" : "DBLP, http://dblp.uni-trier.de", "type" : "Publication", "year" : "1982", "isbn" : "0-934613-14-1", "label" : "GUIDE: Graphical User Interface for Database Exploration", "key" : "Wong82" }, { "url" : "citeseer.nj.nec.com/catarci95visual.html", "journal" : "Journal of Visual Languages and Computing", "pub-type" : "article", "uri" : "urn:01ac2040ee90dd8ba67fa7f554255389", "pages" : "215-260", "date" : "1997", "number" : "2", "author" : [ "Catarci, Tiziana", "Costabile, Maria Francesca", "Levialdi, Stefano", "Batini, Carlo" ], "volume" : "8", "type" : "Publication", "year" : "1997", "label" : "Visual Query Systems for Databases: A Survey", "key" : "catarci97" }, { "journal" : "ACM Computing Surveys", "pub-type" : "article", "uri" : "urn:093d9ff49deee26e41074a12f9b752b0", "pages" : "133--135", "date" : "1996-03", "number" : "1", "author" : [ "Riloff, Ellen", "Hollaar, Lee" ], "volume" : "28", "month" : "March", "type" : "Publication", "year" : "1996", "label" : "Text Databases and Information Retrieval", "key" : "Riloff96" }, { "pub-type" : [ "mastersthesis", "Master of {Eng}ineering Thesis" ], "uri" : "urn:d96b06ea9e1b4abe2d8f771891e576d4", "date" : "2000-06", "school" : "Massachusetts Institute of Technology", "author" : "Chien, Wendy S.", "month" : "June", "year" : "2000", "type" : "Publication", "label" : "Learning Query Behavior in the {Haystack} System", "address" : "Department of Electrical Engineering and Computer Science", "key" : "WChienMEngThesis" }, { "pub-type" : [ "mastersthesis", "{M.S. Thesis}" ], "uri" : "urn:c2c26ab1c3384922a1485c41c2bc0702", "date" : "2003-09", "school" : "M.I.T.", "author" : "Sinha, Vineet", "month" : "September", "year" : "2003", "type" : "Publication", "label" : "Dynamically Exploiting Available Metadata For Browsing And Information Retrieval", "address" : "Department of Electrical Engineering and Computer Science", "key" : "MSThesis" }, { "pub-type" : [ "mastersthesis", "Master of {Eng}ineering Thesis" ], "uri" : "urn:61e350acb3cd56b853b3f71146f56f2b", "date" : "1998-05", "school" : "Massachusetts Institute of Technology", "author" : "Asdoorian, Mark", "month" : "May", "year" : "1998", "type" : "Publication", "label" : "Data Manipulation Services in the Haystack IR System", "address" : "Department of Electrical Engineering and Computer Science", "key" : "MAsdoorianMEngThesis" }, { "pub-type" : [ "mastersthesis", "Master of {Eng}ineering Thesis" ], "uri" : "urn:40102f723bab0402638e18d9555812fa", "date" : "1999-05", "school" : "Massachusetts Institute of Technology", "author" : "Low, Aidan", "month" : "May", "year" : "1999", "type" : "Publication", "label" : "A Folder-Based Graphical Interface for an Information Retrieval System", "address" : "Department of Electrical Engineering and Computer Science", "key" : "ALowMEngThesis" }, { "pub-type" : [ "mastersthesis", "Master of {Eng}ineering Thesis" ], "uri" : "urn:a66f2ad752e09a4b31a69481bc3f3cce", "date" : "1999-02", "school" : "Massachusetts Institute of Technology", "author" : "Lisanskiy, Ilya", "month" : "February", "year" : "1999", "type" : "Publication", "label" : "Something About {Haystack}", "address" : "Department of Electrical Engineering and Computer Science", "key" : "ILisanskiyMEngThesis" }, { "pub-type" : [ "mastersthesis", "Master of {Eng}ineering Thesis" ], "uri" : "urn:61f5895202c2326e76319563385fae9f", "date" : "1998-05", "school" : "Massachusetts Institute of Technology", "author" : "Adar, Eytan", "month" : "May", "year" : "1998", "type" : "Publication", "label" : "Hybrid-Search and Storage of Semi--structured Information", "address" : "Department of Electrical Engineering and Computer Science", "key" : "EAdarMEngThesis" }, { "pub-type" : [ "mastersthesis", "Master of {Eng}ineering Thesis" ], "uri" : "urn:a814c4c63dbf623c16ac15534ff232e7", "date" : "2000-06", "school" : "Massachusetts Institute of Technology", "author" : "Shnitser, Svetlana", "month" : "June", "year" : "2000", "type" : "Publication", "label" : "Integrating Structural Search Capabilites Into Project{Haystack}", "address" : "Department of Electrical Engineering and Computer Science", "key" : "SShnitserMEngThesis" }, { "pub-type" : [ "mastersthesis", "Master of {Eng}ineering Thesis" ], "uri" : "urn:6b352c382eda186fb4e7491fb00bc3ab", "date" : "2003-02", "school" : "Massachusetts Institute of Technology", "author" : "Rosen, Mark", "month" : "February", "year" : "2003", "type" : "Publication", "label" : "E-mail Classification in the {Haystack} Framework", "address" : "Department of Electrical Engineering and Computer Science", "key" : "MRosenMEngThesis" }, { "publisher" : "ACM Press", "booktitle" : "Proceedings of the SIGCHI conference on Human factors in computing systems", "pub-type" : "inproceedings", "uri" : "urn:5dc971516677a779b8bfec7f3023985a", "pages" : "276--283", "date" : "1996", "author" : [ "Whittaker, Steve", "Sidner, Candace" ], "doi" : "http://doi.acm.org/10.1145/238386.238530", "type" : "Publication", "year" : "1996", "isbn" : "0-89791-777-4", "label" : "Email overload: exploring personal information management of email", "location" : "Vancouver, British Columbia, Canada", "key" : "Whittaker96" }, { "ps" : "{http://db.cis.upenn.edu/DL/97/Tutorial-Peter/tutorial-semi-pods.ps.gz}", "publisher" : "ACM Press", "booktitle" : "Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems", "pub-type" : "inproceedings", "sli_ps" : "{http://db.cis.upenn.edu/DL/97/Tutorial-Peter/slides.ps.gz}", "uri" : "urn:d0fd31c4f373623a876de7594c2be236", "pages" : "117--121", "date" : "1997", "author" : "Buneman, Peter", "doi" : "http://doi.acm.org/10.1145/263661.263675", "type" : "Publication", "year" : "1997", "abstract" : "{http://db.cis.upenn.edu/DL/97/Tutorial-Peter/abstract}", "isbn" : "0-89791-910-6", "label" : "Semistructured data", "location" : "Tucson, Arizona, United States", "key" : "buneman97semi" }, { "publisher" : "ACM Press", "journal" : "Communications of the ACM", "pub-type" : "article", "uri" : "urn:c89a04db9a9464237d8bf53d06bec90b", "pages" : "95--98", "date" : "1998", "number" : "4", "author" : [ "Shneiderman, Ben", "Byrd, Donald", "Croft, W. Bruce" ], "volume" : "41", "doi" : "http://doi.acm.org/10.1145/273035.273069", "type" : "Publication", "year" : "1998", "label" : "Sorting out searching: a user-interface framework for text searches", "issn" : "0001-0782", "key" : "Shneiderman98" }, { "publisher" : "ACM Press", "journal" : "ACM SIGACT News", "pub-type" : "article", "uri" : "urn:b766dbb3d25089a18964cc63a03fcb28", "pages" : "28--38", "date" : "1998", "number" : "4", "author" : "Suciu, Dan", "volume" : "29", "doi" : "http://doi.acm.org/10.1145/306198.306204", "type" : "Publication", "year" : "1998", "label" : "An overview of semistructured data", "issn" : "0163-5700", "key" : "suciu98overview" }, { "url" : "citeseer.nj.nec.com/mchugh97lore.html", "journal" : "SIGMOD Record", "pub-type" : "article", "uri" : "urn:b0138c7197884e88e3aec602c8c9df99", "pages" : "54-66", "date" : "1997", "number" : "3", "author" : [ "McHugh, Jason", "Abiteboul, Serge", "Goldman, Roy", "Quass, Dallan", "Widom, Jennifer" ], "volume" : "26", "type" : "Publication", "year" : "1997", "label" : "Lore: A Database Management System for Semistructured Data", "key" : "lore97" }, { "journal" : "Journal of the American Society for Information Science", "pub-type" : "article", "uri" : "urn:dfa679dc0e1cec5b0631cb2fed88ebb8", "pages" : "205--214", "date" : "1979", "number" : "4", "author" : "Bates, Marcia J.", "volume" : "30", "type" : "Publication", "year" : "1979", "label" : "Information Search Tactics", "key" : "batesSearchTactics" }, { "journal" : "Journal of the American Society for Information Science", "pub-type" : "article", "uri" : "urn:0e305cb24a4475cf2930b1bc1167000e", "pages" : "280--289", "date" : "1979", "number" : "5", "author" : "Bates, Marcia J.", "volume" : "30", "type" : "Publication", "year" : "1979", "label" : "Idea Tactics", "key" : "batesIdeaTactics" }, { "journal" : "Online Review", "pub-type" : "article", "uri" : "urn:dbf93cbf5eef57276f07de2001ecd472", "pages" : "407--424", "date" : "1985", "number" : "5", "author" : [ "Harter, Stephen P.", "Peters, Anne Rogers" ], "volume" : "9", "type" : "Publication", "year" : "1985", "label" : "Heuristics for online information retrieval: a typology and preliminary listing", "key" : "OnlineInfoRetrievalHeuristics" }, { "publisher" : "ACM Press", "booktitle" : "Proceedings of the SIGCHI conference on Human factors in computing systems", "pub-type" : "inproceedings", "uri" : "urn:096c8166898f2ad1a1b37950a081bfea", "pages" : "367--374", "date" : "1997", "author" : "Furnas, George W.", "doi" : "http://doi.acm.org/10.1145/258549.258800", "type" : "Publication", "year" : "1997", "isbn" : "0-89791-802-9", "label" : "Effective view navigation", "location" : "Atlanta, Georgia, United States", "key" : "Furnas97EVN" }, { "publisher" : "ACM Press", "booktitle" : "Proceedings of the SIGCHI conference on Human factors in computing systems", "pub-type" : "inproceedings", "uri" : "urn:bdcb9c0ab38a7c99e83f887b4f60a9a8", "pages" : "3--10", "date" : "1997", "author" : "Pirolli, Peter", "doi" : "http://doi.acm.org/10.1145/258549.258558", "type" : "Publication", "year" : "1997", "isbn" : "0-89791-802-9", "label" : "Computational models of information scent-following in a very large browsable text collection", "location" : "Atlanta, Georgia, United States", "key" : "Pirolli97" }, { "publisher" : "ACM Press", "booktitle" : "Proceedings of the SIGCHI conference on Human factors in computing systems", "pub-type" : "inproceedings", "uri" : "urn:6892f4ca0c52dca86e77212ddd31d741", "pages" : "118--125", "date" : "1996", "author" : [ "Pirolli, Peter", "Pitkow, James", "Rao, Ramana" ], "doi" : "http://doi.acm.org/10.1145/238386.238450", "type" : "Publication", "year" : "1996", "isbn" : "0-89791-777-4", "label" : "Silk from a sow\'s ear: extracting usable structures from the Web", "location" : "Vancouver, British Columbia, Canada", "key" : "Pirolli96" }, { "publisher" : "American Association for Artificial Intelligence", "journal" : "AI Magazine", "pub-type" : "article", "uri" : "urn:e89da3bf65503a44d687730ad618c608", "pages" : "38--53", "date" : "1986", "number" : "2", "author" : "Nii, H. Penny", "volume" : "7", "month" : "Summer", "type" : "Publication", "year" : "1986", "label" : "The Blackboard Model of Problem Solving and the Evolution of Blackboard Architectures", "issn" : "0738-4602", "key" : "Nii1" }, { "publisher" : "American Association for Artificial Intelligence", "journal" : "AI Magazine", "pub-type" : "article", "uri" : "urn:ff4aefa60052ec81255b20864c629047", "pages" : "82--106", "date" : "1986-08", "number" : "3", "author" : "Nii, H. Penny", "volume" : "7", "month" : "August", "type" : "Publication", "year" : "1986", "label" : "Blackboard Application Systems, Blackboard Systems and a Knowledge Engineering Perspective", "key" : "Nii2" }, { "journal" : "AI Expert", "pub-type" : "article", "uri" : "urn:6eb32c0aaee52a7eaa4d588693f8a0ae", "pages" : "40--47", "date" : "1991-09", "number" : "9", "author" : "Corkill, Daniel D.", "volume" : "6", "month" : "September", "type" : "Publication", "year" : "1991", "label" : "Blackboard Systems", "key" : "Corkill91" }, { "publisher" : "Prentice-Hall", "booktitle" : "The {SMART} Retrieval System: Experiments in Automatic Document Processing", "pub-type" : "incollection", "uri" : "urn:6d6864c2b0f867356c08c0055ddaf20b", "pages" : "313--323", "date" : "1971", "author" : "Rocchio, J. J.", "keywords" : "rocchio", "editor" : "G. Salton", "type" : "Publication", "year" : "1971", "label" : "Relevance feedback in information retrieval", "key" : "Rocchio71" }, { "url" : "citeseer.nj.nec.com/hammer97semistructured.html", "booktitle" : "Advances in Databases and Information Systems", "pub-type" : "inproceedings", "uri" : "urn:d37d71da64d506d8e76aacbe7fa28163", "pages" : "1-8", "date" : "1997", "author" : [ "Hammer, Joachim", "McHugh, Jason", "Garcia-Molina, Hector" ], "year" : "1997", "type" : "Publication", "label" : "Semistructured Data: The Tsimmis Experience", "key" : "Tsimmis" }, { "publisher" : "ACM Press", "journal" : "Communications of the ACM", "pub-type" : "article", "uri" : "urn:d8de928968fce2cc34c61abba784d4f1", "pages" : "254--258", "date" : "1983", "number" : "4", "author" : "Norman, Donald A.", "volume" : "26", "doi" : "http://doi.acm.org/10.1145/2163.358092", "type" : "Publication", "year" : "1983", "label" : "Design rules based on analyses of human error", "issn" : "0001-0782", "key" : "DonNormanHumanError" }, { "publisher" : "ACM Press", "booktitle" : "Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval", "pub-type" : "inproceedings", "uri" : "urn:3eb0703f01b5d72fe0c896f2e0f9e3c1", "pages" : "151--158", "date" : "2003", "author" : [ "Carmel, David", "Maarek, Yoelle S.", "Mandelbrod, Matan", "Mass, Yosi", "Soffer, Aya" ], "doi" : "http://doi.acm.org/10.1145/860435.860464", "type" : "Publication", "year" : "2003", "isbn" : "1-58113-646-3", "label" : "Searching {XML} documents via {XML} fragments", "location" : "Toronto, Canada", "key" : "XMLFrag" }, { "publisher" : "ACM Press", "booktitle" : "Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval", "pub-type" : "inproceedings", "uri" : "urn:8e5a537eae3107de2fb35b98a5a1b20a", "pages" : "409--410", "date" : "2003", "author" : [ "Kamps, Jaap", "Marx, Maarten", "Rijke}, Maarten {de", "Sigurbj?rnsson, B?rkur" ], "doi" : "http://doi.acm.org/10.1145/860435.860525", "type" : "Publication", "year" : "2003", "isbn" : "1-58113-646-3", "label" : "{XML} retrieval: {W}hat to retrieve?", "location" : "Toronto, Canada", "key" : "XMLWhatToRetrieve" }, { "publisher" : "Springer-Verlag", "booktitle" : "Proceedings of the First International Workshop on the Web and Databases (WebDB \'98), Lecture Notes in Computer Science 1590", "pub-type" : "inproceedings", "uri" : "urn:4d5e2c6802b6184630d69ca244ec18b8", "pages" : "52--62", "date" : "1998-03", "author" : [ "Goldman, Roy", "Widom, Jennifer" ], "month" : "March", "type" : "Publication", "year" : "1998", "label" : "Interactive Query and Search in Semistructured Databases", "location" : "Berlin", "key" : "DataGuidesSearch" }, { "publisher" : "Springer-Verlag Heidelberg", "booktitle" : "Proceedings of the Fifth International Conference on Flexible Query Answering Systems (FQAS 2002), Lecture Notes in Computer Science 2522", "pub-type" : "inproceedings", "uri" : "urn:d6bc259e0998edd819e15ce81c2eba83", "pages" : "356--369", "date" : "2002-10", "author" : "Trigoni, Agathoniki", "month" : "October", "type" : "Publication", "year" : "2002", "label" : "Interactive Query Formulation in Semistructured Databases", "location" : "Copenhagen, Denmark", "key" : "Trigoni02" }, { "booktitle" : "Proceedings of the First Biennial Conference on Innovative Data Systems Research (CIDR)", "pub-type" : "inproceedings", "uri" : "urn:e0bf01f5207bfffb26f0676f6a8ca720", "date" : "2003-01", "author" : [ "Halevy, Alon", "Etzioni, Oren", "Doan, AnHai", "Ives, Zachary", "Madhavan, Jayant", "McDowell, Luke", "Tatarinov, Igor" ], "month" : "January", "type" : "Publication", "year" : "2003", "label" : "Crossing the Structure Chasm", "key" : "Halevy:StructureChasm" }, { "booktitle" : "Second International Semantic Web Conference (ISWC)", "pub-type" : "inproceedings", "uri" : "urn:e9b0873916c172ece61be1ff12f2d3c7", "date" : "2003", "author" : [ "McDowell, Luke", "Etzioni, Oren", "Halevy, Alon", "Levy, Henry", "Gribble, Steven", "Pentney, William", "Verma, Deepak", "Vlasseva, Stani" ], "type" : "Publication", "year" : "2003", "label" : "Mangrove: Enticing Ordinary People onto the Semantic Web via Instant Gratification", "key" : "McDowell:Mangrove" }, { "publisher" : "Academic Press", "booktitle" : "Representation and Understanding", "pub-type" : "incollection", "uri" : "urn:2710846951e348d7dd1aa00586827757", "pages" : "35-82", "date" : "1975", "author" : "Woods, William A.", "editor" : "D. G. Bobrow and A. Collins", "type" : "Publication", "year" : "1975", "label" : "What\'s in a Link: Foundations for Semantic Networks", "address" : "New York", "key" : "Woods:SemanticNetwork" }, { "publisher" : "ACM Press", "booktitle" : "UIST \'05: Proceedings of the 18th annual ACM symposium on User interface software and technology", "pub-type" : "inproceedings", "uri" : "urn:931f4fe8107ab474437381b6e6818f89", "pages" : "163--172", "date" : "2005", "author" : [ "Bolin, Michael", "Webber, Matthew", "Rha, Philip", "Wilson, Tom", "Miller, Robert C." ], "doi" : "http://doi.acm.org/10.1145/1095034.1095062", "type" : "Publication", "year" : "2005", "isbn" : "1-59593-271-2", "label" : "Automation and customization of rendered web pages", "location" : "Seattle, WA, USA", "address" : "New York, NY, USA", "key" : "Bolin05" }, { "booktitle" : "Proceedings of the 7th International World Wide Web Conference (WWW7)", "pub-type" : "inproceedings", "uri" : "urn:6a42b17e48b3c09471c79d0a59ca3c35", "date" : "1998", "author" : [ "Kistler, Thomas", "Marais, Hannes" ], "type" : "Publication", "year" : "1998", "label" : "{WebL} -- a programming language for the {Web}", "key" : "Kistler98" }, { "journal" : "IEEE Internet Computing", "pub-type" : "article", "uri" : "urn:3d4abb95c1a071574d97dd3df069ca66", "pages" : "34--38", "date" : "1997", "number" : "4", "author" : "Krulwich, Bruce", "volume" : "1", "type" : "Publication", "year" : "1997", "label" : "Automating the {Internet}: Agents as User Surrogates", "key" : "Krulwich97" }, { "booktitle" : "{USENIX} 2000 Annual Technical Conference", "pub-type" : "inproceedings", "uri" : "urn:5858b678b8e49a9452cb54ddd7eb8367", "pages" : "171--182", "date" : "2000-06", "author" : [ "Miller, Robert C.", "Myers, Brad A." ], "month" : "June", "type" : "Publication", "year" : "2000", "label" : "Integrating a Command Shell into a Web Browser", "key" : "Miller00" }, { "booktitle" : "Proceedings of User Interface Software and Technology (UIST 98)", "pub-type" : "inproceedings", "uri" : "urn:60e020e74d2e2ff372f51e89afa160f1", "pages" : "9--18", "date" : "1998", "author" : [ "Sugiura, Atsushi", "Koseki, Yoshiyuki" ], "year" : "1998", "type" : "Publication", "label" : "{Internet Scrapbook}: Automating Web Browsing Tasks by Demonstration", "key" : "Sugiura98" }, { "url" : "citeseer.ist.psu.edu/anupam00automating.html", "journal" : "Computer Networks (Amsterdam, Netherlands: 1999)", "pub-type" : "article", "uri" : "urn:e2904998f28982379d673f4eb01b2740", "pages" : "503--517", "date" : "2000", "number" : "1--6", "author" : [ "Anupam, Vinod", "Freire, Juliana", "Kumar, Bharat", "Lieuwen, Daniel" ], "volume" : "33", "type" : "Publication", "year" : "2000", "label" : "Automating {Web} navigation with the {WebVCR}", "key" : "anupam00automating" }, { "publisher" : "ACM Press", "booktitle" : "UIST \'04: Proceedings of the 17th annual ACM symposium on User interface software and technology", "pub-type" : "inproceedings", "uri" : "urn:03fafbb3de3d6b9081fb3b61dde691b3", "pages" : "175--184", "date" : "2004", "author" : [ "Fujima, Jun", "Lunzer, Aran", "Hornb\\&\\#230;k, Kasper", "Tanaka, Yuzuru" ], "doi" : "http://doi.acm.org/10.1145/1029632.1029664", "type" : "Publication", "year" : "2004", "isbn" : "1-58113-957-8", "label" : "Clip, connect, clone: combining application elements to build custom interfaces for information access", "location" : "Santa Fe, NM, USA", "address" : "New York, NY, USA", "key" : "Fujima04" }, { "organization" : "{Ekiwi, LLC}", "pub-type" : "misc", "uri" : "urn:b10c38868ede93c3ab13337fdd3d3fe6", "date" : "2004", "type" : "Publication", "year" : "2004", "howpublished" : "http://www.screen-scraper.com/", "label" : "{screen-scraper}: solutions for web data extraction", "key" : "screenscraper" }, { "journal" : "World Wide Web", "pub-type" : "article", "uri" : "urn:1f2cdf67202ef996206f8bbf61f5d44f", "pages" : "79--94", "date" : "2000", "number" : "2", "author" : "Kushmerick, Nicholas", "volume" : "3", "type" : "Publication", "year" : "2000", "note" : "http://citeseer.nj.nec.com/article/kushmerick00wrapper.html\", ", "label" : "Wrapper verification", "key" : "Kushmerick00" }, { "id" : "698348c198a61645838d1de5de19ed7d", "booktitle" : "Proceedings of International Joint Conference on Artificial Intelligence (IJCAI)", "pub-type" : "inproceedings", "uri" : "urn:698348c198a61645838d1de5de19ed7d", "pages" : "729--737", "date" : "1997", "author" : [ "Kushmerick, Nicholas", "Weld, Daniel S.", "Doorenbos, Robert" ], "type" : "Publication", "year" : "1997", "label" : "Wrapper Induction for Information Extraction", "key" : "Kushmerick97" }, { "publisher" : "ACM Press", "id" : "ffd26d1904466ee807e50d55b3c181b2", "booktitle" : "Proceedings of the third annual conference on Autonomous Agents", "pub-type" : "inproceedings", "uri" : "urn:ffd26d1904466ee807e50d55b3c181b2", "pages" : "190--197", "date" : "1999", "author" : [ "Muslea, Ion", "Minton, Steven", "Knoblock, Craig" ], "doi" : "http://doi.acm.org/10.1145/301136.301191", "type" : "Publication", "year" : "1999", "isbn" : "1-58113-066-X", "label" : "A hierarchical approach to wrapper induction", "location" : "Seattle, Washington, United States", "key" : "Muslea99" }, { "publisher" : "ACM Press", "booktitle" : "Proceeding of the third international workshop on Web information and data management", "pub-type" : "inproceedings", "uri" : "urn:335ddac3394bb82e4fa7ce29395b1c3c", "pages" : "24--30", "date" : "2001", "author" : "Chidlovskii, Boris", "doi" : "http://doi.acm.org/10.1145/502932.502938", "type" : "Publication", "year" : "2001", "isbn" : "1-58113-444-4", "label" : "Automatic repairing of web wrappers", "location" : "Atlanta, Georgia, USA", "key" : "Chidlovskii01" }, { "publisher" : "Physica-Verlag GmbH", "journal" : "Intelligent exploration of the web", "pub-type" : "article", "uri" : "urn:2fa04a1cf4e4102bbca96df79353ba4f", "pages" : "275--287", "date" : "2003", "author" : [ "Knoblock, Craig A.", "Lerman, Kristina", "Minton, Steven", "Muslea, Ion" ], "type" : "Publication", "year" : "2003", "isbn" : "3-7908-1529-2", "label" : "Accurately and reliably extracting data from the Web: a machine learning approach", "key" : "Knoblock03" }, { "journal" : "Journal of Artificial Intelligence Research", "pub-type" : "article", "uri" : "urn:f335cf9eb28362ae2d8d74b905cc697e", "pages" : "149--181", "date" : "2003", "author" : [ "Lerman, Kristina", "Minton, Steven N.", "Knoblock, Craig A." ], "volume" : "18", "type" : "Publication", "year" : "2003", "label" : "Wrapper maintenance: a machine learning approach", "key" : "Lerman03" }, { "publisher" : "ACM Press", "booktitle" : "Proceedings of the 2004 ACM SIGMOD international conference on Management of data", "pub-type" : "inproceedings", "uri" : "urn:c5151a2db525eb77ebc0c98eeb15ca40", "pages" : "119--130", "date" : "2004", "author" : [ "Lerman, Kristina", "Getoor, Lise", "Minton, Steven", "Knoblock, Craig" ], "doi" : "http://doi.acm.org/10.1145/1007568.1007584", "type" : "Publication", "year" : "2004", "isbn" : "1-58113-859-8", "label" : "Using the structure of Web sites for automatic segmentation of tables", "location" : "Paris, France", "key" : "Lerman04" }, { "url" : "citeseer.ist.psu.edu/ciravegna03integrating.html", "booktitle" : "Proc. IJCAI 2003", "pub-type" : "inproceedings", "uri" : "urn:97a513a17e980e55c5e3669163f893d0", "date" : "2003", "author" : [ "Ciravegna, F.", "Dingli, A.", "Guthrie, D.", "Wilks, Y." ], "type" : "Publication", "year" : "2003", "label" : "Integrating Information to Bootstrap Information Extraction from Web Sites", "key" : "ciravegna03integrating" }, { "pub-type" : "misc", "uri" : "urn:4efa8e5bdc85d942607c47e0b7dc71bb", "date" : "2003", "author" : [ "Miller, Robert C.", "others" ], "type" : "Publication", "year" : "2003", "howpublished" : "http://graphics.lcs.mit.edu/lapis/", "label" : "{LAPIS} 1.2", "key" : "LAPIS" }, { "publisher" : "MIT Press", "booktitle" : "Watch What I Do: Programming by Demonstration", "pub-type" : "incollection", "uri" : "urn:74d3f728a7c64bd246a8361727d1192e", "pages" : "183--204", "date" : "1993", "author" : [ "Witten, Ian H.", "Mo, Dan" ], "editor" : "Allen Cypher", "type" : "Publication", "year" : "1993", "label" : "{TELS}: Learning Text Editing Tasks From Examples", "key" : "Witten93" }, { "booktitle" : "Proceedings of the 11th International IEEE Symposium on Visual Languages \'95", "pub-type" : "inproceedings", "uri" : "urn:015150b9a57d803f574e07ff853dcc76", "pages" : "267--274", "date" : "1995", "author" : [ "Landauer, Jurgen", "Hirakawa, Masahito" ], "type" : "Publication", "note" : "http://www.computer.org/conferen/vl95/talks/T32.html", "year" : "1995", "label" : "Visual {AWK}: a model for text processing by demonstration", "key" : "Landauer95" }, { "booktitle" : "Proceedings of the International Conference on Intelligent User Interfaces (IUI \'98)", "pub-type" : "inproceedings", "uri" : "urn:d95174df71d522f8aef5059e18599266", "pages" : "101--108", "date" : "1998", "author" : "Fujishima, Yuzo", "type" : "Publication", "note" : "http://doi.acm.org/10.1145/268389.268408", "year" : "1998", "label" : "Demonstrational Automation of Text Editing Tasks Involving Multiple Focus Points and Conversions", "key" : "Fujishima98" }, { "booktitle" : "Proceedings of ICML 2000", "pub-type" : "inproceedings", "uri" : "urn:61c9f2a41f14541acde4b41d8ad080c4", "pages" : "527--534", "date" : "2000-06", "author" : [ "Lau, Tessa", "Domingos, Pedro", "Weld, Daniel S." ], "month" : "June", "type" : "Publication", "year" : "2000", "note" : "http://www.ofb.net/ tlau/research/papers/icml2000.ps", "label" : "Version Space Algebra and its Application to Programming by Demonstration", "key" : "Lau00" }, { "publisher" : "Morgan Kaufmann", "booktitle" : "Your Wish Is My Command: Giving Users the Power to Instruct Their Software", "pub-type" : "incollection", "uri" : "urn:e38d1c5566982ebe14059f3938502970", "pages" : "209--226", "date" : "2001", "author" : [ "Lau, Tessa", "Wolfman, Steven", "Domingos, Pedro", "Weld, Daniel S." ], "editor" : "Henry Lieberman", "type" : "Publication", "year" : "2001", "note" : "http://www.ofb.net/ tlau/research/yourwish/smartedit.html", "label" : "Learning Repetitive Text-Editing Procedures with {SMARTedit}", "key" : "Lau01" }, { "booktitle" : "Proceedings of the 2001 {USENIX} Annual Technical Conference", "pub-type" : "inproceedings", "uri" : "urn:77e280d229022444995fde104e67adaf", "pages" : "161--174", "date" : "2001-06", "author" : [ "Miller, Robert C.", "Myers, Brad A." ], "month" : "June", "type" : "Publication", "year" : "2001", "label" : "Interactive Simultaneous Editing of Multiple Text Regions", "key" : "Miller01b" }, { "publisher" : "{MIT} Press", "pub-type" : "book", "uri" : "urn:bd5a896d2ea3da7098ef42f3ad9e2e63", "date" : "1993", "author" : "Nardi, Bonnie A.", "type" : "Publication", "year" : "1993", "label" : "A Small Matter of Programming: Perspectives on End User Computing", "key" : "Nardi93" }, { "booktitle" : "Proceedings of Intelligent User Interfaces (IUI \'04)", "pub-type" : "inproceedings", "uri" : "urn:9509642fb2adbb0f9ad710b13373e75a", "date" : "2004", "author" : [ "Gajos, Krzysztof", "Weld, Daniel S." ], "type" : "Publication", "year" : "2004", "label" : "{SUPPLE:} Automatically Generating User Interfaces", "key" : "Gajos:Supple" }, { "publisher" : "MIT Press", "pub-type" : "book", "uri" : "urn:4b37d7c02154acc5367ba667ad6d41fa", "date" : "1993", "editor" : "Allen Cypher", "type" : "Publication", "year" : "1993", "label" : "Watch What I Do: Programming by Demonstration", "key" : "Cypher93" }, { "publisher" : "Morgan Kaufmann", "pub-type" : "book", "uri" : "urn:40bc53c16d8a559338356fb2971dabcd", "date" : "2001", "editor" : "Henry Lieberman", "type" : "Publication", "year" : "2001", "label" : "Your Wish Is My Command: Giving Users the Power to Instruct Their Software", "key" : "Lieberman01" }, { "publisher" : "ACM Press", "booktitle" : "CHI \'87: Proceedings of the SIGCHI/GI conference on Human factors in computing systems and graphics interface", "pub-type" : "inproceedings", "uri" : "urn:2b8cf2d5395c905286651cf45d968fe5", "pages" : "255--260", "date" : "1987", "author" : "Somberg, Benjamin L.", "doi" : "http://doi.acm.org/10.1145/29933.275639", "type" : "Publication", "year" : "1987", "isbn" : "0-89791-213-6", "label" : "A comparison of rule-based and positionally constant arrangements of computer menu items", "location" : "Toronto, Ontario, Canada", "address" : "New York, NY, USA", "key" : "Somberg87" }, { "publisher" : "ACM Press", "booktitle" : "IUI \'05: Proceedings of the 10th international conference on Intelligent user interfaces", "pub-type" : "inproceedings", "uri" : "urn:4252051550fd3ba664ad1758b9e20deb", "pages" : "305--307", "date" : "2005", "author" : [ "Liu, Hugo", "Lieberman, Henry" ], "doi" : "http://doi.acm.org/10.1145/1040830.1040908", "type" : "Publication", "year" : "2005", "isbn" : "1-58113-894-6", "label" : "Metafor: visualizing stories as code", "location" : "San Diego, California, USA", "address" : "New York, NY, USA", "key" : "Liu05" }, { "publisher" : "ACM Press", "journal" : "ACM Trans. Comput.-Hum. Interact.", "pub-type" : "article", "uri" : "urn:ebab1a3414f1049878c8303b6b9a1374", "pages" : "27--51", "date" : "1994", "number" : "1", "author" : [ "Sears, Andrew", "Shneiderman, Ben" ], "volume" : "1", "doi" : "http://doi.acm.org/10.1145/174630.174632", "type" : "Publication", "year" : "1994", "label" : "Split menus: effectively using selection frequency to organize menus", "issn" : "1073-0516", "address" : "New York, NY, USA", "key" : "Sears94" }, { "publisher" : "ACM Press", "journal" : "SIGCHI Bull.", "pub-type" : "article", "uri" : "urn:41cc2a34abd6e1016d2c83c05a2264b3", "pages" : "33--37", "date" : "1989", "number" : "4", "author" : [ "Mitchell, J.", "Shneiderman, Ben" ], "volume" : "20", "doi" : "http://doi.acm.org/10.1145/67243.67247", "type" : "Publication", "year" : "1989", "label" : "Dynamic versus static menus: an exploratory comparison", "issn" : "0736-6906", "address" : "New York, NY, USA", "key" : "Mitchell89" }, { "url" : "citeseer.ist.psu.edu/pane00studying.html", "journal" : "International Journal of Human Computer Studies", "pub-type" : "article", "uri" : "urn:3fd4837539208f8e86e3dbe444d0eb54", "pages" : "237-264", "date" : "2001", "number" : "2", "author" : [ "Pane, John F.", "Ratanamahatana, Chotirat (Ann)", "Myers, Brad A." ], "volume" : "54", "type" : "Publication", "year" : "2001", "label" : "Studying the language and structure in non-programmers\' solutions to programming problems", "key" : "pane01studying" }, { "journal" : "Dlib", "pub-type" : "article", "uri" : "urn:86f9bff21c9fec8431d9a17fcc2f7994", "date" : "2006-01", "number" : "1", "author" : [ "Guy, Marieke", "Tonkin, Emma" ], "volume" : "12", "month" : "January", "type" : "Publication", "year" : "2006", "note" : "Digital publication, available at http://www.dlib.org/dlib/january06/guy/01guy.html", "label" : "Folksonomies: Tidying up Tags?", "key" : "Guy:Folksonomy" }, { "publisher" : "Springer", "alteditor" : "Vladimir Geroimenko and Chaomei Chen", "chapter" : "9", "booktitle" : "Visualizing the Semantic Web", "pub-type" : "inbook", "uri" : "urn:0a3528bbded0d933ce628739b1f4dcda", "pages" : "154-171", "date" : "2005", "author" : [ "Frasincar, Flavius", "Telea, Alexandru", "Houben, Geert-Jan" ], "edition" : "2", "type" : "Publication", "year" : "2005", "label" : "Adapting graph visualization techniques for the visualization of RDF data", "key" : "Frasincar:RDFViz" }, { "url" : "citeseer.ist.psu.edu/article/rutledge03finding.html", "booktitle" : "Proceedings of the 14th ACM conference on Hypertext and Hypermedia", "pub-type" : "inproceedings", "uri" : "urn:033dcf434876a94f6dc18556273c137f", "pages" : "67-76", "date" : "2003", "author" : [ "Rutledge, Lloyd", "Alberink, M.", "Brussee, R.", "Pokraev, S.", "Dieten, W. van", "Veenstra, M." ], "type" : "Publication", "year" : "2003", "label" : "Finding the Story --- Broader Applicability of Semantics and Discourse for Hypermedia Generation", "key" : "Rutledge:Finding", "text" : "L. Rutledge, M. Alberink, R. Brussee, S. Pokraev, W. van Dieten, and M. Veenstra. Finding the Story --- Broader Applicability of Semantics and Discourse for Hypermedia Generation. In, Nottingham, UK, August 26-30, 2003. http: //www.ht03.org/." }, { "booktitle" : "International Conference on Combinatorics and Computing", "pub-type" : "inproceedings", "uri" : "urn:a4baca8b55d1e29bbb628dc41d74f62d", "date" : "1999", "author" : [ "Kleinberg, Jon", "Kumar, S. R.", "Raghavan, Prabhakar", "Rajagopalan, Sridhar", "Tomkins, Andrew" ], "note" : "Invited Survey", "type" : "Publication", "year" : "1999", "label" : "The Web as a graph: Measurements, models and methods", "key" : "Kleinberg:WebAsGraph" }, { "publisher" : "North-Holland Publishing Co.", "booktitle" : "Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking", "pub-type" : "inproceedings", "uri" : "urn:cfcb37d94617c0d22444c669c970fdce", "pages" : "309--320", "date" : "2000", "author" : [ "Broder, Andrei", "Kumar, Ravi", "Maghoul, Farzin", "Raghavan, Prabhakar", "Rajagopalan, Sridhar", "Stata, Raymie", "Tomkins, Andrew", "Wiener, Janet" ], "doi" : "http://dx.doi.org/10.1016/S1389-1286(00)00083-9", "type" : "Publication", "year" : "2000", "label" : "Graph structure in the Web", "location" : "Amsterdam, The Netherlands", "address" : "Amsterdam, The Netherlands, The Netherlands", "key" : "Broder:Bowtie" }, { "publisher" : "ACM Press", "journal" : "Communications of the ACM", "pub-type" : "article", "uri" : "urn:3d27c7ad553307271bc2b855c935decb", "pages" : "59--61", "date" : "2006", "number" : "4", "author" : "Hearst, Marti A.", "volume" : "49", "doi" : "http://doi.acm.org/10.1145/1121949.1121983", "type" : "Publication", "year" : "2006", "label" : "Clustering versus faceted categories for information exploration", "issn" : "0001-0782", "address" : "New York, NY, USA", "key" : "Hearst:Clustering" }, { "journal" : "Journal of Web Semantics", "pub-type" : "article", "uri" : "urn:35927688a25eafece1301d97e6a510da", "date" : "2005", "number" : "2", "author" : [ "Kalyanpur, Aditya", "Parsia, Bijan", "Sirin, Evren", "Cuenca-Grau, Bernardo", "Hendler, James" ], "volume" : "4", "type" : "Publication", "year" : "2005", "label" : "Swoop: A \'Web\' Ontology Editing Browser", "key" : "Kalyanpur:Swoop" }, { "journal" : "IEEE Computer", "pub-type" : "article", "uri" : "urn:cfad9fe8174b80ee7e41df7d2913e36a", "pages" : "80-86", "date" : "2002-07", "number" : "7", "author" : [ "Seo, Jinwook", "Shneiderman, Ben" ], "volume" : "35", "month" : "July", "type" : "Publication", "year" : "2002", "label" : "Interactively Exploring Hierarchical Clustering Results", "key" : "Seo:HierarchicalCluster" }, { "booktitle" : "Proceedings of V MUSICNETWORK OPEN WORKSHOP: Integration of Music in Multimedia Applications", "pub-type" : "inproceedings", "uri" : "urn:e013ea7b39ecbe939863c2a3f1ddfca1", "date" : "2005", "author" : [ "schraefel, m. c.", "Smith, D. A.", "Russel, A.", "Owens, A.", "Harris, C.", "Wilson, M. L." ], "type" : "Publication", "year" : "2005", "label" : "The mSpace Classical Music Explorer: Improving Access to Classical Music for Real People", "key" : "Schraefel:Mspace" }, { "journal" : "Information Visualization", "pub-type" : "article", "uri" : "urn:e479761c889a1b1db3849b67f21c69c0", "pages" : "50-65", "date" : "2002", "number" : "1", "author" : [ "Robertson, G. G.", "Cameron, K.", "Czerwinski, M.", "Robbins, D." ], "volume" : "1", "type" : "Publication", "year" : "2002", "label" : "Polyarchy Visualization: Visualizing multiple intersecting hierarchies", "key" : "Robertson:Pivot" }, { "publisher" : "ACM Press", "booktitle" : "CHI \'03: Proceedings of the SIGCHI conference on Human factors in computing systems", "pub-type" : "inproceedings", "uri" : "urn:f8c8109185d061c9f796e73da6b010ac", "pages" : "345--352", "date" : "2003", "author" : [ "Bellotti, Victoria", "Ducheneaut, Nicolas", "Howard, Mark", "Smith, Ian" ], "doi" : "http://doi.acm.org/10.1145/642611.642672", "type" : "Publication", "year" : "2003", "isbn" : "1-58113-630-7", "label" : "Taking email to task: the design and evaluation of a task management centered email tool", "location" : "Ft. Lauderdale, Florida, USA", "address" : "New York, NY, USA", "key" : "Bellotti:Taskmaster" }, { "booktitle" : "$5^{th}$ International Semantic Web Conference (ISWC)", "pub-type" : "inproceedings", "uri" : "urn:5ebefd6fb3e6bfc6851204f58b9e8993", "date" : "2006", "author" : [ "Hildebrand, Michiel", "van Ossenbruggen, Jacco", "Hardman, Lynda" ], "note" : "To appear", "type" : "Publication", "year" : "2006", "label" : "/facet: A Browser for Heterogeneous Semantic Web Repositories", "key" : "Hildebrand:Slashfacet" }, { "journal" : "Journal of Digital Information", "pub-type" : "article", "uri" : "urn:d1c7c38247e035f48de2f6207bb0b1f1", "date" : "2004", "number" : "1", "author" : [ "schraefel, m. c.", "Carr, Leslie", "Roure, David De", "Hall, Wendy" ], "volume" : "5", "type" : "Publication", "year" : "2004", "label" : "You\'ve Got Hypertext", "key" : "Schraefel:Hypertext" }, { "publisher" : "Springer-Verlag", "booktitle" : "Proceedings of the 1994 European Symposium on Algorithms", "pub-type" : "proceedings", "venue" : "ESA", "uri" : "urn:44df9dcef7abda3875adaf854834b595", "date" : "1994-09", "editor" : "van Leeuwen, Jan", "month" : "September", "year" : "1994", "type" : "Publication", "label" : "Proceedings of the 1994 European Symposium on Algorithms", "key" : "esa94" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "stoc84", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:22497fdf5d36736a7b28eee097e67997", "date" : "1984", "year" : "1984", "type" : "Publication", "label" : "stoc84", "key" : "stoc84" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "stoc85", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:7df8b51a081a36c5eab1873ec657a702", "date" : "1985", "year" : "1985", "type" : "Publication", "label" : "stoc85", "key" : "stoc85" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$18^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:9fe1420357ffb234ccc7502c89286e30", "date" : "1986", "year" : "1986", "type" : "Publication", "label" : "Proceedings of the {$18^{th}$} {ACM} Symposium on Theory of Computing", "key" : "stoc86" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$19^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:d5461e9a622def12a0fddfef16ed926b", "date" : "1987", "year" : "1987", "type" : "Publication", "label" : "Proceedings of the {$19^{th}$} {ACM} Symposium on Theory of Computing", "key" : "stoc87" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$20^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:50f63a9a513d59548d5d1daab6eb014e", "date" : "1988", "year" : "1988", "type" : "Publication", "label" : "Proceedings of the {$20^{th}$} {ACM} Symposium on Theory of Computing", "key" : "stoc88" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$21^{st}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:eda447332740a84ff6f082a22b87d1fa", "date" : "1989", "year" : "1989", "type" : "Publication", "label" : "Proceedings of the {$21^{st}$} {ACM} Symposium on Theory of Computing", "key" : "stoc89" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$22^{nd}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:9fd7360b02d883212f8c2ef125def3b6", "date" : "1990-05", "month" : "May", "year" : "1990", "type" : "Publication", "label" : "Proceedings of the {$22^{nd}$} {ACM} Symposium on Theory of Computing", "key" : "stoc90" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$23^{rd}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:11eed07b68e5a36038993585fefe9a92", "date" : "1991-05", "month" : "May", "year" : "1991", "type" : "Publication", "label" : "Proceedings of the {$23^{rd}$} {ACM} Symposium on Theory of Computing", "key" : "stoc91" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$24^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:939cc51351fd83be7c5cc068e20e6ee3", "date" : "1992-05", "place" : "Victora, BC, Canada", "month" : "May", "year" : "1992", "type" : "Publication", "label" : "Proceedings of the {$24^{th}$} {ACM} Symposium on Theory of Computing", "key" : "stoc92" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:da06139f71d3b9cb609fec7096d84176", "date" : "1993-05", "place" : "San Diego, CA", "editor" : "Alok Aggarwal", "month" : "May", "type" : "Publication", "year" : "1993", "label" : "Proceedings of the {$25^{th}$} {ACM} Symposium on Theory of Computing", "key" : "stoc93" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:9933d879d38eeb680e898a12e91a3589", "date" : "1994-05", "place" : "Montreal, Quebec, Canada", "month" : "May", "year" : "1994", "type" : "Publication", "label" : "Proceedings of the {$26^{th}$} {ACM} Symposium on Theory of Computing", "key" : "stoc94" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:cc78bef8c3356bf1745eac8468bc40af", "date" : "1995-05", "place" : "Las Vegas, NV", "month" : "May", "year" : "1995", "type" : "Publication", "label" : "Proceedings of the {$27^{th}$} {ACM} Symposium on Theory of Computing", "key" : "stoc95" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$28^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:66ea5745f9f07eafbfc8abf1e25560ff", "date" : "1996-05", "place" : "Philadelphia, PA", "editor" : "Gary Miller", "month" : "May", "type" : "Publication", "year" : "1996", "label" : "Proceedings of the {$28^{th}$} {ACM} Symposium on Theory of Computing", "key" : "stoc96" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$29^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:98903371af780e968ea00c3bebd9ddd0", "date" : "1997-05", "place" : "El Paso, TX", "month" : "May", "year" : "1997", "type" : "Publication", "label" : "Proceedings of the {$29^{th}$} {ACM} Symposium on Theory of Computing", "key" : "stoc97" }, { "publisher" : "ACM Press", "organization" : "ACM", "id" : "6d0df7fe6c2a810e01136e60fabb2543", "booktitle" : "Proceedings of the {$29^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:6d0df7fe6c2a810e01136e60fabb2543", "date" : "1998-05", "place" : "Dallas, TX", "month" : "May 23--26", "type" : "Publication", "year" : "1998", "isbn" : "0-89791-962-9", "label" : "Proceedings of the {$29^{th}$} {ACM} Symposium on Theory of Computing", "address" : "New York", "key" : "stoc98" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$30^{th}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:329ec8f39d7e9dc177feff715d9947e6", "date" : "1999-05", "place" : "Philadelphia, PA", "month" : "May", "year" : "1999", "type" : "Publication", "label" : "Proceedings of the {$30^{th}$} {ACM} Symposium on Theory of Computing", "key" : "stoc99" }, { "publisher" : "ACM Press", "organization" : "ACM", "booktitle" : "Proceedings of the {$33^{rd}$} {ACM} Symposium on Theory of Computing", "pub-type" : "proceedings", "venue" : "STOC", "uri" : "urn:d14e85aeb34d2aa455d8fd3809ae1235", "date" : "2002-05", "place" : "Montreal, Canada", "month" : "May", "year" : "2002", "type" : "Publication", "label" : "Proceedings of the {$33^{rd}$} {ACM} Symposium on Theory of Computing", "key" : "stoc02" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "{IEEE}", "booktitle" : "Proceedings of the {$20^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:b73c60fa3ee05625af4ce680c0123ec2", "date" : "1979-10", "place" : "San Juan, Puerto Rico", "month" : "October", "type" : "Publication", "year" : "1979", "label" : "Proceedings of the {$20^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs79" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$23^{rd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:455f5f3483e671e4cb31ff3f8d3aee1a", "date" : "1982", "year" : "1982", "type" : "Publication", "label" : "Proceedings of the {$23^{rd}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs82" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$25^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:a98f37a7baddc96455d6669a6052c5e1", "date" : "1984", "year" : "1984", "type" : "Publication", "label" : "Proceedings of the {$25^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs84" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$27^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:d160006b5ebe70d622e5a9724551cf4d", "date" : "1986", "year" : "1986", "type" : "Publication", "label" : "Proceedings of the {$27^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs86" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$28^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:2d0779d925a8e3eff37f088bb9acb352", "date" : "1987", "year" : "1987", "type" : "Publication", "label" : "Proceedings of the {$28^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs87" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$29^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:7e5f19086b1a0efacf4310f994078807", "date" : "1988-10", "month" : "October", "year" : "1988", "type" : "Publication", "label" : "Proceedings of the {$29^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs88" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "id" : "d67d268055bde95f8913385c120a0ea3", "booktitle" : "Proceedings of the {$30^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:d67d268055bde95f8913385c120a0ea3", "date" : "1989", "year" : "1989", "type" : "Publication", "label" : "Proceedings of the {$30^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs89" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$31^{st}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:c21cdb50d091e6d978f0f74136c2a509", "date" : "1990-10", "month" : "October", "year" : "1990", "type" : "Publication", "label" : "Proceedings of the {$31^{st}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs90" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:4faa45fab99031c2e9e9b244e8b7e773", "date" : "1991-10", "place" : "San Juan, Puerto Rico", "month" : "October", "year" : "1991", "type" : "Publication", "label" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs91" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "id" : "5ed72fd951313adbaa6f4fea39148a0b", "booktitle" : "Proceedings of the {$33^{rd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:5ed72fd951313adbaa6f4fea39148a0b", "date" : "1992-10", "place" : "Pittsburgh, PA", "month" : "October", "type" : "Publication", "year" : "1992", "label" : "Proceedings of the {$33^{rd}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs92" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$34^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:296f4ee5ce8864e428c3e2418c906c78", "date" : "1993-11", "place" : "Palo Alto, CA", "editor" : "Leonidas Guibas", "month" : "November", "type" : "Publication", "year" : "1993", "label" : "Proceedings of the {$34^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs93" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:d530161aafff5e48b52a6983d2eb0faa", "date" : "1994-11", "place" : "Santa Fe, NM", "editor" : "Shafi Goldwasser", "month" : "November", "type" : "Publication", "year" : "1994", "label" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs94" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "id" : "4f92a6a10a0562a42ae5d18c125dff20", "booktitle" : "Proceedings of the {$36^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:4f92a6a10a0562a42ae5d18c125dff20", "date" : "1995-10", "place" : "Milwaukie, WI", "month" : "October", "type" : "Publication", "year" : "1995", "label" : "Proceedings of the {$36^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs95" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "id" : "c439f573bd84581fc9bf33f6e82e6008", "booktitle" : "Proceedings of the {$37^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:c439f573bd84581fc9bf33f6e82e6008", "date" : "1996-10", "place" : "Burlington, VT", "month" : "October", "type" : "Publication", "year" : "1996", "label" : "Proceedings of the {$37^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs96" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$30^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:c78d8e01f9a3e311b5ae9083d1adc1c7", "date" : "1997-10", "place" : "Miami, FL", "month" : "October", "year" : "1997", "type" : "Publication", "label" : "Proceedings of the {$30^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs97" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "id" : "618afa550bd05e89de4bd9fa6f5a8106", "booktitle" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:618afa550bd05e89de4bd9fa6f5a8106", "date" : "1999-10", "place" : "New York, NY", "month" : "October", "type" : "Publication", "year" : "1999", "label" : "Proceedings of the {$32^{nd}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs99" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$33^{rd}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:e2c9e4338bf6b3e0de81d646d2f84198", "date" : "2000-11", "place" : "Rodondo Beach, CA", "month" : "November", "year" : "2000", "type" : "Publication", "label" : "Proceedings of the {$33^{rd}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs00" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "id" : "48477c6b4049a76b364a0b41f8d35114", "booktitle" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:48477c6b4049a76b364a0b41f8d35114", "date" : "2002-11", "place" : "Vancouver, Canada", "month" : "November", "type" : "Publication", "year" : "2002", "label" : "Proceedings of the {$35^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs02" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$36^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:1fdf6c0734a1b75112293bed59c5e9f7", "date" : "2003-10", "place" : "Cambridge, MA", "month" : "October", "year" : "2003", "type" : "Publication", "label" : "Proceedings of the {$36^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs03" }, { "publisher" : "{IEEE} Computer Society Press", "organization" : "IEEE", "booktitle" : "Proceedings of the {$37^{th}$} Annual Symposium on the Foundations of Computer Science", "pub-type" : "proceedings", "venue" : "FOCS", "uri" : "urn:53fd9d84674f5f3e37f431561ba83277", "date" : "2004-10", "month" : "October", "year" : "2004", "type" : "Publication", "label" : "Proceedings of the {$37^{th}$} Annual Symposium on the Foundations of Computer Science", "key" : "focs04" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$3^{rd}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "proceedings", "venue" : "SODA", "uri" : "urn:935097a319ca5d45448400812e95b3d9", "date" : "1992-01", "month" : "January", "year" : "1992", "type" : "Publication", "label" : "Proceedings of the {$3^{rd}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "key" : "soda92" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "proceedings", "venue" : "SODA", "uri" : "urn:f884bcf3816c593caa2329964a22e695", "date" : "1993-01", "place" : "Austin, TX", "month" : "January", "year" : "1993", "type" : "Publication", "label" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "key" : "soda93" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$5^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "proceedings", "venue" : "SODA", "uri" : "urn:a780626f6f191d1efb2f3920673b4fca", "date" : "1994-01", "place" : "Arlington, VA", "editor" : "Daniel D. Sleator", "month" : "January", "type" : "Publication", "year" : "1994", "label" : "Proceedings of the {$5^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "key" : "soda94" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$6^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "proceedings", "venue" : "SODA", "uri" : "urn:1c5e758980bc8f3f7286eca726ac0288", "date" : "1995-01", "place" : "San Fransisco, CA", "month" : "January", "year" : "1995", "type" : "Publication", "label" : "Proceedings of the {$6^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "key" : "soda95" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$7^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "proceedings", "venue" : "SODA", "uri" : "urn:d1a4bcda75f2b4c4a62312cfa5c757b0", "date" : "1996-01", "place" : "Atlanta, GA", "month" : "January", "year" : "1996", "type" : "Publication", "label" : "Proceedings of the {$7^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "key" : "soda96" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$8^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "proceedings", "venue" : "SODA", "uri" : "urn:d29661682d631141871c315dc14230df", "date" : "1997-01", "place" : "New Orleans, LA", "editor" : "Michael Saks", "month" : "January", "type" : "Publication", "year" : "1997", "label" : "Proceedings of the {$8^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "key" : "soda97" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$9^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "proceedings", "venue" : "SODA", "uri" : "urn:6aae35fbc68f5a5db1cbc4e3e299c72f", "date" : "1998-01", "place" : "San Fransisco, CA", "editor" : "Howard Karloff", "month" : "January", "type" : "Publication", "year" : "1998", "label" : "Proceedings of the {$9^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "key" : "soda98" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$12^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "proceedings", "venue" : "SODA", "uri" : "urn:c87847111b6b030257c1a4a73f641a92", "date" : "2001-01", "place" : "Washington, DC", "editor" : "S. Rao Kosaraju", "month" : "January", "confurl" : "http://portal.acm.org/toc.cfm?id=365411&dl=GUIDE&dl=ACM&type=proceeding&idx=SERIES422&part=Proceedings&WantType=Proceedings", "type" : "Publication", "year" : "2001", "label" : "Proceedings of the {$12^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "key" : "soda01" }, { "publisher" : "Society for Industrial and Applied Mathematics", "booktitle" : "Proceedings of the {$15^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "proceedings", "venue" : "SODA", "uri" : "urn:e63912ab1b2f27c3c979430eb967e51c", "date" : "2004", "year" : "2004", "type" : "Publication", "isbn" : "0-89871-558-X", "label" : "Proceedings of the {$15^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "location" : "New Orleans, Louisiana", "address" : "Philadelphia, PA, USA", "key" : "soda04" }, { "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$16^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "proceedings", "venue" : "SODA", "uri" : "urn:6845a6b085655f785cc8560fbcbc1368", "date" : "2005-01", "place" : "Vancouver, BC", "month" : "January", "year" : "2005", "type" : "Publication", "label" : "Proceedings of the {$16^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "key" : "soda05" }, { "publisher" : "ACM Press", "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$17^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "proceedings", "venue" : "SODA", "uri" : "urn:17f09891e69e881981d1f8fb1dc6a661", "date" : "2006-01", "place" : "Miami, FL", "month" : "January", "type" : "Publication", "year" : "2006", "isbn" : "0-89871-605-5", "label" : "Proceedings of the {$17^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "location" : "Miami, Florida", "address" : "New York, NY, USA", "key" : "soda06" }, { "publisher" : "ACM Press", "organization" : "ACM-SIAM", "booktitle" : "Proceedings of the {$19^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "pub-type" : "proceedings", "venue" : "SODA", "uri" : "urn:48c52d1b40d332d4e657b2410ea846c5", "date" : "2008-01", "place" : "San Francisco, CA", "month" : "January", "type" : "Publication", "year" : "2008", "label" : "Proceedings of the {$19^{th}$} Annual {ACM}-{SIAM} Symposium on Discrete Algorithms", "address" : "New York, NY, USA", "key" : "soda08" }, { "organization" : "ACM", "booktitle" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "pub-type" : "proceedings", "venue" : "SPAA", "uri" : "urn:858294943c0dbf9c6b841ac6b162fb4b", "date" : "1992-06", "place" : "San Diega, CA", "month" : "June", "year" : "1992", "type" : "Publication", "label" : "Proceedings of the {$4^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "key" : "spaa92" }, { "organization" : "ACM", "booktitle" : "spaa93", "pub-type" : "proceedings", "venue" : "SPAA", "uri" : "urn:beedb655d3c6fe9be614e13568420abf", "date" : "1993-06", "month" : "June", "year" : "1993", "type" : "Publication", "label" : "spaa93", "key" : "spaa93" }, { "organization" : "ACM", "booktitle" : "Proceedings of the {$6^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "pub-type" : "proceedings", "venue" : "SPAA", "uri" : "urn:72df71e783197e088330039786581496", "date" : "1994-06", "month" : "June", "year" : "1994", "type" : "Publication", "label" : "Proceedings of the {$6^{th}$} Annual {ACM}-{SIAM} Symposium on Parallel Algorithms and Architectures", "key" : "spaa94" }, { "publisher" : "Springer-Verlag", "booktitle" : "Proceedings of the $2^{nd}$ Scandinavian Workshop on Algorithmic Theory", "pub-type" : "proceedings", "venue" : "SWAT", "uri" : "urn:26c5b277ce87bd3e24354c6f57d61ba1", "date" : "1990", "number" : "447", "series" : "Lecture Notes in Computer Science", "editor" : "John R. Gilbert and Rolf Karlsson", "type" : "Publication", "year" : "1990", "label" : "Proceedings of the $2^{nd}$ Scandinavian Workshop on Algorithmic Theory", "address" : "New York", "key" : "swat90" }, { "publisher" : "Springer-Verlag", "booktitle" : "Automata, Languages and Programming. {$17^{th}$} International Colloquium Proceedings", "pub-type" : "proceedings", "venue" : "ICALP", "uri" : "urn:cc44611291895d0cf39c586e42350369", "date" : "1992-07", "series" : "Lecture Notes in Computer Science", "volume" : "443", "editor" : "Michael S. Patterson", "month" : "July", "type" : "Publication", "year" : "1992", "label" : "cc44611291895d0cf39c586e42350369", "key" : "icalp90" }, { "publisher" : "Springer-Verlag", "booktitle" : "Automata, Languages and Programming. {$18^{th}$} International Colloquium Proceedings", "pub-type" : "proceedings", "venue" : "ICALP", "uri" : "urn:95cbb22de9b7077d15872f28f7458647", "date" : "1992-07", "series" : "Lecture Notes in Computer Science", "volume" : "510", "editor" : "Leach Albert, Javier and Burkhard Monien and Artalejo Rodru{\'i}gez, Mario", "month" : "July", "type" : "Publication", "year" : "1992", "label" : "95cbb22de9b7077d15872f28f7458647", "key" : "icalp91" }, { "publisher" : "Springer-Verlag", "booktitle" : "Automata, Languages and Programming. {$19^{th}$} International Colloquium Proceedings", "pub-type" : "proceedings", "venue" : "ICALP", "uri" : "urn:e0a43503495b262a9ee9a6f6014384d6", "date" : "1992-07", "series" : "Lecture Notes in Computer Science", "volume" : "623", "month" : "July", "type" : "Publication", "year" : "1992", "label" : "e0a43503495b262a9ee9a6f6014384d6", "key" : "icalp92" }, { "publisher" : "Springer-Verlag", "booktitle" : "Automata, Languages and Programming. {$22^{nd}$} International Colloquium Proceedings", "pub-type" : "proceedings", "venue" : "ICALP", "uri" : "urn:47863bc2831cdc2f7eed3bb9af4130fe", "date" : "1995-07", "series" : "Lecture Notes in Computer Science", "volume" : "944", "month" : "July", "type" : "Publication", "year" : "1995", "label" : "47863bc2831cdc2f7eed3bb9af4130fe", "key" : "icalp95" }, { "url" : "http://www.hpl.hp.com/conferences/icml03/", "booktitle" : "The Twentieth International Conference on Machine Learning", "pub-type" : "proceedings", "venue" : "ICML", "uri" : "urn:0385633dd6303320ed6f74a576d011ab", "date" : "2003-08", "month" : "August", "type" : "Publication", "year" : "2003", "label" : "The Twentieth International Conference on Machine Learning", "address" : "Washington, DC", "key" : "icml03" }, { "publisher" : "MIT Press", "booktitle" : "Handbook of Theoretical Computer Science", "pub-type" : "book", "uri" : "urn:5e356d0878da2c940a1aaaaccc0e3bc7", "date" : "1990", "volume" : "A", "editor" : "van Leeuwen, Jan", "type" : "Publication", "year" : "1990", "label" : "Handbook of Theoretical Computer Science", "address" : "Cambridge, MA", "key" : "HandbookTCS" }, { "booktitle" : "Proceedings of the First International Workshop on Peer-to-Peer Systems", "pub-type" : "proceedings", "venue" : "IPTPS", "uri" : "urn:dcedac1e6d06ebb9fc26de8857771a07", "date" : "2002-03", "month" : "March", "type" : "Publication", "year" : "2002", "label" : "Proceedings of the First International Workshop on Peer-to-Peer Systems", "address" : "Cambridge, MA", "key" : "iptps02" }, { "publisher" : "Springer", "booktitle" : "2nd International Workshop on Peer to Peer Systems", "pub-type" : "proceedings", "venue" : "IPTPS", "uri" : "urn:1916e282ed7717e780761431a29a8b98", "date" : "2003-01", "series" : "LNCS Hot Topics", "editor" : "M. Frans Kaashoek and Ion Stoica", "month" : "January", "confurl" : "http://iptps03.cs.berkeley.edu/", "type" : "Publication", "year" : "2003", "label" : "2nd International Workshop on Peer to Peer Systems", "address" : "Berkeley, CA", "key" : "iptps03" }, { "publisher" : "Springer", "booktitle" : "IPTPS: 3rd International Workshop on Peer to Peer Systems", "pub-type" : "proceedings", "venue" : "IPTPS", "uri" : "urn:8c8abfa0e52ff83dcf651b53c71dc914", "date" : "2004-02", "series" : "LNCS Hot Topics", "month" : "February", "type" : "Publication", "year" : "2004", "label" : "IPTPS: 3rd International Workshop on Peer to Peer Systems", "key" : "iptps04" }, { "publisher" : "Springer", "booktitle" : "4th International Workshop on Peer to Peer Systems", "pub-type" : "proceedings", "venue" : "IPTPS", "uri" : "urn:834c197e019511cfe38e4ac4f943655c", "date" : "2005-02", "series" : "LNCS Hot Topics", "editor" : "M. Frans Kaashoek and Ion Stoica", "month" : "February", "confurl" : "http://iptps05.cs.cornell.edu/", "type" : "Publication", "year" : "2005", "label" : "4th International Workshop on Peer to Peer Systems", "address" : "Ithaca, NY", "key" : "iptps05" }, { "organization" : "International Federation for Information Processing", "booktitle" : "INTERACT: $9^{th}$ IFIP International Conference on Human Computer Interaction", "pub-type" : "proceedings", "venue" : "INTERACT", "uri" : "urn:f040e01d0a61382e74c116e7181caadf", "date" : "2003-09", "month" : "September", "confurl" : "http://www.interact2003.org/", "type" : "Publication", "year" : "2003", "label" : "INTERACT: $9^{th}$ IFIP International Conference on Human Computer Interaction", "address" : "Zurich", "key" : "interact03" }, { "publisher" : "ACM", "organization" : "ACM SIGIR", "booktitle" : "$26^{th}$ Internationl ACM SIGIR Conference", "pub-type" : "proceedings", "venue" : "SIGIR", "uri" : "urn:075ea70754265e418ef06318c564241e", "date" : "2003-07", "month" : "July", "confurl" : "http://www.sigir2003.org", "type" : "Publication", "year" : "2003", "label" : "$26^{th}$ Internationl ACM SIGIR Conference", "address" : "Toronto", "key" : "sigir03" }, { "publisher" : "ACM", "organization" : "ACM SIGIR", "booktitle" : "$29^{th}$ Internationl ACM SIGIR Conference", "pub-type" : "proceedings", "venue" : "SIGIR", "uri" : "urn:9a959c35f6d95defef8c5141bb5ee5cf", "date" : "2006-07", "month" : "July", "confurl" : "http://www.sigir2006.org", "type" : "Publication", "year" : "2006", "label" : "$29^{th}$ Internationl ACM SIGIR Conference", "key" : "sigir06" }, { "publisher" : "ACM", "booktitle" : "Intelligent User Interfaces", "pub-type" : "proceedings", "venue" : "IUI", "uri" : "urn:e5a5d893a54460e930d54e16d70387db", "date" : "2003-01", "month" : "January", "confurl" : "http://www.iuiconf.org/03program.html", "bibsource" : "DBLP, http://dblp.uni-trier.de", "type" : "Publication", "year" : "2003", "isbn" : "1-58113-586-6", "label" : "Proceedings of the 2003 International Conference on Intelligent User Interfaces", "address" : "Miami, FL", "key" : "iui03" }, { "booktitle" : "Semantic Web Workshop at WWW2002", "pub-type" : "proceedings", "venue" : "WWW", "uri" : "urn:cdcc23d232af2180802ab238e70f747f", "date" : "2002-05", "month" : "May", "confurl" : "http://www.www2002.org/", "year" : "2002", "type" : "Publication", "label" : "Semantic Web Workshop at WWW2002", "address" : "Hawaii", "key" : "semweb02" }, { "booktitle" : "$2^{nd}$ International Semantic Web Conference", "pub-type" : "proceedings", "venue" : "ISWC", "uri" : "urn:3e03f1a857a83b80600e3b44560ed40f", "date" : "2003-10", "month" : "October", "type" : "Publication", "year" : "2003", "label" : "$2^{nd}$ International Semantic Web Conference", "address" : "Sanibel Island, FL", "key" : [ "iswc03", "$2^{nd}$ International Semantic Web Conference" ] }, { "booktitle" : "$5^{th}$ International Semantic Web Conference (ISWC)", "pub-type" : "proceedings", "venue" : "ISWC", "uri" : "urn:aa84b2a6ab4ae62a103815e4de488a6d", "date" : "2006-11", "month" : "November", "type" : "Publication", "year" : "2006", "label" : "$5^{th}$ International Semantic Web Conference (ISWC)", "key" : "iswc06" }, { "booktitle" : "$6^{th}$ International Semantic Web Conference (ISWC)", "pub-type" : "proceedings", "venue" : "ISWC", "uri" : "urn:1f2c54ccffba08e2408b62278996e4ba", "date" : "2007-11", "month" : "November", "type" : "Publication", "year" : "2007", "label" : "$6^{th}$ International Semantic Web Conference (ISWC)", "key" : "iswc07" }, { "organization" : "IEEE", "booktitle" : "IEEE International Symposium on Information Theory", "pub-type" : "proceedings", "venue" : "ISIT", "uri" : "urn:45479d24e67b2e08acf651fa0cf31d42", "date" : "2003-06", "month" : "June", "confurl" : "http://www.isit2003.org/", "type" : "Publication", "year" : "2003", "label" : "IEEE International Symposium on Information Theory", "address" : "Yokohama, Japan", "key" : "isit03" }, { "organization" : "ACM", "booktitle" : "The $16^{th}$ Annual Symposium on User Interface Software and Technology", "pub-type" : "proceedings", "venue" : "UIST", "uri" : "urn:09deb8150af976ed721cb490e0138300", "date" : "2003-11", "month" : "November", "type" : "Publication", "year" : "2003", "label" : "The $16^{th}$ Annual Symposium on User Interface Software and Technology", "address" : "Vancouver, BC", "key" : "uist03" }, { "booktitle" : "Proceedings of the $12^{th}$ International World Wide Web Conference", "pub-type" : "proceedings", "venue" : "WWW", "uri" : "urn:491f8af064d3f1cf6c0efde3d68be9e2", "date" : "2003", "type" : "Publication", "year" : "2003", "label" : "Proceedings of the $12^{th}$ International World Wide Web Conference", "key" : "www03" }, { "booktitle" : "Proceedings of the $13^{th}$ International World Wide Web Conference", "pub-type" : "proceedings", "venue" : "WWW", "uri" : "urn:535b7388e27003e6ff2b249ab075b038", "date" : "2004", "type" : "Publication", "year" : "2004", "label" : "Proceedings of the $13^{th}$ International World Wide Web Conference", "key" : "www04" }, { "booktitle" : "Proceedings of the $14^{th}$ International World Wide Web Conference (WWW)", "pub-type" : "proceedings", "venue" : "WWW", "uri" : "urn:2403d2a71b9720827c5e10cf5137062e", "date" : "2005", "type" : "Publication", "year" : "2005", "label" : "Proceedings of the $14^{th}$ International World Wide Web Conference (WWW)", "key" : "www05" }, { "booktitle" : "16th International World Wide Web Conference (WWW2007)", "pub-type" : "proceedings", "venue" : "WWW", "uri" : "urn:50e556c5004cc6b5e34bede4de95f0e3", "date" : "2007-05", "month" : "May", "type" : "Publication", "year" : "2007", "label" : "16th International World Wide Web Conference (WWW2007)", "location" : "Banff, Canada", "key" : "www07" }, { "publisher" : "ACM Press", "booktitle" : "OOPSLA \'05: Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications", "pub-type" : "proceedings", "venue" : "OOPSLA", "uri" : "urn:dabcb24543738cc3f065402ae0b2b897", "date" : "2005", "year" : "2005", "type" : "Publication", "isbn" : "1-59593-193-7", "label" : "OOPSLA \'05: Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications", "location" : "San Diego, CA, USA", "address" : "New York, NY, USA", "key" : "oopsla05companion" }, { "booktitle" : "4th ACM Workshop on Hot Topics in Networks (HotNets)", "pub-type" : "proceedings", "venue" : "HotNets", "uri" : "urn:681b06f0f31b64fc026d0f91ebf2e5c5", "date" : "2005-11", "month" : "November", "type" : "Publication", "year" : "2005", "label" : "4th ACM Workshop on Hot Topics in Networks (HotNets)", "address" : "College Park, MD", "key" : "hotnets05" }, { "label" : "Jakobsson, Hakan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Jakobsson%2C+Hakan", "original-name" : "Hakan Jakobsson", "last-name" : "Jakobsson" }, { "label" : "Whitney, Hassler", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Whitney%2C+Hassler", "original-name" : "Hassler Whitney", "last-name" : "Whitney" }, { "label" : "Tennebaum, Joshua B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tennebaum%2C+Joshua+B.", "original-name" : "Joshua B. Tennebaum", "last-name" : "Tennebaum" }, { "label" : "Madyastha, Raghu", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Madyastha%2C+Raghu", "original-name" : "Raghu Madyastha", "last-name" : "Madyastha" }, { "label" : "Liben-Nowell, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Liben-Nowell%2C+David", "original-name" : "David Liben-Nowell", "last-name" : "Liben-Nowell" }, { "label" : "Lichtenberg, Kristian de", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lichtenberg%2C+Kristian+de", "original-name" : "Kristian de Lichtenberg", "last-name" : "Lichtenberg" }, { "label" : "Dahlhaus, E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dahlhaus%2C+E.", "original-name" : "E. Dahlhaus", "last-name" : "Dahlhaus" }, { "label" : "Clark, James", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Clark%2C+James", "original-name" : "James Clark", "last-name" : "Clark" }, { "label" : "Welsh, Dominic", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Welsh%2C+Dominic", "original-name" : "Dominic Welsh", "last-name" : "Welsh" }, { "label" : "Bhattacharjee, Bobby", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bhattacharjee%2C+Bobby", "original-name" : "Bobby Bhattacharjee", "last-name" : "Bhattacharjee" }, { "label" : "Barahona, Francisco", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Barahona%2C+Francisco", "original-name" : "Francisco Barahona", "last-name" : "Barahona" }, { "label" : "Nigam, Kamal", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Nigam%2C+Kamal", "original-name" : "Kamal Nigam", "last-name" : "Nigam" }, { "label" : "Bor\\o{u}vka, O.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bor%5Co%7Bu%7Dvka%2C+O.", "original-name" : "O. Bor\\o{u}vka", "last-name" : "Bor\\o{u}vka" }, { "label" : "Frank, Andr\\\'as", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Frank%2C+Andr%5C%27as", "original-name" : "Andr\\\'as Frank", "last-name" : "Frank" }, { "label" : "Ibaraki, Toshihide", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ibaraki%2C+Toshihide", "original-name" : "Toshihide Ibaraki", "last-name" : "Ibaraki" }, { "label" : "Hochbaum, Dorit S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hochbaum%2C+Dorit+S.", "original-name" : "Dorit S. Hochbaum", "last-name" : "Hochbaum" }, { "label" : "Maffioli, F.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Maffioli%2C+F.", "original-name" : "F. Maffioli", "last-name" : "Maffioli" }, { "label" : "Tukey, John W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tukey%2C+John+W.", "original-name" : "John W. Tukey", "last-name" : "Tukey" }, { "label" : "Schwarzkopf, Otfried", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Schwarzkopf%2C+Otfried", "original-name" : "Otfried Schwarzkopf", "last-name" : "Schwarzkopf" }, { "label" : "Luczak", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Luczak", "original-name" : "Luczak", "last-name" : "Luczak" }, { "label" : "James, A. P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:James%2C+A.+P.", "original-name" : "A. P. James", "last-name" : "James" }, { "label" : "Kennedy, J. M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kennedy%2C+J.+M.", "original-name" : "J. M. Kennedy", "last-name" : "Kennedy" }, { "label" : "Megiddo, N.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Megiddo%2C+N.", "original-name" : "N. Megiddo", "last-name" : "Megiddo" }, { "label" : "Tatarinov, Igor", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tatarinov%2C+Igor", "original-name" : "Igor Tatarinov", "last-name" : "Tatarinov" }, { "label" : "Lun, Desmond S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lun%2C+Desmond+S.", "original-name" : "Desmond S. Lun", "last-name" : "Lun" }, { "label" : "Handschuh, S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Handschuh%2C+S.", "original-name" : "S. Handschuh", "last-name" : "Handschuh" }, { "label" : "Shor, Peter W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shor%2C+Peter+W.", "original-name" : "Peter W. Shor", "last-name" : "Shor" }, { "label" : "Allen, F.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Allen%2C+F.", "original-name" : "F. Allen", "last-name" : "Allen" }, { "label" : "Gusfield, Dan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gusfield%2C+Dan", "original-name" : "Dan Gusfield", "last-name" : "Gusfield" }, { "label" : "Grigni, Michelangelo", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Grigni%2C+Michelangelo", "original-name" : "Michelangelo Grigni", "last-name" : "Grigni" }, { "label" : "Nissenzweig, Amnon", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Nissenzweig%2C+Amnon", "original-name" : "Amnon Nissenzweig", "last-name" : "Nissenzweig" }, { "label" : "Chekuri, Chandra", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chekuri%2C+Chandra", "original-name" : "Chandra Chekuri", "last-name" : "Chekuri" }, { "label" : "Kaplan, Haim", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kaplan%2C+Haim", "original-name" : "Haim Kaplan", "last-name" : "Kaplan" }, { "label" : "Weitz, Dror", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Weitz%2C+Dror", "original-name" : "Dror Weitz", "last-name" : "Weitz" }, { "label" : "Shpitser, Ilya", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shpitser%2C+Ilya", "original-name" : "Ilya Shpitser", "last-name" : "Shpitser" }, { "label" : "Richa, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Richa%2C+A.", "original-name" : "A. Richa", "last-name" : "Richa" }, { "label" : "Ciravegna, F.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ciravegna%2C+F.", "original-name" : "F. Ciravegna", "last-name" : "Ciravegna" }, { "label" : "Matkins, Luke", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Matkins%2C+Luke", "original-name" : "Luke Matkins", "last-name" : "Matkins" }, { "label" : "Boppana, R. B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Boppana%2C+R.+B.", "original-name" : "R. B. Boppana", "last-name" : "Boppana" }, { "label" : "Gracenote", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gracenote", "original-name" : "Gracenote", "last-name" : "Gracenote" }, { "label" : "Bui, T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bui%2C+T.", "original-name" : "T. Bui", "last-name" : "Bui" }, { "label" : "Mo, Dan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mo%2C+Dan", "original-name" : "Dan Mo", "last-name" : "Mo" }, { "label" : "Bose, Vanu", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bose%2C+Vanu", "original-name" : "Vanu Bose", "last-name" : "Bose" }, { "label" : "Shnitser, Svetlana", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shnitser%2C+Svetlana", "original-name" : "Svetlana Shnitser", "last-name" : "Shnitser" }, { "label" : "Greene, Sharon L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Greene%2C+Sharon+L.", "original-name" : "Sharon L. Greene", "last-name" : "Greene" }, { "label" : "M?dard, Muriel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:M%C3%A9dard%2C+Muriel", "original-name" : "Muriel M?dard", "last-name" : "M?dard" }, { "label" : "Clarkson, Ken L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Clarkson%2C+Ken+L.", "original-name" : "Ken L. Clarkson", "last-name" : "Clarkson" }, { "label" : "Whittaker, Steve", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Whittaker%2C+Steve", "original-name" : "Steve Whittaker", "last-name" : "Whittaker" }, { "label" : "Chow, Fred C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chow%2C+Fred+C.", "original-name" : "Fred C. Chow", "last-name" : "Chow" }, { "label" : "Ho, Tracey", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ho%2C+Tracey", "original-name" : "Tracey Ho", "last-name" : "Ho" }, { "label" : "Kanevsky, Arkady", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kanevsky%2C+Arkady", "original-name" : "Arkady Kanevsky", "last-name" : "Kanevsky" }, { "label" : "Cooper, K. D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cooper%2C+K.+D.", "original-name" : "K. D. Cooper", "last-name" : "Cooper" }, { "label" : "Newcombe, H. B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Newcombe%2C+H.+B.", "original-name" : "H. B. Newcombe", "last-name" : "Newcombe" }, { "label" : "Tonkin, Emma", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tonkin%2C+Emma", "original-name" : "Emma Tonkin", "last-name" : "Tonkin" }, { "label" : "Suciu, Dan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Suciu%2C+Dan", "original-name" : "Dan Suciu", "last-name" : "Suciu" }, { "label" : "Katz, Boris", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Katz%2C+Boris", "original-name" : "Boris Katz", "last-name" : "Katz" }, { "label" : "Pruhs, Kirk", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pruhs%2C+Kirk", "original-name" : "Kirk Pruhs", "last-name" : "Pruhs" }, { "label" : "Cormen, Tom H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cormen%2C+Tom+H.", "original-name" : "Tom H. Cormen", "last-name" : "Cormen" }, { "label" : "Woloszyn, Andrzej", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Woloszyn%2C+Andrzej", "original-name" : "Andrzej Woloszyn", "last-name" : "Woloszyn" }, { "label" : "Pan, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pan%2C+A.", "original-name" : "A. Pan", "last-name" : "Pan" }, { "label" : "Fry, Christopher", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Fry%2C+Christopher", "original-name" : "Christopher Fry", "last-name" : "Fry" }, { "label" : "Landauer, Jurgen", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Landauer%2C+Jurgen", "original-name" : "Jurgen Landauer", "last-name" : "Landauer" }, { "label" : "Sinclair, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sinclair%2C+A.", "original-name" : "A. Sinclair", "last-name" : "Sinclair" }, { "label" : "Baecker, R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Baecker%2C+R.", "original-name" : "Baecker, R.", "last-name" : "Baecker" }, { "label" : "Yu, Xiangdong", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Yu%2C+Xiangdong", "original-name" : "Xiangdong Yu", "last-name" : "Yu" }, { "label" : "Lai, Kum-Yew", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lai%2C+Kum-Yew", "original-name" : "Kum-Yew Lai", "last-name" : "Lai" }, { "label" : "Yee, Ping", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Yee%2C+Ping", "original-name" : "Ping Yee", "last-name" : "Yee" }, { "label" : "Ibaraki, Toshihde", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ibaraki%2C+Toshihde", "original-name" : "Toshihde Ibaraki", "last-name" : "Ibaraki" }, { "label" : "Overmars, Mark", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Overmars%2C+Mark", "original-name" : "Mark Overmars", "last-name" : "Overmars" }, { "label" : "Pratt, V. R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pratt%2C+V.+R.", "original-name" : "V. R. Pratt", "last-name" : "Pratt" }, { "label" : "Nardi, Bonnie A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Nardi%2C+Bonnie+A.", "original-name" : "Bonnie A. Nardi", "last-name" : "Nardi" }, { "label" : "Ruhl, Matthias", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ruhl%2C+Matthias", "original-name" : "Matthias Ruhl", "last-name" : "Ruhl" }, { "label" : "Dinitz, E. A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dinitz%2C+E.+A.", "original-name" : "E. A. Dinitz", "last-name" : "Dinitz" }, { "label" : "Dumais, Susan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dumais%2C+Susan", "original-name" : "Susan Dumais", "last-name" : "Dumais" }, { "label" : "Adar, Eytan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Adar%2C+Eytan", "original-name" : "Eytan Adar", "last-name" : "Adar" }, { "label" : "Even, Shimon", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Even%2C+Shimon", "original-name" : "Shimon Even", "last-name" : "Even" }, { "label" : "Hoare, C. A. R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hoare%2C+C.+A.+R.", "original-name" : "C. A. R. Hoare", "last-name" : "Hoare" }, { "label" : "Sears, Andrew", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sears%2C+Andrew", "original-name" : "Andrew Sears", "last-name" : "Sears" }, { "label" : "Ducheneaut, Nicolas", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ducheneaut%2C+Nicolas", "original-name" : "Nicolas Ducheneaut", "last-name" : "Ducheneaut" }, { "label" : "Nishimura, Kazuhiro", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Nishimura%2C+Kazuhiro", "original-name" : "Kazuhiro Nishimura", "last-name" : "Nishimura" }, { "label" : "Stork, David G.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Stork%2C+David+G.", "original-name" : "David G. Stork", "last-name" : "Stork" }, { "label" : "Rennie, Jason D. M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rennie%2C+Jason+D.+M.", "original-name" : "Jason D. M. Rennie", "last-name" : "Rennie" }, { "label" : "Hell, P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hell%2C+P.", "original-name" : "P. Hell", "last-name" : "Hell" }, { "label" : "Jerrum, Mark R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Jerrum%2C+Mark+R.", "original-name" : "Mark R. Jerrum", "last-name" : "Jerrum" }, { "label" : "Pentney, William", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pentney%2C+William", "original-name" : "William Pentney", "last-name" : "Pentney" }, { "label" : "Swearingen, Kirsten", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Swearingen%2C+Kirsten", "original-name" : "Kirsten Swearingen", "last-name" : "Swearingen" }, { "label" : "Kamps, Jaap", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kamps%2C+Jaap", "original-name" : "Jaap Kamps", "last-name" : "Kamps" }, { "label" : "Wong, Yin Yin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wong%2C+Yin+Yin", "original-name" : "Yin Yin Wong", "last-name" : "Wong" }, { "label" : "Motta, Enrico", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Motta%2C+Enrico", "original-name" : "Enrico Motta", "last-name" : "Motta" }, { "label" : "Hao, Jianxiu", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hao%2C+Jianxiu", "original-name" : "Jianxiu Hao", "last-name" : "Hao" }, { "label" : "Maganty, Vivekananda", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Maganty%2C+Vivekananda", "original-name" : "Vivekananda Maganty", "last-name" : "Maganty" }, { "label" : "Lehman, Eric", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lehman%2C+Eric", "original-name" : "Eric Lehman", "last-name" : "Lehman" }, { "label" : "Harfst, Greg", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Harfst%2C+Greg", "original-name" : "Greg Harfst", "last-name" : "Harfst" }, { "label" : "Podderyugin, V. D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Podderyugin%2C+V.+D.", "original-name" : "V. D. Podderyugin", "last-name" : "Podderyugin" }, { "label" : "Hassibi, B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hassibi%2C+B.", "original-name" : "B. Hassibi", "last-name" : "Hassibi" }, { "label" : "Edwards, W. Keith", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Edwards%2C+W.+Keith", "original-name" : "W. Keith Edwards", "last-name" : "Edwards" }, { "label" : "Hopkins, M. E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hopkins%2C+M.+E.", "original-name" : "M. E. Hopkins", "last-name" : "Hopkins" }, { "label" : "Case, P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Case%2C+P.", "original-name" : "P. Case", "last-name" : "Case" }, { "label" : "French, James C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:French%2C+James+C.", "original-name" : "James C. French", "last-name" : "French" }, { "label" : "Rajagopalan, Sridhar", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rajagopalan%2C+Sridhar", "original-name" : "Sridhar Rajagopalan", "last-name" : "Rajagopalan" }, { "label" : "Dietz", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dietz", "original-name" : "Dietz", "last-name" : "Dietz" }, { "label" : "Hirakawa, Masahito", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hirakawa%2C+Masahito", "original-name" : "Masahito Hirakawa", "last-name" : "Hirakawa" }, { "label" : "Kommareddy, Christopher", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kommareddy%2C+Christopher", "original-name" : "Christopher Kommareddy", "last-name" : "Kommareddy" }, { "label" : "Ibaraki, T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ibaraki%2C+T.", "original-name" : "T. Ibaraki", "last-name" : "Ibaraki" }, { "label" : "Aingworth, Donald", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Aingworth%2C+Donald", "original-name" : "Donald Aingworth", "last-name" : "Aingworth" }, { "label" : "Goldberg, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Goldberg%2C+David", "original-name" : "Goldberg, David", "last-name" : "Goldberg" }, { "label" : "Dzbor, Martin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dzbor%2C+Martin", "original-name" : "Martin Dzbor", "last-name" : "Dzbor" }, { "label" : "Manber, Udi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Manber%2C+Udi", "original-name" : "Udi Manber", "last-name" : "Manber" }, { "label" : "Manola, Frank", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Manola%2C+Frank", "original-name" : "Frank Manola", "last-name" : "Manola" }, { "label" : "Wainwright, Martin J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wainwright%2C+Martin+J.", "original-name" : "Martin J. Wainwright", "last-name" : "Wainwright" }, { "label" : "Maghoul, Farzin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Maghoul%2C+Farzin", "original-name" : "Farzin Maghoul", "last-name" : "Maghoul" }, { "label" : "Fellegi, I. P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Fellegi%2C+I.+P.", "original-name" : "Fellegi, I. P.", "last-name" : "Fellegi" }, { "label" : "Oki, Brian", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Oki%2C+Brian", "original-name" : "Oki, Brian", "last-name" : "Oki" }, { "label" : "Fertig, Scott J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Fertig%2C+Scott+J.", "original-name" : "Scott J. Fertig", "last-name" : "Fertig" }, { "label" : "Boyer, Edward W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Boyer%2C+Edward+W.", "original-name" : "Edward W. Boyer", "last-name" : "Boyer" }, { "label" : "Hu, Tien Chung", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hu%2C+Tien+Chung", "original-name" : "Tien Chung Hu", "last-name" : "Hu" }, { "label" : "Rubinfeld, Ronitt", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rubinfeld%2C+Ronitt", "original-name" : "Ronitt Rubinfeld", "last-name" : "Rubinfeld" }, { "label" : "Chazelle, Bernard", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chazelle%2C+Bernard", "original-name" : "Bernard Chazelle", "last-name" : "Chazelle" }, { "label" : "Luby, Michael G.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Luby%2C+Michael+G.", "original-name" : "Michael G. Luby", "last-name" : "Luby" }, { "label" : "Zemel, Eitan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Zemel%2C+Eitan", "original-name" : "Eitan Zemel", "last-name" : "Zemel" }, { "label" : "Grove, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Grove%2C+M.", "original-name" : "M. Grove", "last-name" : "Grove" }, { "label" : "Wilson, M. L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wilson%2C+M.+L.", "original-name" : "Wilson, M. L.", "last-name" : "Wilson" }, { "label" : "Karpinski, Marek", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Karpinski%2C+Marek", "original-name" : "Marek Karpinski", "last-name" : "Karpinski" }, { "label" : "Wainwright, Martin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wainwright%2C+Martin", "original-name" : "Martin Wainwright", "last-name" : "Wainwright" }, { "label" : "Cohen, Edith", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cohen%2C+Edith", "original-name" : "Edith Cohen", "last-name" : "Cohen" }, { "label" : "Medard, Muriel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Medard%2C+Muriel", "original-name" : "Muriel Medard", "last-name" : "Medard" }, { "label" : "Lane, Terran", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lane%2C+Terran", "original-name" : "Terran Lane", "last-name" : "Lane" }, { "label" : "Lieuwen, Daniel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lieuwen%2C+Daniel", "original-name" : "Daniel Lieuwen", "last-name" : "Lieuwen" }, { "label" : "McAllester, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:McAllester%2C+David", "original-name" : "David McAllester", "last-name" : "McAllester" }, { "label" : "Baker, Nicholson", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Baker%2C+Nicholson", "original-name" : "Nicholson Baker", "last-name" : "Baker" }, { "label" : "Milner, E. C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Milner%2C+E.+C.", "original-name" : "E. C. Milner", "last-name" : "Milner" }, { "label" : "Li, Jinyang", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Li%2C+Jinyang", "original-name" : "Jinyang Li", "last-name" : "Li" }, { "label" : "Chong, Ka Wong", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chong%2C+Ka+Wong", "original-name" : "Ka Wong Chong", "last-name" : "Chong" }, { "label" : "Ta-Shma, Amnon", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ta-Shma%2C+Amnon", "original-name" : "Amnon Ta-Shma", "last-name" : "Ta-Shma" }, { "label" : "Studer, Rudi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Studer%2C+Rudi", "original-name" : "Rudi Studer", "last-name" : "Studer" }, { "label" : "Nagamochi, Hiroshi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Nagamochi%2C+Hiroshi", "original-name" : "Hiroshi Nagamochi", "last-name" : "Nagamochi" }, { "label" : "Maler, Eve", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Maler%2C+Eve", "original-name" : "Eve Maler", "last-name" : "Maler" }, { "label" : "Leiserson, Charles E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Leiserson%2C+Charles+E.", "original-name" : "Charles E. Leiserson", "last-name" : "Leiserson" }, { "label" : "Camerini, P. M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Camerini%2C+P.+M.", "original-name" : "P. M. Camerini", "last-name" : "Camerini" }, { "label" : "Chv\\\'a{a}tal, Va\\v{s}ek", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chv%5C%27a%7Ba%7Dtal%2C+Va%5Cv%7Bs%7Dek", "original-name" : "Va\\v{s}ek Chv\\\'a{a}tal", "last-name" : "Chv\\\'a{a}tal" }, { "label" : "Kahng, A. B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kahng%2C+A.+B.", "original-name" : "A. B. Kahng", "last-name" : "Kahng" }, { "label" : "Charles, P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Charles%2C+P.", "original-name" : "P. Charles", "last-name" : "Charles" }, { "label" : "Robbins, D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Robbins%2C+D.", "original-name" : "Robbins, D.", "last-name" : "Robbins" }, { "label" : "Yun, Yeogirl", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Yun%2C+Yeogirl", "original-name" : "Yeogirl Yun", "last-name" : "Yun" }, { "label" : "Wierman", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wierman", "original-name" : "Wierman", "last-name" : "Wierman" }, { "label" : "Galbiati, G.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Galbiati%2C+G.", "original-name" : "G. Galbiati", "last-name" : "Galbiati" }, { "label" : "Ramesh, H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ramesh%2C+H.", "original-name" : "H. Ramesh", "last-name" : "Ramesh" }, { "label" : "Weivel, Stuart L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Weivel%2C+Stuart+L.", "original-name" : "Stuart L. Weivel", "last-name" : "Weivel" }, { "label" : "Fredman, Michael", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Fredman%2C+Michael", "original-name" : "Michael Fredman", "last-name" : "Fredman" }, { "label" : "Plaxton, C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Plaxton%2C+C.", "original-name" : "C. Plaxton", "last-name" : "Plaxton" }, { "label" : "Sidner, C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sidner%2C+C.", "original-name" : "C. Sidner", "last-name" : "Sidner" }, { "label" : "Balazinska, Magdalena", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Balazinska%2C+Magdalena", "original-name" : "Magdalena Balazinska", "last-name" : "Balazinska" }, { "label" : "Zamfirescu, J. D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Zamfirescu%2C+J.+D.", "original-name" : "J. D. Zamfirescu", "last-name" : "Zamfirescu" }, { "label" : "Best, C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Best%2C+C.", "original-name" : "Best, C.", "last-name" : "Best" }, { "label" : "Anderson, Corin R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Anderson%2C+Corin+R.", "original-name" : "Corin R. Anderson", "last-name" : "Anderson" }, { "label" : "Chernoff, H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chernoff%2C+H.", "original-name" : "H. Chernoff", "last-name" : "Chernoff" }, { "label" : "Blum, Manuel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Blum%2C+Manuel", "original-name" : "Manuel Blum", "last-name" : "Blum" }, { "label" : "Bollacker, Kurt", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bollacker%2C+Kurt", "original-name" : "Kurt Bollacker", "last-name" : "Bollacker" }, { "label" : "Collins, Michael", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Collins%2C+Michael", "original-name" : "Michael Collins", "last-name" : "Collins" }, { "label" : "Provan, J. Scott", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Provan%2C+J.+Scott", "original-name" : "J. Scott Provan", "last-name" : "Provan" }, { "label" : "Motro, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Motro%2C+A.", "original-name" : "A. Motro", "last-name" : "Motro" }, { "label" : "Jerrum, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Jerrum%2C+M.", "original-name" : "M. Jerrum", "last-name" : "Jerrum" }, { "label" : "Freitag, Dayne", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Freitag%2C+Dayne", "original-name" : "Dayne Freitag", "last-name" : "Freitag" }, { "label" : "Bertsimas, Dimitris J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bertsimas%2C+Dimitris+J.", "original-name" : "Dimitris J. Bertsimas", "last-name" : "Bertsimas" }, { "label" : "Pan, Victor", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pan%2C+Victor", "original-name" : "Victor Pan", "last-name" : "Pan" }, { "label" : "Stein, Lynn", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Stein%2C+Lynn", "original-name" : "Lynn Stein", "last-name" : "Stein" }, { "label" : "Young, Cliff", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Young%2C+Cliff", "original-name" : "Cliff Young", "last-name" : "Young" }, { "label" : "F?rer, Martin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:F%C3%BCrer%2C+Martin", "original-name" : "Martin F?rer", "last-name" : "F?rer" }, { "label" : "Ragde, Prabakar", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ragde%2C+Prabakar", "original-name" : "Prabakar Ragde", "last-name" : "Ragde" }, { "label" : "Shaw, R. A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shaw%2C+R.+A.", "original-name" : "R. A. Shaw", "last-name" : "Shaw" }, { "label" : "Goemans, Michel X.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Goemans%2C+Michel+X.", "original-name" : "Michel X. Goemans", "last-name" : "Goemans" }, { "label" : "Elias, P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Elias%2C+P.", "original-name" : "P. Elias", "last-name" : "Elias" }, { "label" : "Halperin, Shay", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Halperin%2C+Shay", "original-name" : "Shay Halperin", "last-name" : "Halperin" }, { "label" : "Ruzzo, Walter L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ruzzo%2C+Walter+L.", "original-name" : "Walter L. Ruzzo", "last-name" : "Ruzzo" }, { "label" : "Nisan, Noam", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Nisan%2C+Noam", "original-name" : "Noam Nisan", "last-name" : "Nisan" }, { "label" : "Dietzfelbinger, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dietzfelbinger%2C+M.", "original-name" : "M. Dietzfelbinger", "last-name" : "Dietzfelbinger" }, { "label" : "Shneiderman, Ben", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shneiderman%2C+Ben", "original-name" : "Ben Shneiderman", "last-name" : "Shneiderman" }, { "label" : "Cole, Richard", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cole%2C+Richard", "original-name" : "Richard Cole", "last-name" : "Cole" }, { "label" : "Rao, Ramana", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rao%2C+Ramana", "original-name" : "Ramana Rao", "last-name" : "Rao" }, { "label" : "Edmonds, Jack", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Edmonds%2C+Jack", "original-name" : "Jack Edmonds", "last-name" : "Edmonds" }, { "label" : "Shoham, Yoav", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shoham%2C+Yoav", "original-name" : "Yoav Shoham", "last-name" : "Shoham" }, { "label" : "Ahuja, Ravindra K.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ahuja%2C+Ravindra+K.", "original-name" : "Ravindra K. Ahuja", "last-name" : "Ahuja" }, { "label" : "Thorup, Mikkel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Thorup%2C+Mikkel", "original-name" : "Mikkel Thorup", "last-name" : "Thorup" }, { "label" : "Raghavan, Prabhakar", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Raghavan%2C+Prabhakar", "original-name" : "Prabhakar Raghavan", "last-name" : "Raghavan" }, { "label" : "Hall, Wendy", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hall%2C+Wendy", "original-name" : "Wendy Hall", "last-name" : "Hall" }, { "label" : "Adler, Micah", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Adler%2C+Micah", "original-name" : "Micah Adler", "last-name" : "Adler" }, { "label" : "Langford, John C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Langford%2C+John+C.", "original-name" : "John C. Langford", "last-name" : "Langford" }, { "label" : "schraefel, m. c.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:schraefel%2C+m.+c.", "original-name" : "schraefel, m. c.", "last-name" : "schraefel" }, { "label" : "Malone, Thomas W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Malone%2C+Thomas+W.", "original-name" : "Thomas W. Malone", "last-name" : "Malone" }, { "label" : "Kutylowski, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kutylowski%2C+M.", "original-name" : "M. Kutylowski", "last-name" : "Kutylowski" }, { "label" : "Staab, Steffen", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Staab%2C+Steffen", "original-name" : "Steffen Staab", "last-name" : "Staab" }, { "label" : "Tanaka, Yuzuru", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tanaka%2C+Yuzuru", "original-name" : "Yuzuru Tanaka", "last-name" : "Tanaka" }, { "label" : "Dabek, Frank", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dabek%2C+Frank", "original-name" : "Frank Dabek", "last-name" : "Dabek" }, { "label" : "Ives, Zachary", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ives%2C+Zachary", "original-name" : "Zachary Ives", "last-name" : "Ives" }, { "label" : "Balakrishnan, Hari", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Balakrishnan%2C+Hari", "original-name" : "Hari Balakrishnan", "last-name" : "Balakrishnan" }, { "label" : "Freund, Yoav", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Freund%2C+Yoav", "original-name" : "Yoav Freund", "last-name" : "Freund" }, { "label" : "Muslea, Ion", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Muslea%2C+Ion", "original-name" : "Ion Muslea", "last-name" : "Muslea" }, { "label" : "Sviridenko, Maxim", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sviridenko%2C+Maxim", "original-name" : "Maxim Sviridenko", "last-name" : "Sviridenko" }, { "label" : "Lov?sz, L?szl?", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lov%C3%A1sz%2C+L%C3%A0szl%C3%B3", "original-name" : "L?szl? Lov?sz", "last-name" : "Lov?sz" }, { "label" : "Milch, Brian", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Milch%2C+Brian", "original-name" : "Brian Milch", "last-name" : "Milch" }, { "label" : "Ball, Michael O.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ball%2C+Michael+O.", "original-name" : "Michael O. Ball", "last-name" : "Ball" }, { "label" : "Leighton, Tom", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Leighton%2C+Tom", "original-name" : "Tom Leighton", "last-name" : "Leighton" }, { "label" : "Madhavan, Jayant", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Madhavan%2C+Jayant", "original-name" : "Jayant Madhavan", "last-name" : "Madhavan" }, { "label" : "Smith, Brian Cantwell", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Smith%2C+Brian+Cantwell", "original-name" : "Brian Cantwell Smith", "last-name" : "Smith" }, { "label" : "Frederickson, G. N.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Frederickson%2C+G.+N.", "original-name" : "G. N. Frederickson", "last-name" : "Frederickson" }, { "label" : "Goldberg, Andrew", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Goldberg%2C+Andrew", "original-name" : "Andrew Goldberg", "last-name" : "Goldberg" }, { "label" : "Cytron, R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cytron%2C+R.", "original-name" : "R. Cytron", "last-name" : "Cytron" }, { "label" : "Gifford, David K.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gifford%2C+David+K.", "original-name" : "David K. Gifford", "last-name" : "Gifford" }, { "label" : "Poncele\\\'on, Dulce B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Poncele%5C%27on%2C+Dulce+B.", "original-name" : "Dulce B. Poncele\\\'on", "last-name" : "Poncele\\\'on" }, { "label" : "Jerrum, Mark", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Jerrum%2C+Mark", "original-name" : "Mark Jerrum", "last-name" : "Jerrum" }, { "label" : "Klein, Philip N.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Klein%2C+Philip+N.", "original-name" : "Philip N. Klein", "last-name" : "Klein" }, { "label" : "Wang, Jason Tsong-Li", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wang%2C+Jason+Tsong-Li", "original-name" : "Jason Tsong-Li Wang", "last-name" : "Wang" }, { "label" : "Spira, P. M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Spira%2C+P.+M.", "original-name" : "P. M. Spira", "last-name" : "Spira" }, { "label" : "Bilenko, Mikhail", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bilenko%2C+Mikhail", "original-name" : "Mikhail Bilenko", "last-name" : "Bilenko" }, { "label" : "Hariharan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hariharan", "original-name" : "Hariharan", "last-name" : "Hariharan" }, { "label" : "Hassin, Refael", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hassin%2C+Refael", "original-name" : "Refael Hassin", "last-name" : "Hassin" }, { "label" : "Hildebrand, Michiel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hildebrand%2C+Michiel", "original-name" : "Michiel Hildebrand", "last-name" : "Hildebrand" }, { "label" : "Bolin, Michael", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bolin%2C+Michael", "original-name" : "Michael Bolin", "last-name" : "Bolin" }, { "label" : "Kleinberg, Robert", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kleinberg%2C+Robert", "original-name" : "Robert Kleinberg", "last-name" : "Kleinberg" }, { "label" : "Teevan, Jaime", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Teevan%2C+Jaime", "original-name" : "Jaime Teevan", "last-name" : "Teevan" }, { "label" : "Saran, H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Saran%2C+H.", "original-name" : "H. Saran", "last-name" : "Saran" }, { "label" : "Nichols, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Nichols%2C+David", "original-name" : "Nichols, David", "last-name" : "Nichols" }, { "label" : "Zwick, Uri", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Zwick%2C+Uri", "original-name" : "Uri Zwick", "last-name" : "Zwick" }, { "label" : "Lam", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lam", "original-name" : "Lam", "last-name" : "Lam" }, { "label" : "Orlin, James B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Orlin%2C+James+B.", "original-name" : "James B. Orlin", "last-name" : "Orlin" }, { "label" : "Vazirani, Umesh", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Vazirani%2C+Umesh", "original-name" : "Umesh Vazirani", "last-name" : "Vazirani" }, { "label" : "News, Microdoc", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:News%2C+Microdoc", "original-name" : "Microdoc News", "last-name" : "News" }, { "label" : "McGeoch, C. C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:McGeoch%2C+C.+C.", "original-name" : "C. C. McGeoch", "last-name" : "McGeoch" }, { "label" : "Cutrell, Edward", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cutrell%2C+Edward", "original-name" : "Edward Cutrell", "last-name" : "Cutrell" }, { "label" : "Ports, Dan R. K.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ports%2C+Dan+R.+K.", "original-name" : "Dan R. K. Ports", "last-name" : "Ports" }, { "label" : "Ravi, R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ravi%2C+R.", "original-name" : "R. Ravi", "last-name" : "Ravi" }, { "label" : "Rosson, Mary Beth", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rosson%2C+Mary+Beth", "original-name" : "Mary Beth Rosson", "last-name" : "Rosson" }, { "label" : "Botafogo, Rodrigo A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Botafogo%2C+Rodrigo+A.", "original-name" : "Rodrigo A. Botafogo", "last-name" : "Botafogo" }, { "label" : "Lisanskiy, Ilya", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lisanskiy%2C+Ilya", "original-name" : "Ilya Lisanskiy", "last-name" : "Lisanskiy" }, { "label" : "Vempala, Santosh", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Vempala%2C+Santosh", "original-name" : "Santosh Vempala", "last-name" : "Vempala" }, { "label" : "Michaud, J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Michaud%2C+J.", "original-name" : "Michaud, J.", "last-name" : "Michaud" }, { "label" : "Van Der Waerden, B. L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Van+Der+Waerden%2C+B.+L.", "original-name" : "Van Der Waerden, B. L.", "last-name" : "Van Der Waerden" }, { "label" : "Rackoff, C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rackoff%2C+C.", "original-name" : "C. Rackoff", "last-name" : "Rackoff" }, { "label" : "Searingen, Kristen", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Searingen%2C+Kristen", "original-name" : "Kristen Searingen", "last-name" : "Searingen" }, { "label" : "Pedersen, Jan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pedersen%2C+Jan", "original-name" : "Jan Pedersen", "last-name" : "Pedersen" }, { "label" : "Iwamoto, Ken", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Iwamoto%2C+Ken", "original-name" : "Ken Iwamoto", "last-name" : "Iwamoto" }, { "label" : "Staples, J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Staples%2C+J.", "original-name" : "J. Staples", "last-name" : "Staples" }, { "label" : "Wu, S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wu%2C+S.", "original-name" : "S. Wu", "last-name" : "Wu" }, { "label" : "Gajos, Krzysztof", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gajos%2C+Krzysztof", "original-name" : "Krzysztof Gajos", "last-name" : "Gajos" }, { "label" : "Kao, Min-Yang", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kao%2C+Min-Yang", "original-name" : "Min-Yang Kao", "last-name" : "Kao" }, { "label" : "Cannata, Philip E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cannata%2C+Philip+E.", "original-name" : "Philip E. Cannata", "last-name" : "Cannata" }, { "label" : "Pasi, G.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pasi%2C+G.", "original-name" : "G. Pasi", "last-name" : "Pasi" }, { "label" : "Chan, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chan%2C+A.", "original-name" : "A. Chan", "last-name" : "Chan" }, { "label" : "Petersen, Karin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Petersen%2C+Karin", "original-name" : "Karin Petersen", "last-name" : "Petersen" }, { "label" : "Card, Stuart", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Card%2C+Stuart", "original-name" : "Stuart Card", "last-name" : "Card" }, { "label" : "Dijkstra, E. W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dijkstra%2C+E.+W.", "original-name" : "E. W. Dijkstra", "last-name" : "Dijkstra" }, { "label" : "Chignell, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chignell%2C+M.", "original-name" : "Chignell, M.", "last-name" : "Chignell" }, { "label" : "Patashnik, Oren", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Patashnik%2C+Oren", "original-name" : "Oren Patashnik", "last-name" : "Patashnik" }, { "label" : "Cohen, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cohen%2C+A.", "original-name" : "A. Cohen", "last-name" : "Cohen" }, { "label" : "Storey, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Storey%2C+M.", "original-name" : "Storey, M.", "last-name" : "Storey" }, { "label" : "Spolsky, Joel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Spolsky%2C+Joel", "original-name" : "Joel Spolsky", "last-name" : "Spolsky" }, { "label" : "Hernandez, Mauricio A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hernandez%2C+Mauricio+A.", "original-name" : "Mauricio A. Hernandez", "last-name" : "Hernandez" }, { "label" : "Williams, John H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Williams%2C+John+H.", "original-name" : "John H. Williams", "last-name" : "Williams" }, { "label" : "Katabi, Dina", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Katabi%2C+Dina", "original-name" : "Dina Katabi", "last-name" : "Katabi" }, { "label" : "Kortsarz, Guy", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kortsarz%2C+Guy", "original-name" : "Guy Kortsarz", "last-name" : "Kortsarz" }, { "label" : "Krueger, Helmut", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Krueger%2C+Helmut", "original-name" : "Helmut Krueger", "last-name" : "Krueger" }, { "label" : "Rivest, Ron L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rivest%2C+Ron+L.", "original-name" : "Ron L. Rivest", "last-name" : "Rivest" }, { "label" : "Aho, Alfred V.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Aho%2C+Alfred+V.", "original-name" : "Alfred V. Aho", "last-name" : "Aho" }, { "label" : "Azar, Yossi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Azar%2C+Yossi", "original-name" : "Yossi Azar", "last-name" : "Azar" }, { "label" : "Svitkina, Zoya", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Svitkina%2C+Zoya", "original-name" : "Zoya Svitkina", "last-name" : "Svitkina" }, { "label" : "Deerwester, Scott", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Deerwester%2C+Scott", "original-name" : "Scott Deerwester", "last-name" : "Deerwester" }, { "label" : "Terry, Douglas B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Terry%2C+Douglas+B.", "original-name" : "Douglas B. Terry", "last-name" : "Terry" }, { "label" : "Gilver, J. R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gilver%2C+J.+R.", "original-name" : "J. R. Gilver", "last-name" : "Gilver" }, { "label" : "Brand, Matthew", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Brand%2C+Matthew", "original-name" : "Matthew Brand", "last-name" : "Brand" }, { "label" : "Luby, Michael", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Luby%2C+Michael", "original-name" : "Michael Luby", "last-name" : "Luby" }, { "label" : "Rauch, Samuel J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rauch%2C+Samuel+J.", "original-name" : "Samuel J. Rauch", "last-name" : "Rauch" }, { "label" : "Lund, Carsten", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lund%2C+Carsten", "original-name" : "Carsten Lund", "last-name" : "Lund" }, { "label" : "Yao, Andrew C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Yao%2C+Andrew+C.", "original-name" : "Andrew C. Yao", "last-name" : "Yao" }, { "label" : "Frederickson, Greg N.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Frederickson%2C+Greg+N.", "original-name" : "Greg N. Frederickson", "last-name" : "Frederickson" }, { "label" : "Low, Aidan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Low%2C+Aidan", "original-name" : "Aidan Low", "last-name" : "Low" }, { "label" : "Lamping, John", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lamping%2C+John", "original-name" : "John Lamping", "last-name" : "Lamping" }, { "label" : "Bartal, Y.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bartal%2C+Y.", "original-name" : "Y. Bartal", "last-name" : "Bartal" }, { "label" : "Ullman, Jeffrey D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ullman%2C+Jeffrey+D.", "original-name" : "Jeffrey D. Ullman", "last-name" : "Ullman" }, { "label" : "Uma, R. N.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Uma%2C+R.+N.", "original-name" : "R. N. Uma", "last-name" : "Uma" }, { "label" : "Auslander, M. A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Auslander%2C+M.+A.", "original-name" : "M. A. Auslander", "last-name" : "Auslander" }, { "label" : "Rosen, Mark", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rosen%2C+Mark", "original-name" : "Mark Rosen", "last-name" : "Rosen" }, { "label" : "Rivest, Ronald L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rivest%2C+Ronald+L.", "original-name" : "Ronald L. Rivest", "last-name" : "Rivest" }, { "label" : "Ferrante, J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ferrante%2C+J.", "original-name" : "J. Ferrante", "last-name" : "Ferrante" }, { "label" : "McGuinness, Deborah L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:McGuinness%2C+Deborah+L.", "original-name" : "McGuinness, Deborah L.", "last-name" : "McGuinness" }, { "label" : "Cohen, Robert F.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cohen%2C+Robert+F.", "original-name" : "Robert F. Cohen", "last-name" : "Cohen" }, { "label" : "MacLeod, Ken", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:MacLeod%2C+Ken", "original-name" : "Ken MacLeod", "last-name" : "MacLeod" }, { "label" : "Myers, Brad A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Myers%2C+Brad+A.", "original-name" : "Brad A. Myers", "last-name" : "Myers" }, { "label" : "Henderson, Jr., D. Austin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Henderson%2C+Jr.%2C+D.+Austin", "original-name" : "Henderson, Jr., D. Austin", "last-name" : "Henderson" }, { "label" : "Queyranne, Maurice", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Queyranne%2C+Maurice", "original-name" : "Maurice Queyranne", "last-name" : "Queyranne" }, { "label" : "Stolfo, Salvatore J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Stolfo%2C+Salvatore+J.", "original-name" : "Salvatore J. Stolfo", "last-name" : "Stolfo" }, { "label" : "Hochbaum, Dorit", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hochbaum%2C+Dorit", "original-name" : "Dorit Hochbaum", "last-name" : "Hochbaum" }, { "label" : "Martel, Charles", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Martel%2C+Charles", "original-name" : "Charles Martel", "last-name" : "Martel" }, { "label" : "Chor, B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chor%2C+B.", "original-name" : "B. Chor", "last-name" : "Chor" }, { "label" : "Staab, S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Staab%2C+S.", "original-name" : "S. Staab", "last-name" : "Staab" }, { "label" : "Salton, Gerard", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Salton%2C+Gerard", "original-name" : "Gerard Salton", "last-name" : "Salton" }, { "label" : "Parsia, Bijan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Parsia%2C+Bijan", "original-name" : "Bijan Parsia", "last-name" : "Parsia" }, { "label" : "Hart, Peter E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hart%2C+Peter+E.", "original-name" : "Peter E. Hart", "last-name" : "Hart" }, { "label" : "Rodeh, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rodeh%2C+M.", "original-name" : "M. Rodeh", "last-name" : "Rodeh" }, { "label" : "Swamy, Chaitana", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Swamy%2C+Chaitana", "original-name" : "Chaitana Swamy", "last-name" : "Swamy" }, { "label" : "Chaitin, G. J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chaitin%2C+G.+J.", "original-name" : "G. J. Chaitin", "last-name" : "Chaitin" }, { "label" : "Tardos, ?va", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tardos%2C+%C3%89va", "original-name" : "?va Tardos", "last-name" : "Tardos" }, { "label" : "Subramanian, S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Subramanian%2C+S.", "original-name" : "S. Subramanian", "last-name" : "Subramanian" }, { "label" : "Seidel, Raimund", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Seidel%2C+Raimund", "original-name" : "Raimund Seidel", "last-name" : "Seidel" }, { "label" : "Levine, Matthew S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Levine%2C+Matthew+S.", "original-name" : "Matthew S. Levine", "last-name" : "Levine" }, { "label" : "Rompel, John", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rompel%2C+John", "original-name" : "John Rompel", "last-name" : "Rompel" }, { "label" : "Alpert, C. J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Alpert%2C+C.+J.", "original-name" : "C. J. Alpert", "last-name" : "Alpert" }, { "label" : "Gribble, Steven", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gribble%2C+Steven", "original-name" : "Steven Gribble", "last-name" : "Gribble" }, { "label" : "Marthi, Bhaskara", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Marthi%2C+Bhaskara", "original-name" : "Bhaskara Marthi", "last-name" : "Marthi" }, { "label" : "Vohra, R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Vohra%2C+R.", "original-name" : "R. Vohra", "last-name" : "Vohra" }, { "label" : "Picard, Jean-Claude", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Picard%2C+Jean-Claude", "original-name" : "Jean-Claude Picard", "last-name" : "Picard" }, { "label" : "Mander, Richer", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mander%2C+Richer", "original-name" : "Richer Mander", "last-name" : "Mander" }, { "label" : "Hammer, Joachim", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hammer%2C+Joachim", "original-name" : "Joachim Hammer", "last-name" : "Hammer" }, { "label" : "Sidner, Candace", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sidner%2C+Candace", "original-name" : "Candace Sidner", "last-name" : "Sidner" }, { "label" : "Matula, D. W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Matula%2C+D.+W.", "original-name" : "D. W. Matula", "last-name" : "Matula" }, { "label" : "Zellweger, Polle T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Zellweger%2C+Polle+T.", "original-name" : "Polle T. Zellweger", "last-name" : "Zellweger" }, { "label" : "Dwork, Cynthia", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dwork%2C+Cynthia", "original-name" : "Cynthia Dwork", "last-name" : "Dwork" }, { "label" : "Kleek, Max Van", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kleek%2C+Max+Van", "original-name" : "Max Van Kleek", "last-name" : "Kleek" }, { "label" : "Paoli, Jean", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Paoli%2C+Jean", "original-name" : "Jean Paoli", "last-name" : "Paoli" }, { "label" : "Alvarado, Christine", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Alvarado%2C+Christine", "original-name" : "Christine Alvarado", "last-name" : "Alvarado" }, { "label" : "Hummel, S. Flynn", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hummel%2C+S.+Flynn", "original-name" : "S. Flynn Hummel", "last-name" : "Hummel" }, { "label" : "Polychronopoulos, C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Polychronopoulos%2C+C.", "original-name" : "C. Polychronopoulos", "last-name" : "Polychronopoulos" }, { "label" : "Giles, C. Lee", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Giles%2C+C.+Lee", "original-name" : "C. Lee Giles", "last-name" : "Giles" }, { "label" : "Johnson, Donald B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Johnson%2C+Donald+B.", "original-name" : "Donald B. Johnson", "last-name" : "Johnson" }, { "label" : "Zhao, Fang", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Zhao%2C+Fang", "original-name" : "Fang Zhao", "last-name" : "Zhao" }, { "label" : "Kim, C. E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kim%2C+C.+E.", "original-name" : "C. E. Kim", "last-name" : "Kim" }, { "label" : "Patel-Schneider, Peter F.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Patel-Schneider%2C+Peter+F.", "original-name" : "Peter F. Patel-Schneider", "last-name" : "Patel-Schneider" }, { "label" : "Bencz?r, Andr?s A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bencz%C3%BAr%2C+Andr%C3%A1s+A.", "original-name" : "Andr?s A. Bencz?r", "last-name" : "Bencz?r" }, { "label" : "Dodds, Leigh", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dodds%2C+Leigh", "original-name" : "Leigh Dodds", "last-name" : "Dodds" }, { "label" : "Kahale, Nabil", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kahale%2C+Nabil", "original-name" : "Nabil Kahale", "last-name" : "Kahale" }, { "label" : "Fredman, Michael L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Fredman%2C+Michael+L.", "original-name" : "Michael L. Fredman", "last-name" : "Fredman" }, { "label" : "Takaoka, T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Takaoka%2C+T.", "original-name" : "T. Takaoka", "last-name" : "Takaoka" }, { "label" : "Klein, Philip", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Klein%2C+Philip", "original-name" : "Philip Klein", "last-name" : "Klein" }, { "label" : "Frieze, Alan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Frieze%2C+Alan", "original-name" : "Alan Frieze", "last-name" : "Frieze" }, { "label" : "Harshman, Richard", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Harshman%2C+Richard", "original-name" : "Richard Harshman", "last-name" : "Harshman" }, { "label" : "Mihail, Milena", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mihail%2C+Milena", "original-name" : "Milena Mihail", "last-name" : "Mihail" }, { "label" : "Garcia-Molina, Hector", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Garcia-Molina%2C+Hector", "original-name" : "Hector Garcia-Molina", "last-name" : "Garcia-Molina" }, { "label" : "Freire, Juliana", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Freire%2C+Juliana", "original-name" : "Juliana Freire", "last-name" : "Freire" }, { "label" : "Ryan, Jennifer", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ryan%2C+Jennifer", "original-name" : "Jennifer Ryan", "last-name" : "Ryan" }, { "label" : "Nash-Williams, C. St. J. A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Nash-Williams%2C+C.+St.+J.+A.", "original-name" : "C. St. J. A. Nash-Williams", "last-name" : "Nash-Williams" }, { "label" : "Stata, Raymie", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Stata%2C+Raymie", "original-name" : "Raymie Stata", "last-name" : "Stata" }, { "label" : "Impagliazzo, Russel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Impagliazzo%2C+Russel", "original-name" : "Russel Impagliazzo", "last-name" : "Impagliazzo" }, { "label" : "Clements, Austin T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Clements%2C+Austin+T.", "original-name" : "Austin T. Clements", "last-name" : "Clements" }, { "label" : "Doan, Khoa", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Doan%2C+Khoa", "original-name" : "Khoa Doan", "last-name" : "Doan" }, { "label" : "Haystack", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Haystack", "original-name" : "Haystack", "last-name" : "Haystack" }, { "label" : "Minton, S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Minton%2C+S.", "original-name" : "S. Minton", "last-name" : "Minton" }, { "label" : "Lau, Tessa", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lau%2C+Tessa", "original-name" : "Tessa Lau", "last-name" : "Lau" }, { "label" : "Vishkin, Uzi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Vishkin%2C+Uzi", "original-name" : "Uzi Vishkin", "last-name" : "Vishkin" }, { "label" : "Weiss, Ron", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Weiss%2C+Ron", "original-name" : "Ron Weiss", "last-name" : "Weiss" }, { "label" : "Lomonosov, Micael V.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lomonosov%2C+Micael+V.", "original-name" : "Micael V. Lomonosov", "last-name" : "Lomonosov" }, { "label" : "Pfeffer, Avi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pfeffer%2C+Avi", "original-name" : "Avi Pfeffer", "last-name" : "Pfeffer" }, { "label" : "Tomkins, Andrew", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tomkins%2C+Andrew", "original-name" : "Andrew Tomkins", "last-name" : "Tomkins" }, { "label" : "Sheldon, Mark A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sheldon%2C+Mark+A.", "original-name" : "Mark A. Sheldon", "last-name" : "Sheldon" }, { "label" : "Hastad", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hastad", "original-name" : "Hastad", "last-name" : "Hastad" }, { "label" : "Lee, Ryan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lee%2C+Ryan", "original-name" : "Ryan Lee", "last-name" : "Lee" }, { "label" : "Roure, David De", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Roure%2C+David+De", "original-name" : "David De Roure", "last-name" : "Roure" }, { "label" : "Karapetian, Iskandar A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Karapetian%2C+Iskandar+A.", "original-name" : "Iskandar A. Karapetian", "last-name" : "Karapetian" }, { "label" : "Jones, Karen Sparck", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Jones%2C+Karen+Sparck", "original-name" : "Karen Sparck Jones", "last-name" : "Jones" }, { "label" : "Yerushalmi, Yoav", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Yerushalmi%2C+Yoav", "original-name" : "Yoav Yerushalmi", "last-name" : "Yerushalmi" }, { "label" : "Hogue, Andrew", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hogue%2C+Andrew", "original-name" : "Andrew Hogue", "last-name" : "Hogue" }, { "label" : "Pokraev, S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pokraev%2C+S.", "original-name" : "S. Pokraev", "last-name" : "Pokraev" }, { "label" : "Mitchell, J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mitchell%2C+J.", "original-name" : "J. Mitchell", "last-name" : "Mitchell" }, { "label" : "Bellare, Mihir", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bellare%2C+Mihir", "original-name" : "Mihir Bellare", "last-name" : "Bellare" }, { "label" : "Maarek, Yoelle S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Maarek%2C+Yoelle+S.", "original-name" : "Yoelle S. Maarek", "last-name" : "Maarek" }, { "label" : "Ramanathan, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ramanathan%2C+A.", "original-name" : "A. Ramanathan", "last-name" : "Ramanathan" }, { "label" : "Dagum, Paul", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dagum%2C+Paul", "original-name" : "Paul Dagum", "last-name" : "Dagum" }, { "label" : "Immorlica, Nicole", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Immorlica%2C+Nicole", "original-name" : "Nicole Immorlica", "last-name" : "Immorlica" }, { "label" : "Frank, Andras", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Frank%2C+Andras", "original-name" : "Andras Frank", "last-name" : "Frank" }, { "label" : "Vazirani, V. V.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Vazirani%2C+V.+V.", "original-name" : "V. V. Vazirani", "last-name" : "Vazirani" }, { "label" : "Karp, Richard M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Karp%2C+Richard+M.", "original-name" : "Richard M. Karp", "last-name" : "Karp" }, { "label" : "Schulman, Eric", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Schulman%2C+Eric", "original-name" : "Eric Schulman", "last-name" : "Schulman" }, { "label" : "Jones, William", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Jones%2C+William", "original-name" : "William Jones", "last-name" : "Jones" }, { "label" : "Charikar, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Charikar%2C+M.", "original-name" : "M. Charikar", "last-name" : "Charikar" }, { "label" : "Dinic, E.A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dinic%2C+E.A.", "original-name" : "E.A. Dinic", "last-name" : "Dinic" }, { "label" : "Hu, T. C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hu%2C+T.+C.", "original-name" : "T. C. Hu", "last-name" : "Hu" }, { "label" : "Safra, S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Safra%2C+S.", "original-name" : "S. Safra", "last-name" : "Safra" }, { "label" : "Sellie, Linda", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sellie%2C+Linda", "original-name" : "Linda Sellie", "last-name" : "Sellie" }, { "label" : "Srinivasan, Aravind", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Srinivasan%2C+Aravind", "original-name" : "Aravind Srinivasan", "last-name" : "Srinivasan" }, { "label" : "Cai, G--P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cai%2C+G--P.", "original-name" : "Cai, G--P.", "last-name" : "Cai" }, { "label" : "Aldous, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Aldous%2C+David", "original-name" : "David Aldous", "last-name" : "Aldous" }, { "label" : "Verma, Deepak", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Verma%2C+Deepak", "original-name" : "Deepak Verma", "last-name" : "Verma" }, { "label" : "McCallum, Andrew", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:McCallum%2C+Andrew", "original-name" : "Andrew McCallum", "last-name" : "McCallum" }, { "label" : "Kahan, Jose", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kahan%2C+Jose", "original-name" : "Jose Kahan", "last-name" : "Kahan" }, { "label" : "Kao, Ming Yang", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kao%2C+Ming+Yang", "original-name" : "Ming Yang Kao", "last-name" : "Kao" }, { "label" : "Gilbert, John R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gilbert%2C+John+R.", "original-name" : "John R. Gilbert", "last-name" : "Gilbert" }, { "label" : "Blum, Avrim", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Blum%2C+Avrim", "original-name" : "Avrim Blum", "last-name" : "Blum" }, { "label" : "Karzanov, Alexander V.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Karzanov%2C+Alexander+V.", "original-name" : "Alexander V. Karzanov", "last-name" : "Karzanov" }, { "label" : "Ramkumar, G. D. S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ramkumar%2C+G.+D.+S.", "original-name" : "G. D. S. Ramkumar", "last-name" : "Ramkumar" }, { "label" : "Kannan, Ravi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kannan%2C+Ravi", "original-name" : "Ravi Kannan", "last-name" : "Kannan" }, { "label" : "Halldorsson, Magnus M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Halldorsson%2C+Magnus+M.", "original-name" : "Magnus M. Halldorsson", "last-name" : "Halldorsson" }, { "label" : "Pedersen, Jan O.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pedersen%2C+Jan+O.", "original-name" : "Jan O. Pedersen", "last-name" : "Pedersen" }, { "label" : "Wigderson, Avi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wigderson%2C+Avi", "original-name" : "Avi Wigderson", "last-name" : "Wigderson" }, { "label" : "Timofeev, E. A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Timofeev%2C+E.+A.", "original-name" : "E. A. Timofeev", "last-name" : "Timofeev" }, { "label" : "Morris, Robert", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Morris%2C+Robert", "original-name" : "Robert Morris", "last-name" : "Morris" }, { "label" : "Frieze, Alan M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Frieze%2C+Alan+M.", "original-name" : "Alan M. Frieze", "last-name" : "Frieze" }, { "label" : "Aumann, Yonatan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Aumann%2C+Yonatan", "original-name" : "Yonatan Aumann", "last-name" : "Aumann" }, { "label" : "Barzilay, Regina", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Barzilay%2C+Regina", "original-name" : "Barzilay, Regina", "last-name" : "Barzilay" }, { "label" : "Rauch, Monika", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rauch%2C+Monika", "original-name" : "Monika Rauch", "last-name" : "Rauch" }, { "label" : "Sheffler, T. J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sheffler%2C+T.+J.", "original-name" : "T. J. Sheffler", "last-name" : "Sheffler" }, { "label" : "Rosenfeld, Roni", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rosenfeld%2C+Roni", "original-name" : "Roni Rosenfeld", "last-name" : "Rosenfeld" }, { "label" : "Fernandez de la Vega, W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Fernandez+de+la+Vega%2C+W.", "original-name" : "Fernandez de la Vega, W.", "last-name" : "Fernandez de la Vega" }, { "label" : "Loo, Book Thau", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Loo%2C+Book+Thau", "original-name" : "Book Thau Loo", "last-name" : "Loo" }, { "label" : "Lasilla, Ora", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lasilla%2C+Ora", "original-name" : "Ora Lasilla", "last-name" : "Lasilla" }, { "label" : "Chen, Hao", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chen%2C+Hao", "original-name" : "Hao Chen", "last-name" : "Chen" }, { "label" : "Doan, AnHai", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Doan%2C+AnHai", "original-name" : "AnHai Doan", "last-name" : "Doan" }, { "label" : "Cuenca-Grau, Bernardo", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cuenca-Grau%2C+Bernardo", "original-name" : "Bernardo Cuenca-Grau", "last-name" : "Cuenca-Grau" }, { "label" : "Swick, Ralph", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Swick%2C+Ralph", "original-name" : "Ralph Swick", "last-name" : "Swick" }, { "label" : "Tenenbaum, Joshua B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tenenbaum%2C+Joshua+B.", "original-name" : "Joshua B. Tenenbaum", "last-name" : "Tenenbaum" }, { "label" : "Aggarwal, Manica", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Aggarwal%2C+Manica", "original-name" : "Manica Aggarwal", "last-name" : "Aggarwal" }, { "label" : "Alon, Noga", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Alon%2C+Noga", "original-name" : "Noga Alon", "last-name" : "Alon" }, { "label" : "Thurimella, Ramki", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Thurimella%2C+Ramki", "original-name" : "Ramki Thurimella", "last-name" : "Thurimella" }, { "label" : "Lord, Robert", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lord%2C+Robert", "original-name" : "Robert Lord", "last-name" : "Lord" }, { "label" : "Czerwinski, Mary", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Czerwinski%2C+Mary", "original-name" : "Mary Czerwinski", "last-name" : "Czerwinski" }, { "label" : "Mazzochi, Stefano", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mazzochi%2C+Stefano", "original-name" : "Stefano Mazzochi", "last-name" : "Mazzochi" }, { "label" : "Houben, Geert-Jan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Houben%2C+Geert-Jan", "original-name" : "Geert-Jan Houben", "last-name" : "Houben" }, { "label" : "Veenstra, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Veenstra%2C+M.", "original-name" : "M. Veenstra", "last-name" : "Veenstra" }, { "label" : "Gabber, O.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gabber%2C+O.", "original-name" : "O. Gabber", "last-name" : "Gabber" }, { "label" : "Pane, John F.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pane%2C+John+F.", "original-name" : "John F. Pane", "last-name" : "Pane" }, { "label" : "Karger, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Karger%2C+David", "original-name" : "David Karger", "last-name" : "Karger" }, { "label" : "Mackinlay, Jock D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mackinlay%2C+Jock+D.", "original-name" : "Jock D. Mackinlay", "last-name" : "Mackinlay" }, { "label" : "McHugh, Jason", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:McHugh%2C+Jason", "original-name" : "Jason McHugh", "last-name" : "McHugh" }, { "label" : "Engelbart, Douglas C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Engelbart%2C+Douglas+C.", "original-name" : "Douglas C. Engelbart", "last-name" : "Engelbart" }, { "label" : "Kahale, Nabile", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kahale%2C+Nabile", "original-name" : "Nabile Kahale", "last-name" : "Kahale" }, { "label" : "Harman, Donna", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Harman%2C+Donna", "original-name" : "Donna Harman", "last-name" : "Harman" }, { "label" : "Connolly, Dan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Connolly%2C+Dan", "original-name" : "Dan Connolly", "last-name" : "Connolly" }, { "label" : "Buckley, Chris", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Buckley%2C+Chris", "original-name" : "Chris Buckley", "last-name" : "Buckley" }, { "label" : "Feinstein, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Feinstein%2C+A.", "original-name" : "A. Feinstein", "last-name" : "Feinstein" }, { "label" : "Furnas, George W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Furnas%2C+George+W.", "original-name" : "George W. Furnas", "last-name" : "Furnas" }, { "label" : "Brown, Mark", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Brown%2C+Mark", "original-name" : "Mark Brown", "last-name" : "Brown" }, { "label" : "Minton, Steven N.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Minton%2C+Steven+N.", "original-name" : "Steven N. Minton", "last-name" : "Minton" }, { "label" : "Frederickson, Gary N.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Frederickson%2C+Gary+N.", "original-name" : "Gary N. Frederickson", "last-name" : "Frederickson" }, { "label" : "Cole", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cole", "original-name" : "Cole", "last-name" : "Cole" }, { "label" : "Motwani, Rajeev", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Motwani%2C+Rajeev", "original-name" : "Rajeev Motwani", "last-name" : "Motwani" }, { "label" : "Hill, W.C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hill%2C+W.C.", "original-name" : "Hill, W.C.", "last-name" : "Hill" }, { "label" : "Furnas, George", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Furnas%2C+George", "original-name" : "George Furnas", "last-name" : "Furnas" }, { "label" : "Lam, J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lam%2C+J.", "original-name" : "J. Lam", "last-name" : "Lam" }, { "label" : "Szemeredi, Endre", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Szemeredi%2C+Endre", "original-name" : "Endre Szemeredi", "last-name" : "Szemeredi" }, { "label" : "Akra, M. A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Akra%2C+M.+A.", "original-name" : "M. A. Akra", "last-name" : "Akra" }, { "label" : "Thornton, James", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Thornton%2C+James", "original-name" : "James Thornton", "last-name" : "Thornton" }, { "label" : "Appelgate, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Appelgate%2C+David", "original-name" : "David Appelgate", "last-name" : "Appelgate" }, { "label" : "Golbeck, J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Golbeck%2C+J.", "original-name" : "J. Golbeck", "last-name" : "Golbeck" }, { "label" : "Ibarra, O. H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ibarra%2C+O.+H.", "original-name" : "O. H. Ibarra", "last-name" : "Ibarra" }, { "label" : "Wroblewski, D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wroblewski%2C+D.", "original-name" : "Wroblewski, D.", "last-name" : "Wroblewski" }, { "label" : "Hardman, Lynda", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hardman%2C+Lynda", "original-name" : "Lynda Hardman", "last-name" : "Hardman" }, { "label" : "Seymour, Paul D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Seymour%2C+Paul+D.", "original-name" : "Paul D. Seymour", "last-name" : "Seymour" }, { "label" : "Sami, Rahul", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sami%2C+Rahul", "original-name" : "Rahul Sami", "last-name" : "Sami" }, { "label" : "Quang, L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Quang%2C+L.", "original-name" : "L. Quang", "last-name" : "Quang" }, { "label" : "P\\`osa, L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:P%5C%60osa%2C+L.", "original-name" : "L. P\\`osa", "last-name" : "P\\`osa" }, { "label" : "Matias, Yossi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Matias%2C+Yossi", "original-name" : "Yossi Matias", "last-name" : "Matias" }, { "label" : "Pasula, Hanna", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pasula%2C+Hanna", "original-name" : "Hanna Pasula", "last-name" : "Pasula" }, { "label" : "Janotti, John", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Janotti%2C+John", "original-name" : "John Janotti", "last-name" : "Janotti" }, { "label" : "Linial, Natan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Linial%2C+Natan", "original-name" : "Natan Linial", "last-name" : "Linial" }, { "label" : "Dourish, Paul", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dourish%2C+Paul", "original-name" : "Paul Dourish", "last-name" : "Dourish" }, { "label" : "Kautz, Henry", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kautz%2C+Henry", "original-name" : "Henry Kautz", "last-name" : "Kautz" }, { "label" : "Zhurakhinskaya, Marina", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Zhurakhinskaya%2C+Marina", "original-name" : "Marina Zhurakhinskaya", "last-name" : "Zhurakhinskaya" }, { "label" : "R., Thomas", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:R.%2C+Thomas", "original-name" : "Thomas R.", "last-name" : "R." }, { "label" : "Mehlhorn, Kurt", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mehlhorn%2C+Kurt", "original-name" : "Kurt Mehlhorn", "last-name" : "Mehlhorn" }, { "label" : "Meyerson, Adam", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Meyerson%2C+Adam", "original-name" : "Adam Meyerson", "last-name" : "Meyerson" }, { "label" : "Williamson, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Williamson%2C+David", "original-name" : "David Williamson", "last-name" : "Williamson" }, { "label" : "Getoor, Lise", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Getoor%2C+Lise", "original-name" : "Lise Getoor", "last-name" : "Getoor" }, { "label" : "Tim Berners-Lee, James Hendler", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tim+Berners-Lee%2C+James+Hendler", "original-name" : "Tim Berners-Lee, James Hendler", "last-name" : "Tim Berners-Lee" }, { "label" : "Wilks, Y.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wilks%2C+Y.", "original-name" : "Y. Wilks", "last-name" : "Wilks" }, { "label" : "Deshpande, Pawan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Deshpande%2C+Pawan", "original-name" : "Deshpande, Pawan", "last-name" : "Deshpande" }, { "label" : "Huang, J. H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Huang%2C+J.+H.", "original-name" : "J. H. Huang", "last-name" : "Huang" }, { "label" : "Chien, Wendy S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chien%2C+Wendy+S.", "original-name" : "Wendy S. Chien", "last-name" : "Chien" }, { "label" : "Goldreich, Oded", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Goldreich%2C+Oded", "original-name" : "Oded Goldreich", "last-name" : "Goldreich" }, { "label" : "Berkheimer, Andy", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Berkheimer%2C+Andy", "original-name" : "Andy Berkheimer", "last-name" : "Berkheimer" }, { "label" : "Garg, Naveen", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Garg%2C+Naveen", "original-name" : "Naveen Garg", "last-name" : "Garg" }, { "label" : "freedb.org", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:freedb.org", "original-name" : "freedb.org", "last-name" : "freedb.org" }, { "label" : "Brunskill, Emma", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Brunskill%2C+Emma", "original-name" : "Emma Brunskill", "last-name" : "Brunskill" }, { "label" : "Ford, Jr., Lester R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ford%2C+Jr.%2C+Lester+R.", "original-name" : "Ford, Jr., Lester R.", "last-name" : "Ford" }, { "label" : "Khuller, Samir", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Khuller%2C+Samir", "original-name" : "Samir Khuller", "last-name" : "Khuller" }, { "label" : "Ratanamahatana, Chotirat (Ann)", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ratanamahatana%2C+Chotirat+%28Ann%29", "original-name" : "Chotirat (Ann) Ratanamahatana", "last-name" : "Ratanamahatana" }, { "label" : "Chin, F. Y.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chin%2C+F.+Y.", "original-name" : "F. Y. Chin", "last-name" : "Chin" }, { "label" : "Rose, Daniel E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rose%2C+Daniel+E.", "original-name" : "Daniel E. Rose", "last-name" : "Rose" }, { "label" : "Golgher, P. B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Golgher%2C+P.+B.", "original-name" : "P. B. Golgher", "last-name" : "Golgher" }, { "label" : "Chekuri, Chandra C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chekuri%2C+Chandra+C.", "original-name" : "Chandra C. Chekuri", "last-name" : "Chekuri" }, { "label" : "Rajaraman, R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rajaraman%2C+R.", "original-name" : "R. Rajaraman", "last-name" : "Rajaraman" }, { "label" : "Anupam, Vinod", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Anupam%2C+Vinod", "original-name" : "Vinod Anupam", "last-name" : "Anupam" }, { "label" : "Mooney, Raymond J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mooney%2C+Raymond+J.", "original-name" : "Raymond J. Mooney", "last-name" : "Mooney" }, { "label" : "Hogue, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hogue%2C+A.", "original-name" : "A. Hogue", "last-name" : "Hogue" }, { "label" : "Guthrie, D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Guthrie%2C+D.", "original-name" : "D. Guthrie", "last-name" : "Guthrie" }, { "label" : "Ron, Dana", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ron%2C+Dana", "original-name" : "Dana Ron", "last-name" : "Ron" }, { "label" : "Kruskal, Jr., J. B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kruskal%2C+Jr.%2C+J.+B.", "original-name" : "Kruskal, Jr., J. B.", "last-name" : "Kruskal" }, { "label" : "LaMarca, Anthony", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:LaMarca%2C+Anthony", "original-name" : "Anthony LaMarca", "last-name" : "LaMarca" }, { "label" : "Trigoni, Agathoniki", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Trigoni%2C+Agathoniki", "original-name" : "Agathoniki Trigoni", "last-name" : "Trigoni" }, { "label" : "Peters, Anne Rogers", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Peters%2C+Anne+Rogers", "original-name" : "Anne Rogers Peters", "last-name" : "Peters" }, { "label" : "Kearns, Michael", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kearns%2C+Michael", "original-name" : "Michael Kearns", "last-name" : "Kearns" }, { "label" : "Schrijver, Alexander", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Schrijver%2C+Alexander", "original-name" : "Alexander Schrijver", "last-name" : "Schrijver" }, { "label" : "Seymour, Paul", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Seymour%2C+Paul", "original-name" : "Paul Seymour", "last-name" : "Seymour" }, { "label" : "Abiteboul, Serge", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Abiteboul%2C+Serge", "original-name" : "Serge Abiteboul", "last-name" : "Abiteboul" }, { "label" : "Shmoys, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shmoys%2C+David", "original-name" : "David Shmoys", "last-name" : "Shmoys" }, { "label" : "Doorenbos, Robert", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Doorenbos%2C+Robert", "original-name" : "Robert Doorenbos", "last-name" : "Doorenbos" }, { "label" : "Holm, Jacob", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Holm%2C+Jacob", "original-name" : "Jacob Holm", "last-name" : "Holm" }, { "label" : "Weld, Daniel S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Weld%2C+Daniel+S.", "original-name" : "Daniel S. Weld", "last-name" : "Weld" }, { "label" : "Henzinger, Monika Rauch", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Henzinger%2C+Monika+Rauch", "original-name" : "Monika Rauch Henzinger", "last-name" : "Henzinger" }, { "label" : "Dhanidina, Rizwan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dhanidina%2C+Rizwan", "original-name" : "Rizwan Dhanidina", "last-name" : "Dhanidina" }, { "label" : "Chen, Harr", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chen%2C+Harr", "original-name" : "Harr Chen", "last-name" : "Chen" }, { "label" : "Domingue, John", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Domingue%2C+John", "original-name" : "John Domingue", "last-name" : "Domingue" }, { "label" : "Goldberg, Andrew V.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Goldberg%2C+Andrew+V.", "original-name" : "Andrew V. Goldberg", "last-name" : "Goldberg" }, { "label" : "Feldman, Jon", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Feldman%2C+Jon", "original-name" : "Jon Feldman", "last-name" : "Feldman" }, { "label" : "Maggs, Bruce", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Maggs%2C+Bruce", "original-name" : "Bruce Maggs", "last-name" : "Maggs" }, { "label" : "Kuck, D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kuck%2C+D.", "original-name" : "D. Kuck", "last-name" : "Kuck" }, { "label" : "Sirin, Evren", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sirin%2C+Evren", "original-name" : "Evren Sirin", "last-name" : "Sirin" }, { "label" : "Yannakakis, Mihalis", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Yannakakis%2C+Mihalis", "original-name" : "Mihalis Yannakakis", "last-name" : "Yannakakis" }, { "label" : "Naor, Dalit", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Naor%2C+Dalit", "original-name" : "Dalit Naor", "last-name" : "Naor" }, { "label" : "Bogstad, Bill", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bogstad%2C+Bill", "original-name" : "Bill Bogstad", "last-name" : "Bogstad" }, { "label" : "Milis, Ioannis", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Milis%2C+Ioannis", "original-name" : "Ioannis Milis", "last-name" : "Milis" }, { "label" : "Codd, E. F.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Codd%2C+E.+F.", "original-name" : "E. F. Codd", "last-name" : "Codd" }, { "label" : "Hollan, J.D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hollan%2C+J.D.", "original-name" : "Hollan, J.D.", "last-name" : "Hollan" }, { "label" : "Rabani, Yuval", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rabani%2C+Yuval", "original-name" : "Yuval Rabani", "last-name" : "Rabani" }, { "label" : "Sinha, Vineet", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sinha%2C+Vineet", "original-name" : "Vineet Sinha", "last-name" : "Sinha" }, { "label" : "Shmoys, David B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shmoys%2C+David+B.", "original-name" : "David B. Shmoys", "last-name" : "Shmoys" }, { "label" : "Norman, Donald A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Norman%2C+Donald+A.", "original-name" : "Donald A. Norman", "last-name" : "Norman" }, { "label" : "Awerbuch, Baruch", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Awerbuch%2C+Baruch", "original-name" : "Baruch Awerbuch", "last-name" : "Awerbuch" }, { "label" : "Goldman, Roy", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Goldman%2C+Roy", "original-name" : "Roy Goldman", "last-name" : "Goldman" }, { "label" : "Henzinger, Monika", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Henzinger%2C+Monika", "original-name" : "Monika Henzinger", "last-name" : "Henzinger" }, { "label" : "DSTC", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:DSTC", "original-name" : "DSTC", "last-name" : "DSTC" }, { "label" : "Rahul, Hariharan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rahul%2C+Hariharan", "original-name" : "Hariharan Rahul", "last-name" : "Rahul" }, { "label" : "Lam, Tak Wah", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lam%2C+Tak+Wah", "original-name" : "Tak Wah Lam", "last-name" : "Lam" }, { "label" : "Bush, Vannevar", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bush%2C+Vannevar", "original-name" : "Vannevar Bush", "last-name" : "Bush" }, { "label" : "Little, Greg", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Little%2C+Greg", "original-name" : "Greg Little", "last-name" : "Little" }, { "label" : "Etzioni, Oren", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Etzioni%2C+Oren", "original-name" : "Oren Etzioni", "last-name" : "Etzioni" }, { "label" : "Kalyanpur, Aditya", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kalyanpur%2C+Aditya", "original-name" : "Aditya Kalyanpur", "last-name" : "Kalyanpur" }, { "label" : "Williamson, David P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Williamson%2C+David+P.", "original-name" : "David P. Williamson", "last-name" : "Williamson" }, { "label" : "Cocke, J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cocke%2C+J.", "original-name" : "J. Cocke", "last-name" : "Cocke" }, { "label" : "Stribling, Jeremy", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Stribling%2C+Jeremy", "original-name" : "Jeremy Stribling", "last-name" : "Stribling" }, { "label" : "Plotkin, Serge A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Plotkin%2C+Serge+A.", "original-name" : "Serge A. Plotkin", "last-name" : "Plotkin" }, { "label" : "Apgar, S. Bacon J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Apgar%2C+S.+Bacon+J.", "original-name" : "S. Bacon J. Apgar", "last-name" : "Apgar" }, { "label" : "Szegedy, Mario", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Szegedy%2C+Mario", "original-name" : "Mario Szegedy", "last-name" : "Szegedy" }, { "label" : "Welty, Chris", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Welty%2C+Chris", "original-name" : "Welty, Chris", "last-name" : "Welty" }, { "label" : "Fizzano, Perry", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Fizzano%2C+Perry", "original-name" : "Perry Fizzano", "last-name" : "Fizzano" }, { "label" : "Bizer, Chris", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bizer%2C+Chris", "original-name" : "Chris Bizer", "last-name" : "Bizer" }, { "label" : "Feige, Uri", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Feige%2C+Uri", "original-name" : "Uri Feige", "last-name" : "Feige" }, { "label" : "Couto}, Douglas S. J. {De", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Couto%7D%2C+Douglas+S.+J.+%7BDe", "original-name" : "Douglas S. J. {De Couto}", "last-name" : "Couto}" }, { "label" : "Berners-Lee, Tim", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Berners-Lee%2C+Tim", "original-name" : "Tim Berners-Lee", "last-name" : "Berners-Lee" }, { "label" : "Project, The Simile", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Project%2C+The+Simile", "original-name" : "The Simile Project", "last-name" : "Project" }, { "label" : "Minkoff, Maria", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Minkoff%2C+Maria", "original-name" : "Maria Minkoff", "last-name" : "Minkoff" }, { "label" : "Mirrokni, Vahab S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mirrokni%2C+Vahab+S.", "original-name" : "Vahab S. Mirrokni", "last-name" : "Mirrokni" }, { "label" : "Pirolli, Peter", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pirolli%2C+Peter", "original-name" : "Peter Pirolli", "last-name" : "Pirolli" }, { "label" : "Asdoorian, Mark", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Asdoorian%2C+Mark", "original-name" : "Mark Asdoorian", "last-name" : "Asdoorian" }, { "label" : "Ono, T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ono%2C+T.", "original-name" : "T. Ono", "last-name" : "Ono" }, { "label" : "Katti, Sachin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Katti%2C+Sachin", "original-name" : "Sachin Katti", "last-name" : "Katti" }, { "label" : "Wilson, Tom", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wilson%2C+Tom", "original-name" : "Tom Wilson", "last-name" : "Wilson" }, { "label" : "Broder, Andrei", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Broder%2C+Andrei", "original-name" : "Andrei Broder", "last-name" : "Broder" }, { "label" : "Hendler, J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hendler%2C+J.", "original-name" : "J. Hendler", "last-name" : "Hendler" }, { "label" : "Shavit, Nir", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shavit%2C+Nir", "original-name" : "Nir Shavit", "last-name" : "Shavit" }, { "label" : "Schrader, Rainer", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Schrader%2C+Rainer", "original-name" : "Rainer Schrader", "last-name" : "Schrader" }, { "label" : "Miller, Eric J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Miller%2C+Eric+J.", "original-name" : "Eric J. Miller", "last-name" : "Miller" }, { "label" : "Pfaltz, John L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pfaltz%2C+John+L.", "original-name" : "John L. Pfaltz", "last-name" : "Pfaltz" }, { "label" : "Arora, Sanjeev", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Arora%2C+Sanjeev", "original-name" : "Sanjeev Arora", "last-name" : "Arora" }, { "label" : "Vazirani, Umesh V.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Vazirani%2C+Umesh+V.", "original-name" : "Umesh V. Vazirani", "last-name" : "Vazirani" }, { "label" : "Oren, Tim", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Oren%2C+Tim", "original-name" : "Tim Oren", "last-name" : "Oren" }, { "label" : "Wellner, Ben", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wellner%2C+Ben", "original-name" : "Ben Wellner", "last-name" : "Wellner" }, { "label" : "Carr, Leslie", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Carr%2C+Leslie", "original-name" : "Leslie Carr", "last-name" : "Carr" }, { "label" : "Walfish, Michael", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Walfish%2C+Michael", "original-name" : "Michael Walfish", "last-name" : "Walfish" }, { "label" : "Telea, Alexandru", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Telea%2C+Alexandru", "original-name" : "Alexandru Telea", "last-name" : "Telea" }, { "label" : "Fulkerson, Delbert R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Fulkerson%2C+Delbert+R.", "original-name" : "Delbert R. Fulkerson", "last-name" : "Fulkerson" }, { "label" : "Sperberg-McQueen, C. M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sperberg-McQueen%2C+C.+M.", "original-name" : "C. M. Sperberg-McQueen", "last-name" : "Sperberg-McQueen" }, { "label" : "Fergerson, R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Fergerson%2C+R.", "original-name" : "Fergerson, R.", "last-name" : "Fergerson" }, { "label" : "Ukkonen, Esko", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ukkonen%2C+Esko", "original-name" : "Esko Ukkonen", "last-name" : "Ukkonen" }, { "label" : "Sch\\\"ar, Sissel Guttormsen", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sch%5C%22ar%2C+Sissel+Guttormsen", "original-name" : "Sissel Guttormsen Sch\\\"ar", "last-name" : "Sch\\\"ar" }, { "label" : "Dieten, W. van", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dieten%2C+W.+van", "original-name" : "W. van Dieten", "last-name" : "Dieten" }, { "label" : "Lassila, Ora", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lassila%2C+Ora", "original-name" : "Ora Lassila", "last-name" : "Lassila" }, { "label" : "Gillman, D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gillman%2C+D.", "original-name" : "D. Gillman", "last-name" : "Gillman" }, { "label" : "Fujishima, Yuzo", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Fujishima%2C+Yuzo", "original-name" : "Yuzo Fujishima", "last-name" : "Fujishima" }, { "label" : "Huynh, David F.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Huynh%2C+David+F.", "original-name" : "David F. Huynh", "last-name" : "Huynh" }, { "label" : "Bergstrom, Mitesh Suchak andPeter", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bergstrom%2C+Mitesh+Suchak+andPeter", "original-name" : "Mitesh Suchak andPeter Bergstrom", "last-name" : "Bergstrom" }, { "label" : "Lin, Dekang", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lin%2C+Dekang", "original-name" : "Dekang Lin", "last-name" : "Lin" }, { "label" : "Thomason, A. G.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Thomason%2C+A.+G.", "original-name" : "A. G. Thomason", "last-name" : "Thomason" }, { "label" : "Boros, R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Boros%2C+R.", "original-name" : "R. Boros", "last-name" : "Boros" }, { "label" : "Hendler, James", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hendler%2C+James", "original-name" : "James Hendler", "last-name" : "Hendler" }, { "label" : "Stein, Clifford", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Stein%2C+Clifford", "original-name" : "Clifford Stein", "last-name" : "Stein" }, { "label" : "Yekhanin, Sergey", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Yekhanin%2C+Sergey", "original-name" : "Sergey Yekhanin", "last-name" : "Yekhanin" }, { "label" : "McCandless, T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:McCandless%2C+T.", "original-name" : "McCandless, T.", "last-name" : "McCandless" }, { "label" : "Gabow, Harold N.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gabow%2C+Harold+N.", "original-name" : "Harold N. Gabow", "last-name" : "Gabow" }, { "label" : "Fiat, Amos", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Fiat%2C+Amos", "original-name" : "Amos Fiat", "last-name" : "Fiat" }, { "label" : "Johnson, David S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Johnson%2C+David+S.", "original-name" : "David S. Johnson", "last-name" : "Johnson" }, { "label" : "Koetter, Ralf", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Koetter%2C+Ralf", "original-name" : "Ralf Koetter", "last-name" : "Koetter" }, { "label" : "Willard, D. E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Willard%2C+D.+E.", "original-name" : "D. E. Willard", "last-name" : "Willard" }, { "label" : "Recski, Andr?s", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Recski%2C+Andr%C3%A1s", "original-name" : "Andr?s Recski", "last-name" : "Recski" }, { "label" : "Webber, Matthew", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Webber%2C+Matthew", "original-name" : "Matthew Webber", "last-name" : "Webber" }, { "label" : "Garey, Michael R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Garey%2C+Michael+R.", "original-name" : "Michael R. Garey", "last-name" : "Garey" }, { "label" : "Menger, K.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Menger%2C+K.", "original-name" : "K. Menger", "last-name" : "Menger" }, { "label" : "Kneser, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kneser%2C+M.", "original-name" : "M. Kneser", "last-name" : "Kneser" }, { "label" : "Veksler, Olga", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Veksler%2C+Olga", "original-name" : "Olga Veksler", "last-name" : "Veksler" }, { "label" : "Elliott, Ame", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Elliott%2C+Ame", "original-name" : "Ame Elliott", "last-name" : "Elliott" }, { "label" : "Loan, C. F. Van", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Loan%2C+C.+F.+Van", "original-name" : "C. F. Van Loan", "last-name" : "Loan" }, { "label" : "Erd?s, P?l", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Erd%C3%B6s%2C+P%C3%A0l", "original-name" : "P?l Erd?s", "last-name" : "Erd?s" }, { "label" : "Widom, Jennifer", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Widom%2C+Jennifer", "original-name" : "Jennifer Widom", "last-name" : "Widom" }, { "label" : "Aggarwal, Alok", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Aggarwal%2C+Alok", "original-name" : "Alok Aggarwal", "last-name" : "Aggarwal" }, { "label" : "Cameron, K.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cameron%2C+K.", "original-name" : "Cameron, K.", "last-name" : "Cameron" }, { "label" : "Lassila, O.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lassila%2C+O.", "original-name" : "O. Lassila", "last-name" : "Lassila" }, { "label" : "Cutting, Douglas", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cutting%2C+Douglas", "original-name" : "Douglas Cutting", "last-name" : "Cutting" }, { "label" : "Barnes, Greg", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Barnes%2C+Greg", "original-name" : "Greg Barnes", "last-name" : "Barnes" }, { "label" : "Hollaar, Lee", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hollaar%2C+Lee", "original-name" : "Lee Hollaar", "last-name" : "Hollaar" }, { "label" : "Lawrence, Steve", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lawrence%2C+Steve", "original-name" : "Steve Lawrence", "last-name" : "Lawrence" }, { "label" : "Freeman, E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Freeman%2C+E.", "original-name" : "Freeman, E.", "last-name" : "Freeman" }, { "label" : "Hornb\\&\\#230;k, Kasper", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hornb%5C%26%5C%23230%3Bk%2C+Kasper", "original-name" : "Kasper Hornb\\&\\#230;k", "last-name" : "Hornb\\&\\#230;k" }, { "label" : "Torng, Eric", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Torng%2C+Eric", "original-name" : "Eric Torng", "last-name" : "Torng" }, { "label" : "Crescenzi, Valter", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Crescenzi%2C+Valter", "original-name" : "Valter Crescenzi", "last-name" : "Crescenzi" }, { "label" : "Kenyon, Claire", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kenyon%2C+Claire", "original-name" : "Claire Kenyon", "last-name" : "Kenyon" }, { "label" : "McGrenere, Joanna", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:McGrenere%2C+Joanna", "original-name" : "Joanna McGrenere", "last-name" : "McGrenere" }, { "label" : "Carmel, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Carmel%2C+David", "original-name" : "David Carmel", "last-name" : "Carmel" }, { "label" : "Tai, Ray P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tai%2C+Ray+P.", "original-name" : "Ray P. Tai", "last-name" : "Tai" }, { "label" : "Kennedy, K.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kennedy%2C+K.", "original-name" : "K. Kennedy", "last-name" : "Kennedy" }, { "label" : "Szemer?di, Endre", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Szemer%C3%A9di%2C+Endre", "original-name" : "Endre Szemer?di", "last-name" : "Szemer?di" }, { "label" : "Zhang, K.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Zhang%2C+K.", "original-name" : "K. Zhang", "last-name" : "Zhang" }, { "label" : "Lee, Jon", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lee%2C+Jon", "original-name" : "Jon Lee", "last-name" : "Lee" }, { "label" : "Allan, James", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Allan%2C+James", "original-name" : "James Allan", "last-name" : "Allan" }, { "label" : "Koivunen, Marja-Ritta", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Koivunen%2C+Marja-Ritta", "original-name" : "Marja-Ritta Koivunen", "last-name" : "Koivunen" }, { "label" : "HopCroft, J. E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:HopCroft%2C+J.+E.", "original-name" : "J. E. HopCroft", "last-name" : "HopCroft" }, { "label" : "Pietriga, Emmanuel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pietriga%2C+Emmanuel", "original-name" : "Emmanuel Pietriga", "last-name" : "Pietriga" }, { "label" : "Goldberg, A. V.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Goldberg%2C+A.+V.", "original-name" : "A. V. Goldberg", "last-name" : "Goldberg" }, { "label" : "Schmidt, Jeanette", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Schmidt%2C+Jeanette", "original-name" : "Jeanette Schmidt", "last-name" : "Schmidt" }, { "label" : "Smith, W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Smith%2C+W.", "original-name" : "W. Smith", "last-name" : "Smith" }, { "label" : "Coppersmith, Dan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Coppersmith%2C+Dan", "original-name" : "Dan Coppersmith", "last-name" : "Coppersmith" }, { "label" : "Battista, Giuseppe Di", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Battista%2C+Giuseppe+Di", "original-name" : "Giuseppe Di Battista", "last-name" : "Battista" }, { "label" : "DeRose, Steve", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:DeRose%2C+Steve", "original-name" : "Steve DeRose", "last-name" : "DeRose" }, { "label" : "Sorkin, G. B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sorkin%2C+G.+B.", "original-name" : "G. B. Sorkin", "last-name" : "Sorkin" }, { "label" : "Pitkow, James", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pitkow%2C+James", "original-name" : "James Pitkow", "last-name" : "Pitkow" }, { "label" : "Abrams, D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Abrams%2C+D.", "original-name" : "Abrams, D.", "last-name" : "Abrams" }, { "label" : "Lipton, Richard J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lipton%2C+Richard+J.", "original-name" : "Richard J. Lipton", "last-name" : "Lipton" }, { "label" : "Kushmerick, Nicholas", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kushmerick%2C+Nicholas", "original-name" : "Nicholas Kushmerick", "last-name" : "Kushmerick" }, { "label" : "Wolfman, Steven", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wolfman%2C+Steven", "original-name" : "Steven Wolfman", "last-name" : "Wolfman" }, { "label" : "Cheriyan, Joseph", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cheriyan%2C+Joseph", "original-name" : "Joseph Cheriyan", "last-name" : "Cheriyan" }, { "label" : "Stoica, Ion", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Stoica%2C+Ion", "original-name" : "Ion Stoica", "last-name" : "Stoica" }, { "label" : "Korte, Bernhard H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Korte%2C+Bernhard+H.", "original-name" : "Bernhard H. Korte", "last-name" : "Korte" }, { "label" : "Croft, W. Bruce", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Croft%2C+W.+Bruce", "original-name" : "W. Bruce Croft", "last-name" : "Croft" }, { "label" : "Byrd, Donald", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Byrd%2C+Donald", "original-name" : "Donald Byrd", "last-name" : "Byrd" }, { "label" : "Bollob?s, B?la", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bollob%C3%A1s%2C+B%C3%A9la", "original-name" : "B?la Bollob?s", "last-name" : "Bollob?s" }, { "label" : "Horvitz, Eric", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Horvitz%2C+Eric", "original-name" : "Eric Horvitz", "last-name" : "Horvitz" }, { "label" : "Mackay, Wendy E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mackay%2C+Wendy+E.", "original-name" : "Wendy E. Mackay", "last-name" : "Mackay" }, { "label" : "Rocchio, J. J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rocchio%2C+J.+J.", "original-name" : "J. J. Rocchio", "last-name" : "Rocchio" }, { "label" : "Vazirani, Vijay", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Vazirani%2C+Vijay", "original-name" : "Vijay Vazirani", "last-name" : "Vazirani" }, { "label" : "Marx, Maarten", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Marx%2C+Maarten", "original-name" : "Maarten Marx", "last-name" : "Marx" }, { "label" : "Maedche, Alexander", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Maedche%2C+Alexander", "original-name" : "Alexander Maedche", "last-name" : "Maedche" }, { "label" : "Quass, Dallan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Quass%2C+Dallan", "original-name" : "Dallan Quass", "last-name" : "Quass" }, { "label" : "Shankar, Narendar", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shankar%2C+Narendar", "original-name" : "Narendar Shankar", "last-name" : "Shankar" }, { "label" : "Graham, Ronald L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Graham%2C+Ronald+L.", "original-name" : "Ronald L. Graham", "last-name" : "Graham" }, { "label" : "Upfal, Eli", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Upfal%2C+Eli", "original-name" : "Eli Upfal", "last-name" : "Upfal" }, { "label" : "Goemans, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Goemans%2C+M.", "original-name" : "M. Goemans", "last-name" : "Goemans" }, { "label" : "Musen, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Musen%2C+M.", "original-name" : "Musen, M.", "last-name" : "Musen" }, { "label" : "Afrati, Foto", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Afrati%2C+Foto", "original-name" : "Foto Afrati", "last-name" : "Afrati" }, { "label" : "Kolliopoulos, S. G.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kolliopoulos%2C+S.+G.", "original-name" : "S. G. Kolliopoulos", "last-name" : "Kolliopoulos" }, { "label" : "Vigoda, Eric", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Vigoda%2C+Eric", "original-name" : "Eric Vigoda", "last-name" : "Vigoda" }, { "label" : "Halld?rsson, Magnus M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Halld%C3%B3rsson%2C+Magnus+M.", "original-name" : "Magnus M. Halld?rsson", "last-name" : "Halld?rsson" }, { "label" : "Liefield, T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Liefield%2C+T.", "original-name" : "T. Liefield", "last-name" : "Liefield" }, { "label" : "Knoblock, Craig A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Knoblock%2C+Craig+A.", "original-name" : "Craig A. Knoblock", "last-name" : "Knoblock" }, { "label" : "Peleg, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Peleg%2C+David", "original-name" : "David Peleg", "last-name" : "Peleg" }, { "label" : "Corkill, Daniel D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Corkill%2C+Daniel+D.", "original-name" : "Daniel D. Corkill", "last-name" : "Corkill" }, { "label" : "schraefel, mc", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:schraefel%2C+mc", "original-name" : "mc schraefel", "last-name" : "schraefel" }, { "label" : "Chaterjee, S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chaterjee%2C+S.", "original-name" : "S. Chaterjee", "last-name" : "Chaterjee" }, { "label" : "Bickel, P. J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bickel%2C+P.+J.", "original-name" : "Bickel, P. J.", "last-name" : "Bickel" }, { "label" : "Schreiber, R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Schreiber%2C+R.", "original-name" : "R. Schreiber", "last-name" : "Schreiber" }, { "label" : "Hutchinson, Joan P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hutchinson%2C+Joan+P.", "original-name" : "Joan P. Hutchinson", "last-name" : "Hutchinson" }, { "label" : "Baldonado, Michelle Q Wang", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Baldonado%2C+Michelle+Q+Wang", "original-name" : "Michelle Q Wang Baldonado", "last-name" : "Baldonado" }, { "label" : "Watanabe, T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Watanabe%2C+T.", "original-name" : "Watanabe, T.", "last-name" : "Watanabe" }, { "label" : "Egnor, Daniel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Egnor%2C+Daniel", "original-name" : "Daniel Egnor", "last-name" : "Egnor" }, { "label" : "Indyk, Piotr", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Indyk%2C+Piotr", "original-name" : "Piotr Indyk", "last-name" : "Indyk" }, { "label" : "Tan, D. S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tan%2C+D.+S.", "original-name" : "D. S. Tan", "last-name" : "Tan" }, { "label" : "Grimmet, G. R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Grimmet%2C+G.+R.", "original-name" : "G. R. Grimmet", "last-name" : "Grimmet" }, { "label" : "Sleator, Daniel D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sleator%2C+Daniel+D.", "original-name" : "Daniel D. Sleator", "last-name" : "Sleator" }, { "label" : "Raman", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Raman", "original-name" : "Raman", "last-name" : "Raman" }, { "label" : "Schieber, Baruch", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Schieber%2C+Baruch", "original-name" : "Baruch Schieber", "last-name" : "Schieber" }, { "label" : "Markstein, P. W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Markstein%2C+P.+W.", "original-name" : "P. W. Markstein", "last-name" : "Markstein" }, { "label" : "Karger, David R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Karger%2C+David+R.", "original-name" : "David R. Karger", "last-name" : "Karger" }, { "label" : "Lewin, Daniel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lewin%2C+Daniel", "original-name" : "Daniel Lewin", "last-name" : "Lewin" }, { "label" : "Kalyanpur, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kalyanpur%2C+A.", "original-name" : "A. Kalyanpur", "last-name" : "Kalyanpur" }, { "label" : "Iyer, Raj D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Iyer%2C+Raj+D.", "original-name" : "Raj D. Iyer", "last-name" : "Iyer" }, { "label" : "M\\\'edard, Muriel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:M%5C%27edard%2C+Muriel", "original-name" : "Muriel M\\\'edard", "last-name" : "M\\\'edard" }, { "label" : "Beged-Dov, Gabe", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Beged-Dov%2C+Gabe", "original-name" : "Gabe Beged-Dov", "last-name" : "Beged-Dov" }, { "label" : "Yuster, Raphy", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Yuster%2C+Raphy", "original-name" : "Raphy Yuster", "last-name" : "Yuster" }, { "label" : "Harris, C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Harris%2C+C.", "original-name" : "Harris, C.", "last-name" : "Harris" }, { "label" : "Yergeau, Fran?ois", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Yergeau%2C+Fran%EF%BF%BDois", "original-name" : "Fran?ois Yergeau", "last-name" : "Yergeau" }, { "label" : "Halevy, Alon", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Halevy%2C+Alon", "original-name" : "Alon Halevy", "last-name" : "Halevy" }, { "label" : "Riloff, Ellen", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Riloff%2C+Ellen", "original-name" : "Ellen Riloff", "last-name" : "Riloff" }, { "label" : "Dornfest, Rael", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dornfest%2C+Rael", "original-name" : "Rael Dornfest", "last-name" : "Dornfest" }, { "label" : "Minton, Steven", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Minton%2C+Steven", "original-name" : "Steven Minton", "last-name" : "Minton" }, { "label" : "Kumar, S. R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kumar%2C+S.+R.", "original-name" : "S. R. Kumar", "last-name" : "Kumar" }, { "label" : "Levy, Henry", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Levy%2C+Henry", "original-name" : "Henry Levy", "last-name" : "Levy" }, { "label" : "Dixon, Brandon", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dixon%2C+Brandon", "original-name" : "Brandon Dixon", "last-name" : "Dixon" }, { "label" : "Axford, S. J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Axford%2C+S.+J.", "original-name" : "S. J. Axford", "last-name" : "Axford" }, { "label" : "Inc., Adobe Systems", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Inc.%2C+Adobe+Systems", "original-name" : "Adobe Systems Inc.", "last-name" : "Inc." }, { "label" : "Krulwich, Bruce", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Krulwich%2C+Bruce", "original-name" : "Bruce Krulwich", "last-name" : "Krulwich" }, { "label" : "Neumann, J. Von", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Neumann%2C+J.+Von", "original-name" : "J. Von Neumann", "last-name" : "Neumann" }, { "label" : "Gibbons, Phillip B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gibbons%2C+Phillip+B.", "original-name" : "Phillip B. Gibbons", "last-name" : "Gibbons" }, { "label" : "Bellotti, Victoria", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bellotti%2C+Victoria", "original-name" : "Victoria Bellotti", "last-name" : "Bellotti" }, { "label" : "Zabih, Ramin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Zabih%2C+Ramin", "original-name" : "Ramin Zabih", "last-name" : "Zabih" }, { "label" : "Jensen, F.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Jensen%2C+F.", "original-name" : "Jensen, F.", "last-name" : "Jensen" }, { "label" : "Goldschlager, L. M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Goldschlager%2C+L.+M.", "original-name" : "L. M. Goldschlager", "last-name" : "Goldschlager" }, { "label" : "Margalit, Oded", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Margalit%2C+Oded", "original-name" : "Oded Margalit", "last-name" : "Margalit" }, { "label" : "Ahmed, Ebad", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ahmed%2C+Ebad", "original-name" : "Ebad Ahmed", "last-name" : "Ahmed" }, { "label" : "Knoblock, Craig", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Knoblock%2C+Craig", "original-name" : "Craig Knoblock", "last-name" : "Knoblock" }, { "label" : "Stojanovic, Nenad", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Stojanovic%2C+Nenad", "original-name" : "Nenad Stojanovic", "last-name" : "Stojanovic" }, { "label" : "Rauch, Monika H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rauch%2C+Monika+H.", "original-name" : "Monika H. Rauch", "last-name" : "Rauch" }, { "label" : "Hagerup, T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hagerup%2C+T.", "original-name" : "T. Hagerup", "last-name" : "Hagerup" }, { "label" : "Li, Kevin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Li%2C+Kevin", "original-name" : "Kevin Li", "last-name" : "Li" }, { "label" : "Margulis, G. A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Margulis%2C+G.+A.", "original-name" : "G. A. Margulis", "last-name" : "Margulis" }, { "label" : "Watanabe, S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Watanabe%2C+S.", "original-name" : "S. Watanabe", "last-name" : "Watanabe" }, { "label" : "Frankl, P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Frankl%2C+P.", "original-name" : "P. Frankl", "last-name" : "Frankl" }, { "label" : "Eppstein, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Eppstein%2C+David", "original-name" : "David Eppstein", "last-name" : "Eppstein" }, { "label" : "Lerman, Kristina", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lerman%2C+Kristina", "original-name" : "Kristina Lerman", "last-name" : "Lerman" }, { "label" : "Galbraith, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Galbraith%2C+David", "original-name" : "David Galbraith", "last-name" : "Galbraith" }, { "label" : "Bixby, Robert", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bixby%2C+Robert", "original-name" : "Robert Bixby", "last-name" : "Bixby" }, { "label" : "Skutella, Martin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Skutella%2C+Martin", "original-name" : "Martin Skutella", "last-name" : "Skutella" }, { "label" : "Hoffmann, C. M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hoffmann%2C+C.+M.", "original-name" : "C. M. Hoffmann", "last-name" : "Hoffmann" }, { "label" : "Wiener, Janet", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wiener%2C+Janet", "original-name" : "Janet Wiener", "last-name" : "Wiener" }, { "label" : "Engels, Daniel W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Engels%2C+Daniel+W.", "original-name" : "Daniel W. Engels", "last-name" : "Engels" }, { "label" : "Guha, R.V.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Guha%2C+R.V.", "original-name" : "R.V. Guha", "last-name" : "Guha" }, { "label" : "Bartal, Yair", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bartal%2C+Yair", "original-name" : "Yair Bartal", "last-name" : "Bartal" }, { "label" : "Theune, D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Theune%2C+D.", "original-name" : "D. Theune", "last-name" : "Theune" }, { "label" : "Riedl, John", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Riedl%2C+John", "original-name" : "John Riedl", "last-name" : "Riedl" }, { "label" : "Winter, Pawel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Winter%2C+Pawel", "original-name" : "Pawel Winter", "last-name" : "Winter" }, { "label" : "Reis, D. C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Reis%2C+D.+C.", "original-name" : "D. C. Reis", "last-name" : "Reis" }, { "label" : "Mecca, Giansalvatore", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mecca%2C+Giansalvatore", "original-name" : "Giansalvatore Mecca", "last-name" : "Mecca" }, { "label" : "Haas, Laura M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Haas%2C+Laura+M.", "original-name" : "Laura M. Haas", "last-name" : "Haas" }, { "label" : "Koller, Daphne", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Koller%2C+Daphne", "original-name" : "Daphne Koller", "last-name" : "Koller" }, { "label" : "Applegate, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Applegate%2C+David", "original-name" : "David Applegate", "last-name" : "Applegate" }, { "label" : "Seo, Jinwook", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Seo%2C+Jinwook", "original-name" : "Jinwook Seo", "last-name" : "Seo" }, { "label" : "Tarjan, R. E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tarjan%2C+R.+E.", "original-name" : "R. E. Tarjan", "last-name" : "Tarjan" }, { "label" : "Gibbons, Phillip", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gibbons%2C+Phillip", "original-name" : "Phillip Gibbons", "last-name" : "Gibbons" }, { "label" : "Welsh, D. J. A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Welsh%2C+D.+J.+A.", "original-name" : "D. J. A. Welsh", "last-name" : "Welsh" }, { "label" : "de Silva, Vin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:de+Silva%2C+Vin", "original-name" : "de Silva, Vin", "last-name" : "de Silva" }, { "label" : "Jensen, D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Jensen%2C+D.", "original-name" : "Jensen, D.", "last-name" : "Jensen" }, { "label" : "Briggs, P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Briggs%2C+P.", "original-name" : "P. Briggs", "last-name" : "Briggs" }, { "label" : "Goldschmidt, Oliver", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Goldschmidt%2C+Oliver", "original-name" : "Oliver Goldschmidt", "last-name" : "Goldschmidt" }, { "label" : "Landauer, Thomas K.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Landauer%2C+Thomas+K.", "original-name" : "Thomas K. Landauer", "last-name" : "Landauer" }, { "label" : "van Ossenbruggen, Jacco", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:van+Ossenbruggen%2C+Jacco", "original-name" : "van Ossenbruggen, Jacco", "last-name" : "van Ossenbruggen" }, { "label" : "Lagoze, Carl", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lagoze%2C+Carl", "original-name" : "Carl Lagoze", "last-name" : "Lagoze" }, { "label" : "Spencer, T. H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Spencer%2C+T.+H.", "original-name" : "T. H. Spencer", "last-name" : "Spencer" }, { "label" : "Smith, D. A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Smith%2C+D.+A.", "original-name" : "Smith, D. A.", "last-name" : "Smith" }, { "label" : "Kistler, Thomas", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kistler%2C+Thomas", "original-name" : "Thomas Kistler", "last-name" : "Kistler" }, { "label" : "Kumar, Bharat", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kumar%2C+Bharat", "original-name" : "Bharat Kumar", "last-name" : "Kumar" }, { "label" : "Schonberg, E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Schonberg%2C+E.", "original-name" : "E. Schonberg", "last-name" : "Schonberg" }, { "label" : "Itai, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Itai%2C+A.", "original-name" : "A. Itai", "last-name" : "Itai" }, { "label" : "Rayside, D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rayside%2C+D.", "original-name" : "Rayside, D.", "last-name" : "Rayside" }, { "label" : "McCool, R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:McCool%2C+R.", "original-name" : "R. McCool", "last-name" : "McCool" }, { "label" : "Meyers, B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Meyers%2C+B.", "original-name" : "B. Meyers", "last-name" : "Meyers" }, { "label" : "Reif, John H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Reif%2C+John+H.", "original-name" : "John H. Reif", "last-name" : "Reif" }, { "label" : "Brickley, Dan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Brickley%2C+Dan", "original-name" : "Dan Brickley", "last-name" : "Brickley" }, { "label" : "Gusfield, D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gusfield%2C+D.", "original-name" : "D. Gusfield", "last-name" : "Gusfield" }, { "label" : "Chawla, Shuchi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chawla%2C+Shuchi", "original-name" : "Shuchi Chawla", "last-name" : "Chawla" }, { "label" : "Tardos, Eva", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tardos%2C+Eva", "original-name" : "Eva Tardos", "last-name" : "Tardos" }, { "label" : "Chen, I. N.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chen%2C+I.+N.", "original-name" : "I. N. Chen", "last-name" : "Chen" }, { "label" : "Cook, William", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cook%2C+William", "original-name" : "William Cook", "last-name" : "Cook" }, { "label" : "Ungar, Lyle", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ungar%2C+Lyle", "original-name" : "Lyle Ungar", "last-name" : "Ungar" }, { "label" : "Williamson, D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Williamson%2C+D.", "original-name" : "D. Williamson", "last-name" : "Williamson" }, { "label" : "Vazirani, Vijay V.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Vazirani%2C+Vijay+V.", "original-name" : "Vijay V. Vazirani", "last-name" : "Vazirani" }, { "label" : "Hoeffding, W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hoeffding%2C+W.", "original-name" : "W. Hoeffding", "last-name" : "Hoeffding" }, { "label" : "Uhrig", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Uhrig", "original-name" : "Uhrig", "last-name" : "Uhrig" }, { "label" : "Rabinovich, Y.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rabinovich%2C+Y.", "original-name" : "Y. Rabinovich", "last-name" : "Rabinovich" }, { "label" : "Papadimitriou, Christos", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Papadimitriou%2C+Christos", "original-name" : "Christos Papadimitriou", "last-name" : "Papadimitriou" }, { "label" : "Colbourn, Charles J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Colbourn%2C+Charles+J.", "original-name" : "Charles J. Colbourn", "last-name" : "Colbourn" }, { "label" : "Safra, Shmuel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Safra%2C+Shmuel", "original-name" : "Shmuel Safra", "last-name" : "Safra" }, { "label" : "Wagner, Frank", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wagner%2C+Frank", "original-name" : "Frank Wagner", "last-name" : "Wagner" }, { "label" : "Nottingham, Mark", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Nottingham%2C+Mark", "original-name" : "Mark Nottingham", "last-name" : "Nottingham" }, { "label" : "Padberg, Manfred", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Padberg%2C+Manfred", "original-name" : "Manfred Padberg", "last-name" : "Padberg" }, { "label" : "Zuckerman, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Zuckerman%2C+David", "original-name" : "David Zuckerman", "last-name" : "Zuckerman" }, { "label" : "Badics, T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Badics%2C+T.", "original-name" : "T. Badics", "last-name" : "Badics" }, { "label" : "Chidlovskii, Boris", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chidlovskii%2C+Boris", "original-name" : "Boris Chidlovskii", "last-name" : "Chidlovskii" }, { "label" : "Lin, Jimmy", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lin%2C+Jimmy", "original-name" : "Jimmy Lin", "last-name" : "Lin" }, { "label" : "Floyd, Robert W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Floyd%2C+Robert+W.", "original-name" : "Robert W. Floyd", "last-name" : "Floyd" }, { "label" : "Domingos, Pedro", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Domingos%2C+Pedro", "original-name" : "Pedro Domingos", "last-name" : "Domingos" }, { "label" : "Bakshi, Karun", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bakshi%2C+Karun", "original-name" : "Karun Bakshi", "last-name" : "Bakshi" }, { "label" : "Miller, Robert", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Miller%2C+Robert", "original-name" : "Robert Miller", "last-name" : "Miller" }, { "label" : "Duda, Richard O.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Duda%2C+Richard+O.", "original-name" : "Richard O. Duda", "last-name" : "Duda" }, { "label" : "Chong", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chong", "original-name" : "Chong", "last-name" : "Chong" }, { "label" : "Moore, J. M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Moore%2C+J.+M.", "original-name" : "J. M. Moore", "last-name" : "Moore" }, { "label" : "Italiano, Giuseppe F.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Italiano%2C+Giuseppe+F.", "original-name" : "Giuseppe F. Italiano", "last-name" : "Italiano" }, { "label" : "Iacovou, Neophytos", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Iacovou%2C+Neophytos", "original-name" : "Neophytos Iacovou", "last-name" : "Iacovou" }, { "label" : "Lehman, April Rasala", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lehman%2C+April+Rasala", "original-name" : "April Rasala Lehman", "last-name" : "Lehman" }, { "label" : "Soderland, Stephen", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Soderland%2C+Stephen", "original-name" : "Stephen Soderland", "last-name" : "Soderland" }, { "label" : "Liu, Hugo", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Liu%2C+Hugo", "original-name" : "Hugo Liu", "last-name" : "Liu" }, { "label" : "Kleinberg, Jon", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kleinberg%2C+Jon", "original-name" : "Jon Kleinberg", "last-name" : "Kleinberg" }, { "label" : "Werner, P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Werner%2C+P.", "original-name" : "P. Werner", "last-name" : "Werner" }, { "label" : "Doksum, K. A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Doksum%2C+K.+A.", "original-name" : "Doksum, K. A.", "last-name" : "Doksum" }, { "label" : "Brussee, R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Brussee%2C+R.", "original-name" : "R. Brussee", "last-name" : "Brussee" }, { "label" : "Batini, Carlo", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Batini%2C+Carlo", "original-name" : "Carlo Batini", "last-name" : "Batini" }, { "label" : "Eisenzopf, Jonathan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Eisenzopf%2C+Jonathan", "original-name" : "Jonathan Eisenzopf", "last-name" : "Eisenzopf" }, { "label" : "Hagerup, Torben", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hagerup%2C+Torben", "original-name" : "Torben Hagerup", "last-name" : "Hagerup" }, { "label" : "Witten, Ian H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Witten%2C+Ian+H.", "original-name" : "Ian H. Witten", "last-name" : "Witten" }, { "label" : "Gomez, Louis M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gomez%2C+Louis+M.", "original-name" : "Louis M. Gomez", "last-name" : "Gomez" }, { "label" : "Dantzig, George B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dantzig%2C+George+B.", "original-name" : "George B. Dantzig", "last-name" : "Dantzig" }, { "label" : "Somberg, Benjamin L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Somberg%2C+Benjamin+L.", "original-name" : "Benjamin L. Somberg", "last-name" : "Somberg" }, { "label" : "Eswaran, K. P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Eswaran%2C+K.+P.", "original-name" : "K. P. Eswaran", "last-name" : "Eswaran" }, { "label" : "Consortium, The World Wide Web", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Consortium%2C+The+World+Wide+Web", "original-name" : "The World Wide Web Consortium", "last-name" : "Consortium" }, { "label" : "Harvey, Nicholas J. A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Harvey%2C+Nicholas+J.+A.", "original-name" : "Nicholas J. A. Harvey", "last-name" : "Harvey" }, { "label" : "Kaelbling, Leslie Pack", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kaelbling%2C+Leslie+Pack", "original-name" : "Leslie Pack Kaelbling", "last-name" : "Kaelbling" }, { "label" : "Gazit, H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gazit%2C+H.", "original-name" : "H. Gazit", "last-name" : "Gazit" }, { "label" : "Sengupta, S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sengupta%2C+S.", "original-name" : "S. Sengupta", "last-name" : "Sengupta" }, { "label" : "Raghavachari, Balaji", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Raghavachari%2C+Balaji", "original-name" : "Balaji Raghavachari", "last-name" : "Raghavachari" }, { "label" : "Shiloach, Y.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shiloach%2C+Y.", "original-name" : "Y. Shiloach", "last-name" : "Shiloach" }, { "label" : "Tarjan, Robert E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tarjan%2C+Robert+E.", "original-name" : "Robert E. Tarjan", "last-name" : "Tarjan" }, { "label" : "Bernstein, Michael S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bernstein%2C+Michael+S.", "original-name" : "Michael S. Bernstein", "last-name" : "Bernstein" }, { "label" : "Miller, Robert C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Miller%2C+Robert+C.", "original-name" : "Robert C. Miller", "last-name" : "Miller" }, { "label" : "Ratnakar, Niranjan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ratnakar%2C+Niranjan", "original-name" : "Niranjan Ratnakar", "last-name" : "Ratnakar" }, { "label" : "Siegel, Alan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Siegel%2C+Alan", "original-name" : "Alan Siegel", "last-name" : "Siegel" }, { "label" : "Shen, Yuan Kui", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shen%2C+Yuan+Kui", "original-name" : "Yuan Kui Shen", "last-name" : "Shen" }, { "label" : "Sure, York", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sure%2C+York", "original-name" : "York Sure", "last-name" : "Sure" }, { "label" : "Papadimitriou, Christos H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Papadimitriou%2C+Christos+H.", "original-name" : "Christos H. Papadimitriou", "last-name" : "Papadimitriou" }, { "label" : "Edwards, Keith", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Edwards%2C+Keith", "original-name" : "Keith Edwards", "last-name" : "Edwards" }, { "label" : "Chandra, A. K.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chandra%2C+A.+K.", "original-name" : "A. K. Chandra", "last-name" : "Chandra" }, { "label" : "Chaudhuri, S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Chaudhuri%2C+S.", "original-name" : "S. Chaudhuri", "last-name" : "Chaudhuri" }, { "label" : "Czerwinski, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Czerwinski%2C+M.", "original-name" : "Czerwinski, M.", "last-name" : "Czerwinski" }, { "label" : "Colbourn, Charles", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Colbourn%2C+Charles", "original-name" : "Charles Colbourn", "last-name" : "Colbourn" }, { "label" : "Sugiura, Atsushi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sugiura%2C+Atsushi", "original-name" : "Atsushi Sugiura", "last-name" : "Sugiura" }, { "label" : "Phillips, Steven", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Phillips%2C+Steven", "original-name" : "Steven Phillips", "last-name" : "Phillips" }, { "label" : "Lafferty, John", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lafferty%2C+John", "original-name" : "John Lafferty", "last-name" : "Lafferty" }, { "label" : "Tai, Kuo--Chung", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tai%2C+Kuo--Chung", "original-name" : "Kuo--Chung Tai", "last-name" : "Tai" }, { "label" : "Gilman, T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gilman%2C+T.", "original-name" : "T. Gilman", "last-name" : "Gilman" }, { "label" : "Pittel, Boris", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pittel%2C+Boris", "original-name" : "Boris Pittel", "last-name" : "Pittel" }, { "label" : "Bazzo, Louay M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bazzo%2C+Louay+M.", "original-name" : "Louay M. Bazzo", "last-name" : "Bazzo" }, { "label" : "Cormen, Thomas H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cormen%2C+Thomas+H.", "original-name" : "Thomas H. Cormen", "last-name" : "Cormen" }, { "label" : "Robertson, G. G.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Robertson%2C+G.+G.", "original-name" : "Robertson, G. G.", "last-name" : "Robertson" }, { "label" : "Shih, Kai", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shih%2C+Kai", "original-name" : "Kai Shih", "last-name" : "Shih" }, { "label" : "Mass, Yosi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mass%2C+Yosi", "original-name" : "Yosi Mass", "last-name" : "Mass" }, { "label" : "Eriksson, H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Eriksson%2C+H.", "original-name" : "Eriksson, H.", "last-name" : "Eriksson" }, { "label" : "Nilsson, Martin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Nilsson%2C+Martin", "original-name" : "Martin Nilsson", "last-name" : "Nilsson" }, { "label" : "Dyer, M. E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dyer%2C+M.+E.", "original-name" : "M. E. Dyer", "last-name" : "Dyer" }, { "label" : "Kennedy, Robert", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kennedy%2C+Robert", "original-name" : "Robert Kennedy", "last-name" : "Kennedy" }, { "label" : "Ghahramani, Zoubin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ghahramani%2C+Zoubin", "original-name" : "Zoubin Ghahramani", "last-name" : "Ghahramani" }, { "label" : "Spirakis, P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Spirakis%2C+P.", "original-name" : "P. Spirakis", "last-name" : "Spirakis" }, { "label" : "Cohn, David A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cohn%2C+David+A.", "original-name" : "David A. Cohn", "last-name" : "Cohn" }, { "label" : "Salomon, Gitta", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Salomon%2C+Gitta", "original-name" : "Gitta Salomon", "last-name" : "Salomon" }, { "label" : "Dubiner, Moshe", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dubiner%2C+Moshe", "original-name" : "Moshe Dubiner", "last-name" : "Dubiner" }, { "label" : "Costabile, Maria Francesca", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Costabile%2C+Maria+Francesca", "original-name" : "Maria Francesca Costabile", "last-name" : "Costabile" }, { "label" : "Newcombe, H.B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Newcombe%2C+H.B.", "original-name" : "H.B. Newcombe", "last-name" : "Newcombe" }, { "label" : "Berg, Mark de", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Berg%2C+Mark+de", "original-name" : "Mark de Berg", "last-name" : "Berg" }, { "label" : "Leong, B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Leong%2C+B.", "original-name" : "B. Leong", "last-name" : "Leong" }, { "label" : "Flynn, L. E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Flynn%2C+L.+E.", "original-name" : "L. E. Flynn", "last-name" : "Flynn" }, { "label" : "Findlater, Leah", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Findlater%2C+Leah", "original-name" : "Leah Findlater", "last-name" : "Findlater" }, { "label" : "Silva, A. S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Silva%2C+A.+S.", "original-name" : "A. S. Silva", "last-name" : "Silva" }, { "label" : "Bernstein, Michael", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bernstein%2C+Michael", "original-name" : "Michael Bernstein", "last-name" : "Bernstein" }, { "label" : "Woods, William A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Woods%2C+William+A.", "original-name" : "William A. Woods", "last-name" : "Woods" }, { "label" : "Israeli, Amos", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Israeli%2C+Amos", "original-name" : "Amos Israeli", "last-name" : "Israeli" }, { "label" : "Powell, Allison L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Powell%2C+Allison+L.", "original-name" : "Allison L. Powell", "last-name" : "Powell" }, { "label" : "Golub, Gene H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Golub%2C+Gene+H.", "original-name" : "Gene H. Golub", "last-name" : "Golub" }, { "label" : "Horrocks, Ian", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Horrocks%2C+Ian", "original-name" : "Ian Horrocks", "last-name" : "Horrocks" }, { "label" : "Howard, Mark", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Howard%2C+Mark", "original-name" : "Mark Howard", "last-name" : "Howard" }, { "label" : "Shasha, Dennis", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shasha%2C+Dennis", "original-name" : "Dennis Shasha", "last-name" : "Shasha" }, { "label" : "Aiello, W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Aiello%2C+W.", "original-name" : "W. Aiello", "last-name" : "Aiello" }, { "label" : "Harmelen, Frank van", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Harmelen%2C+Frank+van", "original-name" : "Frank van Harmelen", "last-name" : "Harmelen" }, { "label" : "Cook, Stephen", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cook%2C+Stephen", "original-name" : "Stephen Cook", "last-name" : "Cook" }, { "label" : "Ramachandran, Vijaya", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ramachandran%2C+Vijaya", "original-name" : "Vijaya Ramachandran", "last-name" : "Ramachandran" }, { "label" : "Dinitz, Efim A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dinitz%2C+Efim+A.", "original-name" : "Efim A. Dinitz", "last-name" : "Dinitz" }, { "label" : "Aleliunas, R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Aleliunas%2C+R.", "original-name" : "R. Aleliunas", "last-name" : "Aleliunas" }, { "label" : "Lawler, Eugene L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lawler%2C+Eugene+L.", "original-name" : "Eugene L. Lawler", "last-name" : "Lawler" }, { "label" : "Bernstein, Aaron", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bernstein%2C+Aaron", "original-name" : "Aaron Bernstein", "last-name" : "Bernstein" }, { "label" : "Kreveld, Mark van", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kreveld%2C+Mark+van", "original-name" : "Mark van Kreveld", "last-name" : "Kreveld" }, { "label" : "Stoer, Mechthild", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Stoer%2C+Mechthild", "original-name" : "Mechthild Stoer", "last-name" : "Stoer" }, { "label" : "Kim, Brian", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kim%2C+Brian", "original-name" : "Brian Kim", "last-name" : "Kim" }, { "label" : "Smith, Michael D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Smith%2C+Michael+D.", "original-name" : "Michael D. Smith", "last-name" : "Smith" }, { "label" : "Herlihy, Maurice", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Herlihy%2C+Maurice", "original-name" : "Maurice Herlihy", "last-name" : "Herlihy" }, { "label" : "Reischuk, Rudiger", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Reischuk%2C+Rudiger", "original-name" : "Rudiger Reischuk", "last-name" : "Reischuk" }, { "label" : "Mader, W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mader%2C+W.", "original-name" : "W. Mader", "last-name" : "Mader" }, { "label" : "Karmarkar, N.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Karmarkar%2C+N.", "original-name" : "N. Karmarkar", "last-name" : "Karmarkar" }, { "label" : "Authority}, {Internet Assigned Numbers", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Authority%7D%2C+%7BInternet+Assigned+Numbers", "original-name" : "{Internet Assigned Numbers Authority}", "last-name" : "Authority}" }, { "label" : "Meyers, Brad A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Meyers%2C+Brad+A.", "original-name" : "Brad A. Meyers", "last-name" : "Meyers" }, { "label" : "Alizadeh, Farid", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Alizadeh%2C+Farid", "original-name" : "Farid Alizadeh", "last-name" : "Alizadeh" }, { "label" : "Agrawal, Ajit", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Agrawal%2C+Ajit", "original-name" : "Ajit Agrawal", "last-name" : "Agrawal" }, { "label" : "Councill, Isaac G.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Councill%2C+Isaac+G.", "original-name" : "Isaac G. Councill", "last-name" : "Councill" }, { "label" : "Valiant, Leslie", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Valiant%2C+Leslie", "original-name" : "Leslie Valiant", "last-name" : "Valiant" }, { "label" : "Harvey, Nick", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Harvey%2C+Nick", "original-name" : "Nick Harvey", "last-name" : "Harvey" }, { "label" : "Young, Neal", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Young%2C+Neal", "original-name" : "Neal Young", "last-name" : "Young" }, { "label" : "Giugno, Rosalba", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Giugno%2C+Rosalba", "original-name" : "Rosalba Giugno", "last-name" : "Giugno" }, { "label" : "Bates, Marcia J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bates%2C+Marcia+J.", "original-name" : "Marcia J. Bates", "last-name" : "Bates" }, { "label" : "Murota, Kazuo", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Murota%2C+Kazuo", "original-name" : "Kazuo Murota", "last-name" : "Murota" }, { "label" : "Swartz, Aaron", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Swartz%2C+Aaron", "original-name" : "Aaron Swartz", "last-name" : "Swartz" }, { "label" : "Kosaraju, S. R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kosaraju%2C+S.+R.", "original-name" : "S. R. Kosaraju", "last-name" : "Kosaraju" }, { "label" : "Jul, Susanne", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Jul%2C+Susanne", "original-name" : "Susanne Jul", "last-name" : "Jul" }, { "label" : "Hennessy, John L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hennessy%2C+John+L.", "original-name" : "John L. Hennessy", "last-name" : "Hennessy" }, { "label" : "Smith, Ian", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Smith%2C+Ian", "original-name" : "Ian Smith", "last-name" : "Smith" }, { "label" : "Hearst, Marti A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hearst%2C+Marti+A.", "original-name" : "Marti A. Hearst", "last-name" : "Hearst" }, { "label" : "Jakatra Project, The Apache Software Foundation", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Jakatra+Project%2C+The+Apache+Software+Foundation", "original-name" : "Jakatra Project, The Apache Software Foundation", "last-name" : "Jakatra Project" }, { "label" : "Organization, The Mozilla", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Organization%2C+The+Mozilla", "original-name" : "The Mozilla Organization", "last-name" : "Organization" }, { "label" : "Litoiu, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Litoiu%2C+M.", "original-name" : "Litoiu, M.", "last-name" : "Litoiu" }, { "label" : "Kaashoek, M. Frans", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kaashoek%2C+M.+Frans", "original-name" : "M. Frans Kaashoek", "last-name" : "Kaashoek" }, { "label" : "Graham, R. L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Graham%2C+R.+L.", "original-name" : "R. L. Graham", "last-name" : "Graham" }, { "label" : "Resnick, Paul", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Resnick%2C+Paul", "original-name" : "Paul Resnick", "last-name" : "Resnick" }, { "label" : "Wong, Harry K. T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wong%2C+Harry+K.+T.", "original-name" : "Harry K. T. Wong", "last-name" : "Wong" }, { "label" : "Ackerman, Mark S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ackerman%2C+Mark+S.", "original-name" : "Mark S. Ackerman", "last-name" : "Ackerman" }, { "label" : "Marchionini, Gary", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Marchionini%2C+Gary", "original-name" : "Gary Marchionini", "last-name" : "Marchionini" }, { "label" : "Merialdo, Paolo", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Merialdo%2C+Paolo", "original-name" : "Paolo Merialdo", "last-name" : "Merialdo" }, { "label" : "Fujima, Jun", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Fujima%2C+Jun", "original-name" : "Jun Fujima", "last-name" : "Fujima" }, { "label" : "Ray, S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ray%2C+S.", "original-name" : "S. Ray", "last-name" : "Ray" }, { "label" : "Feder, Tomas", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Feder%2C+Tomas", "original-name" : "Tomas Feder", "last-name" : "Feder" }, { "label" : "Plaisant, Catherine", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Plaisant%2C+Catherine", "original-name" : "Catherine Plaisant", "last-name" : "Plaisant" }, { "label" : "Babai, L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Babai%2C+L.", "original-name" : "L. Babai", "last-name" : "Babai" }, { "label" : "Wein, Joel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wein%2C+Joel", "original-name" : "Joel Wein", "last-name" : "Wein" }, { "label" : "Dyer, Martin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dyer%2C+Martin", "original-name" : "Martin Dyer", "last-name" : "Dyer" }, { "label" : "Guy, Marieke", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Guy%2C+Marieke", "original-name" : "Marieke Guy", "last-name" : "Guy" }, { "label" : "Mulmuley, Ketan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mulmuley%2C+Ketan", "original-name" : "Ketan Mulmuley", "last-name" : "Mulmuley" }, { "label" : "London, E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:London%2C+E.", "original-name" : "E. London", "last-name" : "London" }, { "label" : "Shih, Lawrence", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shih%2C+Lawrence", "original-name" : "Lawrence Shih", "last-name" : "Shih" }, { "label" : "Panigrahy, Rina", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Panigrahy%2C+Rina", "original-name" : "Rina Panigrahy", "last-name" : "Panigrahy" }, { "label" : "Nikolova, Evdokia", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Nikolova%2C+Evdokia", "original-name" : "Evdokia Nikolova", "last-name" : "Nikolova" }, { "label" : "O\'Donnell, M. J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:O%27Donnell%2C+M.+J.", "original-name" : "M. J. O\'Donnell", "last-name" : "O\'Donnell" }, { "label" : "Magnanti, Thomas L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Magnanti%2C+Thomas+L.", "original-name" : "Thomas L. Magnanti", "last-name" : "Magnanti" }, { "label" : "Karloff, Howard", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Karloff%2C+Howard", "original-name" : "Howard Karloff", "last-name" : "Karloff" }, { "label" : "Naor, Moni", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Naor%2C+Moni", "original-name" : "Moni Naor", "last-name" : "Naor" }, { "label" : "Stein, Lynn Andrea", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Stein%2C+Lynn+Andrea", "original-name" : "Lynn Andrea Stein", "last-name" : "Stein" }, { "label" : "Plotkin, Serge", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Plotkin%2C+Serge", "original-name" : "Serge Plotkin", "last-name" : "Plotkin" }, { "label" : "Vetta, Adrian", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Vetta%2C+Adrian", "original-name" : "Adrian Vetta", "last-name" : "Vetta" }, { "label" : "Bosc, P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bosc%2C+P.", "original-name" : "P. Bosc", "last-name" : "Bosc" }, { "label" : "Ravasio, Pamela", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ravasio%2C+Pamela", "original-name" : "Pamela Ravasio", "last-name" : "Ravasio" }, { "label" : "Kuo, Ivy", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kuo%2C+Ivy", "original-name" : "Ivy Kuo", "last-name" : "Kuo" }, { "label" : "Neville, J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Neville%2C+J.", "original-name" : "Neville, J.", "last-name" : "Neville" }, { "label" : "Hoppe, Bruce", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hoppe%2C+Bruce", "original-name" : "Bruce Hoppe", "last-name" : "Hoppe" }, { "label" : "Boas, Peter van Emde", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Boas%2C+Peter+van+Emde", "original-name" : "Peter van Emde Boas", "last-name" : "Boas" }, { "label" : "Levine, Matthew", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Levine%2C+Matthew", "original-name" : "Matthew Levine", "last-name" : "Levine" }, { "label" : "Miller, Scott", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Miller%2C+Scott", "original-name" : "Scott Miller", "last-name" : "Miller" }, { "label" : "Koller, D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Koller%2C+D.", "original-name" : "D. Koller", "last-name" : "Koller" }, { "label" : "Nii, H. Penny", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Nii%2C+H.+Penny", "original-name" : "H. Penny Nii", "last-name" : "Nii" }, { "label" : "Rodl, V.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rodl%2C+V.", "original-name" : "V. Rodl", "last-name" : "Rodl" }, { "label" : "V?lez, Bienvenido", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:V%EF%BF%BDlez%2C+Bienvenido", "original-name" : "Bienvenido V?lez", "last-name" : "V?lez" }, { "label" : "Gelernter, D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gelernter%2C+D.", "original-name" : "Gelernter, D.", "last-name" : "Gelernter" }, { "label" : "Kerr, L. R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kerr%2C+L.+R.", "original-name" : "L. R. Kerr", "last-name" : "Kerr" }, { "label" : "Hirschberg, D S", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hirschberg%2C+D+S", "original-name" : "D S Hirschberg", "last-name" : "Hirschberg" }, { "label" : "Dor, Dorit", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dor%2C+Dorit", "original-name" : "Dorit Dor", "last-name" : "Dor" }, { "label" : "Koml?s, J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Koml%C3%B3s%2C+J.", "original-name" : "J. Koml?s", "last-name" : "Koml?s" }, { "label" : "Sinclair, Alistair", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sinclair%2C+Alistair", "original-name" : "Alistair Sinclair", "last-name" : "Sinclair" }, { "label" : "Sipser, Michael", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sipser%2C+Michael", "original-name" : "Michael Sipser", "last-name" : "Sipser" }, { "label" : "Lim, B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lim%2C+B.", "original-name" : "B. Lim", "last-name" : "Lim" }, { "label" : "Freeman, Eric T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Freeman%2C+Eric+T.", "original-name" : "Eric T. Freeman", "last-name" : "Freeman" }, { "label" : "Boykov, Yuri", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Boykov%2C+Yuri", "original-name" : "Yuri Boykov", "last-name" : "Boykov" }, { "label" : "Winograd, Shmuel", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Winograd%2C+Shmuel", "original-name" : "Shmuel Winograd", "last-name" : "Winograd" }, { "label" : "McDowell, Luke", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:McDowell%2C+Luke", "original-name" : "Luke McDowell", "last-name" : "McDowell" }, { "label" : "Sudan, Madhu", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sudan%2C+Madhu", "original-name" : "Madhu Sudan", "last-name" : "Sudan" }, { "label" : "Lieberman, Henry", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lieberman%2C+Henry", "original-name" : "Henry Lieberman", "last-name" : "Lieberman" }, { "label" : "Hellerstein, Joe", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hellerstein%2C+Joe", "original-name" : "Joe Hellerstein", "last-name" : "Hellerstein" }, { "label" : "Vlasseva, Stani", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Vlasseva%2C+Stani", "original-name" : "Stani Vlasseva", "last-name" : "Vlasseva" }, { "label" : "Engineering, User Interface", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Engineering%2C+User+Interface", "original-name" : "User Interface Engineering", "last-name" : "Engineering" }, { "label" : "Cohen, William W.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Cohen%2C+William+W.", "original-name" : "William W. Cohen", "last-name" : "Cohen" }, { "label" : "Dingli, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dingli%2C+A.", "original-name" : "A. Dingli", "last-name" : "Dingli" }, { "label" : "English, Jennifer", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:English%2C+Jennifer", "original-name" : "Jennifer English", "last-name" : "English" }, { "label" : "Koutsoupias, E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Koutsoupias%2C+E.", "original-name" : "E. Koutsoupias", "last-name" : "Koutsoupias" }, { "label" : "Jordan, Michael I.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Jordan%2C+Michael+I.", "original-name" : "Michael I. Jordan", "last-name" : "Jordan" }, { "label" : "Berners--Lee, T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Berners--Lee%2C+T.", "original-name" : "T. Berners--Lee", "last-name" : "Berners--Lee" }, { "label" : "Feller, William", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Feller%2C+William", "original-name" : "William Feller", "last-name" : "Feller" }, { "label" : "Frieze, Allan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Frieze%2C+Allan", "original-name" : "Allan Frieze", "last-name" : "Frieze" }, { "label" : "Huynh, David", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Huynh%2C+David", "original-name" : "David Huynh", "last-name" : "Huynh" }, { "label" : "Owens, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Owens%2C+A.", "original-name" : "Owens, A.", "last-name" : "Owens" }, { "label" : "others", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:others", "original-name" : "others", "last-name" : "others" }, { "label" : "Polesskii, V. P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Polesskii%2C+V.+P.", "original-name" : "V. P. Polesskii", "last-name" : "Polesskii" }, { "label" : "Sigurbj?rnsson, B?rkur", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sigurbj%C3%B6rnsson%2C+B%C3%B6rkur", "original-name" : "B?rkur Sigurbj?rnsson", "last-name" : "Sigurbj?rnsson" }, { "label" : "R?nyi, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:R%C3%A9nyi%2C+A.", "original-name" : "A. R?nyi", "last-name" : "R?nyi" }, { "label" : "Prim, R. C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Prim%2C+R.+C.", "original-name" : "R. C. Prim", "last-name" : "Prim" }, { "label" : "Westermann, Herbert H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Westermann%2C+Herbert+H.", "original-name" : "Herbert H. Westermann", "last-name" : "Westermann" }, { "label" : "Lunzer, Aran", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lunzer%2C+Aran", "original-name" : "Aran Lunzer", "last-name" : "Lunzer" }, { "label" : "Salisbury, Michael", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Salisbury%2C+Michael", "original-name" : "Michael Salisbury", "last-name" : "Salisbury" }, { "label" : "Levialdi, Stefano", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Levialdi%2C+Stefano", "original-name" : "Stefano Levialdi", "last-name" : "Levialdi" }, { "label" : "Kang, H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kang%2C+H.", "original-name" : "Kang, H.", "last-name" : "Kang" }, { "label" : "Russel, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Russel%2C+A.", "original-name" : "Russel, A.", "last-name" : "Russel" }, { "label" : "Rao, Satish", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rao%2C+Satish", "original-name" : "Satish Rao", "last-name" : "Rao" }, { "label" : "Lengauer, T.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Lengauer%2C+T.", "original-name" : "T. Lengauer", "last-name" : "Lengauer" }, { "label" : "Effros, Michelle", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Effros%2C+Michelle", "original-name" : "Michelle Effros", "last-name" : "Effros" }, { "label" : "Smith, Michael K.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Smith%2C+Michael+K.", "original-name" : "Smith, Michael K.", "last-name" : "Smith" }, { "label" : "Phillips, Steven J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Phillips%2C+Steven+J.", "original-name" : "Steven J. Phillips", "last-name" : "Phillips" }, { "label" : "Vlist, Eric van der", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Vlist%2C+Eric+van+der", "original-name" : "Eric van der Vlist", "last-name" : "Vlist" }, { "label" : "Torczon, L.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Torczon%2C+L.", "original-name" : "L. Torczon", "last-name" : "Torczon" }, { "label" : "King, Valerie", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:King%2C+Valerie", "original-name" : "Valerie King", "last-name" : "King" }, { "label" : "Hearst, Marti", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hearst%2C+Marti", "original-name" : "Marti Hearst", "last-name" : "Hearst" }, { "label" : "Knuth, Donald E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Knuth%2C+Donald+E.", "original-name" : "Donald E. Knuth", "last-name" : "Knuth" }, { "label" : "Ojakaar, Erik", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ojakaar%2C+Erik", "original-name" : "Erik Ojakaar", "last-name" : "Ojakaar" }, { "label" : "Rutledge, Lloyd", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rutledge%2C+Lloyd", "original-name" : "Lloyd Rutledge", "last-name" : "Rutledge" }, { "label" : "Tardos, E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tardos%2C+E.", "original-name" : "E. Tardos", "last-name" : "Tardos" }, { "label" : "Gr?tschel, Martin", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gr%C3%B6tschel%2C+Martin", "original-name" : "Martin Gr?tschel", "last-name" : "Gr?tschel" }, { "label" : "Davis, Ian", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Davis%2C+Ian", "original-name" : "Ian Davis", "last-name" : "Davis" }, { "label" : "Tamassia, Roberto", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Tamassia%2C+Roberto", "original-name" : "Roberto Tamassia", "last-name" : "Tamassia" }, { "label" : "Berkman, Omer", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Berkman%2C+Omer", "original-name" : "Omer Berkman", "last-name" : "Berkman" }, { "label" : "Spencer, Joel H.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Spencer%2C+Joel+H.", "original-name" : "Joel H. Spencer", "last-name" : "Spencer" }, { "label" : "Goldwasser, Shafi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Goldwasser%2C+Shafi", "original-name" : "Shafi Goldwasser", "last-name" : "Goldwasser" }, { "label" : "Bampis, Evripidis", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bampis%2C+Evripidis", "original-name" : "Evripidis Bampis", "last-name" : "Bampis" }, { "label" : "McCallum, Andrew K.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:McCallum%2C+Andrew+K.", "original-name" : "Andrew K. McCallum", "last-name" : "McCallum" }, { "label" : "Quan, Dennis", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Quan%2C+Dennis", "original-name" : "Dennis Quan", "last-name" : "Quan" }, { "label" : "Mahajan, Sanjeev", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mahajan%2C+Sanjeev", "original-name" : "Sanjeev Mahajan", "last-name" : "Mahajan" }, { "label" : "Aragon, C. R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Aragon%2C+C.+R.", "original-name" : "C. R. Aragon", "last-name" : "Aragon" }, { "label" : "Polesski, V. P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Polesski%2C+V.+P.", "original-name" : "V. P. Polesski", "last-name" : "Polesski" }, { "label" : "Miller, Eric", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Miller%2C+Eric", "original-name" : "Eric Miller", "last-name" : "Miller" }, { "label" : "Magen, Edith", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Magen%2C+Edith", "original-name" : "Edith Magen", "last-name" : "Magen" }, { "label" : "Shannon, C. E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shannon%2C+C.+E.", "original-name" : "C. E. Shannon", "last-name" : "Shannon" }, { "label" : "Feige, U.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Feige%2C+U.", "original-name" : "U. Feige", "last-name" : "Feige" }, { "label" : "Wood, D. C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Wood%2C+D.+C.", "original-name" : "D. C. Wood", "last-name" : "Wood" }, { "label" : "Parnas, Michal", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Parnas%2C+Michal", "original-name" : "Michal Parnas", "last-name" : "Parnas" }, { "label" : "Harter, Stephen P.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Harter%2C+Stephen+P.", "original-name" : "Stephen P. Harter", "last-name" : "Harter" }, { "label" : "Balabanovic, Marko", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Balabanovic%2C+Marko", "original-name" : "Marko Balabanovic", "last-name" : "Balabanovic" }, { "label" : "Devlin, Susan J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Devlin%2C+Susan+J.", "original-name" : "Susan J. Devlin", "last-name" : "Devlin" }, { "label" : "Kumar, Ravi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Kumar%2C+Ravi", "original-name" : "Ravi Kumar", "last-name" : "Kumar" }, { "label" : "Sunter, A. B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sunter%2C+A.+B.", "original-name" : "Sunter, A. B.", "last-name" : "Sunter" }, { "label" : "Carey, Michael J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Carey%2C+Michael+J.", "original-name" : "Michael J. Carey", "last-name" : "Carey" }, { "label" : "Buneman, Peter", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Buneman%2C+Peter", "original-name" : "Peter Buneman", "last-name" : "Buneman" }, { "label" : "Stein, Cliff", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Stein%2C+Cliff", "original-name" : "Cliff Stein", "last-name" : "Stein" }, { "label" : "Gomory, Ralph E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Gomory%2C+Ralph+E.", "original-name" : "Ralph E. Gomory", "last-name" : "Gomory" }, { "label" : "Berge, C.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Berge%2C+C.", "original-name" : "C. Berge", "last-name" : "Berge" }, { "label" : "Shi, J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shi%2C+J.", "original-name" : "J. Shi", "last-name" : "Shi" }, { "label" : "Doorenbos, Robert B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Doorenbos%2C+Robert+B.", "original-name" : "Robert B. Doorenbos", "last-name" : "Doorenbos" }, { "label" : "Alberink, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Alberink%2C+M.", "original-name" : "M. Alberink", "last-name" : "Alberink" }, { "label" : "Schapire, Robert E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Schapire%2C+Robert+E.", "original-name" : "Robert E. Schapire", "last-name" : "Schapire" }, { "label" : "Bruns, Tom", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bruns%2C+Tom", "original-name" : "Tom Bruns", "last-name" : "Bruns" }, { "label" : "Thompson, C. D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Thompson%2C+C.+D.", "original-name" : "C. D. Thompson", "last-name" : "Thompson" }, { "label" : "Galil, Zvi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Galil%2C+Zvi", "original-name" : "Zvi Galil", "last-name" : "Galil" }, { "label" : "Indyk", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Indyk", "original-name" : "Indyk", "last-name" : "Indyk" }, { "label" : "Madras, N.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Madras%2C+N.", "original-name" : "N. Madras", "last-name" : "Madras" }, { "label" : "Rha, Philip", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rha%2C+Philip", "original-name" : "Philip Rha", "last-name" : "Rha" }, { "label" : "Bray, Tim", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bray%2C+Tim", "original-name" : "Tim Bray", "last-name" : "Bray" }, { "label" : "Jain, Kamal", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Jain%2C+Kamal", "original-name" : "Kamal Jain", "last-name" : "Jain" }, { "label" : "Laender, A. F.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Laender%2C+A.+F.", "original-name" : "A. F. Laender", "last-name" : "Laender" }, { "label" : "Frasincar, Flavius", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Frasincar%2C+Flavius", "original-name" : "Flavius Frasincar", "last-name" : "Frasincar" }, { "label" : "Russell, Stuart", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Russell%2C+Stuart", "original-name" : "Stuart Russell", "last-name" : "Russell" }, { "label" : "Winograd, Terry", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Winograd%2C+Terry", "original-name" : "Terry Winograd", "last-name" : "Winograd" }, { "label" : "Hu, Wenjun", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hu%2C+Wenjun", "original-name" : "Wenjun Hu", "last-name" : "Hu" }, { "label" : "Naor, Joseph", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Naor%2C+Joseph", "original-name" : "Joseph Naor", "last-name" : "Naor" }, { "label" : "Feamster, Nick", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Feamster%2C+Nick", "original-name" : "Nick Feamster", "last-name" : "Feamster" }, { "label" : "Yee, Ka-Ping", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Yee%2C+Ka-Ping", "original-name" : "Ka-Ping Yee", "last-name" : "Yee" }, { "label" : "Koseki, Yoshiyuki", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Koseki%2C+Yoshiyuki", "original-name" : "Yoshiyuki Koseki", "last-name" : "Koseki" }, { "label" : "Nakamura, A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Nakamura%2C+A.", "original-name" : "A. Nakamura", "last-name" : "Nakamura" }, { "label" : "Seymore, Kristie", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Seymore%2C+Kristie", "original-name" : "Kristie Seymore", "last-name" : "Seymore" }, { "label" : "Marais, Hannes", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Marais%2C+Hannes", "original-name" : "Hannes Marais", "last-name" : "Marais" }, { "label" : "Rijke}, Maarten {de", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rijke%7D%2C+Maarten+%7Bde", "original-name" : "Maarten {de Rijke}", "last-name" : "Rijke}" }, { "label" : "Sarwate, D. V.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sarwate%2C+D.+V.", "original-name" : "D. V. Sarwate", "last-name" : "Sarwate" }, { "label" : "Sherman, Alex", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sherman%2C+Alex", "original-name" : "Alex Sherman", "last-name" : "Sherman" }, { "label" : "Johnson, S. M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Johnson%2C+S.+M.", "original-name" : "S. M. Johnson", "last-name" : "Johnson" }, { "label" : "Guha, S.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Guha%2C+S.", "original-name" : "S. Guha", "last-name" : "Guha" }, { "label" : "Metaxas, Panagiotis", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Metaxas%2C+Panagiotis", "original-name" : "Panagiotis Metaxas", "last-name" : "Metaxas" }, { "label" : "Ajtai, Miklos", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ajtai%2C+Miklos", "original-name" : "Miklos Ajtai", "last-name" : "Ajtai" }, { "label" : "Shenker, Scott", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shenker%2C+Scott", "original-name" : "Scott Shenker", "last-name" : "Shenker" }, { "label" : "Srebro, Nati", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Srebro%2C+Nati", "original-name" : "Nati Srebro", "last-name" : "Srebro" }, { "label" : "Sinha, Rashmi", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sinha%2C+Rashmi", "original-name" : "Rashmi Sinha", "last-name" : "Sinha" }, { "label" : "Soffer, Aya", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Soffer%2C+Aya", "original-name" : "Aya Soffer", "last-name" : "Soffer" }, { "label" : "Catarci, Tiziana", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Catarci%2C+Tiziana", "original-name" : "Tiziana Catarci", "last-name" : "Catarci" }, { "label" : "Ratliff, H.D.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Ratliff%2C+H.D.", "original-name" : "H.D. Ratliff", "last-name" : "Ratliff" }, { "label" : "Feigenbaum, Joan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Feigenbaum%2C+Joan", "original-name" : "Joan Feigenbaum", "last-name" : "Feigenbaum" }, { "label" : "Pereira, Fernando", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Pereira%2C+Fernando", "original-name" : "Fernando Pereira", "last-name" : "Pereira" }, { "label" : "Bloniarz, P. A.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Bloniarz%2C+P.+A.", "original-name" : "P. A. Bloniarz", "last-name" : "Bloniarz" }, { "label" : "Zimmerman, U.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Zimmerman%2C+U.", "original-name" : "U. Zimmerman", "last-name" : "Zimmerman" }, { "label" : "Rinaldi, Giovanni", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Rinaldi%2C+Giovanni", "original-name" : "Giovanni Rinaldi", "last-name" : "Rinaldi" }, { "label" : "Guha, R.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Guha%2C+R.", "original-name" : "R. Guha", "last-name" : "Guha" }, { "label" : "Dial, R. B.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Dial%2C+R.+B.", "original-name" : "R. B. Dial", "last-name" : "Dial" }, { "label" : "Shahar, Y.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Shahar%2C+Y.", "original-name" : "Shahar, Y.", "last-name" : "Shahar" }, { "label" : "Hopcroft, John E.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Hopcroft%2C+John+E.", "original-name" : "John E. Hopcroft", "last-name" : "Hopcroft" }, { "label" : "Sun, Y--G.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Sun%2C+Y--G.", "original-name" : "Y--G. Sun", "last-name" : "Sun" }, { "label" : "Khanna, Sanjeev", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Khanna%2C+Sanjeev", "original-name" : "Sanjeev Khanna", "last-name" : "Khanna" }, { "label" : "Zloof, Mosh? M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Zloof%2C+Mosh%C3%A9+M.", "original-name" : "Mosh? M. Zloof", "last-name" : "Zloof" }, { "label" : "Mandelbrod, Matan", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Mandelbrod%2C+Matan", "original-name" : "Matan Mandelbrod", "last-name" : "Mandelbrod" }, { "label" : "Westbrook, Jeffrey", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Westbrook%2C+Jeffrey", "original-name" : "Jeffrey Westbrook", "last-name" : "Westbrook" }, { "label" : "Anderson, R. J.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Anderson%2C+R.+J.", "original-name" : "R. J. Anderson", "last-name" : "Anderson" }, { "label" : "Burke, M.", "type" : "Author", "uri" : "urn:pg:298a474b7484a9d8aca89b8406cbc82ed8b32d66:Burke%2C+M.", "original-name" : "M. Burke", "last-name" : "Burke" } ], "types" : { "Author" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#Author" }, "Publication" : { "label" : "Publication", "uri" : "http://simile.mit.edu/2006/11/bibtex#Publication", "pluralLabel" : "Publications" } }, "properties" : { "general-terms" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#general-terms" }, "opteditor" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#opteditor" }, "note" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#note" }, "studentwork" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#studentwork" }, "crossref" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#crossref", "valueType" : "item" }, "area" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#area" }, "optannote" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#optannote" }, "place" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#place" }, "ee" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#ee" }, "howpublished" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#howpublished" }, "institution" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#institution" }, "link" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#link" }, "coden" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#coden" }, "abstract" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#abstract" }, "editors" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#editors" }, "mrclass" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#mrclass" }, "pages" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#pages" }, "date" : { "uri" : "http://purl.org/dc/elements/1.1/date" }, "basefilename" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#basefilename" }, "ps" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#ps" }, "author" : { "reverseLabel" : "authors of", "label" : "author", "groupingLabel" : "their authors", "uri" : "http://simile.mit.edu/2006/11/bibtex#author", "reverseGroupingLabel" : "what they author", "reversePluralLabel" : "authors of", "valueType" : "item", "pluralLabel" : "authors" }, "mynote" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#mynote" }, "optseries" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#optseries" }, "url" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#url" }, "optaddress" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#optaddress" }, "doi" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#doi" }, "abstsract" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#abstsract" }, "work-done-at" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#work-done-at" }, "optedition" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#optedition" }, "postscript" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#postscript" }, "original-name" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#original-name" }, "screencastkb" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#screencastkb" }, "mrnumber" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#mrnumber" }, "bibsource" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#bibsource" }, "screencasturl" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#screencasturl" }, "editor" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#editor" }, "preliminary" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#preliminary" }, "event" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#event" }, "pdfkb" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#pdfkb" }, "annote" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#annote" }, "volume" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#volume" }, "venue" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#venue" }, "publisher" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#publisher" }, "day" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#day" }, "vulome" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#vulome" }, "optmonth" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#optmonth" }, "notes" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#notes" }, "optnumber" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#optnumber" }, "month" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#month" }, "cat" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#cat" }, "acknowledgement" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#acknowledgement" }, "journal" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#journal" }, "alteditor" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#alteditor" }, "chapter" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#chapter" }, "pdfurl" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#pdfurl" }, "no" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#no" }, "sli_ps" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#sli_ps" }, "language" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#language" }, "series" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#series" }, "key" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#key" }, "last-name" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#last-name" }, "comments" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#comments" }, "isbn" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#isbn" }, "year" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#year" }, "bibdate" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#bibdate" }, "ppt" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#ppt" }, "brag" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#brag" }, "vol" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#vol" }, "conf" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#conf" }, "pdf" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#pdf" }, "cr-categories" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#cr-categories" }, "origin" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#origin" }, "references" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#references" }, "text" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#text" }, "conferenceurl" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#conferenceurl" }, "keywords" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#keywords" }, "optnote" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#optnote" }, "city" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#city" }, "confurl" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#confurl" }, "project" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#project" }, "booktitle" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#booktitle" }, "optkey" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#optkey" }, "edition" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#edition" }, "issn" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#issn" }, "number" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#number" }, "source" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#source" }, "projectsite" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#projectsite" }, "cite" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#cite" }, "school" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#school" }, "optvolume" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#optvolume" }, "location" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#location" }, "psgz" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#psgz" }, "organization" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#organization" }, "address" : { "uri" : "http://simile.mit.edu/2006/11/bibtex#address" } } })