The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Arindam Mitra: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Arindam Mitra, Muthucumaru Maheswaran
    Trusted Gossip: A Rumor Resistant Dissemination Mechanism for Peer-to-Peer Information Sharing. [Citation Graph (0, 0)][DBLP]
    AINA, 2007, pp:702-707 [Conf]
  2. Arindam Mitra, Ranganath Udupa, Muthucumaru Maheswaran
    A secured hierarchical trust management framework for public computing utilities. [Citation Graph (0, 0)][DBLP]
    CASCON, 2005, pp:185-199 [Conf]
  3. Arindam Mitra, Ranganath Udupa, Muthucumaru Maheswaran
    A secure trust and incentive management framework for public-resource based computing utilities. [Citation Graph (0, 0)][DBLP]
    CCGRID, 2005, pp:267-274 [Conf]
  4. Arindam Mitra, Muthucumaru Maheswaran, Shoukat Ali
    Measuring Scalability of Resource Management Systems. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  5. Arindam Mitra, Muthucumaru Maheswaran, Jose A. Rueda
    Wide-Area Content-Based Routing Mechanism. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:246- [Conf]
  6. Muthucumaru Maheswaran, Balasubramaneyam Maniymaran, Shah Asaduzzaman, Arindam Mitra
    Towards a Quality of Service Aware Public Computing Utility. [Citation Graph (0, 0)][DBLP]
    NCA, 2004, pp:376-379 [Conf]
  7. Farag Azzedin, Muthucumaru Maheswaran, Arindam Mitra
    Trust Brokering and Its Use for Resource Matchmaking in Public-Resource Grids. [Citation Graph (0, 0)][DBLP]
    J. Grid Comput., 2006, v:4, n:3, pp:247-263 [Journal]
  8. Arindam Mitra, Muthucumaru Maheswaran
    Impact of Peer Churning in Trusted Gossiping for P2P Information Sharing. [Citation Graph (0, 0)][DBLP]
    ICDCS Workshops, 2007, pp:31- [Conf]
  9. Arindam Mitra, Muthucumaru Maheswaran
    Benefits of Targeting in Trusted Gossiping for Peer-to-Peer Information Sharing. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-10 [Conf]
  10. Arindam Mitra
    Quantum communication is possible with pure ensemble of entangled states [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  11. Arindam Mitra
    An unbreakable cryptosystem for common people [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  12. Arindam Mitra
    Quantum mechanics can alone provide security in communication [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  13. Arindam Mitra
    Quantum mechanics can force us to be completely honest and unbiased [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  14. Arindam Mitra
    Is entanglement necessary to have unconditional security in quantum bit commitment ? [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  15. Arindam Mitra
    An unbreakable cryptosystem [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]

  16. Human brain and classical computer can generate true random numbers through algorithmic process [Citation Graph (, )][DBLP]


  17. Quantum mechanics allows zero-bias [Citation Graph (, )][DBLP]


  18. With minimum energy cost nothing can be transmitted faster than information [Citation Graph (, )][DBLP]


  19. Entangled messages [Citation Graph (, )][DBLP]


  20. Quantum theory can be collectively verified [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002