Advisor

Sort by: Order: Results:

  • Bandwidth Problem in Graphs 
    YADAV, R. VINAY (2012-05)
    Bandwidth is a graph layout problem that is known for its difficulty even on small graph classes. The bandwidth problem of an arbitrary graph is known to be NP-complete. It is NP-complete even for a tree of maximum degree ...
  • On the security of Multi-Use Identity Based Proxy Re-Encryption 
    HAMBARDIKAR, KARTIK D (2012-05)
    In a proxy re-encryption (PRE) scheme, a proxy, authorized by Alice, transforms messages encrypted under Alices public key into encryptions under Bobs public key without learning anything about the underlying message(plaintext). ...

Search Repository


Advanced Search

Browse

My Account