{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:41Z","timestamp":1725740501613},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_28","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:36:30Z","timestamp":1373506590000},"page":"316-327","source":"Crossref","is-referenced-by-count":3,"title":["Combinatorial Pair Testing: Distinguishing Workers from Slackers"],"prefix":"10.1007","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[]},{"given":"Daniel S.","family":"Hirschberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Frikken, K.B., Blanton, M., Cho, Y.: Private combinatorial group testing. In: ACM Symp on Information, Computer and Communications Security (ASIACCS), pp. 312\u2013320 (2008)","DOI":"10.1145\/1368310.1368355"},{"key":"28_CR2","unstructured":"Beigel, R., Hurwood, W., Kahale, N.: Fault diagnosis in a flash. In: Proc. IEEE Foundations of Computer Science (FOCS), pp. 571\u2013580 (October 1995)"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Beigel, R., Kosaraju, S.R., Sullican, G.F.: Locating faults in a constant number of parallel testing rounds. In: ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 189\u2013198 (1989)","DOI":"10.1145\/72935.72956"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Beigel, R., Margulis, G., Spielman, D.A.: Fault diagnosis in a small constant number of parallel testing rounds. In: ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 21\u201329 (1993)","DOI":"10.1145\/165231.165234"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0012-365X(83)90026-2","volume":"43","author":"P.M. Blecher","year":"1983","unstructured":"Blecher, P.M.: On a logical problem. Discrete Mathematics\u00a043(1), 107\u2013110 (1983)","journal-title":"Discrete Mathematics"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Du, D.-Z., Hwang, F.: Combinatorial Group Testing and Its Applications. Series on Applied Mathematics. World Scientific (2000)","DOI":"10.1142\/4252"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/11496137_9","volume-title":"Applied Cryptography and Network Security","author":"W. Du","year":"2005","unstructured":"Du, W., Goodrich, M.T.: Searching for high-value rare events with uncheatable grid computing. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 122\u2013137. Springer, Heidelberg (2005)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Du, W., Jia, J., Mangal, M., Murugesan, M.: Uncheatable grid computing. In: 24th Int. Conf. on Distributed Computing Systems (ICDCS), pp. 4\u201311 (2004)","DOI":"10.1109\/ICDCS.2004.1281562"},{"issue":"5","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1137\/050631847","volume":"36","author":"D. Eppstein","year":"2006","unstructured":"Eppstein, D., Goodrich, M.T., Hirschberg, D.S.: Improved combinatorial group testing algorithms for real-world problem sizes. SIAM J. Comput.\u00a036(5), 1360\u20131375 (2006)","journal-title":"SIAM J. Comput."},{"issue":"2\/3","key":"28_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.tcs.2008.08.008","volume":"408","author":"M.T. Goodrich","year":"2008","unstructured":"Goodrich, M.T.: Pipelined algorithms to detect cheating in long-term grid computations. Theoretical Computer Science\u00a0408(2\/3), 199\u2013207 (2008)","journal-title":"Theoretical Computer Science"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/11496137_15","volume-title":"Applied Cryptography and Network Security","author":"M.T. Goodrich","year":"2005","unstructured":"Goodrich, M.T., Atallah, M.J., Tamassia, R.: Indexing information for data forensics. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 206\u2013221. Springer, Heidelberg (2005)"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1017\/S0269964800141051","volume":"14","author":"F.K. Hwang","year":"2000","unstructured":"Hwang, F.K.: Random k-set pool designs with distinct columns. Probab. Eng. Inf. Sci.\u00a014(1), 49\u201356 (2000)","journal-title":"Probab. Eng. Inf. Sci."},{"issue":"2","key":"28_CR13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/1383602.1383643","volume":"40","author":"N. Jacobson","year":"2008","unstructured":"Jacobson, N., Schaefer, S.K.: Pair programming in CS1: overcoming objections to its adoption. SIGCSE Bull.\u00a040(2), 93\u201396 (2008)","journal-title":"SIGCSE Bull."},{"key":"28_CR14","unstructured":"Liu, Q., Peng, J., Ihler, A.: Variational inference for crowdsourcing. In: Bartlett, P., Pereira, F.C.N., Burges, C.J.C., Bottou, L., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems (NIPS), pp. 701\u2013709 (2012)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Nagappan, N., Williams, L., Ferzli, M., Wiebe, E., Yang, K., Miller, C., Balik, S.: Improving the CS1 experience with pair programming. In: Proc. 34th SIGCSE Technical Symp. on Computer Science Education (SIGCSE 2003). SIGCSE Bulletin, vol.\u00a035(1), pp. 359\u2013362 (2003)","DOI":"10.1145\/792548.612006"},{"key":"28_CR16","unstructured":"Niculescu, C.P., Vernescu, A.: A two-sided estimate of e\n                \n                  x\n                \u2009\u2212\u2009(1\u2009+\u2009x\/n)\n                  n\n                . Journal of Inequalities in Pure and Applied Mathematics\u00a05(3) (2004)"},{"issue":"3","key":"28_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1017\/S0963548398003563","volume":"7","author":"A. Pelc","year":"1998","unstructured":"Pelc, A., Upfal, E.: Reliable fault diagnosis with few tests. Comb. Probab. Comput.\u00a07(3), 323\u2013333 (1998)","journal-title":"Comb. Probab. Comput."},{"issue":"4","key":"28_CR18","doi-asserted-by":"publisher","first-page":"866","DOI":"10.2307\/1427566","volume":"22","author":"W. Stadje","year":"1990","unstructured":"Stadje, W.: The collector\u2019s problem with group drawings. Advances in Applied Probability\u00a022(4), 866\u2013882 (1990)","journal-title":"Advances in Applied Probability"},{"key":"28_CR19","unstructured":"Williams, L., Kessler, R.R.: Pair Programming Illuminated. Addison-Wesley (2003)"},{"issue":"4","key":"28_CR20","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/52.854064","volume":"17","author":"L. Williams","year":"2000","unstructured":"Williams, L., Kessler, R.R., Cunningham, W., Jeffries, R.: Strengthening the case for pair programming. IEEE Software\u00a017(4), 19\u201325 (2000)","journal-title":"IEEE Software"},{"key":"28_CR21","first-page":"162","volume-title":"Proceedings of the 27th Annual Symposium on Foundations of Computer Science","author":"A.C. Yao","year":"1986","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society, Washington, DC (1986)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:41:34Z","timestamp":1557931294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}