{"id":"https://openalex.org/W2063772523","doi":"https://doi.org/10.1080/01495739708941416","title":"THE JANUS TEST: A HIERARCHICAL ALGORITHM FOR COMPUTING DIRECTION AND DISTANCE VECTORS (EXTENDED VERSION)*","display_name":"THE JANUS TEST: A HIERARCHICAL ALGORITHM FOR COMPUTING DIRECTION AND DISTANCE VECTORS (EXTENDED VERSION)*","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2063772523","doi":"https://doi.org/10.1080/01495739708941416","mag":"2063772523"},"language":"en","primary_location":{"id":"doi:10.1080/01495739708941416","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01495739708941416","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/A5070831524","display_name":"Jean-Claude Sogno","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"JEAN-CLAUDE SOGNO","raw_affiliation_strings":["INRIA , 78153 Le Chesnay Cedex, FRANCE"],"affiliations":[{"raw_affiliation_string":"INRIA , 78153 Le Chesnay Cedex, FRANCE","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070831524"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14793702,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"1-3","first_page":"57","last_page":"82"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.996399998664856,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9883000254631042,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6566433906555176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6012467741966248},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5023024082183838},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.4546038508415222},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.4471660554409027},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.4368343651294708},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.42216214537620544},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3295436501502991},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29083943367004395}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6566433906555176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6012467741966248},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5023024082183838},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.4546038508415222},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.4471660554409027},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.4368343651294708},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.42216214537620544},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3295436501502991},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29083943367004395},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/01495739708941416","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01495739708941416","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/W1492984840","https://openalex.org/W1524877046","https://openalex.org/W1963547452","https://openalex.org/W2005873279","https://openalex.org/W2057030036","https://openalex.org/W2078552136","https://openalex.org/W2079235644","https://openalex.org/W2097699872","https://openalex.org/W2127218465","https://openalex.org/W2138777205","https://openalex.org/W2152506070","https://openalex.org/W2154172505","https://openalex.org/W2171262795","https://openalex.org/W2340604309","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W2915032613","https://openalex.org/W4241790184","https://openalex.org/W4301808069","https://openalex.org/W4403159200"],"related_works":["https://openalex.org/W3096456556","https://openalex.org/W4240253816","https://openalex.org/W2169584677","https://openalex.org/W2979513934","https://openalex.org/W4232954277","https://openalex.org/W2020341030","https://openalex.org/W2749133591","https://openalex.org/W2367473450","https://openalex.org/W23346600","https://openalex.org/W2460280200"],"abstract_inverted_index":{"For":[0,132],"a":[1,38,68,74,81,94,100,115,138],"compiler,":[2],"dependence":[3,69,222],"direction":[4,47,71,124],"vectors":[5,125],"are":[6],"the":[7,20,23,51,61,65,121,128,149,157,173,176,190,194,200,204],"key":[8],"structure":[9],"for":[10,164],"many":[11,31],"loop":[12,130,151],"parallelizing":[13],"transformations.":[14],"More":[15],"powerful":[16],"transformations":[17],"require":[18],"knowing":[19],"values":[21,174],"of":[22,41,64,67,80,84,87,109,120,134,162,175,203],"associated":[24,117],"distances.":[25],"However,":[26],"this":[27,34],"generally":[28],"involves":[29],"solving":[30],"problems.":[32],"In":[33],"paper,":[35],"we":[36,59,103,141],"consider":[37],"hierarchical":[39],"set":[40],"problems":[42,146,219],"which":[43],"differ":[44],"only":[45],"in":[46,50,189,199,220],"vectors,":[48],"as":[49],"framework":[52],"introduced":[53],"by":[54,113,148],"Burke":[55],"and":[56,76,86,153,198,223],"Cytron.":[57],"Firstly,":[58],"solve":[60],"basic":[62],"problem":[63,167],"existence":[66],"without":[70],"constraints,":[72],"using":[73],"fast":[75],"exact":[77],"algorithm":[78],"composed":[79],"pre-processing":[82],"phase":[83],"reduction":[85],"an":[88],"integer":[89],"simplex":[90],"resolution.":[91],"We":[92],"propose":[93],"new":[95,106,166],"\u201cbasic\u201d":[96],"algorithm.":[97],"Secondly,":[98],"if":[99,137],"solution":[101,139],"exists,":[102,140],"define":[104,142],"three":[105,122,143],"problems,":[107,136],"each":[108,133,165],"them":[110],"being":[111],"obtained":[112],"adding":[114],"constraint":[116],"with":[118],"one":[119],"possible":[123],"relative":[126],"to":[127,209,216],"first":[129],"index.":[131,159],"these":[135],"enlarged":[144],"similar":[145],"involved":[147],"second":[150],"index,":[152],"so":[154],"forth":[155],"until":[156],"last":[158],"The":[160,180],"amount":[161],"computation":[163],"is":[168,178],"very":[169],"low.":[170],"Information":[171],"on":[172],"distances":[177],"provided.":[179],"Janus":[181],"Test,":[182],"implemented":[183],"at":[184],"INRIA,":[185],"has":[186],"been":[187],"embedded":[188],"parallelizer":[191],"built":[192],"within":[193],"esprit":[195],"project":[196,206],"Compare":[197],"PARTITA":[201],"tool":[202],"EUREKA":[205],"EUROTOPS.":[207],"Due":[208],"its":[210],"robustness,":[211],"it":[212],"could":[213],"be":[214],"applied":[215],"more":[217],"complex":[218],"data":[221,224],"flow":[225],"analysis.":[226]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}