{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:26:23Z","timestamp":1742970383669,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_17","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"201-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Optimal Tester for k-Linear"],"prefix":"10.1007","author":[{"given":"Nader H.","family":"Bshouty","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-85363-3_26","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"E Blais","year":"2008","unstructured":"Blais, E.: Improved bounds for testing Juntas. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX\/RANDOM -2008. LNCS, vol. 5171, pp. 317\u2013330. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85363-3_26"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Blais, E.: Testing juntas nearly optimally. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, 31 May\u20132 June 2009, pp. 151\u2013158 (2009). https:\/\/doi.org\/10.1145\/1536414.1536437","DOI":"10.1145\/1536414.1536437"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Blais, E., Brody, J., Matulef, K.: Property testing lower bounds via communication complexity. In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, 8\u201310 June 2011, pp. 210\u2013220 (2011). https:\/\/doi.org\/10.1109\/CCC.2011.31","DOI":"10.1109\/CCC.2011.31"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Blais, E., Kane, D.M.: Tight bounds for testing k-linearity. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, 15\u201317 August 2012, Proceedings, pp. 435\u2013446 (2012). https:\/\/doi.org\/10.1007\/978-3-642-32512-0_37","DOI":"10.1007\/978-3-642-32512-0_37"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47(3), 549\u2013595 (1993). https:\/\/doi.org\/10.1016\/0022-0000(93)90044-W","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Bshouty, N.J.: Almost optimal distribution-free junta testing. In: 34th Computational Complexity Conference, CCC 2019, 18\u201320 July 2019, New Brunswick, NJ, USA, pp. 2:1\u20132:13 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2019.2","DOI":"10.4230\/LIPIcs.CCC.2019.2"},{"key":"17_CR7","unstructured":"Bshouty, N.H.: An optimal tester for $$k$$-linear. Electron. Colloquium Comput. Complex. 27, 123 (2020). https:\/\/eccc.weizmann.ac.il\/report\/2020\/123"},{"key":"17_CR8","unstructured":"Buhrman, H., Garc\u00eda-Soriano, D., Matsliah, A., de Wolf, R.: The non-adaptive query complexity of testing k-parities. Chicago J. Theor. Comput. Sci. 2013, 1\u201311 (2013). http:\/\/cjtcs.cs.uchicago.edu\/articles\/2013\/6\/contents.html"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing juntas. In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16\u201319 November 2002, Vancouver, BC, Canada, Proceedings, pp. 103\u2013112 (2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181887","DOI":"10.1109\/SFCS.2002.1181887"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: On testing computability by small width OBDDs. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, 1\u20133 September 2010. Proceedings, pp. 574\u2013587 (2010). https:\/\/doi.org\/10.1007\/978-3-642-15369-3_43","DOI":"10.1007\/978-3-642-15369-3_43"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16367-8","volume-title":"Property Testing","year":"2010","unstructured":"Goldreich, O. (ed.): Property Testing. LNCS, vol. 6390. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16367-8"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: Introduction to Property Testing. Cambridge University Press, Cambridge (2017). http:\/\/www.cambridge.org\/us\/catalogue\/catalogue.asp?isbn=9781107194052, https:\/\/doi.org\/10.1017\/9781108135252","DOI":"10.1017\/9781108135252"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45(4), 653\u2013750 (1998). https:\/\/doi.org\/10.1145\/285055.285060","journal-title":"J. ACM"},{"issue":"4","key":"17_CR14","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1137\/050645804","volume":"37","author":"S Halevy","year":"2007","unstructured":"Halevy, S., Kushilevitz, E.: Distribution-free property-testing. SIAM J. Comput. 37(4), 1107\u20131138 (2007). https:\/\/doi.org\/10.1137\/050645804","journal-title":"SIAM J. Comput."},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-49097-3_9","volume-title":"Computational Learning Theory","author":"T Hofmeister","year":"1999","unstructured":"Hofmeister, T.: An application of codes to attribute-efficient learning. In: Fischer, P., Simon, H.U. (eds.) EuroCOLT 1999. LNCS (LNAI), vol. 1572, pp. 101\u2013110. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49097-3_9"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1561\/2200000004","volume":"1","author":"D Ron","year":"2008","unstructured":"Ron, D.: Property testing: a learning theory perspective. Found. Trends Mach. Learn. 1(3), 307\u2013402 (2008). https:\/\/doi.org\/10.1561\/2200000004","journal-title":"Found. Trends Mach. Learn."},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1561\/0400000029","volume":"5","author":"D Ron","year":"2009","unstructured":"Ron, D.: Algorithmic and analysis techniques in property testing. Found. Trends Theor. Comput. Sci. 5(2), 73\u2013205 (2009). https:\/\/doi.org\/10.1561\/0400000029","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"4","key":"17_CR18","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1137\/100791075","volume":"25","author":"R Rubinfeld","year":"2011","unstructured":"Rubinfeld, R., Shapira, A.: Sublinear time algorithms. SIAM J. Discrete Math. 25(4), 1562\u20131588 (2011). https:\/\/doi.org\/10.1137\/100791075","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM J. Comput. 25(2), 252\u2013271 (1996). https:\/\/doi.org\/10.1137\/S0097539793255151","journal-title":"SIAM J. Comput."},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Saglam, M.: Near log-convexity of measured heat in (discrete) time and consequences. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7\u20139 October 2018, pp. 967\u2013978 (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00095","DOI":"10.1109\/FOCS.2018.00095"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:05:19Z","timestamp":1647389119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The proceedings also include 3 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}