default search action
Zvi Kohavi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1995
- [j18]Tatiana Orenstein, Zvi Kohavi, Irith Pomeranz:
An optimal algorithm for cycle breaking in directed graphs. J. Electron. Test. 7(1-2): 71-81 (1995) - 1992
- [j17]Irith Pomeranz, Zvi Kohavi:
A limited exponential complexity algorithm for increasing the testability of digital circuits by testing-module insertion. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(2): 247-259 (1992) - 1991
- [j16]Irith Pomeranz, Zvi Kohavi:
The minimum test set problem for circuits with nonreconvergent fanout. J. Electron. Test. 2(4): 339-349 (1991) - [j15]Irith Pomeranz, Zvi Kohavi:
Polynomial Complexity Algorithms for Increasing the Testability of Digital Circuits by Testing Module Insertion. IEEE Trans. Computers 40(11): 1198-1214 (1991) - 1979
- [j14]Israel Koren, Zvi Kohavi:
On the Properties of Sensitized Paths. IEEE Trans. Computers 28(3): 268-269 (1979) - 1977
- [j13]Israel Koren, Zvi Kohavi:
Sequential Fault Diagnosis in Combinational Networks. IEEE Trans. Computers 26(4): 334-342 (1977) - [j12]Israel Koren, Zvi Kohavi:
Diagnosis of Intermittent Faults in Combinational Networks. IEEE Trans. Computers 26(11): 1154-1158 (1977) - 1975
- [j11]Zvi Kohavi, Israel Berger:
Fault Diagnosis in Combinational Tree Networks. IEEE Trans. Computers 24(12): 1161-1167 (1975) - 1974
- [j10]Zvi Kohavi, J. A. Rivierre, Igal Kohavi:
Checking experiments for sequential machines. Inf. Sci. 7: 11-28 (1974) - 1973
- [j9]Zvi Kohavi, J. A. Rivierre, Igal Kohavi:
Machine Distinguishing Experiments. Comput. J. 16(2): 141-147 (1973) - [j8]Zvi Kohavi, Joseph Winograd:
Establishing Certain Bounds Concerning Finite Automata. J. Comput. Syst. Sci. 7(3): 288-299 (1973) - [j7]Israel Berger, Zvi Kohavi:
Fault Detection in Fanout-Free Combinational Networks. IEEE Trans. Computers 22(10): 908-914 (1973) - 1972
- [j6]Igal Kohavi, Zvi Kohavi:
Detection of Multiple Faults in Combinational Logic Networks. IEEE Trans. Computers 21(6): 556-568 (1972) - 1971
- [j5]Zvi Kohavi, DeWayne A. Spires:
Designing Sets of Fault-Detection Tests ror Combinational Logic Circuits. IEEE Trans. Computers 20(12): 1463-1469 (1971) - 1968
- [j4]Igal Kohavi, Zvi Kohavi:
Variable-Length Distinguishing Sequences and Their Application to the Design of Fault-Detection Experiments. IEEE Trans. Computers 17(8): 792-795 (1968) - 1967
- [j3]Zvi Kohavi, Pierre Lavallée:
Design of Sequential Machines with Fault-Detection Capabilities. IEEE Trans. Electron. Comput. 16(4): 473-484 (1967) - 1965
- [j2]Zvi Kohavi:
Reduction of Output Dependency in Sequential Machines. IEEE Trans. Electron. Comput. 14(6): 932-934 (1965) - 1964
- [j1]Zvi Kohavi:
Secondary State Assignment for Sequential Machines. IEEE Trans. Electron. Comput. 13(3): 193-203 (1964)
Conference and Workshop Papers
- 1967
- [c3]Zvi Kohavi, Pierre Lavallée:
Design of diagnosable sequential machines. AFIPS Spring Joint Computing Conference 1967: 713-718 - 1966
- [c2]Edward J. Smith, Zvi Kohavi:
Synthesis of Multiple Sequential Machines. SWAT 1966: 160-171 - 1965
- [c1]Zvi Kohavi, Edward J. Smith:
Decomposition of sequential machines. SWCT 1965: 52-61
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint