{"id":"https://openalex.org/W2729743783","doi":"https://doi.org/10.1145/3155296","title":"Parameterized Property Testing of Functions","display_name":"Parameterized Property Testing of Functions","publication_year":2017,"publication_date":"2017-12-14","ids":{"openalex":"https://openalex.org/W2729743783","doi":"https://doi.org/10.1145/3155296","mag":"2729743783"},"language":"en","primary_location":{"id":"doi:10.1145/3155296","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3155296","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol067-itcs2017/LIPIcs.ITCS.2017.12/LIPIcs.ITCS.2017.12.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017167506","display_name":"Ramesh Krishnan S. Pallavoor","orcid":"https://orcid.org/0000-0003-1060-7466"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ramesh Krishnan S. Pallavoor","raw_affiliation_strings":["Boston University, Boston, MA","Pennsylvania State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA","institution_ids":[]},{"raw_affiliation_string":"Pennsylvania State University","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080839778","display_name":"Sofya Raskhodnikova","orcid":"https://orcid.org/0000-0002-4902-050X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sofya Raskhodnikova","raw_affiliation_strings":["Boston University, Boston, MA","Institute for Computational and Data Sciences (ICDS)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA","institution_ids":[]},{"raw_affiliation_string":"Institute for Computational and Data Sciences (ICDS)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063941985","display_name":"Nithin Varma","orcid":"https://orcid.org/0000-0002-1211-2566"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nithin Varma","raw_affiliation_strings":["Boston University, Boston, MA","Pennsylvania State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA","institution_ids":[]},{"raw_affiliation_string":"Pennsylvania State University","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.082944,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"9","issue":"4","first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9093626737594604},{"id":"https://openalex.org/keywords/property-testing","display_name":"Property testing","score":0.8498754501342773},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.738055408000946},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6346083283424377},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6276706457138062},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5807043313980103},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5532413125038147},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5494597554206848},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5181233286857605},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5170881748199463},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49285078048706055},{"id":"https://openalex.org/keywords/worst-case-complexity","display_name":"Worst-case complexity","score":0.4746823012828827},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.43548065423965454},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42290258407592773},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4194800555706024},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39637115597724915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3705947995185852},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3540831208229065}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9093626737594604},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.8498754501342773},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.738055408000946},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6346083283424377},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6276706457138062},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5807043313980103},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5532413125038147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5494597554206848},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5181233286857605},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5170881748199463},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49285078048706055},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.4746823012828827},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.43548065423965454},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42290258407592773},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4194800555706024},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39637115597724915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3705947995185852},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3540831208229065},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3155296","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3155296","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:8147","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.12","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol067-itcs2017/LIPIcs.ITCS.2017.12/LIPIcs.ITCS.2017.12.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.itcs.2017.12","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.itcs.2017.12","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"mag:2729743783","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc24.html#PallavoorRV17","pdf_url":null,"source":{"id":"https://openalex.org/S4306509107","display_name":"Electron. Colloquium Comput. Complex.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electron. Colloquium Comput. Complex.","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:8147","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.12","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol067-itcs2017/LIPIcs.ITCS.2017.12/LIPIcs.ITCS.2017.12.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1594553621","display_name":null,"funder_award_id":"CCF-1422975","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G458201980","display_name":"AF: Small: Sublinear Algorithms for Real Data","funder_award_id":"1422975","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2729743783.pdf","grobid_xml":"https://content.openalex.org/works/W2729743783.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W1786299627","https://openalex.org/W1967290069","https://openalex.org/W1970630090","https://openalex.org/W1973616368","https://openalex.org/W1986542077","https://openalex.org/W1988511047","https://openalex.org/W2001141376","https://openalex.org/W2010461081","https://openalex.org/W2016443407","https://openalex.org/W2018925011","https://openalex.org/W2023146810","https://openalex.org/W2038521541","https://openalex.org/W2055587090","https://openalex.org/W2064609684","https://openalex.org/W2071769989","https://openalex.org/W2079996283","https://openalex.org/W2085693797","https://openalex.org/W2100732817","https://openalex.org/W2105984887","https://openalex.org/W2110769899","https://openalex.org/W2116455242","https://openalex.org/W2145985902","https://openalex.org/W2148336723","https://openalex.org/W2161906179","https://openalex.org/W2212352090","https://openalex.org/W2267350596","https://openalex.org/W2296151834","https://openalex.org/W2343833495","https://openalex.org/W2419099043","https://openalex.org/W2515694000","https://openalex.org/W2592411267","https://openalex.org/W2774995031","https://openalex.org/W2962825398","https://openalex.org/W2963845289","https://openalex.org/W3023302315","https://openalex.org/W3163847447","https://openalex.org/W4235805661"],"related_works":["https://openalex.org/W2773151473","https://openalex.org/W2798477648","https://openalex.org/W3012735815","https://openalex.org/W808328477","https://openalex.org/W1653844607","https://openalex.org/W2255082502","https://openalex.org/W2291046003","https://openalex.org/W2207541471","https://openalex.org/W2001141376","https://openalex.org/W2597370859","https://openalex.org/W3098089233","https://openalex.org/W2898913421","https://openalex.org/W2083503960","https://openalex.org/W2165038808","https://openalex.org/W1986302927","https://openalex.org/W3127553026","https://openalex.org/W1910476567","https://openalex.org/W2963864717","https://openalex.org/W2568886140","https://openalex.org/W2031388544"],"abstract_inverted_index":{"We":[0,172],"investigate":[1],"the":[2,8,27,30,52,60,77,83,106,112,116,119,132,157,183,192,198],"parameters":[3,22,43],"in":[4,57,90,109,189],"terms":[5,58,110,190],"of":[6,10,29,59,74,76,79,102,111,115,118,129,131,186,191],"which":[7],"complexity":[9,78,92,108,141,185],"sublinear-time":[11,80],"algorithms":[12,37,81],"should":[13],"be":[14],"expressed.":[15],"Our":[16,66],"goal":[17],"is":[18,68,195],"to":[19,26,50,69,82],"find":[20],"input":[21,61,120,193],"that":[23,38,85,181],"are":[24,44],"tailored":[25],"combinatorics":[28],"specific":[31],"problem":[32],"being":[33],"studied":[34],"and":[35,127],"design":[36],"run":[39],"faster":[40],"when":[41],"these":[42],"small.":[45],"This":[46],"direction":[47],"enables":[48],"us":[49],"surpass":[51],"(worst-case)":[53],"lower":[54,162],"bounds,":[55],"expressed":[56],"size,":[62],"for":[63,93,125,154,169],"several":[64,174],"problems.":[65],"aim":[67],"develop":[70],"a":[71],"similar":[72],"level":[73],"understanding":[75],"one":[84],"was":[86],"enabled":[87],"by":[88,164],"research":[89],"parameterized":[91,176],"classical":[94],"algorithms.":[95],"Specifically,":[96],"we":[97,122],"focus":[98],"on":[99,149],"testing":[100],"properties":[101],"functions.":[103],"By":[104],"parameterizing":[105],"query":[107,140,184],"size":[113,194],"r":[114,144],"image":[117],"function,":[121],"obtain":[123],"testers":[124,188],"monotonicity":[126,155],"convexity":[128],"functions":[130],"form":[133],"f":[134],":[":[135],"n":[136,150,160],"]\u2192":[137],"R":[138],"with":[139,146],"O":[142],"(log":[143,159],"),":[145],"no":[147],"dependence":[148],".":[151],"The":[152],"result":[153],"circumvents":[156],"\u03a9":[158],")":[161],"bound":[163],"Fischer":[165],"(Inf.":[166],"Comput.":[167],"2004)":[168],"this":[170],"problem.":[171],"present":[173],"other":[175],"testers,":[177],"providing":[178],"compelling":[179],"evidence":[180],"expressing":[182],"property":[187],"not":[196],"always":[197],"best":[199],"choice.":[200]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}