{"id":"https://openalex.org/W2578342868","doi":"https://doi.org/10.1017/s0963548320000085","title":"Pointer chasing via triangular discrimination","display_name":"Pointer chasing via triangular discrimination","publication_year":2020,"publication_date":"2020-05-15","ids":{"openalex":"https://openalex.org/W2578342868","doi":"https://doi.org/10.1017/s0963548320000085","mag":"2578342868"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548320000085","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548320000085","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1792C00D506C602217BB778835A990FD/S0963548320000085a.pdf/div-class-title-pointer-chasing-via-triangular-discrimination-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1792C00D506C602217BB778835A990FD/S0963548320000085a.pdf/div-class-title-pointer-chasing-via-triangular-discrimination-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041051779","display_name":"Amir Yehudayoff","orcid":"https://orcid.org/0000-0002-0177-1814"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Amir Yehudayoff","raw_affiliation_strings":["Department of Mathematics, Technion \u2013 Israel Institute of Technology, Haifa32000, Israel, Email:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technion \u2013 Israel Institute of Technology, Haifa32000, Israel, Email:","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041051779"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":3.8163,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94496733,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"29","issue":"4","first_page":"485","last_page":"494"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9884999990463257,"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.9884999990463257,"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/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9796000123023987,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.97079998254776,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.8896799087524414},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.726871132850647},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6074784994125366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4768185019493103},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4747258424758911},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.423258513212204},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4155810475349426},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08704090118408203},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06242555379867554}],"concepts":[{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.8896799087524414},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.726871132850647},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6074784994125366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4768185019493103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4747258424758911},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.423258513212204},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4155810475349426},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08704090118408203},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06242555379867554}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548320000085","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548320000085","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1792C00D506C602217BB778835A990FD/S0963548320000085a.pdf/div-class-title-pointer-chasing-via-triangular-discrimination-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"mag:2578342868","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc23.html#Yehudayoff16","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.1017/s0963548320000085","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548320000085","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1792C00D506C602217BB778835A990FD/S0963548320000085a.pdf/div-class-title-pointer-chasing-via-triangular-discrimination-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5600000023841858,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320273","display_name":"University of Cambridge","ror":"https://ror.org/013meh722"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2578342868.pdf","grobid_xml":"https://content.openalex.org/works/W2578342868.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1513349005","https://openalex.org/W1912027225","https://openalex.org/W1979615282","https://openalex.org/W2022444580","https://openalex.org/W2025352788","https://openalex.org/W2037817744","https://openalex.org/W2038255135","https://openalex.org/W2043356449","https://openalex.org/W2043522657","https://openalex.org/W2055309977","https://openalex.org/W2070486524","https://openalex.org/W2073639613","https://openalex.org/W2076688599","https://openalex.org/W2083425572","https://openalex.org/W2083432171","https://openalex.org/W2086076777","https://openalex.org/W2093303125","https://openalex.org/W2131587307","https://openalex.org/W2159902206","https://openalex.org/W4211003473","https://openalex.org/W6688344138"],"related_works":["https://openalex.org/W3024696485","https://openalex.org/W2070486524","https://openalex.org/W2021016639","https://openalex.org/W2569757174","https://openalex.org/W2424986266","https://openalex.org/W2165753192","https://openalex.org/W2148137544","https://openalex.org/W2107917944","https://openalex.org/W2016289973","https://openalex.org/W1981620197","https://openalex.org/W2963034343","https://openalex.org/W2788015272","https://openalex.org/W2605016360","https://openalex.org/W2340787257","https://openalex.org/W2258899852","https://openalex.org/W2083432171","https://openalex.org/W2002501531","https://openalex.org/W1980223785","https://openalex.org/W1979790324","https://openalex.org/W1639030016"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"prove":[2],"an":[3,34],"essentially":[4,46],"sharp":[5],"$\\tilde":[6,40],"\\Omega":[7,41],"(n/k)$":[8],"lower":[9,43,50],"bound":[10,51],"on":[11],"the":[12,18,25,48],"k":[13,19],"-round":[14],"distributional":[15],"complexity":[16],"of":[17,63,71],"-step":[20],"pointer":[21],"chasing":[22],"problem":[23],"under":[24],"uniform":[26],"distribution,":[27],"when":[28],"Bob":[29],"speaks":[30],"first.":[31],"This":[32],"is":[33,57,65],"improvement":[35],"over":[36],"Nisan":[37],"and":[38,45,59],"Wigderson\u2019s":[39],"(n/{k^2})$":[42],"bound,":[44],"matches":[47],"randomized":[49],"proved":[52],"by":[53],"Klauck.":[54],"The":[55],"proof":[56],"information-theoretic,":[58],"a":[60],"key":[61],"part":[62],"it":[64],"using":[66],"asymmetric":[67],"triangular":[68],"discrimination":[69],"instead":[70],"total":[72],"variation":[73],"distance;":[74],"this":[75],"idea":[76],"may":[77],"be":[78],"useful":[79],"elsewhere.":[80]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":23},{"year":2019,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}