And Gate
An "And Gate" is a logical gate in fault tree analysis that belongs to the class of Boolean logic operators, distinguished by requiring all of its input events to occur simultaneously for the output event to be realized.
163
Publications
8K
Citations
631
Authors
242
Institutions
Publications per year
2017–2026
50
Parents
163
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
Toshinori Araki, Jun Furukawa, Yehuda Lindell et al. · 2016 · 389 citations
The TFT A New Thin-Film Transistor
Paul J. Weimer · Proceedings of the IRE · 1962 · 295 citations
Easily Testable Realizations ror Logic Functions
S.M. Reddy · IEEE Transactions on Computers · 1972 · 278 citations
Computational functions in biochemical reaction networks
Adam P. Arkin, John Ross · Biophysical Journal · 1994 · 222 citations · Full text
1–5 of 163
631
3
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 631
242

Clarkson University
Potsdam, United States
4 h-index
16 publications
636 citations
NEC (Japan)
Tokyo, Japan
4 h-index
16 publications
1.8K citations
University of Southern California
Los Angeles, United States
3 h-index
7 publications
252 citations
Nanjing University of Posts and Telecommunications
Nanjing, China
3 h-index
12 publications
392 citations
Arizona State University
Tempe, United States
3 h-index
15 publications
2.1K citations
University of Science and Technology of China
Hefei, China
3 h-index
10 publications
384 citations

Nara Institute of Science and Technology
Ikoma, Japan
3 h-index
9 publications
252 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
6 publications
274 citations
1–8 of 242
JACS · 8 publications · 943 citations
8
h-index
5 publications · 237 citations
5
h-index
5 publications · 220 citations
5
h-index
3 publications · 95 citations
3
h-index
3 publications · 380 citations
3
h-index
1–5