Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
bit vectors
Description:
Bit vectors are sequences of binary values used to represent sets or data compactly in computing and information processing.
Related topics:
Algorithms and Data Compression (18%),
Formal Methods in Verification (16%),
Logic, programming, and type systems (11%)
Wikidata ID:
wiki/Q1992074
OpenAlex ID:
keywords/bit-vectors
Z3: An Efficient SMT Solver
2008
·
Leonardo de Moura
, Nikolaj Bjørner
·
Lecture notes in computer science
·
10,298
Ambit: in-memory accelerator for bulk bitwise operations using commodity DRAM technology
2017
·
Vivek Seshadri
, Donghyuk Lee
, et al.
·
IEEE/ACM International Symposium on Microarchitecture (MICRO)
·
779
A Decision Procedure for Bit-Vectors and Arrays
2007
·
Vijay Ganesh
, David L. Dill
·
Springer eBooks
·
695
The YICES SMT Solver
2006
·
Bruno Dutertre
, Leonardo de Moura
·
640
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
2009
·
Robert Brummayer
, Armin Biere
·
Lecture notes in computer science
·
457
PDF
Decision Procedures: An Algorithmic Point of View
2008
·
Daniel Kroening
, Ofer Strichman
·
394
PDF
Global Data Flow Analysis and Iterative Algorithms
1976
·
John B. Kam
, Jeffrey D. Ullman
·
Journal of the ACM
·
336
PDF
The MathSAT 4 SMT Solver
2008
·
Roberto Bruttomesso
, Alessandro Cimatti
, et al.
·
Lecture notes in computer science
·
247
A Mechanically Checked Proof of IEEE Compliance of the Floating Point Multiplication, Division and Square Root Algorithms of the AMD-K7™ Processor
1998
·
David M. Russinoff
·
LMS Journal of Computation and Mathematics
·
207
PDF
Decision Procedures
2016
·
Daniel Kroening
, Ofer Strichman
·
Texts in theoretical computer science
·
196
The ELDARICA Horn Solver
2018
·
Hossein Hojjat
, Philipp Rummer
·
Formal Methods in Computer-Aided Design
·
195
GenASM: A High-Performance, Low-Power Approximate String Matching Acceleration Framework for Genome Sequence Analysis
2020
·
Damla Senol Cali
, Gurpreet S. Kalsi
, et al.
·
IEEE/ACM International Symposium on Microarchitecture (MICRO)
·
190
PDF
Privacy via the Johnson-Lindenstrauss Transform
2013
·
Krishnaram Kenthapadi
, Aleksandra Korolova
, et al.
·
Journal of Privacy and Confidentiality
·
160
PDF
Efficient parsing of highly ambiguous context-free grammars with bit vectors
2004
·
Helmut Schmid
·
International Conference on Computational Linguistics
·
150
PDF
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems
2021
·
Maciej Besta
, Raghavendra Kanakagiri
, et al.
·
IEEE/ACM International Symposium on Microarchitecture (MICRO)
·
147
PDF
Efficient Implementation of the Plan Graph in STAN
1999
·
D. Long
, M. Fox
·
Journal of Artificial Intelligence Research
·
142
PDF
Chapter 33. Satisfiability Modulo Theories
2021
·
Clark Barrett
, Roberto Sebastiani
, et al.
·
Frontiers in artificial intelligence and applications
·
141
ICS: Integrated Canonizer and Solver?
2001
·
Jean-Christophe Filliâtre
, Sam Owre
, et al.
·
Lecture notes in computer science
·
141
PDF
A characterization of the power of vector machines
1976
·
Vaughan R. Pratt
, Larry J. Stockmeyer
·
Journal of Computer and System Sciences
·
138
SMT-COMP: Satisfiability Modulo Theories Competition
2005
·
Clark Barrett
, Leonardo de Moura
, et al.
·
Lecture notes in computer science
·
131
SMTCoq: A Plug-In for Integrating SMT Solvers into Coq
2017
·
Burak Ekici
, Alain Mebsout
, et al.
·
Lecture notes in computer science
·
124
Succinct Dynamic Data Structures
2001
·
Rajeev Raman
, Venkatesh Raman
, et al.
·
Lecture notes in computer science
·
122
Tools
2007
·
Maxime Crochemore
, Christophe Hancart
, et al.
·
Cambridge University Press eBooks
·
117
Are Bitvectors Optimal?
2002
·
H. Buhrman
, P. B. Miltersen
, et al.
·
SIAM Journal on Computing
·
107
A Tutorial on Satisfiability Modulo Theories
2007
·
Leonardo de Moura
, Bruno Dutertre
, et al.
·
Lecture notes in computer science
·
94
PDF
Show more works
View as search
Works count:
559
Citation count:
15,280
Year
Topic
Type