{"id":"https://openalex.org/W2084488265","doi":"https://doi.org/10.1109/ciss.2015.7086839","title":"A locality preserving one-sided binary tree - Crossbar switch wiring design algorithm","display_name":"A locality preserving one-sided binary tree - Crossbar switch wiring design algorithm","publication_year":2015,"publication_date":"2015-03-01","ids":{"openalex":"https://openalex.org/W2084488265","doi":"https://doi.org/10.1109/ciss.2015.7086839","mag":"2084488265"},"language":"en","primary_location":{"id":"doi:10.1109/ciss.2015.7086839","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2015.7086839","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 49th Annual Conference on Information Sciences and Systems (CISS)","raw_type":"proceedings-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/A5047903444","display_name":"Devrim Sahin","orcid":null},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Devrim Sahin","raw_affiliation_strings":["Department of Computer Science and Engineering, Bilkent University, Ankara, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Bilkent University, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047903444"],"corresponding_institution_ids":["https://openalex.org/I168864056"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08341693,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9818999767303467,"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"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9763000011444092,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/crossbar-switch","display_name":"Crossbar switch","score":0.9122443199157715},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.7066279649734497},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.7007832527160645},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.67011559009552},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.54024338722229},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5191487669944763},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45574238896369934},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4209470748901367},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3620334565639496},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32559511065483093},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2177828550338745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2042967975139618},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17277520895004272},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1347528100013733},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08012664318084717}],"concepts":[{"id":"https://openalex.org/C29984679","wikidata":"https://www.wikidata.org/wiki/Q1929149","display_name":"Crossbar switch","level":2,"score":0.9122443199157715},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.7066279649734497},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.7007832527160645},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.67011559009552},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.54024338722229},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5191487669944763},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45574238896369934},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4209470748901367},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3620334565639496},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32559511065483093},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2177828550338745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2042967975139618},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17277520895004272},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1347528100013733},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08012664318084717},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ciss.2015.7086839","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2015.7086839","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 49th Annual Conference on Information Sciences and Systems (CISS)","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/28385","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/28385","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2015 49th Annual Conference on Information Sciences and Systems (CISS)","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2145932742","https://openalex.org/W2084488265","https://openalex.org/W2902549273","https://openalex.org/W2981001626","https://openalex.org/W2357738827","https://openalex.org/W1966383678","https://openalex.org/W2486717996","https://openalex.org/W3107197685","https://openalex.org/W33990053","https://openalex.org/W2790184291"],"abstract_inverted_index":{"One-sided":[0],"crossbar":[1,39],"switches":[2,40],"allow":[3],"for":[4],"a":[5,20],"simple":[6],"implementation":[7],"of":[8],"complete":[9],"K":[10,49],"<sub":[11,50],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[12,51],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sub>":[13,52],"graphs.":[14],"However,":[15],"designing":[16,33],"these":[17],"circuits":[18],"is":[19],"cumbersome":[21],"process":[22],"and":[23,47],"can":[24],"be":[25],"automated.":[26],"We":[27],"present":[28],"an":[29],"algorithm":[30],"that":[31],"allows":[32],"automatic":[34],"one-sided":[35],"binary":[36],"tree":[37],"-":[38],"which":[41],"do":[42],"not":[43],"exceed":[44],"\u230an/2\u230b":[45],"columns,":[46],"achieves":[48],"graph":[53],"without":[54],"connecting":[55],"any":[56,59],"wires":[57],"between":[58],"three":[60],"adjacent":[61],"blocks,":[62],"thus":[63],"preserving":[64],"locality":[65],"in":[66],"connections.":[67]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}