Priority Queue Optimization is a methodological framework within data structure design that specializes in enhancing the efficiency of priority queue operations by minimizing time complexity and resource overhead through algorithmic refinement and structural adaptation.
71
Publications
2.5K
Citations
169
Authors
103
Institutions
Publications per year
2017–2026
15
Parents
Publications
71
Cache-oblivious priority queue and graph algorithm applications
Lars Arge, Michael A. Bender, Erik D. Demaine et al. · 2002 · 101 citations
SLADE: A Smart Large-Scale Task Decomposer in Crowdsourcing
Yongxin Tong, Lei Chen, Zimu Zhou et al. · IEEE Transactions on Knowledge and Data Engineering · 2018 · 100 citations · Full text
1–5 of 71
Authors
169
- MT
3
h-index
- AE
3
h-index
- JI
2
h-index
- JZ
2
h-index
- LS
2
h-index
1–5 of 169
Institutions
103
AT&T (United States)
Bedminster, United States
4 h-index
5 publications
201 citations
Zhejiang University
Hangzhou, China
3 h-index
4 publications
446 citations
Shanghai Jiao Tong University
Shanghai, China
2 h-index
4 publications
67 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
2 h-index
2 publications
93 citations
Georgia State University
Atlanta, United States
2 h-index
3 publications
99 citations
National Tsing Hua University
Hsinchu, Taiwan
2 h-index
2 publications
34 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
3 publications
100 citations
Iowa State University
Ames, United States
2 h-index
4 publications
68 citations
1–8 of 103
Venues
- IEEE Access
2 publications · 95 citations
2
h-index
- Operations Research
2 publications · 84 citations
2
h-index
- IEEE Transactions on Knowledge and Data Engineering
TKDE · 2 publications · 120 citations
2
h-index
- Computer Graphics Forum
2 publications · 50 citations
2
h-index
- SSRN Electronic Journal
Repository · 2 publications · 34 citations
2
h-index
1–5