Bit Vectors
Bit Vector is a data structure that belongs to the category of array-based storage mechanisms, distinguished by its representation of a sequence of binary values (bits) used to efficiently encode and manipulate sets, flags, or sparse information through bitwise operations.
181
Publications
8.8K
Citations
451
Authors
207
Institutions
Publications per year
2017–2026
27
Variants
Bit Vector
Parents
181
Bruno Dutertre, Leonardo de Moura · 2006 · 483 citations
Vivek Seshadri, Donghyuk Lee, Thomas Mullins et al. · 2017 · 428 citations
Global Data Flow Analysis and Iterative Algorithms
John B. Kam, Jeffrey D. Ullman · Journal of the ACM · 1976 · 303 citations · Full text
Turbo-charging vertical mining of large databases
Pradeep Shenoy, Jayant R. Haritsa, S. Sudarshan et al. · ACM SIGMOD Record · 2000 · 254 citations · Full text
Scalable packet classification
Florin Baboescu, George Varghese · 2001 · 247 citations
1–5 of 181
451
8
h-index
6
h-index
4
h-index
3
h-index
3
h-index
1–5 of 451
207
University of Utah
Salt Lake City, United States
9 h-index
19 publications
389 citations
University of California, Berkeley
Berkeley, United States
8 h-index
23 publications
690 citations
Georgia State University
Atlanta, United States
5 h-index
7 publications
112 citations

University of Duisburg-Essen
Essen, Germany
4 h-index
8 publications
191 citations
University of Oxford
Oxford, United Kingdom
4 h-index
6 publications
139 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
4 h-index
6 publications
236 citations
Stanford University
Stanford, United States
4 h-index
7 publications
246 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
12 publications
396 citations
1–8 of 207
3 publications · 103 citations
3
h-index
3 publications · 59 citations
3
h-index
3 publications · 154 citations
3
h-index
3 publications · 146 citations
3
h-index
3 publications · 126 citations
3
h-index
1–5