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

Authors

631

  1. AM
    Ali Muhammad Ali Rushdi

    King Abdulaziz University, Saudi Arabia

    10 publications · 182 citations

    10

    h-index

  2. RS
    Ratko Stanković

    University of Nis, Serbia

    8 publications · 157 citations

    8

    h-index

  3. SB
    Sheldon B. Akers

    General Electric (United States), United States

    6 publications · 284 citations

    6

    h-index

  4. SH
    S.L. Hurst

    University of Bath, United Kingdom

    5 publications · 154 citations

    5

    h-index

  5. AK
    Abraham Kandel

    University of South Florida, United States

    4 publications · 72 citations

    4

    h-index

1–5 of 631

Venues

  1. IEEE Transactions on Computers

    55 publications · 1.8K citations

    23

    h-index

  2. IEEE Transactions on Electronic Computers

    21 publications · 1.1K citations

    16

    h-index

  3. IEEE Transactions on Power Electronics

    11 publications · 1.1K citations

    10

    h-index

  4. International Journal of Electronics

    7 publications · 198 citations

    7

    h-index

  5. Journal of the ACM

    JACM · 5 publications · 214 citations

    5

    h-index

1–5