Browsing by Subject "Data structures"

Now showing items 1-3 of 3

    • On size balanced binary search trees 

      Kumar, Anand (Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
      History independent data structures are useful when security and privacy are of primary concern. Even if an adversary gets copy of the data structure, he cannot obtain any additional information beyond its content. Important ...

    • Path complexity of maximum segment sum problem 

      Mishra, Devesh (Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
      Various software complexity metrics have been proposed in literature. A program complexity measure called path complexity is proposed in [1]. Path complexity P(A,n) of an algorithm A is defined to be the number of program ...

    • Path complexity of the class binary search tree 

      Doshi, Nishant (Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
      Path complexity of a program is defined as the number of program execution paths as a function of input size n. This notion of program complexity has been extended to complexity of a class as follows. Class had data members ...