default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLev B. Levitin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c22]Yelena Rykalova, Lev B. Levitin:
Multidimensional Computer Interconnection Networks with the Virtual Cut-Through Routing. FNC/MobiSPC/SEIT 2022: 79-86- 2020
- [c21]Lev B. Levitin, Yelena Rykalova:
Virtual Cut-Through Routing in Multidimensional Interconnection Networks. ISNCC 2020: 1-6
2010 – 2019
- 2019
- [c20]Lev B. Levitin, Yelena Rykalova:
An Analytical Model for Virtual Cut-Through Routing. ICCCN 2019: 1-7 - [c19]Yelena Rykalova, Lev B. Levitin:
Simulation Study of Interconnection Networks with Virtual Cut-Through Routing. SpringSim 2019: 1-12 - 2018
- [c18]Lev B. Levitin, Yelena Rykalova:
Critical Phenomena in Interconnection Networks with Heterogeneous Activity. NCA 2018: 1-5 - 2017
- [c17]Yelena Rykalova, Lev B. Levitin:
Virtual cut-through routing in toroidal interconnection networks. NCA 2017: 339-342 - 2015
- [c16]Lev B. Levitin, Tommaso Toffoli:
Information retrievable from an image in natural light. ICACCI 2015: 1596-1598 - 2014
- [j12]Mark G. Karpovsky, Lev B. Levitin, Mehmet Mustafa:
Optimal Turn Prohibition for Deadlock Prevention in Networks With Regular Topologies. IEEE Trans. Control. Netw. Syst. 1(1): 74-85 (2014) - 2012
- [c15]Lev B. Levitin, Tommaso Toffoli:
Work recoverable from two-particle information. ISIT 2012: 1069-1071 - 2011
- [c14]Yelena Rykalova, Lev B. Levitin:
Latency and saturation in networks with finite buffers. SpringSim (CNS) 2011: 43-50 - [i1]Lev B. Levitin, Tommaso Toffoli:
Work recoverable from two-particle information. CoRR abs/1101.1325 (2011) - 2010
- [j11]Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa:
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks. IEEE Trans. Parallel Distributed Syst. 21(9): 1342-1353 (2010)
2000 – 2009
- 2009
- [c13]Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa:
Deadlock prevention by turn prohibition in interconnection networks. IPDPS 2009: 1-7 - [c12]Yelena Rykalova, Lev B. Levitin, Richard Brower:
Multiprocessor networks with small buffers: theory and simulation. SpringSim 2009 - 2007
- [c11]Yelena Rykalova, Lev B. Levitin, Richard Brower:
Modeling of Latency and Saturation Phenomena in Interconnection Networks. ISCC 2007: 1001-1006 - [c10]Yelena Rykalova, Lev B. Levitin, Richard Brower:
Performance model of a multiprocessor interconnection network: theory and simulation. SpringSim (1) 2007: 100-105 - 2006
- [j10]Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa, Lev Zakrevski:
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph. J. Graph Algorithms Appl. 10(2): 387-420 (2006) - [j9]Iiro S. Honkala, Mark G. Karpovsky, Lev B. Levitin:
On robust and dynamic identifying codes. IEEE Trans. Inf. Theory 52(2): 599-612 (2006) - [c9]Lev B. Levitin, Tommaso Toffoli:
Thermodynamic Cost of Reversible Computing. ISIT 2006: 2082-2084 - 2005
- [c8]Tommaso Toffoli, Lev B. Levitin:
Specific ergodicity: an informative indicator for invertible computational media. Conf. Computing Frontiers 2005: 52-58 - [c7]Lev B. Levitin, Tommaso Toffoli:
Thermodynamical cost of reversible computing. Conf. Computing Frontiers 2005: 445-446 - 2004
- [c6]Francesco De Pellegrini, David Starobinski, Mark G. Karpovsky, Lev B. Levitin:
Scalable Cycle-Breaking Algorithms for Gigabit Ethernet Backbones. INFOCOM 2004: 2175-2184 - 2003
- [j8]Mark G. Karpovsky, Lev B. Levitin, Ari Trachtenberg:
Data verification and reconciliation with generalized error-control cod. IEEE Trans. Inf. Theory 49(7): 1788-1793 (2003)
1990 – 1999
- 1999
- [j7]Mark G. Karpovsky, Krishnendu Chakrabarty
, Lev B. Levitin, Dimiter R. Avresky:
On the Covering of Vertices for Fault Diagnosis in Hypercubes. Inf. Process. Lett. 69(2): 99-103 (1999) - 1998
- [j6]Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. Levitin:
On a New Class of Codes for Identifying Vertices in Graphs. IEEE Trans. Inf. Theory 44(2): 599-611 (1998) - [c5]Lev B. Levitin:
Quantum Generalization of Conditional Entropy and Information. QCQC 1998: 269-275 - 1994
- [j5]Mark G. Karpovsky, Lev B. Levitin, Feodor S. Vainstein:
Diagnosis by Signature Analysis of Test Responses. IEEE Trans. Computers 43(2): 141-152 (1994) - 1993
- [c4]Mark G. Karpovsky, Saeed M. Chaudhry, Lev B. Levitin, Claudio Moraga:
Detection and Location of Given Sets of Errors by Nonbinary Linear Codes. Algebraic Coding 1993: 172-193 - 1992
- [c3]Mark G. Karpovsky, Saeed M. Chaudhry, Lev B. Levitin:
Multiple Signature Analysis: A Framework for Built-In Self-Diagnostic. FTCS 1992: 112-119 - 1991
- [j4]Prawat Nagvajara, Mark G. Karpovsky, Lev B. Levitin:
Pseudorandom Testing for Boundary-Scan Design with Built-In Self-Test. IEEE Des. Test Comput. 8(3): 58-65 (1991) - [c2]Prawat Nagvajara, Mark G. Karpovsky, Lev B. Levitin:
Efficient test generation for built-in self-test boundary-scan template. VTS 1991: 277-284 - 1990
- [c1]Mark G. Karpovsky, Lev B. Levitin, Feodor S. Vainstein:
Identification of faulty processing elements by space-time compression of test responses. ITC 1990: 638-647
1980 – 1989
- 1985
- [j3]Lev B. Levitin, Carlos R. P. Hartmann:
A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm. IEEE Trans. Inf. Theory 31(3): 378-384 (1985) - 1983
- [j2]Mark G. Karpovsky, Lev B. Levitin:
Detection and identification of input/output stuck-at and bridging faults in combinational and sequential VLSI networks by universal tests. Integr. 1(2-3): 211-232 (1983)
1960 – 1969
- 1966
- [j1]D. S. Lebedev, Lev B. Levitin:
Information Transmission by Electromagnetic Field. Inf. Control. 9(1): 1-22 (1966)
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-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
