{"id":"https://openalex.org/W1976313192","doi":"https://doi.org/10.1137/s0097539790192702","title":"A Fast Derandomization Scheme and Its Applications","display_name":"A Fast Derandomization Scheme and Its Applications","publication_year":1996,"publication_date":"1996-02-01","ids":{"openalex":"https://openalex.org/W1976313192","doi":"https://doi.org/10.1137/s0097539790192702","mag":"1976313192"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539790192702","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539790192702","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5091329448","display_name":"Yijie Han","orcid":"https://orcid.org/0000-0003-1305-6815"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yijie Han","raw_affiliation_strings":["Department of Computer Science, University of Kentucky, Lexington"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kentucky, Lexington","institution_ids":["https://openalex.org/I143302722"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091329448"],"corresponding_institution_ids":["https://openalex.org/I143302722"],"apc_list":null,"apc_paid":null,"fwci":0.5059,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.61198139,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"25","issue":"1","first_page":"52","last_page":"82"},"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.9998999834060669,"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.9998999834060669,"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/T10237","display_name":"Cryptography and Data Security","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.8263431191444397},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.8167695999145508},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.602571427822113},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5993580222129822},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5481501221656799},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4515421390533447},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.431173175573349},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4295770525932312},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41681474447250366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4107572138309479},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3792066276073456},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28600800037384033},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08514627814292908}],"concepts":[{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.8263431191444397},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.8167695999145508},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.602571427822113},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5993580222129822},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5481501221656799},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4515421390533447},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.431173175573349},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4295770525932312},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41681474447250366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4107572138309479},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3792066276073456},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28600800037384033},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08514627814292908},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539790192702","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539790192702","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W148616101","https://openalex.org/W1519375772","https://openalex.org/W1550838627","https://openalex.org/W1593335462","https://openalex.org/W1964089073","https://openalex.org/W1997802297","https://openalex.org/W2004618348","https://openalex.org/W2017205387","https://openalex.org/W2026143151","https://openalex.org/W2035243909","https://openalex.org/W2073975876","https://openalex.org/W2100061495","https://openalex.org/W2110963759","https://openalex.org/W2118288908","https://openalex.org/W3011766368"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W2887154986","https://openalex.org/W1968512104","https://openalex.org/W78560857"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3],"fast":[4],"derandomization":[5],"scheme":[6,16],"for":[7,26,60,87],"the":[8,12,17,27,43,53,61,76,80,88,102],"PROFIT/COST":[9],"problem.":[10],"Through":[11],"applications":[13],"of":[14,20,56,83],"this":[15],"time":[18,54,81],"complexity":[19,55,82],"$O(\\log":[21,57,84],"^2":[22],"n\\log":[23],"\\log":[24,39],"n)$":[25,59,86],"$\\Delta":[28],"+":[29,35,68,94],"1$":[30],"vertex-coloring":[31],"problem":[32,65,91],"using":[33,66,92],"$O({{(m":[34,67,93],"n)}":[36,69,95],"/":[37,70,96],"{\\log":[38,71,97],"n}})$":[40,73,99],"processors":[41,74,100],"on":[42,75,101],"concurrent":[44],"read":[45,104],"exclusive":[46,103,105],"write":[47,106],"parallel":[48],"random-access":[49],"machine":[50],"(CREW":[51],"PRAM),":[52],"^{2.5}":[58,85],"maximal":[62,89],"independent":[63],"set":[64],"^{1.5}":[72],"CREW":[77],"PRAM":[78,108],"and":[79],"matching":[90],"^{0.5}":[98],"(EREW)":[107],"are":[109],"shown.":[110]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}