- Application of Network Calculus to General Topologies using Turn-Prohibition
- REMARKS ON THE NUMBER OF LOGIC NETWORKS WITH SAME COMPLEXITY DERIVED FROM SPECTRAL
- Data veri cation and reconciliation with generalized error-control codes
- Fault-tolerant message routing in computer networks Lev Zakrevski, Mark Karpovsky
- on the weights of various walks that avoid 0 in the state diagram. This is closely tied to the minimum weight to length ratio of
- Application of Network Calculus to General Topologies using TurnProhibition
- Scalable, Distributed Cycle-Breaking Algorithms for Gigabit Ethernet
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-32, NO. 2, MARCH 1986 303 one can expect to identify pOI. For suppose dn,, = poi&, dt +
- Cycles Identifying Vertices and Edges in Binary Hypercubes and 2dimensional Tori
- Short dominating paths and cycles in the binary hypercube
- Robust Residue Codes for Fault-Tolerant Public-Key Arithmetic
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. , NO. , 1 New Class of Nonlinear Systematic Error Detecting
- 462 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-27, NO. 4, JULY 1981 Weight Distribution of Translates, Covering
- 328 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-31, NO. 3, MAY 1985 Covering Radius-Survey and Recent Results
- Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, November 3-6, 1999, Cambridge, USA A New Method for Deadlock Elimination in Computer Networks
- UNICAST MESSAGE ROUTING IN OMMUNICATION NETWORKS WITH IRREGULAR TOPOLOGY
- In this paper a universal model for breaking cycles is described. A method applicable to nondirected graphs is
- Recent Advent in Spectral Techniques in Binary and Multiple-Valued Switching Theory
- FAULT TOLERANT UNICAST WORMHOLE ROUTING IN IRREGULAR COMPUTER NETWORKS
- Scalable Cycle-Breaking Algorithms for Gigabit Ethernet Backbones
- REDUCTION OF THE NUMBER OF COEFFICIENTS IN ARITHMETIC EXPRESSIONS BY AUTOCORRELATION FUNCTIONS
- Remarks on Calculation of Autocorrelation on Finite Dyadic Groups by Local Transformations
- Delay Insensitive Encoding and Power Analysis: A Balancing Act Konrad J. Kulikowski, Ming Su, Alexander Smirnov, Alexander Taubin, Mark G. Karpovsky, Daniel MacDonald
- An Automated Fine-Grain Pipelining Using Domino Style Asynchronous Alexander Smirnov, Alexander Taubin, Ming Su, Mark Karpovsky
- Remarks on History of Abstract Harmonic Analysis Radomir S. Stankovic, Jaakko T. Astola1
- On robust and dynamic identifying codes Iiro Honkala
- DPA on Faulty Cryptographic Hardware and Countermeasures
- SOME HISTORICAL REMARKS ON SWITCHING THEORY Radomir S. Stankovic1
- Asynchronous Balanced Gates Tolerant to Interconnect Variability
- Concurrent Fault Detection for Secure QDI Asynchronous Circuits Konrad J. Kulikowski, Mark G. Karpovsky, Alexander Taubin, Zhen Wang
- Deadlock Prevention by Turn Prohibition in Interconnection Networks
- Replacing Linear Hamming Codes by Robust Nonlinear Codes Results in a Reliability Improvement of Memories
- Multilinear Codes for Robust Error Detection Zhen Wang, Mark Karpovsky
- J Electron Test (2010) 26:559580 DOI 10.1007/s10836-010-5168-5
- IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. V, NO. N, ANYMONTH 2009 1 Minimal Sets of Turns for Breaking Cycles in
- Algebraic Manipulation Detection Codes and Their Applications for Design of Secure Cryptographic Devices
- Diagnostic Model 1-Application of pseudorandom test patterns onto the primary inputs of n
- Robust codes and robust, fault-tolerant architectures of the Advanced Encryption Standard
- Automated Design of Cryptographic Devices Resistant to Multiple Side-Channel Attacks
- L. Breveglieri et al. (Eds.): FDTC 2006, LNCS 4236, pp. 211 222, 2006. Springer-Verlag Berlin Heidelberg 2006
- Robust Codes for Fault Attack Resistant Cryptographic Konrad J. Kulikowski, Mark G. Karpovsky, Alexander Taubin
- Delay Insensitive Encoding and Power Analysis: A Balancing Act Konrad J. Kulikowski, Ming Su, Alexander Smirnov, Alexander Taubin, Mark G. Karpovsky, Daniel MacDonald
- Duplication Based One-to-many Coding for Trojan HW Detection Osnat Keren
- Nonlinear Codes for Error Detection and Correction in Reliable Memory Systems
- Space-Time Turn Prohibitions for Low Density Parity-Check Codes
- Robust Codes and Robust, Fault Tolerant Architectures of the Advanced Encryption Standard
- Robust Codes for Fault Attack Resistant Cryptographic Konrad J. Kulikowski, Mark G. Karpovsky, Alexander Taubin
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-Z, NO. 1, JANUARY 1979 105 T. Kasami and S. Lin, "Coding for a multiple-access channel," IEEE
- Influence of Metallic Tubes on the Reliability of CNTFET SRAMs: Error Mechanisms and Countermeasures
- Spectral Techniques for Design and Testing of Computer Hardware Mark G. Karpovsky Radomir S. Stankovi c Jaakko T. Astola
- Cycle Breaking in Wormhole Routed Computer Communication Networks
- Comparative Analysis of Robust Fault Attack Resistant Architectures for Public and Private Cryptosystems
- Gate Transfer Level Synthesis as an Automated Approach to Fine-Grain Alexandre Smirnov
- Algebraic Manipulation Detection Codes for Secure Communication and Computation Channels
- Fault Attack Resistant Cryptographic Hardware with Uniform Error Detection
- Robust Correction of Repeating Errors in by Nonlinear Codes
- DIFFERENTIAL FAULT ANALYSIS ATTACK RESISTANT ARCHITECTURES FOR THE
- Reduction of Sizes of Decision Diagrams by Autocorrelation Functions
- Robust Protection against Fault-Injection Attacks on Smart Cards Implementing the Advanced Encryption Standard*
- An approach for designing on-line testable state machines P. K. Lala M. G. Karpovsky
- Remarks on Codes, Spectral Transforms, and Decision Diagrams Radomir S. Stankovic, Mark G. Karpovsky1
- Secure Multipliers Resilient to Strong Fault-Injection Attacks Using Multilinear Arithmetic Codes
- BIST for Word-Oriented DRAM L. Zakrevski, M. Karpovsky, S. H. Yang
- Power Attacks on Secure Hardware Based on Early Propagation of Data Konrad J. Kulikowski, Mark G. Karpovsky, Alexander Taubin
- Nonlinear Multi-Error Correction Codes for Reliable NAND Flash Memories
- PIECEWISE LINERIZATION OF LOGIC FUNCTIONS* The work was supported by BSF under Grant 2002259
- Fault-Tolerant Message Routing for Multiprocessors Lev Zakrevski, Mark Karpovsky
- SOME HISTORIC REMARKS ON SAMPLING THEOREM Raromir S. Stankovic1
- A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph*
- DIFFERENTIAL FAULT ANALYSIS ATTACK RESISTANT ARCHITECTURES FOR THE
- COURSE INFORMATION EC327 Introduction to Software Engineering
- The Department of Electrical & Computer Engineering (ECE) at Boston University (BU) is seeking candi-dates for several anticipated faculty positions. All areas and ranks will be considered, with particular interest in
- Boston University Fall 2011 ECE Department
- EC513: Computer Architecture Fall, 2010 Instructor: Martin Herbordt, PHO 333
- ENGEK131EF Spring2011 Smart Lighting Intro to Engineering
- EC 577: Electrical Optical and Magnetic Properties of Materials Professor Theodore. D. Moustakas
- Boston University Department of Electrical and Computer Engineering
- 2011/2012 Faculty Search Applying for an ECE Faculty Position
- Boston University EC 578 FABRICATION TECHNOLOGY OF INTEGRATED CIRCUITS
- EK 131/132 Photonics Engineering with light This 6 week freshman engineering module offers a brief introduction to the physical principles of light
- EC 535 Introduction to Embedded Systems Spring 2011 Instructor: Prof. Ayse Coskun
- EC512EnterpriseClient/ServerSoftware BostonUniversity
- BOSTON UNIVERSITY Department of Electrical & Computer Engineering
- EC447SoftwareDesign BostonUniversity
- Course Number: EC 571 Course Name: VLSI Principles & Applications Semester: Spring 2011
- Running head: DEADLOCK PREVENTION IN NETWORK OF WORKSTATIONS 1 Deadlock Prevention in Network of Workstations with Wormhole Routing
- Running head: DEADLOCKPREVENTION In MULTIPROCESSOR SYSTEMS 1 Deadlock Prevention in Multiprocessor Systems with Wormhole Routing
- Reliable and Secure Memories Based on Algebraic Manipulation Detection Codes and Robust Error Correction
