{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:52Z","timestamp":1759063792330,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,9]],"date-time":"2015-11-09T00:00:00Z","timestamp":1447027200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,11,9]],"date-time":"2015-11-09T00:00:00Z","timestamp":1447027200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100005651","name":"Computing Research Association","doi-asserted-by":"publisher","award":["CIFellows 0937060"],"award-info":[{"award-number":["CIFellows 0937060"]}],"id":[{"id":"10.13039\/100005651","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0917153"],"award-info":[{"award-number":["CCF-0917153"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"US Department of Education","award":["P200A090157"],"award-info":[{"award-number":["P200A090157"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00453-015-0089-4","type":"journal-article","created":{"date-parts":[[2015,11,9]],"date-time":"2015-11-09T18:43:04Z","timestamp":1447094584000},"page":"595-618","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Max-Throughput for (Conservative) k-of-n Testing"],"prefix":"10.1007","volume":"77","author":[{"given":"Lisa","family":"Hellerstein","sequence":"first","affiliation":[]},{"given":"\u00d6zg\u00fcr","family":"\u00d6zkan","sequence":"additional","affiliation":[]},{"given":"Linda","family":"Sellie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,9]]},"reference":[{"key":"89_CR1","doi-asserted-by":"publisher","first-page":"1410","DOI":"10.1287\/mnsc.27.12.1410","volume":"27","author":"Y Ben-Dov","year":"1981","unstructured":"Ben-Dov, Y.: Optimal testing procedure for special structures of coherent systems. Manag. Sci. 27, 1410\u20131420 (1981)","journal-title":"Manag. Sci."},{"issue":"1\u20134","key":"89_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1018958928835","volume":"26","author":"E Boros","year":"1999","unstructured":"Boros, E., \u00dcnl\u00fcyurt, T.: Diagnosing double regular systems. Ann. Math. Artif. Intell. 26(1\u20134), 171\u2013191 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"89_CR3","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1109\/12.54850","volume":"39","author":"M-F Chang","year":"1990","unstructured":"Chang, M.-F., Shi, W., Fuchs, W.K.: Optimal diagnosis procedures for k-out-of-n structures. IEEE Trans. Comput. 39(4), 559\u2013564 (1990)","journal-title":"IEEE Trans. Comput."},{"key":"89_CR4","doi-asserted-by":"crossref","unstructured":"Condon, A., Deshpande, A., Hellerstein, L., Wu, N.: Flow algorithms for two pipelined filter ordering problems. In: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 193\u2013202. ACM (2006)","DOI":"10.1145\/1142351.1142379"},{"key":"89_CR5","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/1497290.1497300","volume":"5","author":"A Condon","year":"2009","unstructured":"Condon, A., Deshpande, A., Hellerstein, L., Ning, W.: Algorithms for distributional and adversarial pipelined filter ordering problems. ACM Trans. Algorithms 5, 24:1\u201324:34 (2009)","journal-title":"ACM Trans. Algorithms"},{"key":"89_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02022091","volume":"21","author":"L Cox","year":"1989","unstructured":"Cox, L., Qiu, Y., Kuehner, W.: Heuristic least-cost computation of discrete classification functions with uncertain argument values. Ann. Oper. Res. 21, 1\u201329 (1989)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"89_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/2344422.2344431","volume":"8","author":"A Deshpande","year":"2012","unstructured":"Deshpande, A., Hellerstein, L.: Parallel pipelined filter ordering with precedence constraints. ACM Trans. Algorithms 8(4), 41 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"89_CR8","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Hellerstein, L., Kletenik, D.: Approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1453\u20131466 (2014)","DOI":"10.1137\/1.9781611973402.107"},{"key":"89_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(73)90113-1","volume":"4","author":"MR Garey","year":"1973","unstructured":"Garey, M.R.: Optimal task sequencing with precedence constraints. Discrete Math. 4, 37\u201356 (1973)","journal-title":"Discrete Math."},{"key":"89_CR10","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Kushilevitz, E., Mansour, Y.: Learning with attribute costs. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 356\u2013365 (2005)","DOI":"10.1145\/1060590.1060644"},{"key":"89_CR11","doi-asserted-by":"crossref","unstructured":"Kodialam, M.S.: The throughput of sequential testing. In: Proceedings of the 8th International Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 2081, pp. 280\u2013292. Springer (2001)","DOI":"10.1007\/3-540-45535-3_22"},{"key":"89_CR12","doi-asserted-by":"crossref","unstructured":"Liu, Z., Parthasarathy, S., Ranganathan, A., Yang, H.: A generic flow algorithm for shared filter ordering problems. In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 79\u201388. ACM (2008)","DOI":"10.1145\/1376916.1376929"},{"key":"89_CR13","unstructured":"Salloum, S.: Optimal testing algorithms for symmetric coherent systems. Ph.D. thesis, University of Southern California (1979)"},{"issue":"1","key":"89_CR14","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/0022-247X(84)90064-7","volume":"101","author":"S Salloum","year":"1984","unstructured":"Salloum, S., Breuer, M.A.: An optimum testing algorithm for some symmetric coherent systems. J. Math. Anal. Appl. 101(1), 170\u2013194 (1984)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"89_CR15","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1109\/24.589958","volume":"46","author":"S Salloum","year":"1997","unstructured":"Salloum, S., Breuer, M.A.: Fast optimal diagnosis procedures for k-out-of-n: G systems. IEEE Trans. Reliab. 46(2), 283\u2013290 (1997)","journal-title":"IEEE Trans. Reliab."},{"issue":"7","key":"89_CR16","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N Sarnak","year":"1986","unstructured":"Sarnak, N., Tarjan, R.E.: Planar point location using persistent search trees. Commun. ACM 29(7), 669\u2013679 (1986)","journal-title":"Commun. ACM"},{"issue":"1\u20133","key":"89_CR17","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.dam.2002.08.001","volume":"142","author":"T \u00dcnl\u00fcyurt","year":"2004","unstructured":"\u00dcnl\u00fcyurt, T.: Sequential testing of complex systems: a review. Discrete Appl. Math. 142(1\u20133), 189\u2013205 (2004)","journal-title":"Discrete Appl. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0089-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0089-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0089-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0089-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T06:32:10Z","timestamp":1589697130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0089-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,9]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["89"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0089-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2015,11,9]]},"assertion":[{"value":"6 February 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}