{"id":"https://openalex.org/W2164819599","doi":"https://doi.org/10.1109/date.2011.5763013","title":"A scaled random walk solver for fast power grid analysis","display_name":"A scaled random walk solver for fast power grid analysis","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W2164819599","doi":"https://doi.org/10.1109/date.2011.5763013","mag":"2164819599"},"language":"en","primary_location":{"id":"doi:10.1109/date.2011.5763013","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2011.5763013","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Design, Automation & Test in Europe","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"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/A5060945687","display_name":"Baktash Boghrati","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"B Boghrati","raw_affiliation_strings":["University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068714995","display_name":"Sachin S. Sapatnekar","orcid":"https://orcid.org/0000-0002-5353-2364"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S Sapatnekar","raw_affiliation_strings":["University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":0.2873,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53402441,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9994000196456909,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9994000196456909,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9921000003814697,"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/random-walk","display_name":"Random walk","score":0.8255298733711243},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7265790700912476},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6365596055984497},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6246853470802307},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5193291902542114},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5029794573783875},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4246731698513031},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3771460950374603},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2105334997177124},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1032719612121582}],"concepts":[{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.8255298733711243},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7265790700912476},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6365596055984497},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6246853470802307},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5193291902542114},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5029794573783875},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4246731698513031},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3771460950374603},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2105334997177124},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1032719612121582},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/date.2011.5763013","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2011.5763013","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Design, Automation & Test in Europe","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.2647","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.2647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ee.umn.edu/users/sachin/conf/date11bb.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2087018957","https://openalex.org/W2096784381","https://openalex.org/W2099647435","https://openalex.org/W2130464226","https://openalex.org/W2135330947","https://openalex.org/W2155571529","https://openalex.org/W2167064216","https://openalex.org/W2167232953","https://openalex.org/W2321238704","https://openalex.org/W4241562627","https://openalex.org/W4256354365","https://openalex.org/W6675206292","https://openalex.org/W6679942403"],"related_works":["https://openalex.org/W3207760230","https://openalex.org/W1496222301","https://openalex.org/W1590307681","https://openalex.org/W4312814274","https://openalex.org/W4285370786","https://openalex.org/W2296488620","https://openalex.org/W2358353312","https://openalex.org/W2353836703","https://openalex.org/W41015297","https://openalex.org/W2004285327"],"abstract_inverted_index":{"The":[0],"analysis":[1],"of":[2,9,12,22,33,46,74,102,109],"on-chip":[3],"power":[4,63],"grids":[5],"requires":[6],"the":[7,47,62,72,75,84,100,107,127],"solution":[8],"large":[10,81,89],"systems":[11],"linear":[13],"algebraic":[14],"equations":[15],"with":[16],"specific":[17],"properties.":[18],"Lately,":[19],"a":[20,43,56],"class":[21],"random":[23,85,110,123,129],"walk":[24,111,130],"based":[25,112],"solvers":[26],"have":[27],"been":[28],"developed":[29],"that":[30,59],"are":[31,38],"capable":[32],"handling":[34],"these":[35,37],"systems:":[36],"especially":[39],"useful":[40],"when":[41],"only":[42],"small":[44],"part":[45],"original":[48],"system":[49],"must":[50],"be":[51],"solved.":[52],"These":[53],"methods":[54],"build":[55],"probabilistic":[57],"network":[58],"corresponds":[60],"to":[61,105,121],"grid.":[64],"However,":[65],"this":[66],"construction":[67],"does":[68],"not":[69],"fully":[70],"exploit":[71],"properties":[73],"problem":[76],"and":[77,87],"can":[78],"result":[79],"in":[80],"variances":[82],"for":[83],"walks,":[86],"consequently,":[88],"run":[90],"times.":[91],"This":[92],"paper":[93],"presents":[94],"an":[95],"efficient":[96],"methodology,":[97],"inspired":[98],"by":[99,126],"idea":[101],"importance":[103],"sampling,":[104],"improve":[106],"runtime":[108],"solvers.":[113,131],"Experimental":[114],"results":[115],"show":[116],"significant":[117],"speedups,":[118],"as":[119],"compared":[120],"naive":[122],"walks":[124],"used":[125],"state-of-the-art":[128]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}