{"id":"https://openalex.org/W2095135848","doi":"https://doi.org/10.1145/2513228.2513264","title":"Two mechanisms for generating infinite families of pairing bijections","display_name":"Two mechanisms for generating infinite families of pairing bijections","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W2095135848","doi":"https://doi.org/10.1145/2513228.2513264","mag":"2095135848"},"language":"en","primary_location":{"id":"doi:10.1145/2513228.2513264","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2513228.2513264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 Research in Adaptive and Convergent Systems","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/A5042600106","display_name":"Paul Tarau","orcid":"https://orcid.org/0000-0001-7192-9421"},"institutions":[{"id":"https://openalex.org/I123534392","display_name":"University of North Texas","ror":"https://ror.org/00v97ad02","country_code":"US","type":"education","lineage":["https://openalex.org/I123534392"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Paul Tarau","raw_affiliation_strings":["University of North Texas"],"affiliations":[{"raw_affiliation_string":"University of North Texas","institution_ids":["https://openalex.org/I123534392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042600106"],"corresponding_institution_ids":["https://openalex.org/I123534392"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.105703,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"57","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9955000281333923,"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/T11567","display_name":"semigroups and automata theory","score":0.987500011920929,"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/bijection-injection-and-surjection","display_name":"Bijection, injection and surjection","score":0.9948430061340332},{"id":"https://openalex.org/keywords/bijection","display_name":"Bijection","score":0.9271511435508728},{"id":"https://openalex.org/keywords/pairing","display_name":"Pairing","score":0.9193007946014404},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6314709186553955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5519030094146729},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.5316581726074219},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4815666973590851},{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.4690473675727844},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.384410560131073},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3233719766139984},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28702253103256226},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.22010302543640137}],"concepts":[{"id":"https://openalex.org/C48659774","wikidata":"https://www.wikidata.org/wiki/Q4907197","display_name":"Bijection, injection and surjection","level":3,"score":0.9948430061340332},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.9271511435508728},{"id":"https://openalex.org/C14103023","wikidata":"https://www.wikidata.org/wiki/Q11681459","display_name":"Pairing","level":3,"score":0.9193007946014404},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6314709186553955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5519030094146729},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.5316581726074219},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4815666973590851},{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.4690473675727844},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.384410560131073},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3233719766139984},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28702253103256226},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.22010302543640137},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C54101563","wikidata":"https://www.wikidata.org/wiki/Q124131","display_name":"Superconductivity","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2513228.2513264","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2513228.2513264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 Research in Adaptive and Convergent Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.8299999833106995}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1501639307","https://openalex.org/W1611915107","https://openalex.org/W1708938887","https://openalex.org/W1979605853","https://openalex.org/W2005458823","https://openalex.org/W2014470854","https://openalex.org/W2014988510","https://openalex.org/W2031727412","https://openalex.org/W2057871730","https://openalex.org/W2126209209","https://openalex.org/W2132699442","https://openalex.org/W2159772324","https://openalex.org/W2620736084","https://openalex.org/W4302081240","https://openalex.org/W6608815102"],"related_works":["https://openalex.org/W2952259524","https://openalex.org/W2160566290","https://openalex.org/W2806276129","https://openalex.org/W4299611798","https://openalex.org/W1893226401","https://openalex.org/W2885368579","https://openalex.org/W2030568854","https://openalex.org/W2110957471","https://openalex.org/W2952466037","https://openalex.org/W2015282370"],"abstract_inverted_index":{"We":[0],"explore":[1],"two":[2],"general":[3],"mechanisms":[4],"for":[5],"producing":[6],"pairing":[7,32,47,53],"bijections":[8,54],"(bijective":[9],"functions":[10,39,86],"defined":[11,87],"from":[12],"N2":[13],"\u2192":[14],"N).":[15],"The":[16,34,68],"first":[17],"mechanism,":[18,36],"using":[19,37],"n-adic":[20],"valuations":[21],"results":[22],"in":[23,88],"parameterized":[24],"algorithms":[25],"generating":[26],"a":[27,71,89],"countable":[28],"family":[29],"of":[30,40,42,61,63,74,83],"distinct":[31,46],"bijections.":[33,48],"second":[35],"characteristic":[38],"subsets":[41],"N":[43,64],"provides":[44],"2N":[45],"Mechanisms":[49],"to":[50,58,79],"combine":[51],"such":[52],"and":[55],"their":[56],"application":[57],"generate":[59],"families":[60],"permutations":[62],"are":[65],"also":[66],"described.":[67],"paper":[69],"uses":[70],"small":[72],"subset":[73],"the":[75,85],"functional":[76],"language":[77],"Haskell":[78],"provide":[80],"executable":[81],"specifications":[82],"various":[84],"literate":[90],"programming":[91],"style.":[92]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}