- X = TX'. (7) Utilizing the relation in (7) in the respective state model of the
- Constrained Shortest Link-Disjoint Paths Selection: A Network Programming Based Approach
- IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, VOL. CA+22, NO. 12, DECEMBER 1975 937 Synthesisof ResistiveNetworks from Third-
- A Scalable On-Line Multilevel Distributed Network Fault Detectioflonitoring System Based on the SNMP Protocol
- The Primal Simplex Approach to the QoS Routing Problem Ying Xiao, Krishnaiyan Thulasiraman
- PROCEEDINGS OF THE IEEE,VOL.71, NO. 11,NOVEMBER 1983 Proceedings letters
- Logical Topology Augmentation for Guaranteed Survivability under Multiple Failures in IP-over-WDM Optical Network
- The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis
- "Proceedings of the 1973 IEEE International 5ympos;um on Circuit Theory" OF RRTIONAL VOLTXE TRANSFER MATRICES USING
- A Matroid-Theoretic Solution to an Assignment Problem in the Conformance
- JOURNAL OF INDUSTRIAL AND Website: http://AIMsciences.org MANAGEMENT OPTIMIZATION
- SYSTEM LEVEL DIAGNOSIS WITH LOCAL CONSTRAINTS
- 482 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, VOL. CA%22,NO.6, JUNE1975 The n-Port ResistiveNetwork Synthesisfrom
- Managed Dynamic VPN Service: Core Capacity Sharing Schemes For Improved
- I971 THK MA TRIX AND TENSOR QUARTERLY 5 1 On a Theorem h Gro?h Theory-.
- Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design
- XUE ET AL., TO APPEAR IN IEEE JSAC-OCN 1 An Improved Algorithm for Optimal Lightpath
- PROCEEDINGS LETTERS 1143 -0.04 -0.03 -0.02 -0.01 0.0i 0.02 0.03 0.04
- EVOLUTIONARY COMPUTATION, 1994 A Genetic Algorithm for Channel Routing in VLSI Circuits*
- Advances in QoS Path(s) Selection Problem Krishnaiyan Thulasiramn, Ying Xiao
- 1971 THE MA TRlX AND TENSOR QLIARTERLY 65 Unirnodul ar Property of Fundamentol Cut-Set and Circuit Motrices
- Fault-Tolerant Routing in Planarly Constructed Fault Blocks
- DistributedDiagnosis for MultiprocessorSystemsusing ExtendedLocal Neighborhoods
- JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL. 9, NO. 4, DECEMBER 2007 1 Lightpaths Routing for Single Link Failure Survivability
- MULTI-CONSTRAINED QOS ROUTING 1 Polynomial Time Approximation Algorithms for
- Topology Abstraction As VPN Service Ravi S. Ravindran1
- Floorplanning with Datapath Optimization A. SAFIR, B. HAROUN and K. THULASIRAMAN
- 296 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, VOL. CAS-32, NO. 3, MARCH 1985 The FFT has clear advantages over the matrix-vector product
- SIAM J. COMPUT. Vol. 23, No. 5, pp. 895-905, October 1994
- Logical Topology Design for IP-over-WDM Networks: A Hybrid Approach for Minimum
- Faster Algorithms for Constructing Recovery Trees Enhancing QoP and QoS
- GUOLIANG XUE ET AL.: FINDING A PATH SUBJECT TO MANY ADDITIVE QOS CONSTRAINTS 1 Finding a Path Subject to Many Additive QoS
- Vertex Identifying Codes for Fault Isolation in Communication Networks
- QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal
- GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem under
- Establishment of Survivable Connections in WDM Networks using Partial Path Protection
- IEEE TRANSACTIONS ON COMPUTERS, VOL. 51, NO. 9, SEPTEMBER 2002 1117 The second improvement upon [13] is based upon the
- Multi-Level Adaptive Distributed Diagnosis for Fault Detection in a
- The Multi-Level Paradigm for Distributed Fault Detection in Networks with Unreliable Processors
- Correct Diagnosis of Almost A 1 Faulty Units in a Multiprocessor System K. Thulasiraman' Anindya Dad Kaiyuan Huang2
- 136 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 17, NO. 2, FEBRUARY 1998 Diagnosis of Clustered Faults and Wafer Testing
- Fault Tolerance of the Global Navigation SatelliteSystem using System-LevelDiagnosis
- On testing and diagnosis of communication protocols based on
- Fault detection and diagnosis capabilities of test sequence selection
- Parallel Hierarchical Global Routing for General Cell Layout Sanjay Khanna , Shaodi Gao and If'. Thulasiraman
- A Floorplanner driven by Structural and Timing Constraints.
- ,EEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, VOL. CAS-34,NO. 3, MARCH1987 317 Circuits and SystemsLetters
- IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, VOL. CAS-33, NO. 8, AUGUST 1986 843 On Maximal Planarizationof NonplanarGraphs Type H: A node X is said to be Type H if the subtree rooted
- IEEE TRANSACTIONS ON CIRCUIT THEORY, VOL. CT-19, NO. 6, NOVEMBER 1972 599 Sensitivity Invariants for Nonlinear Networks
- 502 IEEE TRANSACTIONSON CIRCUIT THEORY, SEPTEMBER 1972 3) Doubly Exponential Probability Density Fhzction: The calcula-
- CORRESPONDENCE 51.5 ZXeorem 2: A necessary condition for the coefficients of the VTF
- SYNTHESIS OF THE K-MATRIX OF (n+l)-RODE RESISTIVE n-PORT NETWORKS P. Subbarami Reddy and K. Thulasiraman*
- SYNTIIESIS OF MULTIVARXABLE NETWORKS M,N.S. Swamy and K. Thulasiraman*
- IEEE TRANSACTIONS ON CIRCUIT THEORY, VOL.CT-17,NO.4, NOVEMBER1970 475 electronic circuit?," Proc. 6th Midwest Symp. Circuit Theory
- 2 IEEE TRANSACTIONS ON CIRCUIT THEORY, VOL. CT-16, NO. 1, BBBRUARY 1969 The Modified Circuit Matrix of an &Port
- 54 IEEE TRANSACTIONS ON CIRCUIT THEORY, VOL. CT-15,NO. 1, MARCH 1968 Synthesis of a Class of n-Port Networks
- 1216 PROCEEDINGSOFTHEIEEE, JULY 1967 D E L x l u N ? Q w s 1 9 T s o F M f ~ ~ D G d e * ( I ~ .
- CORRESPONDENCE will contain all the directed circuits of G containing the vertex vi.
- INDIAN INSTITUTE OF TECHNOLOGY MADRAS DISTINGUISHED ALUMNUS AWARD 2008
- IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 21, NO. 6, JUNE 2002 685 Multilevel Cooperative Search for the
- 978-1-4244-5489-1/10/ $26.00 2010 IEEE Primal Meets Dual: A Generalized Theory of
- IEEETRANSACTIONSON CIRCUITSAND SYSTEMS,VOL. CAS-31,NO. lo, OCTOBER1984 853 Complexity of Computation of a Spanning
- India-Taiwan Conference on Discrete Mathematics, NTU, November 9-`12, 2009 107 Duality in graphs and logical topology survivability
- On the Design of a Parallel Algorithm for VLSI Layout Compaction K. Thulasiraman, M.A. Comeau, R.P. Chalasani,A. Das
- IEEE TRANSACTIONS ON CIRCUIT THEORY, VOL. CT-20, NO. 1, JANUARY 1973 Sensitivity Invariants For Linear Time-Invariant Networks
- 20 IEEE TRANSACTIONS ON CIRCUIT THEORY, VOL. CT-19, NO. 1, JANUARY 1972 [lo] R. Yarlagadda, "An application of tridiagonal matrices to net-[14] S. Seshuand M. B. Reed, Linear Graphs and Electrical Networks.
- Similarity of graphs and enumeration of dissimilar nth order symmetric sign patterns
- 1332 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 8, OCTOBER 2003 Quality-of-Service and Quality-of-Protection
- IntegratedVLSI Layout Compaction and Wire Balancingon a SharedMemory Multiprocessor: Evaluationof a ParallelAlgorithm
- Survivability Aware Routing of Logical Topologies: On Thiran-Kurant Approach, Enhancements and
- IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, VOL. CAS-34,NO. 12,DECEMBER 1987 1535 Maximum-Weight Markings in Marked
- Self-Organizationin Cooperative Tabu Search Algorithms Michel Toulouse
- 450 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS--II: EXPRESS BRIEFS, VOL. 54, NO. 5, MAY 2007 Constraining Transition Propagation for Low-Power
- IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS,VOL. 36, NO. 2, FEBRUARY 1989 219 MOD-CHAR: An Implementation of Char's
- Approximation and Heuristic Algorithms for Delay Constrained Path Selection under Inaccurate State Information
