Group Sorting
Group Sorting is a computational framework within the class of sorting algorithms that organizes elements into predefined groups based on shared attributes or relational constraints, rather than arranging elements into a total order.
19
Publications
2.6K
Citations
36
Authors
20
Institutions
Publications per year
2017–2026
2
Parents
19
1–5 of 19
36
Commonwealth Scientific and Industrial Research Organisation, Australia
2 publications · 1.8K citations
2
h-index
2
h-index
Commonwealth Scientific and Industrial Research Organisation, Australia
2 publications · 1.9K citations
2
h-index
1
h-index
1
h-index
1–5 of 36
20
North Carolina State University
Raleigh, United States
1 h-index
1 publications
154 citations
SUNY New Paltz
New Paltz, United States
1 h-index
2 publications
80 citations
University of Michigan
Ann Arbor, United States
1 h-index
1 publications
154 citations
Defence Research and Development Canada
Ottawa, Canada
1 h-index
1 publications
52 citations
Computing Center
Khabarovsk, Russia
1 h-index
2 publications
3.4K citations

Kentucky State University
Frankfort, United States
1 h-index
1 publications
39 citations

Mathematical Sciences Research Institute
Berkeley, United States
1 h-index
1 publications
22 citations
Dalian University of Technology
Dalian, China
1 h-index
2 publications
146 citations
1–8 of 20
3 publications · 2K citations
3
h-index
2 publications · 27 citations
2
h-index
1 publications · 70 citations
1
h-index
1 publications · 22 citations
1
h-index
1 publications · 23 citations
1
h-index
1–5