Search the dblp DataBase

Publications of Author

1. Christoforos N. Hadjicostis, George C. Verghese
   Monitoring Discrete Event Systems Using Petri Net Embeddings. [Citation Graph (0, 0)][DBLP]
   ICATPN, 1999, pp:188-207 [Conf]
   
2. Ying Xiao, Christoforos N. Hadjicostis, Krishnaiyan Thulasiraman
   The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm. [Citation Graph (0, 0)][DBLP]
   COCOON, 2006, pp:284-298 [Conf]
   
3. Shreyas Sundaram, Christoforos N. Hadjicostis
   Non-concurrent Error Detection and Correction in Switched Linear Controllers. [Citation Graph (0, 0)][DBLP]
   HSCC, 2004, pp:585-599 [Conf]
   
4. Shreyas Sundaram, Christoforos N. Hadjicostis
   Distributed consensus and linear functional calculation in networks: an observability perspective. [Citation Graph (0, 0)][DBLP]
   IPSN, 2007, pp:99-108 [Conf]
   
5. E. Athanasopoulou, Christoforos N. Hadjicostis
   Upper and lower bounds on FSM switching activity. [Citation Graph (0, 0)][DBLP]
   ISCAS (5), 2003, pp:417-420 [Conf]
   
6. Christoforos N. Hadjicostis
   Encoded finite-state machines for non-concurrent error detection and identification. [Citation Graph (0, 0)][DBLP]
   ISCAS (3), 2003, pp:858-861 [Conf]
   
7. Christoforos N. Hadjicostis
   Aliasing probability calculations in nonlinear compactors. [Citation Graph (0, 0)][DBLP]
   ISCAS (5), 2003, pp:529-532 [Conf]
   
8. Christoforos N. Hadjicostis, George C. Verghese
   Power system monitoring based on relay and circuit breaker information. [Citation Graph (0, 0)][DBLP]
   ISCAS (3), 2001, pp:197-200 [Conf]
   
9. Anant Agarwal, John V. Guttag, Christoforos N. Hadjicostis, Marios C. Papaefthymiou
   Memory Assignment for Multiprocessor Caches through Grey Coloring. [Citation Graph (0, 0)][DBLP]
   PARLE, 1994, pp:351-362 [Conf]
   
10. Christoforos N. Hadjicostis
    Coding Techniques for Fault-Tolerant Parallel Prefix Computations in Abelian Groups. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2004, v:47, n:3, pp:329-341 [Journal]
    
11. Christoforos N. Hadjicostis
    Aliasing Probability Calculations for Arbitrary Compaction under Independently Selected Random Test Vectors. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2005, v:54, n:12, pp:1614-1627 [Journal]
    
12. Christoforos N. Hadjicostis, George C. Verghese
    Coding approaches to fault tolerance in linear dynamic systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:210-228 [Journal]
    
13. Yingquan Wu, Christoforos N. Hadjicostis
    Soft-Decision Decoding Using Ordered Recodings on the Most Reliable Basis. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:2, pp:829-836 [Journal]
    
14. Yingquan Wu, Christoforos N. Hadjicostis
    Soft-Decision Decoding of Linear Block Codes Using Preprocessing and Diversification. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:1, pp:378-393 [Journal]
    
15. 
    Graphical Inference Methods for Fault Diagnosis based on Information from Unreliable Sensors. [Citation Graph (, )][DBLP]
    
    
16. 
    Low-complexity max-product algorithms for problems of multiple fault diagnosis. [Citation Graph (, )][DBLP]
    
    
17. 
    Opacity-enforcing supervisory strategies for secure discrete event systems. [Citation Graph (, )][DBLP]
    
    
18. 
    Supervisor synthesis for discrete event systems with arbitrary forbidden state specifications. [Citation Graph (, )][DBLP]
    
    
19. 
    Probability of error bounds for failure diagnosis and classification in hidden Markov models. [Citation Graph (, )][DBLP]
    
    
20. 
    Distributed calculation of linear functions in noisy networks via linear iterations. [Citation Graph (, )][DBLP]
    
    
21. 
    Verification of K-step opacity and analysis of its complexity. [Citation Graph (, )][DBLP]
    
    
22. 
    Reachability analysis for a class of Petri nets. [Citation Graph (, )][DBLP]
    
    
23. 
    Information dissemination in networks via linear iterative strategies over finite fields. [Citation Graph (, )][DBLP]