{"id":"https://openalex.org/W2171310447","doi":null,"title":"Parallel Storage Allocation for Intermediate Results During Exploration of Random Mappings","display_name":"Parallel Storage Allocation for Intermediate Results During Exploration of Random Mappings","publication_year":2008,"publication_date":"2008-12-30","ids":{"openalex":"https://openalex.org/W2171310447","mag":"2171310447"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.130.7852","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.7852","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://pv.fernuni-hagen.de/docs/heichler-keller-sibeyn-pars-2005-final.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5059259915","display_name":"J. Heichler","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jan Heichler","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"J\u00f6rg Keller","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J\u00f6rg Keller","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035232483","display_name":"Jop F. Sibeyn","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jop F. Sibeyn","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Martin-luther-universit\u00e4t Halle","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin-luther-universit\u00e4t Halle","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5059259915"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6601999998092651,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.6601999998092651,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.10000000149011612,"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/T11269","display_name":"Algorithms and Data Compression","score":0.04960000142455101,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/random-mappings","display_name":"random maps","score":0.9440000057220459},{"id":"https://openalex.org/keywords/graph-structure","display_name":"graph structure","score":0.4740000069141388},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.7699999809265137},{"id":"https://openalex.org/keywords/memory-usage","display_name":"memory usage","score":0.5709999799728394},{"id":"https://openalex.org/keywords/graph-exploration","display_name":"graph exploration","score":0.5460000038146973}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7497100830078125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5342167019844055},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5288199782371521},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5053987503051758},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4360666275024414},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.426298052072525},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16479143500328064}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.130.7852","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.7852","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://pv.fernuni-hagen.de/docs/heichler-keller-sibeyn-pars-2005-final.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1544956979","https://openalex.org/W2226303357","https://openalex.org/W2495335401"],"related_works":["https://openalex.org/W2898430265","https://openalex.org/W7098178060","https://openalex.org/W70164100","https://openalex.org/W4247782993","https://openalex.org/W2785473807","https://openalex.org/W1493041473","https://openalex.org/W7099852533","https://openalex.org/W6885107346","https://openalex.org/W6903870414","https://openalex.org/W7221675422"],"abstract_inverted_index":{"We":[0],"present":[1],"and":[2,56],"analyze":[3],"an":[4],"improved":[5],"parallel":[6,38],"algorithm":[7],"to":[8,30,40],"compute":[9],"the":[10,32,66],"structure":[11],"of":[12,36],"a":[13,17,22,37],"graph":[14,47],"induced":[15],"by":[16],"randomly":[18],"chosen":[19],"function":[20],"on":[21],"finite":[23],"set.":[24],"The":[25],"improvements":[26,55],"center":[27],"around":[28],"how":[29],"use":[31],"vast":[33],"memory":[34],"resources":[35],"computer":[39],"store":[41],"intermediate":[42],"results,":[43],"i.e.":[44],"knowledge":[45],"about":[46],"nodes":[48],"that":[49,64],"have":[50],"already":[51],"been":[52],"visited.":[53],"Further":[54],"extensions":[57],"are":[58,62],"pointed":[59],"out.":[60],"Experiments":[61],"presented":[63],"confirm":[65],"theoretical":[67],"analysis.":[68],"1":[69]},"counts_by_year":[{"year":2017,"cited_by_count":2}],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2025-10-27T00:00:00"}