{"id":"https://openalex.org/W2403112319","doi":"https://doi.org/10.1016/0304-3975(95)00149-2","title":"Frequency computation and bounded queries","display_name":"Frequency computation and bounded queries","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W2403112319","doi":"https://doi.org/10.1016/0304-3975(95)00149-2","mag":"2403112319"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(95)00149-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(95)00149-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/0304-3975(95)00149-2","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078715930","display_name":"Richard Beigel","orcid":null},"institutions":[{"id":"https://openalex.org/I267592682","display_name":"Williams (United States)","ror":"https://ror.org/007zhvp17","country_code":"US","type":"company","lineage":["https://openalex.org/I267592682"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Beigel","raw_affiliation_strings":["Dept. of Computer Science, University of Maryland, A.V. Williams Building, College Park, MD 20742, USA","University of Maryland - College Park"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Maryland, A.V. Williams Building, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132","https://openalex.org/I267592682"]},{"raw_affiliation_string":"University of Maryland - College Park","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089274175","display_name":"William Gasarch","orcid":"https://orcid.org/0000-0003-3698-5991"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"William Gasarch","raw_affiliation_strings":["Department of Computer Science, Yale University, P.O. Box 208285, New Haven, CT 06520\u20138285, USA","Yale Univ., New Haven, CT"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yale University, P.O. Box 208285, New Haven, CT 06520\u20138285, USA","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"Yale Univ., New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059343465","display_name":"Efim Kinber","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]},{"id":"https://openalex.org/I2802890147","display_name":"South College","ror":"https://ror.org/01fryje29","country_code":"US","type":"education","lineage":["https://openalex.org/I2802890147"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Efim Kinber","raw_affiliation_strings":["South College and Anstel Computer Information Sciences, University of Delaware, 103 Smith Hall, Newark, DE 19716, USA","University of Delaware,Newark"],"affiliations":[{"raw_affiliation_string":"South College and Anstel Computer Information Sciences, University of Delaware, 103 Smith Hall, Newark, DE 19716, USA","institution_ids":["https://openalex.org/I2802890147","https://openalex.org/I86501945"]},{"raw_affiliation_string":"University of Delaware,Newark","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089274175"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25128639,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"163","issue":"1-2","first_page":"177","last_page":"192"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9965999722480774,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/bounded-function","display_name":"Bounded function","score":0.6856629848480225},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5678392648696899},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5664382576942444},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5608739852905273},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5181359052658081},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5054006576538086},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5047668218612671},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.482428640127182},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4745382070541382},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4592748284339905},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4244835078716278},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42076390981674194},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3486284613609314},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2384623885154724}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6856629848480225},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5678392648696899},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5664382576942444},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5608739852905273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5181359052658081},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5054006576538086},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5047668218612671},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.482428640127182},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4745382070541382},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4592748284339905},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4244835078716278},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42076390981674194},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3486284613609314},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2384623885154724},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/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":4,"locations":[{"id":"doi:10.1016/0304-3975(95)00149-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(95)00149-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.2505","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.2505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.uic.edu/~beigel/papers/bgk-queries-draft.PS.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.56.868","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.868","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.informatik.uni-trier.de/pub/Users-CTVD/eccc/reports/1995/TR95-036/Paper.ps","raw_type":"text"},{"id":"mag:2403112319","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc2.html#ECCC-TR95-036","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"doi:10.1016/0304-3975(95)00149-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(95)00149-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1589130411","https://openalex.org/W1967660233","https://openalex.org/W1967915758","https://openalex.org/W1995304514","https://openalex.org/W2037662783","https://openalex.org/W2047808405","https://openalex.org/W2068666632","https://openalex.org/W2072181151","https://openalex.org/W2140050124","https://openalex.org/W2157562358","https://openalex.org/W2160493389","https://openalex.org/W2476181846","https://openalex.org/W6602070116","https://openalex.org/W6607751785","https://openalex.org/W6611399372","https://openalex.org/W6632058552","https://openalex.org/W6659160143","https://openalex.org/W6678651474","https://openalex.org/W6680731100","https://openalex.org/W7033973274","https://openalex.org/W7073700710"],"related_works":["https://openalex.org/W3129458497","https://openalex.org/W1993390207","https://openalex.org/W2953323745","https://openalex.org/W2949214562","https://openalex.org/W2963533953","https://openalex.org/W2405936819","https://openalex.org/W2914656101","https://openalex.org/W2918185090","https://openalex.org/W2114187680","https://openalex.org/W2912512664","https://openalex.org/W2950378059","https://openalex.org/W2951874253","https://openalex.org/W2086814302","https://openalex.org/W2555351142","https://openalex.org/W2952096016","https://openalex.org/W147059047","https://openalex.org/W2949178158","https://openalex.org/W3167321720","https://openalex.org/W2984858782","https://openalex.org/W2888250735"],"abstract_inverted_index":{"There":[0],"have":[1,83],"been":[2,31],"several":[3],"papers":[4],"over":[5],"the":[6,12,44,49,104,128],"last":[7],"ten":[8],"years":[9],"that":[10,35,67,91],"consider":[11],"number":[13,50],"of":[14,24,48,51,53],"queries":[15],"needed":[16],"to":[17,99],"compute":[18],"a":[19,22,59,78],"function":[20,29,65],"as":[21],"measure":[23],"its":[25],"complexity.":[26],"The":[27],"following":[28],"has":[30],"studied":[32],"extensively":[33],"in":[34,43],"light:":[36],"FaA(x1,\u2026,xa)":[37,68],"=":[38,119],"A(x1)\u2026A(xa).":[39],"We":[40,121],"are":[41,97],"interested":[42],"complexity":[45],"(in":[46],"terms":[47],"queries)":[52],"approximating":[54],"FaA.":[55],"Let":[56],"b":[57,75],"\u2a7d":[58],"and":[60,69,86,113],"let":[61],"f":[62,90],"be":[63],"any":[64],"such":[66],"f(x1,\u2026,xa)":[70],"agree":[71],"on":[72,89,93],"at":[73],"least":[74],"bits.":[76],"For":[77],"general":[79],"set":[80],"A":[81,107,110,118,126],"we":[82],"matching":[84],"upper":[85],"lower":[87],"bounds":[88,102,124],"depend":[92],"coding":[94],"theory.":[95],"These":[96],"applied":[98],"get":[100],"exact":[101,123],"for":[103],"case":[105],"where":[106],"is":[108,111,127],"semirecursive,":[109],"superterse,":[112],"(assuming":[114],"P":[115],"\u2260":[116],"NP)":[117],"SAT.":[120],"obtain":[122],"when":[125],"halting":[129],"problem":[130],"using":[131],"different":[132],"methods.":[133]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}