Publication Information

{'id': 'https://openalex.org/W3000889303', 'doi': None, 'title': 'Approximating the Distance to Monotonicity of Boolean Functions.', 'display_name': 'Approximating the Distance to Monotonicity of Boolean Functions.', 'publication_year': 2019, 'publication_date': '2019-01-01', 'ids': {'openalex': 'https://openalex.org/W3000889303', 'mag': '3000889303'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://dblp.uni-trier.de/db/journals/eccc/eccc26.html#PallavoorRW19', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306509107', 'display_name': 'Electron. Colloquium Comput. Complex.', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': [], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, '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/I111088046', 'display_name': 'Boston University', 'ror': 'https://ror.org/05qwgg493', 'country_code': 'US', 'type': 'education', 'lineage': ['https://openalex.org/I111088046']}], 'countries': ['US'], 'is_corresponding': False, 'raw_author_name': 'Ramesh Krishnan S. Pallavoor', 'raw_affiliation_strings': ['Department of Computer Science, Boston University, Boston, Massachusetts, USA'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science, Boston University, Boston, Massachusetts, USA', 'institution_ids': ['https://openalex.org/I111088046']}]}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5080839778', 'display_name': 'Sofya Raskhodnikova', 'orcid': 'https://orcid.org/0000-0002-4902-050X'}, 'institutions': [{'id': 'https://openalex.org/I111088046', 'display_name': 'Boston University', 'ror': 'https://ror.org/05qwgg493', 'country_code': 'US', 'type': 'education', 'lineage': ['https://openalex.org/I111088046']}], 'countries': ['US'], 'is_corresponding': False, 'raw_author_name': 'Sofya Raskhodnikova', 'raw_affiliation_strings': ['Department of Computer Science, Boston University, Boston, Massachusetts, USA'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science, Boston University, Boston, Massachusetts, USA', 'institution_ids': ['https://openalex.org/I111088046']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5091677337', 'display_name': 'Erik Waingarten', 'orcid': 'https://orcid.org/0000-0003-0097-7981'}, 'institutions': [{'id': 'https://openalex.org/I78577930', 'display_name': 'Columbia University', 'ror': 'https://ror.org/00hj8s172', 'country_code': 'US', 'type': 'education', 'lineage': ['https://openalex.org/I78577930']}], 'countries': ['US'], 'is_corresponding': False, 'raw_author_name': 'Erik Waingarten', 'raw_affiliation_strings': ['Department of Computer Science, Columbia University New York, New York, USA'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science, Columbia University New York, New York, USA', 'institution_ids': ['https://openalex.org/I78577930']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 2, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': False, 'cited_by_count': 0, 'citation_normalized_percentile': {'value': 0.0, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 0, 'max': 61}, 'biblio': {'volume': '26', 'issue': None, 'first_page': '163', 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10720', 'display_name': 'Complexity and Algorithms in Graphs', 'score': 0.9982, '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'}}, 'topics': [{'id': 'https://openalex.org/T10720', 'display_name': 'Complexity and Algorithms in Graphs', 'score': 0.9982, '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/T12072', 'display_name': 'Machine Learning and Algorithms', 'score': 0.9913, '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/T11303', 'display_name': 'Bayesian Modeling and Causal Inference', 'score': 0.9794, '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/property-testing', 'display_name': 'Property testing', 'score': 0.8829476}, {'id': 'https://openalex.org/keywords/erasure', 'display_name': 'Erasure', 'score': 0.4716579}, {'id': 'https://openalex.org/keywords/constant', 'display_name': 'Constant (computer programming)', 'score': 0.44960833}], 'concepts': [{'id': 'https://openalex.org/C123842658', 'wikidata': 'https://www.wikidata.org/wiki/Q2918980', 'display_name': 'Property testing', 'level': 2, 'score': 0.8829476}, {'id': 'https://openalex.org/C72169020', 'wikidata': 'https://www.wikidata.org/wiki/Q194404', 'display_name': 'Monotonic function', 'level': 2, 'score': 0.7425965}, {'id': 'https://openalex.org/C77553402', 'wikidata': 'https://www.wikidata.org/wiki/Q13222579', 'display_name': 'Upper and lower bounds', 'level': 2, 'score': 0.69876844}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.67362916}, {'id': 'https://openalex.org/C187455244', 'wikidata': 'https://www.wikidata.org/wiki/Q942353', 'display_name': 'Boolean function', 'level': 2, 'score': 0.6492053}, {'id': 'https://openalex.org/C2834757', 'wikidata': 'https://www.wikidata.org/wiki/Q4925424', 'display_name': 'Monotone polygon', 'level': 2, 'score': 0.57915056}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.56982976}, {'id': 'https://openalex.org/C14036430', 'wikidata': 'https://www.wikidata.org/wiki/Q3736076', 'display_name': 'Function (biology)', 'level': 2, 'score': 0.54702526}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.5419676}, {'id': 'https://openalex.org/C189950617', 'wikidata': 'https://www.wikidata.org/wiki/Q937228', 'display_name': 'Property (philosophy)', 'level': 2, 'score': 0.5341173}, {'id': 'https://openalex.org/C55166926', 'wikidata': 'https://www.wikidata.org/wiki/Q2892946', 'display_name': 'Oracle', 'level': 2, 'score': 0.49006498}, {'id': 'https://openalex.org/C2778790127', 'wikidata': 'https://www.wikidata.org/wiki/Q484885', 'display_name': 'Erasure', 'level': 2, 'score': 0.4716579}, {'id': 'https://openalex.org/C2777027219', 'wikidata': 'https://www.wikidata.org/wiki/Q1284190', 'display_name': 'Constant (computer programming)', 'level': 2, 'score': 0.44960833}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.3463921}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.18920913}, {'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/C138885662', 'wikidata': 'https://www.wikidata.org/wiki/Q5891', 'display_name': 'Philosophy', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C2524010', 'wikidata': 'https://www.wikidata.org/wiki/Q8087', 'display_name': 'Geometry', 'level': 1, 'score': 0.0}, {'id': 'https://openalex.org/C115903868', 'wikidata': 'https://www.wikidata.org/wiki/Q80993', 'display_name': 'Software engineering', '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/C78458016', 'wikidata': 'https://www.wikidata.org/wiki/Q840400', 'display_name': 'Evolutionary biology', '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/C199360897', 'wikidata': 'https://www.wikidata.org/wiki/Q9143', 'display_name': 'Programming language', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://dblp.uni-trier.de/db/journals/eccc/eccc26.html#PallavoorRW19', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306509107', 'display_name': 'Electron. Colloquium Comput. Complex.', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 0, 'referenced_works': [], 'related_works': ['https://openalex.org/W3167321720', 'https://openalex.org/W2987627012', 'https://openalex.org/W2964146933', 'https://openalex.org/W2963146668', 'https://openalex.org/W2953323745', 'https://openalex.org/W2952431058', 'https://openalex.org/W2950398502', 'https://openalex.org/W2949895007', 'https://openalex.org/W2912512664', 'https://openalex.org/W2785084575', 'https://openalex.org/W2767632300', 'https://openalex.org/W2612138618', 'https://openalex.org/W2593853527', 'https://openalex.org/W2394592467', 'https://openalex.org/W2167217679', 'https://openalex.org/W2083348414', 'https://openalex.org/W1988511047', 'https://openalex.org/W1963494112', 'https://openalex.org/W1807114442', 'https://openalex.org/W1699753700'], 'abstract_inverted_index': {'We': [0, 130], 'design': [1], 'a': [2, 7, 71, 81, 99, 147, 154, 207, 227], 'nonadaptive': [3, 66, 74], 'algorithm': [4, 75], 'that,': [5, 30], 'given': [6], 'Boolean': [8], 'function': [9, 155, 188, 208], 'f': [10, 42], ':': [11], '{0,': [12, 15], '1}n': [13], '→': [14], '1}': [16], 'which': [17], 'is': [18, 34, 101, 210], 'α-far': [19], 'from': [20, 212], 'monotone,': [21], 'makes': [22], 'poly(n,': [23, 72], '1/α)': [24], 'queries': [25], 'and': [26, 192, 225], 'returns': [27], 'an': [28, 35, 137, 160], 'estimate': [29], 'with': [31, 126], 'high': [32], 'probability,': [33], '[MATH': [36, 64, 127], 'HERE]-approximation': [37], 'to': [38, 43, 58, 61, 98, 104, 115, 153, 169, 183, 193], 'the': [39, 56, 90, 96, 177, 186, 190, 214, 219, 235], 'distance': [40, 57, 97], 'of': [41, 83, 92, 119, 163, 203], 'monotonicity.': [44], 'Furthermore,': [45], 'we': [46], 'show': [47], 'that': [48, 107, 121, 156, 185, 209], 'for': [49, 76, 89, 140, 146, 223, 239], 'any': [50], 'constant': [51], 'k': [52], '>': [53], '0,': [54], 'approximating': [55], 'monotonicity': [59, 120], 'up': [60], 'n1/2−k-factor': [62], 'requires': [63], 'HERE]': [65, 128], 'queries,': [67], 'thereby': [68], 'ruling': [69], 'out': [70], '1/α)-query': [73], 'such': [77], 'approximations.': [78], 'This': [79], 'answers': [80], 'question': [82], 'Seshadhri': [84], '(Property': [85], 'Testing': [86], 'Review,': [87], '2014)': [88], 'case': [91], 'non-adaptive': [93], 'algorithms.': [94], 'Approximating': [95], 'property': [100, 149, 191], 'closely': [102], 'related': [103], 'tolerantly': [105], 'testing': [106, 118], 'property.': [108, 215], 'Our': [109, 216], 'lower': [110, 133, 221, 230, 237], 'bound': [111, 134, 139], 'stands': [112], 'in': [113, 182, 206], 'contrast': [114], 'standard': [116], '(non-tolerant)': [117], 'can': [122, 179], 'be': [123, 180], 'done': [124], 'nonadaptively': [125], 'queries.': [129], 'obtain': [131], 'our': [132], 'by': [135], 'proving': [136], 'analogous': [138], 'erasure-resilient': [141], 'testers.': [142], 'An': [143], 'α-erasure-resilient': [144], 'tester': [145, 167], 'desired': [148], 'gets': [150], 'oracle': [151], 'access': [152], 'has': [157, 168, 189], 'at': [158, 173, 197], 'most': [159], 'α': [161], 'fraction': [162], 'values': [164], 'erased.': [165], 'The': [166], 'accept': [170], '(with': [171, 195], 'probability': [172, 196], 'least': [174, 198], '2/3)': [175, 199], 'if': [176, 200], 'erasures': [178, 204], 'filled': [181], 'ensure': [184], 'resulting': [187], 'reject': [194], 'every': [201], 'completion': [202], 'results': [205], 'e-far': [211], 'having': [213], 'method': [217], 'yields': [218], 'same': [220], 'bounds': [222, 231, 238], 'unateness': [224], 'being': [226], 'k-junta.': [228], 'These': [229], 'improve': [232], 'exponentially': [233], 'on': [234], 'existing': [236], 'these': [240], 'properties.': [241]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W3000889303', 'counts_by_year': [], 'updated_date': '2024-12-15T09:29:25.879771', 'created_date': '2020-01-30'}