{"id":"https://openalex.org/W2755665427","doi":"https://doi.org/10.1007/s002240000105","title":"Efficient List Ranking on the Reconfigurable Mesh, with Applications","display_name":"Efficient List Ranking on the Reconfigurable Mesh, with Applications","publication_year":1998,"publication_date":"1998-09-01","ids":{"openalex":"https://openalex.org/W2755665427","doi":"https://doi.org/10.1007/s002240000105","mag":"2755665427"},"language":"en","primary_location":{"id":"doi:10.1007/s002240000105","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s002240000105","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","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/A5032618095","display_name":"Tatsuya Hayashi","orcid":"https://orcid.org/0000-0001-5269-4081"},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"T. Hayashi","raw_affiliation_strings":["Department of Electrical and Computer Engineering,  Nagoya Institute of Technology,  Showa-ku, Nagoya 466, Japan  hayashi@elcom.nitech.ac.jp   nakano@elcom.nitech.ac.jp  , , , , , , JP"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering,  Nagoya Institute of Technology,  Showa-ku, Nagoya 466, Japan  hayashi@elcom.nitech.ac.jp   nakano@elcom.nitech.ac.jp  , , , , , , JP","institution_ids":["https://openalex.org/I197274945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086055038","display_name":"Koji Nakano","orcid":"https://orcid.org/0000-0002-2040-4032"},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"K. Nakano","raw_affiliation_strings":["Department of Electrical and Computer Engineering,  Nagoya Institute of Technology,  Showa-ku, Nagoya 466, Japan  hayashi@elcom.nitech.ac.jp   nakano@elcom.nitech.ac.jp  , , , , , , JP"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering,  Nagoya Institute of Technology,  Showa-ku, Nagoya 466, Japan  hayashi@elcom.nitech.ac.jp   nakano@elcom.nitech.ac.jp  , , , , , , JP","institution_ids":["https://openalex.org/I197274945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032618095"],"corresponding_institution_ids":["https://openalex.org/I197274945"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.34873284,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"31","issue":"5","first_page":"593","last_page":"611"},"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.9995999932289124,"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.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9976999759674072,"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/ranking","display_name":"Ranking (information retrieval)","score":0.7849164605140686},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.668556809425354},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.6572632789611816},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.632402777671814},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.49791789054870605},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.46165502071380615},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4563887119293213},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4544321894645691},{"id":"https://openalex.org/keywords/learning-to-rank","display_name":"Learning to rank","score":0.4470852017402649},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3883262276649475},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3746030330657959},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31875497102737427},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2552620470523834},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.1766611635684967},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.08139750361442566}],"concepts":[{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.7849164605140686},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.668556809425354},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.6572632789611816},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.632402777671814},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.49791789054870605},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.46165502071380615},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4563887119293213},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4544321894645691},{"id":"https://openalex.org/C86037889","wikidata":"https://www.wikidata.org/wiki/Q4330127","display_name":"Learning to rank","level":3,"score":0.4470852017402649},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3883262276649475},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3746030330657959},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31875497102737427},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2552620470523834},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.1766611635684967},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.08139750361442566}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s002240000105","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s002240000105","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1511717775","https://openalex.org/W1766349993","https://openalex.org/W2003288909","https://openalex.org/W2026497097","https://openalex.org/W2052565631","https://openalex.org/W2057101465","https://openalex.org/W2062585124","https://openalex.org/W2067661972","https://openalex.org/W2074456731","https://openalex.org/W2074992428","https://openalex.org/W2103734074","https://openalex.org/W2106821276","https://openalex.org/W2117006216","https://openalex.org/W2120490947","https://openalex.org/W2153057609","https://openalex.org/W2155595395","https://openalex.org/W2157603153","https://openalex.org/W2160047101","https://openalex.org/W2169244908","https://openalex.org/W2295428206"],"related_works":["https://openalex.org/W2113270940","https://openalex.org/W2004283824","https://openalex.org/W1581210843","https://openalex.org/W1982530285","https://openalex.org/W1992104669","https://openalex.org/W2521054645","https://openalex.org/W1998702677","https://openalex.org/W1830048115","https://openalex.org/W2515993118","https://openalex.org/W2275325805"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}