{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:37:00Z","timestamp":1648964220854},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1007\/bf01293265","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T22:05:16Z","timestamp":1111701916000},"page":"429-442","source":"Crossref","is-referenced-by-count":4,"title":["Provably good pattern generators for a random pattern test"],"prefix":"10.1007","volume":"11","author":[{"given":"Thomas H.","family":"Spencer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"P. H. Bardell and W. H. McAnney. Self-Testing of Multichip Logic Modules,Proceedings of the 1982 International Test Conference, 1982, pp. 200?204."},{"key":"CR2","unstructured":"Z. Barzilai, V. S. Iyengar, B. K. Rosen, and G. M. Silberman. Fault Modeling and Simulation of SCVS Circuits,Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers, 1984, pp. 42?47."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-1-4757-0602-4_6","volume-title":"Advances in Cryptology: Proceedings of CRYPTO 82","author":"L. Blum","year":"1983","unstructured":"L. Blum, M. Blum, and M. Shub. A Simple Secure Pseudo-Random Number Generator,Advances in Cryptology: Proceedings of CRYPTO 82 (edited by D. Chaum, R. L. Rivest, and A. T. Sherman), Plenum, New York, 1983, pp. 61?78."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"M. Blum and S. Micali. How To Generate Cryptographically Strong Sequences of Pseudo Random Bits,Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, 1982, pp. 112?117.","DOI":"10.1109\/SFCS.1982.72"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"J. L. Carter. The Theory of Signature Testing for VLSI,Proceedings of the ACM Symposium on Theory of Computing, 1982, pp. 66?76.","DOI":"10.1145\/800070.802178"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. L. Wegman. Universal Classes of Hash Functions,J. Comput. System Sci.,18 (April 1979), 143?154.","journal-title":"J. Comput. System Sci."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0885-064X(89)90015-0","volume":"5","author":"B. Chor","year":"1989","unstructured":"B. Chor and O. Goldreich. On the Power of Two-Point Based Sampling,J. Complexity,5 (1989), 96?106.","journal-title":"J. Complexity"},{"key":"CR8","unstructured":"E. B. Eichelberger, and T. W. Williams. A Logic Design Structure for LSI Testability,Proceedings of the 14th Design Automation Conference, 1977, pp. 462?468."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1112\/jlms\/s2-9.4.561","volume":"9","author":"J. Galambos","year":"1975","unstructured":"J. Galambos. Methods for Proving Bonferroni Type Inequalities,J. London Math. Soc. (2),9 (1975), 561?564.","journal-title":"J. London Math. Soc. (2)"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1214\/aop\/1176995765","volume":"5","author":"J. Galambos","year":"1977","unstructured":"J. Galambos. Bonferroni Inequalities,Ann. Probab.,5 (1977), 577?581.","journal-title":"Ann. Probab."},{"key":"CR11","unstructured":"M. Y. Hsiao. Generating PN Sequences in Parallel,Proceedings of the Third Annual Princeton Conference on Information Sciences and Systems, 1969."},{"key":"CR12","volume-title":"The Art of Computer Programming, Vol. 1","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth.The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, MA, 1973."},{"key":"CR13","volume-title":"The Art of Computer Programming, Vol. 2","author":"D. E. Knuth","year":"1980","unstructured":"D. E. Knuth.The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, MA, 1980."},{"key":"CR14","unstructured":"B. Konemann, J. Muncha, and G. Zwiehoff. Built-in Logic Block Observation Techniques,Proceedings of the 1979 Test Conference, 1979, pp. 37?41."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem,Proceedings of the 17th ACM Symposium on Theory of Computing, 1985, pp. 1?10.","DOI":"10.1145\/22145.22146"},{"key":"CR16","volume-title":"Error Correcting Codes","author":"W. W. Peterson","year":"1972","unstructured":"W. W. Peterson and E. Weldon, Jr.Error Correcting Codes, MIT Press, Cambridge, MA, 1972."},{"key":"CR17","unstructured":"J. Savir, G. Ditlow, and P. Bardell: Random Pattern Testability,Proceedings of the 13th International Symposium on Fault Tolerant Computing, 1983, pp. 80?89."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A. Shamir","year":"1983","unstructured":"A. Shamir. On the Generation of Cryptographically Strong Pseudo-Random Sequences,ACM Trans. Comput. Systems,1 (1983), 38?44.","journal-title":"ACM Trans. Comput. Systems"},{"key":"CR19","volume-title":"Technical Report, 88-3","author":"T. Spencer","year":"1986","unstructured":"T. Spencer. Good Pattern Generators for Random Pattern Test, Technical Report, 88-3, Rensselaer Polytechnic Institute, Troy, NY, 1986."},{"key":"CR20","unstructured":"T. Spencer. Generalized Bonferroni Inequalities,J. Appl. Probab. (to appear)."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1145\/31846.31848","volume":"37","author":"S. Tezuka","year":"1987","unstructured":"S. Tezuka. On the Discrepancy of GFSR Pseudorandom Numbers,J. Assoc. Comput. Mech.,37 (1987), 939?949.","journal-title":"J. Assoc. Comput. Mech."},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"A. C. Yao. Theory and Applications of Trapdoor Functions,Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, 1982, pp. 80?91.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293265.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01293265\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293265","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T11:15:30Z","timestamp":1556795730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01293265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["BF01293265"],"URL":"https:\/\/doi.org\/10.1007\/bf01293265","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}