@inproceedings{parameswaran2011answering,
  abstract = {For some problems, human assistance is needed in addition to automated (algorithmic) computation. In sharp contrast to existing data management approaches, where human input is either ad-hoc or is never used, we describe the design of the first declarative language involving human-computable functions, standard relational operators, as well as algorithmic computation. We consider the challenges involved in optimizing queries posed in this language, in particular, the tradeoffs between uncertainty, cost and performance, as well as combination of human and algorithmic evidence. We believe that the vision laid out in this paper can act as a road-map for a new area of data management research where human computation is routinely used in data analytics.},
  author = {Parameswaran, Aditya and Polyzotis, Neoklis},
  booktitle = {Conference on Inovative Data Systems Research (CIDR 2011)},
  interhash = {037601fdcba1c499a3e89b1427235489},
  intrahash = {8c11ab0f21767c79cd694a795eddf169},
  month = jan,
  pages = {160--166},
  title = {Answering Queries using Humans, Algorithms and Databases},
  url = {http://ilpubs.stanford.edu:8090/986/},
  year = 2011
}

@inproceedings{little2010turkit,
  abstract = {Mechanical Turk (<i>MTurk</i>) provides an on-demand source of human computation. This provides a tremendous opportunity to explore algorithms which incorporate human computation as a function call. However, various systems challenges make this difficult in practice, and most uses of MTurk post large numbers of independent tasks. TurKit is a toolkit for prototyping and exploring algorithmic human computation, while maintaining a straight-forward imperative programming style. We present the crash-and-rerun programming model that makes TurKit possible, along with a variety of applications for human computation algorithms. We also present case studies of TurKit used for real experiments across different fields.},
  acmid = {1866040},
  address = {New York, NY, USA},
  author = {Little, Greg and Chilton, Lydia B. and Goldman, Max and Miller, Robert C.},
  booktitle = {Proceedings of the 23nd annual ACM symposium on User interface software and technology},
  doi = {10.1145/1866029.1866040},
  interhash = {a2b44d507345037242e3590eee0ab671},
  intrahash = {e364db8e8ee1992a0fdb5f37f425b1a7},
  isbn = {978-1-4503-0271-5},
  location = {New York, New York, USA},
  numpages = {10},
  pages = {57--66},
  publisher = {ACM},
  title = {TurKit: human computation algorithms on mechanical turk},
  url = {http://doi.acm.org/10.1145/1866029.1866040},
  year = 2010
}

@book{knuth2011combinatorial,
  asin = {0201038048},
  author = {Knuth, Donald E.},
  dewey = {001.642},
  ean = {9780201038040},
  interhash = {276f5451e5ece797ff2c247aaa2866a8},
  intrahash = {481baec64f095b2555e780614e5c8f13},
  isbn = {0201038048},
  month = jan,
  publisher = {Addison-Wesley Professional},
  series = {The Art of Computer Programming},
  title = {Combinatorial Algorithms},
  url = {http://www.amazon.com/Art-Computer-Programming-Combinatorial-Algorithms/dp/0201038048/ref=sr_1_1/179-7432054-1264222?ie=UTF8&s=books&qid=1298901523&sr=8-1},
  volume = {4A},
  year = 2011
}

@article{boyer1977string,
  abstract = {An algorithm is presented that searches for the location, “il” of the first occurrence of a character string, “pat,” in another string, “string.” During the search operation, the characters of pat are matched starting with the last character of pat. The information gained by starting the match at the end of the pattern often allows the algorithm to proceed in large jumps through the text being searched. Thus the algorithm has the unusual property that, in most cases, not all of the first i characters of string are inspected. The number of characters actually inspected (on the average) decreases as a function of the length of pat. For a random English pattern of length 5, the algorithm will typically inspect i/4 characters of string before finding a match at i. Furthermore, the algorithm has been implemented so that (on the average) fewer than i + patlen machine instructions are executed. These conclusions are supported with empirical evidence and a theoretical analysis of the average behavior of the algorithm. The worst case behavior of the algorithm is linear in i + patlen, assuming the availability of array space for tables linear in patlen plus the size of the alphabet. 3~},
  address = {New York, NY, USA},
  author = {Boyer, Robert S. and Moore, J. Strother},
  doi = {10.1145/359842.359859},
  interhash = {4df7c63c9e5aa054a20b177265d6fe79},
  intrahash = {bf45f38d1fd1a07a8690339f5a829818},
  issn = {0001-0782},
  journal = {Communications of the ACM},
  month = oct,
  number = 10,
  pages = {762--772},
  publisher = {ACM},
  title = {A fast string searching algorithm},
  url = {http://portal.acm.org/citation.cfm?id=359859},
  volume = 20,
  year = 1977
}

@article{battista1994algorithms,
  abstract = {Several data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and software engineering diagrams. In this paper we
present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of
graphs. Research on this topic is spread over the broad spectrum of Computer Science. This bibliography constitutes an attempt to encompass both theoretical and application oriented papers from disparate
areas.},
  address = {Amsterdam, The Netherlands},
  author = {Battista, Giuseppe Di and Eades, Peter and Tamassia, Roberto and Tollis, Ioannis G.},
  doi = {10.1016/0925-7721(94)00014-X},
  interhash = {c8010ae4e2e0aedf21607631ac79bed4},
  intrahash = {a62ded9eee008659ffa33d294b8de870},
  issn = {0925-7721},
  journal = {Computational Geometry: Theory and Applications},
  number = 5,
  pages = {235--282},
  publisher = {Elsevier Science Publishers B. V.},
  title = {Algorithms for drawing graphs: an annotated bibliography},
  url = {http://portal.acm.org/citation.cfm?id=195598},
  volume = 4,
  year = 1994
}