Probabilistic Data Structure Design
Probabilistic Data Structure Design is a methodological framework in computer science that employs probabilistic techniques to determine structural properties and performance guarantees in data organization, distinguishing itself from deterministic approaches by leveraging randomness in the construction and maintenance of data structures to achieve efficient average-case time and space complexity.
57
Publications
2.9K
Citations
243
Authors
120
Institutions
Publications per year
2017–2026
21
Parents
57
Edge Computing-Based Security Framework for Big Data Analytics in VANETs
Sahil Garg, Amritpal Singh, Kuljeet Kaur et al. · IEEE Network · 2019 · 178 citations · Full text
1–5 of 57
243
6
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 243
120

Peking University
Beijing, China
8 h-index
28 publications
890 citations
Michigan State University
East Lansing, United States
6 h-index
34 publications
10.8K citations
University of Maryland, College Park
College Park, United States
6 h-index
7 publications
648 citations

University of Minnesota
Minneapolis, United States
4 h-index
6 publications
636 citations
Nanjing University
Nanjing, China
4 h-index
15 publications
433 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
4 h-index
7 publications
196 citations
North Carolina State University
Raleigh, United States
3 h-index
3 publications
155 citations
University of Washington
Seattle, United States
3 h-index
8 publications
986 citations
1–8 of 120
TON · 2 publications · 75 citations
2
h-index
TALG · 2 publications · 57 citations
2
h-index
Conference · 2 publications · 42 citations
2
h-index
Conference · 1 publications · 17 citations
1
h-index
1 publications · 26 citations
1
h-index
1–5