{"id":"https://openalex.org/W1512371369","doi":"https://doi.org/10.1002/1098-2418(200008)17:1<64::aid-rsa5>3.0.co;2-3","title":"Construction of expanders and superconcentrators using Kolmogorov complexity","display_name":"Construction of expanders and superconcentrators using Kolmogorov complexity","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1512371369","doi":"https://doi.org/10.1002/1098-2418(200008)17:1<64::aid-rsa5>3.0.co;2-3","mag":"1512371369"},"language":"en","primary_location":{"id":"doi:10.1002/1098-2418(200008)17:1<64::aid-rsa5>3.0.co;2-3","is_oa":true,"landing_page_url":"https://doi.org/10.1002/1098-2418(200008)17:1<64::aid-rsa5>3.0.co;2-3","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/1098-2418%28200008%2917%3A1%3C64%3A%3AAID-RSA5%3E3.0.CO%3B2-3","source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/1098-2418%28200008%2917%3A1%3C64%3A%3AAID-RSA5%3E3.0.CO%3B2-3","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5097581659","display_name":"Uwe Sch\ufffdning","orcid":null},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Uwe Sch\ufffdning","raw_affiliation_strings":["Universita\u0308t Ulm, Abteilung Theoretische Informatik, Oberer Eselsberg,D-89069 Ulm, Germany","Universit\u00e4t Ulm, Abteilung Theoretische Informatik, Oberer Eselsberg,D-89069 Ulm, Germany"],"affiliations":[{"raw_affiliation_string":"Universita\u0308t Ulm, Abteilung Theoretische Informatik, Oberer Eselsberg,D-89069 Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"Universit\u00e4t Ulm, Abteilung Theoretische Informatik, Oberer Eselsberg,D-89069 Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5097581659"],"corresponding_institution_ids":["https://openalex.org/I196349391"],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.07121731,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"17","issue":"1","first_page":"64","last_page":"77"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","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/T12002","display_name":"Computability, Logic, AI Algorithms","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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9922999739646912,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9909999966621399,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/struct","display_name":"struct","score":0.6638178825378418},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.6395096182823181},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.6280071139335632},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5273512005805969},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.49814701080322266},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47588053345680237},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.46253159642219543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4602666199207306},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4546513855457306},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44549915194511414},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43943512439727783},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4179169833660126},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.400485098361969},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3674243092536926},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12445381283760071},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1138925552368164},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06723964214324951}],"concepts":[{"id":"https://openalex.org/C2776142590","wikidata":"https://www.wikidata.org/wiki/Q1164699","display_name":"struct","level":2,"score":0.6638178825378418},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.6395096182823181},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.6280071139335632},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5273512005805969},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.49814701080322266},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47588053345680237},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.46253159642219543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4602666199207306},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4546513855457306},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44549915194511414},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43943512439727783},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4179169833660126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.400485098361969},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3674243092536926},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12445381283760071},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1138925552368164},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06723964214324951},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/1098-2418(200008)17:1<64::aid-rsa5>3.0.co;2-3","is_oa":true,"landing_page_url":"https://doi.org/10.1002/1098-2418(200008)17:1<64::aid-rsa5>3.0.co;2-3","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/1098-2418%28200008%2917%3A1%3C64%3A%3AAID-RSA5%3E3.0.CO%3B2-3","source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1002/1098-2418(200008)17:1<64::aid-rsa5>3.0.co;2-3","is_oa":true,"landing_page_url":"https://doi.org/10.1002/1098-2418(200008)17:1<64::aid-rsa5>3.0.co;2-3","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/1098-2418%28200008%2917%3A1%3C64%3A%3AAID-RSA5%3E3.0.CO%3B2-3","source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5400000214576721,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1512371369.pdf"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W86951258","https://openalex.org/W109020964","https://openalex.org/W1484040084","https://openalex.org/W1571430927","https://openalex.org/W1631603072","https://openalex.org/W1976479454","https://openalex.org/W1999736539","https://openalex.org/W2048958388","https://openalex.org/W2053204254","https://openalex.org/W2058640826","https://openalex.org/W2077054189","https://openalex.org/W2081711245","https://openalex.org/W2084751542","https://openalex.org/W2092198261","https://openalex.org/W2098022011","https://openalex.org/W2126420408","https://openalex.org/W2135393523","https://openalex.org/W2155506366","https://openalex.org/W2159816964","https://openalex.org/W2622132947","https://openalex.org/W4230960895","https://openalex.org/W4231916799","https://openalex.org/W4235082445","https://openalex.org/W4235946010","https://openalex.org/W4240994977","https://openalex.org/W4244496034","https://openalex.org/W6639199319","https://openalex.org/W6683003127"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W4214487273","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W2372211403","https://openalex.org/W3164774158","https://openalex.org/W1498463151"],"abstract_inverted_index":{"We":[0],"show":[1],"the":[2,18,26,31,45,75],"existence":[3],"of":[4,7,33,47,54],"various":[5],"versions":[6],"expander":[8],"graphs":[9],"using":[10],"Kolmogorov":[11,76],"complexity.":[12],"This":[13],"method":[14],"seems":[15],"superior":[16],"to":[17],"usual":[19],"probabilistic":[20],"construction.":[21],"It":[22],"turns":[23],"out":[24],"that":[25],"best":[27],"known":[28],"bounds":[29,72],"on":[30,41,74],"size":[32],"expanders":[34],"and":[35,67,69],"superconcentrators":[36,49],"can":[37],"be":[38],"attained":[39],"based":[40,73],"this":[42],"method.":[43],"In":[44],"case":[46],"(acyclic)":[48],"we":[50,70],"attain":[51],"a":[52],"density":[53],"about":[55],"34":[56],"edges/vertices.":[57],"Furthermore,":[58],"related":[59],"graph":[60],"properties":[61],"are":[62],"reviewed,":[63],"like":[64],"magnification,":[65],"edge-magnification,":[66],"isolation,":[68],"develop":[71],"approach.":[77],"\u00a9":[78],"2000":[79,90],"John":[80],"Wiley":[81],"&":[82],"Sons,":[83],"Inc.":[84],"Random":[85],"Struct.":[86],"Alg.,":[87],"17:":[88],"64\u201377,":[89]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-02-25T21:11:00.739837","created_date":"2025-10-10T00:00:00"}