{"id":"https://openalex.org/W2063573129","doi":null,"title":"Trace reconstruction with constant deletion probability and related results","display_name":"Trace reconstruction with constant deletion probability and related results","publication_year":2008,"publication_date":"2008-01-20","ids":{"openalex":"https://openalex.org/W2063573129","mag":"2063573129"},"language":"en","primary_location":{"id":"mag:2063573129","doi":null,"is_oa":false,"landing_page_url":"https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/soda_deletion_submit.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003729831","display_name":"Thomas Holenstein","orcid":"https://orcid.org/0000-0003-0261-3292","observed_orcids":["https://orcid.org/0000-0003-0261-3292"]},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Holenstein","raw_affiliation_strings":["Microsoft Research, Silicon, Valley"],"raw_orcid":"https://orcid.org/0000-0003-0261-3292","affiliations":[{"raw_affiliation_string":"Microsoft Research, Silicon, Valley","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062318856","display_name":"Michael Mitzenmacher","orcid":"https://orcid.org/0000-0001-5430-5457","observed_orcids":["https://orcid.org/0000-0001-5430-5457"]},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Mitzenmacher","raw_affiliation_strings":["Harvard School of Engineering & Applied Sciences, Cambridge, MA"],"raw_orcid":"https://orcid.org/0000-0001-5430-5457","affiliations":[{"raw_affiliation_string":"Harvard School of Engineering & Applied Sciences, Cambridge, MA","institution_ids":["https://openalex.org/I136199984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085651536","display_name":"Rina Panigrahy\u200e","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rina Panigrahy\u200e","raw_affiliation_strings":["Microsoft Research, Silicon, Valley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Silicon, Valley","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025142058","display_name":"Udi Wieder","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Udi Wieder","raw_affiliation_strings":["Microsoft Research, Silicon, Valley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Silicon, Valley","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5492,"has_fulltext":false,"cited_by_count":89,"citation_normalized_percentile":{"value":0.57446809,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"389","last_page":"398"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9839000105857849,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9839000105857849,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.009399999864399433,"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/T12288","display_name":"Optimization and Search Problems","score":0.001500000013038516,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/trace-reconstruction","display_name":"trace reconstruction","score":0.9990000128746033},{"id":"https://openalex.org/keywords/deletion-channel","display_name":"deletion channel","score":0.4580000042915344},{"id":"https://openalex.org/keywords/binary-strings","display_name":"binary strings","score":0.7360000014305115},{"id":"https://openalex.org/keywords/reconstruction-algorithms","display_name":"reconstruction algorithms","score":0.7670000195503235},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.4350000023841858}],"concepts":[{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.8414021730422974},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.7469323873519897},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6541183590888977},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6313028931617737},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5733630061149597},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5144248604774475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4987800121307373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47071903944015503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4593416154384613},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.41702941060066223},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34249335527420044},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3398963212966919},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.14425405859947205},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06480935215950012},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2063573129","doi":null,"is_oa":false,"landing_page_url":"https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/soda_deletion_submit.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1967505984","https://openalex.org/W1969151232","https://openalex.org/W1996160600","https://openalex.org/W2025177415","https://openalex.org/W2094438648","https://openalex.org/W2101549738","https://openalex.org/W2117885262","https://openalex.org/W2170484108"],"related_works":["https://openalex.org/W4411319997","https://openalex.org/W3177833205","https://openalex.org/W3111446401","https://openalex.org/W2565322834","https://openalex.org/W4406143076","https://openalex.org/W2743775201","https://openalex.org/W4405029607","https://openalex.org/W2564763601","https://openalex.org/W2783580658","https://openalex.org/W1133414672"],"abstract_inverted_index":{"We":[0,108],"provide":[1],"several":[2],"new":[3],"results":[4],"for":[5,70,85,97,122],"the":[6,46,50,56,76],"trace":[7,23,38],"reconstruction":[8,77],"problem.":[9],"In":[10],"this":[11],"setting,":[12],"a":[13,17,33,42,114],"binary":[14],"string":[15,58],"yields":[16],"collection":[18],"of":[19,41,45,94,116],"traces,":[20,51],"where":[21],"each":[22,30],"is":[24,83],"independently":[25,28],"obtained":[26],"by":[27],"deleting":[29],"bit":[31],"with":[32,59,105],"fixed":[34],"probability":[35],"\u0394.":[36],"Each":[37],"therefore":[39],"consists":[40],"random":[43],"subsequence":[44],"original":[47,57],"sequence.":[48],"Given":[49],"we":[52],"wish":[53],"to":[54],"reconstruct":[55],"high":[60,106],"probability.":[61,107],"The":[62],"questions":[63],"are":[64,68],"how":[65,73],"many":[66],"traces":[67,101,117],"necessary":[69],"reconstruction,":[71],"and":[72,90],"efficiently":[74],"can":[75],"be":[78],"performed.":[79],"Our":[80],"primary":[81],"result":[82],"that":[84,112],"some":[86],"universal":[87],"constant":[88],"\u03b3":[89],"uniformly":[91],"chosen":[92],"strings":[93],"length":[95],"n,":[96],"any":[98,123],"\u0394":[99,124],"n)":[100],"in":[102,119],"poly(n)":[103],"time":[104],"also":[109],"obtain":[110],"algorithms":[111],"require":[113],"number":[115],"exponential":[118],"O":[120],"(\u221an)":[121]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}