Switching Functions
Switching Functions is a mathematical function in Boolean algebra that maps a finite sequence of binary input variables to a binary output, distinguished by its representation and manipulation using logical operations for modeling digital circuits and decision processes.
335
Publications
15.1K
Citations
631
Authors
316
Institutions
Publications per year
2017–2026
34
Parents
335
Stabilization of switched linear systems
Daizhan Cheng, Lei Guo, Yuandan Lin et al. · IEEE Transactions on Automatic Control · 2005 · 326 citations
1–5 of 335
631
10
h-index
8
h-index
6
h-index
5
h-index
4
h-index
1–5 of 631
316

King Abdulaziz University
Jeddah, Saudi Arabia
11 h-index
15 publications
306 citations
General Electric (United States)
Boston, United States
8 h-index
11 publications
427 citations
University of Wisconsin–Madison
Madison, United States
8 h-index
9 publications
468 citations
Shandong University
Jinan, China
7 h-index
18 publications
712 citations
SRI International
Menlo Park, United States
6 h-index
8 publications
442 citations
University of Southern California
Los Angeles, United States
6 h-index
9 publications
390 citations
Princeton University
Princeton, United States
6 h-index
11 publications
880 citations
University of Nis
Niš, Serbia
6 h-index
9 publications
161 citations
1–8 of 316
55 publications · 1.8K citations
23
h-index
21 publications · 1.1K citations
16
h-index
11 publications · 1.1K citations
10
h-index
7 publications · 198 citations
7
h-index
JACM · 5 publications · 214 citations
5
h-index
1–5