{"id":"https://openalex.org/keywords/pairing-heaps","display_name":"pairing heaps","description":"Pairing heaps are heap-ordered tree data structures used to implement priority queues, with operations analyzed in algorithms and data structures research.","display_name_alternatives":["pairing heap"],"ids":{"openalex":"https://openalex.org/keywords/pairing-heaps","wikidata":"https://www.wikidata.org/wiki/Q17152481"},"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.6478,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.6478,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1521,"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"}}],"works_count":89,"cited_by_count":1646,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/pairing-heaps","updated_date":"2026-11-18T04:07:20","created_date":"2026-09-30T00:00:00"}
