[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_250":251},"routes/_layout",{"_11":160},"routes/entity.$type.$id",{"_11":12,"_13":14,"_15":16,"_17":-5,"_18":19,"_20":21,"_22":23,"_24":-7,"_25":26},"dehydratedState",{"_58":59,"_60":61},"type","person","id","person_A5086787265","section","entity",{"_15":16,"_27":28,"_29":-5,"_30":-5,"_31":-5,"_32":-5,"_33":34,"_35":36,"_37":-5,"_38":39,"_40":41,"_42":43,"_44":45,"_46":-5,"_47":-5,"_48":-5,"_49":-5,"_50":-5,"_51":-5,"_52":-5,"_53":-5,"_54":-5,"_55":-5,"_56":28,"_57":-5},"canonical","https://www.hugmap.com/entity/person/person_A5086787265","siteBaseUrl","https://www.hugmap.com","sectionCount","jsonLd","{\"@context\":\"https://schema.org\",\"@graph\":[{\"name\":\"Aaron Sidford\",\"url\":\"https://www.hugmap.com/entity/person/person_A5086787265\",\"@type\":\"Person\",\"jobTitle\":null},{\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"首页\",\"item\":\"https://www.hugmap.com/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"人物\",\"item\":\"https://www.hugmap.com/search?type=person\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Aaron Sidford\",\"item\":\"https://www.hugmap.com/entity/person/person_A5086787265\"}]}]}","name","Aaron Sidford","nameZh","aliases","description","descriptionZh","status","active","externalIds","{\"openalex\":\"A5086787265\",\"orcid\":\"0000-0003-2675-7610\"}","properties","source","openalex","createdAt","2026-05-22T18:56:25.17617503","updatedAt","2026-05-22T18:56:25.176177642","orcid","0000-0003-2675-7610","title","affiliation","researchArea","paperCount","citationCount","homepage","linkedin","twitter","github","hindex","displayName","displayDescription","mutations",[],"queries",[62],{"_63":64,"_65":66,"_67":68,"_69":70},"dehydratedAt",1784338656611,"state",{"_72":73,"_74":75,"_76":64,"_77":-5,"_78":79,"_80":79,"_81":79,"_82":-5,"_83":-5,"_84":85,"_33":86,"_87":88},"queryKey",[71,18,14,16],"queryHash","[\"portal\",\"entity\",\"person\",\"person_A5086787265\"]","portal","data",{"_18":19,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_99":100,"_101":102},"dataUpdateCount",1,"dataUpdatedAt","error","errorUpdateCount",0,"errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated",false,"success","fetchStatus","idle","entityType","Person","taxonomies",[],"papers",[133],"companies",[103,104],"events",[],"patents",[],"articles",[],{"_15":125,"_27":126,"_29":-5,"_30":127,"_31":-5,"_32":-5,"_33":34,"_35":128,"_37":-5,"_38":39,"_40":129,"_42":130,"_111":131,"_113":-5,"_114":-5,"_115":116,"_117":-5,"_118":-5,"_119":-5,"_120":-5,"_121":-5,"_122":-5,"_123":-5,"_124":-5,"_56":126,"_57":-5},{"_15":105,"_27":106,"_29":-5,"_30":107,"_31":-5,"_32":-5,"_33":34,"_35":108,"_37":-5,"_38":39,"_40":109,"_42":110,"_111":112,"_113":-5,"_114":-5,"_115":116,"_117":-5,"_118":-5,"_119":-5,"_120":-5,"_121":-5,"_122":-5,"_123":-5,"_124":-5,"_56":106,"_57":-5},"company_I4210110987","IIT@MIT",[106],"{\"ror\":\"01wp8zh54\",\"openalex\":\"I4210110987\"}","2026-05-14T00:53:04.424768598","2026-06-01T06:06:17.557968992","companyType","RESEARCH_INSTITUTE","foundedDate","headquarters","country","US","employeeCount","fundingStage","totalFunding","valuation","website","stockSymbol","uscc","crunchbaseUrl","company_I63966007","Massachusetts Institute of Technology",[132,126],"{\"ror\":\"042nb2s44\",\"openalex\":\"I63966007\",\"wikidata\":\"Q49108\"}","2026-05-14T00:28:56.29244562","2026-06-01T04:16:59.964914338","UNIVERSITY","Instituto Tecnológico de Massachusetts",{"_15":134,"_27":135,"_29":-5,"_30":-5,"_31":-5,"_32":-5,"_33":34,"_35":136,"_37":-5,"_38":39,"_40":137,"_42":138,"_139":140,"_141":-5,"_142":143,"_46":135,"_144":145,"_146":147,"_148":149,"_150":-5,"_50":151,"_152":-5,"_153":154,"_155":-5,"_156":85,"_56":135,"_57":-5},"paper_W2084990336","Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow","{\"openalex\":\"W2084990336\",\"doi\":\"10.1109/focs.2014.52\"}","2026-05-22T18:56:23.190851293","2026-05-22T18:56:23.190853445","doi","10.1109/focs.2014.52","arxivId","openalexId","W2084990336","abstractText","In this paper, we present a new algorithm for '/ solving linear programs that requires only Õ(√rank(A)L) iterations where A is the constraint matrix of a linear program with m constraints, n variables, and bit complexity L. Each iteration of our method consists of solving Õ(1) linear systems and additional nearly linear time computation. Our method improves upon the previous best iteration bounds by factor Ω̃((m/rank (A))) ^1/4 ) of for methods with polynomial time computable iterations and by Ω̃((m/rank (A)) ^1/2 ) for methods which solve at most Õ(1) linear systems in each iteration each achieved over 20 years ago. Applying our techniques to the linear program formulation of maximum flow yields an Õ(|E| √|V| log ² U) time algorithm for solving the maximum flow problem on directed graphs with |E| edges, |V| vertices, and capacity ratio U. This improves upon the previous fastest running time of O(|E| min{|E| ^1/2 , |V| ^2/3 } log (|V| ² /|E|) log(U)) achieved over 15 years ago by Goldberg and Rao and improves upon the previous best running times for solving dense directed unit capacity graphs of Õ(|E| min{|E| ^1/2 , |V| ^2/3 }) achieved by Even and Tarjan over 35 years ago and a running time of Õ(|E| ^10/7 ) achieved recently by Madry.","publishedDate","2014-10-01","publishedYear",2014,"venue",238,"authors","keywords",[157,158,159],"pdfUrl","topVenue","Complexity and Algorithms in Graphs","Advanced Optimization Algorithms Research","Advanced Graph Theory Research",{"_58":161,"_60":162},[],[163],{"_63":164,"_65":165,"_67":166,"_69":167},1784338652887,{"_72":169,"_74":75,"_76":164,"_77":-5,"_78":79,"_80":79,"_81":79,"_82":-5,"_83":-5,"_84":85,"_33":86,"_87":88},[71,168],"[\"portal\",\"industries\"]","industries",[170,171,172,173,174,175,176,177,178,179,180,181],{"_15":243,"_27":244,"_29":-5,"_30":245,"_31":246,"_32":-5,"_33":34,"_35":-5,"_37":-5,"_38":185,"_40":-5,"_42":-5,"_186":187,"_188":-5,"_189":75,"_190":191,"_192":247,"_194":79,"_195":85,"_196":79,"_197":-5,"_56":244,"_57":246},{"_15":239,"_27":240,"_29":-5,"_30":-5,"_31":241,"_32":-5,"_33":34,"_35":-5,"_37":-5,"_38":185,"_40":-5,"_42":-5,"_186":187,"_188":-5,"_189":75,"_190":191,"_192":242,"_194":79,"_195":85,"_196":79,"_197":-5,"_56":240,"_57":241},{"_15":233,"_27":234,"_29":-5,"_30":235,"_31":236,"_32":-5,"_33":34,"_35":-5,"_37":-5,"_38":185,"_40":-5,"_42":-5,"_186":187,"_188":-5,"_189":75,"_190":191,"_192":237,"_194":79,"_195":85,"_196":79,"_197":-5,"_56":234,"_57":236},{"_15":229,"_27":230,"_29":-5,"_30":-5,"_31":231,"_32":-5,"_33":34,"_35":-5,"_37":-5,"_38":185,"_40":-5,"_42":-5,"_186":187,"_188":-5,"_189":75,"_190":191,"_192":232,"_194":79,"_195":85,"_196":79,"_197":-5,"_56":230,"_57":231},{"_15":225,"_27":226,"_29":-5,"_30":-5,"_31":227,"_32":-5,"_33":34,"_35":-5,"_37":-5,"_38":185,"_40":-5,"_42":-5,"_186":187,"_188":-5,"_189":75,"_190":191,"_192":228,"_194":79,"_195":85,"_196":79,"_197":-5,"_56":226,"_57":227},{"_15":219,"_27":220,"_29":-5,"_30":221,"_31":222,"_32":-5,"_33":34,"_35":-5,"_37":-5,"_38":185,"_40":-5,"_42":-5,"_186":187,"_188":-5,"_189":75,"_190":191,"_192":223,"_194":79,"_195":85,"_196":79,"_197":-5,"_56":220,"_57":222},{"_15":214,"_27":215,"_29":-5,"_30":-5,"_31":216,"_32":-5,"_33":34,"_35":-5,"_37":-5,"_38":185,"_40":-5,"_42":-5,"_186":187,"_188":-5,"_189":75,"_190":191,"_192":217,"_194":79,"_195":218,"_196":79,"_197":-5,"_56":215,"_57":216},{"_15":210,"_27":211,"_29":-5,"_30":-5,"_31":212,"_32":-5,"_33":34,"_35":-5,"_37":-5,"_38":185,"_40":-5,"_42":-5,"_186":187,"_188":-5,"_189":75,"_190":191,"_192":213,"_194":79,"_195":85,"_196":79,"_197":-5,"_56":211,"_57":212},{"_15":206,"_27":207,"_29":-5,"_30":-5,"_31":208,"_32":-5,"_33":34,"_35":-5,"_37":-5,"_38":185,"_40":-5,"_42":-5,"_186":187,"_188":-5,"_189":75,"_190":191,"_192":209,"_194":79,"_195":85,"_196":79,"_197":-5,"_56":207,"_57":208},{"_15":202,"_27":203,"_29":-5,"_30":-5,"_31":204,"_32":-5,"_33":34,"_35":-5,"_37":-5,"_38":185,"_40":-5,"_42":-5,"_186":187,"_188":-5,"_189":75,"_190":191,"_192":205,"_194":79,"_195":85,"_196":79,"_197":-5,"_56":203,"_57":204},{"_15":198,"_27":199,"_29":-5,"_30":-5,"_31":200,"_32":-5,"_33":34,"_35":-5,"_37":-5,"_38":185,"_40":-5,"_42":-5,"_186":187,"_188":-5,"_189":75,"_190":191,"_192":201,"_194":79,"_195":85,"_196":79,"_197":-5,"_56":199,"_57":200},{"_15":182,"_27":183,"_29":-5,"_30":-5,"_31":184,"_32":-5,"_33":34,"_35":-5,"_37":-5,"_38":185,"_40":-5,"_42":-5,"_186":187,"_188":-5,"_189":75,"_190":191,"_192":193,"_194":79,"_195":85,"_196":79,"_197":-5,"_56":183,"_57":184},"tax_ind_smartphone","智能手机","Smartphone","manual","taxonomyType","INDUSTRY","code","level","parentId","tax_ind_root","path","科技行业/智能手机","sortOrder","isLeaf","entityCount","children","tax_ind_robot","机器人","Robotics","科技行业/机器人","tax_ind_wearable","智能穿戴","Smart Wearables","科技行业/智能穿戴","tax_ind_energy","新能源与智能制造","New Energy & Smart Manufacturing","科技行业/新能源与智能制造","tax_ind_biotech","生物科技","Biotech","科技行业/生物科技","tax_ind_quantum","量子计算","Quantum Computing","科技行业/量子计算",true,"tax_ind_blockchain","区块链",[224],"Blockchain","科技行业/区块链","Web3","tax_ind_enterprise","企业软件","Enterprise Software","科技行业/企业软件","tax_ind_security","网络安全","Cybersecurity","科技行业/网络安全","tax_ind_semi","半导体",[238],"Semiconductor","科技行业/半导体","芯片","tax_ind_cloud","云计算","Cloud Computing","科技行业/云计算","tax_ind_ai","人工智能",[248,249],"Artificial Intelligence","科技行业/人工智能","AI","AI 技术","env",{"_252":23},"SITE_BASE_URL"]

Aaron Sidford 人物

详细信息

相关论文查看全部 (1)

相关公司查看全部 (2)

相关事件

相关专利

相关文章