Decision-Theoretic Sorting is a formal framework within sorting problems that integrates probabilistic reasoning and utility maximization to determine optimal sorting strategies under uncertainty, distinguishing itself by explicitly modeling the trade-offs between sorting costs and decision accuracy.
48
Publications
3.9K
Citations
102
Authors
75
Institutions
Publications per year
2017–2026
15
Parents
Publications
48
Introspective Sorting and Selection Algorithms
David R. Musser · Software Practice and Experience · 1997 · 245 citations
A Generalized Sorting Strategy for Computer Classifications
G. N. Lance, W. T. Williams · Nature · 1966 · 229 citations
1–5 of 48
Authors
102
- RS
3
h-index
- VM
3
h-index
- XL
3
h-index
- RP
2
h-index
- AO
2
h-index
1–5 of 102
Institutions
75
Polish Academy of Sciences
Warsaw, Poland
3 h-index
3 publications
372 citations
Xi'an Jiaotong University
Xi'an, China
3 h-index
7 publications
263 citations
Poznań University of Technology
Poznan, Poland
3 h-index
6 publications
557 citations
Systems Research Institute
Warsaw, Poland
3 h-index
3 publications
372 citations
University of Catania
Catania, Italy
2 h-index
2 publications
298 citations
Université Laval
Québec, Canada
2 h-index
4 publications
192 citations
University of Coimbra
Coimbra, Portugal
2 h-index
5 publications
357 citations
University of Canberra
Canberra, Australia
2 h-index
3 publications
470 citations
1–8 of 75
Venues
- European Journal of Operational Research
6 publications · 559 citations
6
h-index
- Computers & Operations Research
5 publications · 269 citations
5
h-index
- SSRN Electronic Journal
Repository · 2 publications · 34 citations
2
h-index
- Annals of Operations Research
2 publications · 47 citations
2
h-index
- Open Repository and Bibliography (University of Luxembourg)
Repository · 1 publications · 10 citations
1
h-index
1–5