Index Sets
Index Sets is a formal construct in computability theory that denotes a set of natural numbers coding the indices of partial recursive functions with a specified property, distinguishing it as a tool for classifying decision problems according to their algorithmic unsolvability.
222
Publications
9.2K
Citations
504
Authors
249
Institutions
Publications per year
2017–2026
27
Parents
222
Querying k-truss community in large and dynamic graphs
Xin Huang, Hong Cheng, Lu Qin et al. · 2014 · 490 citations
On the design of algorithms for VLSI systolic arrays
Dan Moldovan · Proceedings of the IEEE · 1983 · 392 citations
Distance-based indexing for high-dimensional metric spaces
Tolga Bozkaya, Meral Özsoyoğlu · 1997 · 332 citations
1–5 of 222
504
5
h-index
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 504
249
University of California, Santa Barbara
Santa Barbara, United States
5 h-index
14 publications
570 citations
Sobolev Institute of Mathematics
Novosibirsk, Russia
5 h-index
8 publications
124 citations

University of Notre Dame
Notre Dame, United States
4 h-index
7 publications
157 citations
University of Southern California
Los Angeles, United States
4 h-index
7 publications
552 citations
IBM (United States)
Armonk, United States
4 h-index
10 publications
690 citations
National Tsing Hua University
Hsinchu, Taiwan
4 h-index
8 publications
352 citations
Microsoft (United States)
Redmond, United States
3 h-index
7 publications
181 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
3 h-index
7 publications
2K citations
1–8 of 249
10 publications · 166 citations
10
h-index
TRAN · 7 publications · 302 citations
7
h-index
6 publications · 132 citations
6
h-index
TKDE · 5 publications · 386 citations
5
h-index
PVLDB · 3 publications · 87 citations
3
h-index
1–5