{"id":"https://openalex.org/W2919058506","doi":"https://doi.org/10.1145/3385650","title":"A Sequential Importance Sampling Algorithm for Counting Linear Extensions","display_name":"A Sequential Importance Sampling Algorithm for Counting Linear Extensions","publication_year":2020,"publication_date":"2020-05-03","ids":{"openalex":"https://openalex.org/W2919058506","doi":"https://doi.org/10.1145/3385650","mag":"2919058506"},"language":"en","primary_location":{"id":"doi:10.1145/3385650","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3385650","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1902.01704","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Alathea Jensen","orcid":"https://orcid.org/0000-0002-2399-0815"},"institutions":[{"id":"https://openalex.org/I161140089","display_name":"Susquehanna University","ror":"https://ror.org/02nmnpn85","country_code":"US","type":"education","lineage":["https://openalex.org/I161140089"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alathea Jensen","raw_affiliation_strings":["Susquehanna University, Selinsgrove, PA"],"raw_orcid":"https://orcid.org/0000-0002-2399-0815","affiliations":[{"raw_affiliation_string":"Susquehanna University, Selinsgrove, PA","institution_ids":["https://openalex.org/I161140089"]}]},{"author_position":"last","author":{"id":null,"display_name":"Isabel Beichl","orcid":null},"institutions":[{"id":"https://openalex.org/I1321296531","display_name":"National Institute of Standards and Technology","ror":"https://ror.org/05xpvk416","country_code":"US","type":"funder","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Isabel Beichl","raw_affiliation_strings":["National Institute of Standards and Technology, Gaithersburg, MD"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Standards and Technology, Gaithersburg, MD","institution_ids":["https://openalex.org/I1321296531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2131,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51206665,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":null,"first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.7978000044822693,"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"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.7978000044822693,"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/T11720","display_name":"Probability and Risk Models","score":0.07339999824762344,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.014700000174343586,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.5964999794960022},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5680000185966492},{"id":"https://openalex.org/keywords/rejection-sampling","display_name":"Rejection sampling","score":0.4690000116825104},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4683000147342682},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.46070000529289246},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.46050000190734863},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.45879998803138733},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43540000915527344},{"id":"https://openalex.org/keywords/importance-sampling","display_name":"Importance sampling","score":0.3953000009059906}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6384000182151794},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.5964999794960022},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5680000185966492},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5623000264167786},{"id":"https://openalex.org/C187192777","wikidata":"https://www.wikidata.org/wiki/Q381699","display_name":"Rejection sampling","level":5,"score":0.4690000116825104},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4683000147342682},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.46070000529289246},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.46050000190734863},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.45879998803138733},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43540000915527344},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.3953000009059906},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3781999945640564},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36899998784065247},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3677999973297119},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3458000123500824},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3343000113964081},{"id":"https://openalex.org/C86426650","wikidata":"https://www.wikidata.org/wiki/Q7452504","display_name":"Sequential estimation","level":2,"score":0.32989999651908875},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.32919999957084656},{"id":"https://openalex.org/C2781104640","wikidata":"https://www.wikidata.org/wiki/Q11827313","display_name":"Counting process","level":2,"score":0.32580000162124634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31779998540878296},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.3001999855041504},{"id":"https://openalex.org/C158424031","wikidata":"https://www.wikidata.org/wiki/Q1191905","display_name":"Gibbs sampling","level":3,"score":0.2969000041484833},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.29499998688697815},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C170593435","wikidata":"https://www.wikidata.org/wiki/Q4128565","display_name":"Slice sampling","level":4,"score":0.2874000072479248},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.27639999985694885},{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.27399998903274536},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2728999853134155},{"id":"https://openalex.org/C60782215","wikidata":"https://www.wikidata.org/wiki/Q3333679","display_name":"Probabilistic method","level":3,"score":0.26080000400543213}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3385650","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3385650","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1902.01704","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1902.01704","pdf_url":"https://arxiv.org/pdf/1902.01704","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:scholarlycommons.susqu.edu:math_fac_pubs-1017","is_oa":false,"landing_page_url":"https://arxiv.org/abs/1902.01704","pdf_url":null,"source":{"id":"https://openalex.org/S4377196735","display_name":"Scholarly Commons - Susquehanna University Research (Susquehanna University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I161140089","host_organization_name":"Susquehanna University","host_organization_lineage":["https://openalex.org/I161140089"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Sciences Faculty Publications","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1902.01704","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1902.01704","pdf_url":"https://arxiv.org/pdf/1902.01704","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W788570312","https://openalex.org/W1967241521","https://openalex.org/W1974745849","https://openalex.org/W1981755798","https://openalex.org/W2025893614","https://openalex.org/W2043805242","https://openalex.org/W2063123613","https://openalex.org/W2077135574","https://openalex.org/W2110920860","https://openalex.org/W2179435707","https://openalex.org/W2436549090","https://openalex.org/W2735102987","https://openalex.org/W2889662987","https://openalex.org/W2947903189","https://openalex.org/W2963807417","https://openalex.org/W4230870880"],"related_works":[],"abstract_inverted_index":{"In":[0,60],"recent":[1],"decades,":[2],"a":[3,26,38,63,83,98,114,124,180],"number":[4,33,85],"of":[5,10,19,25,34,37,43,86,89,93,110,117,141,154],"profound":[6],"theorems":[7],"concerning":[8],"approximation":[9],"hard":[11],"counting":[12,30,144,167],"problems":[13],"have":[14,46],"appeared.":[15],"These":[16],"include":[17],"estimation":[18],"the":[20,23,32,152,155,164,175],"permanent,":[21],"estimating":[22,151],"volume":[24],"convex":[27],"polyhedron,":[28],"and":[29,113,188],"(approximately)":[31],"linear":[35,145],"extensions":[36],"partially":[39],"ordered":[40],"set.":[41],"All":[42],"these":[44,94,142],"results":[45,95],"been":[47],"achieved":[48],"using":[49],"probabilistic":[50],"sampling":[51,183],"methods,":[52],"specifically":[53],"Monte":[54,136],"Carlo":[55,137],"Markov":[56,66],"Chain":[57],"(MCMC)":[58],"techniques.":[59],"each":[61],"case,":[62],"rapidly":[64],"mixing":[65],"chain":[67],"is":[68,71,119,132,160],"defined":[69],"that":[70],"guaranteed":[72],"to":[73,97,121,133],"produce,":[74],"with":[75],"high":[76,111],"probability,":[77],"an":[78,171],"accurate":[79],"result":[80],"after":[81],"only":[82],"polynomial":[84,90],"operations.":[87],"Although":[88],"complexity,":[91],"none":[92],"lead":[96],"practical":[99,135],"computational":[100],"technique,":[101],"nor":[102],"do":[103],"they":[104],"claim":[105],"to.":[106],"The":[107],"polynomials":[108],"are":[109],"degree":[112],"non-trivial":[115],"amount":[116],"computing":[118],"required":[120],"get":[122],"even":[123],"single":[125],"sample.":[126],"Our":[127],"aim":[128],"in":[129],"this":[130],"article":[131],"present":[134],"methods":[138],"for":[139],"one":[140],"problems,":[143],"extensions.":[146],"Like":[147],"related":[148],"work":[149],"on":[150,162,191],"coefficients":[153],"reliability":[156],"polynomial,":[157],"our":[158],"technique":[159,178],"based":[161],"improving":[163],"so-called":[165],"Knuth":[166],"algorithm":[168],"by":[169],"incorporating":[170],"importance":[172,182,193],"function":[173],"into":[174],"node":[176],"selection":[177],"giving":[179],"sequential":[181],"(SIS)":[184],"method.":[185],"We":[186],"define":[187],"report":[189],"performance":[190],"two":[192],"functions.":[194]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2019-03-11T00:00:00"}