Compressing Binary Decision Diagrams (2008)
Hansen, Esben Rune, Rao, S. Srinivasa, Tiedemann, Peter
The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in...
Computing Refined Buneman Trees in Cubic Time (2003)
Gerth Stlting Brodal, Rolf Fagerberg, Ostlin Christian N. S. Pedersen, S. Srinivasa Rao
Reconstructing the evolutionary tree for a set of n species based on pairwise distances between the species is a fundamental problem in bioinformatics. Neighbor joining is a popular distance based...
Full-Text Indexes in External Memory (2003)
Kärkkäinen, Juha, Rao, S. Srinivasa, Meyer, Ulrich, Sanders, Peter, Sibeyn, Jop
Succinct Dynamic Data Structures (2001)
We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array consisting of a sequence of...
Explicit Deterministic Constructions for Membership in the Bitprobe Model (2001)
Jaikumar Radhakrishnan, S. Srinivasa Rao
We look at time-space tradeoffs for the static membership problem in the bit-probe model. The problem is to represent a set of size up to n from a universe of size m using a small number of bits so...
Space Efficient Suffix Trees (2001)
J. Ian Munro, S. Srinivasa Rao
We give the first representation of a suffix tree that uses n lg n+O(n) bits of space and supports searching for a pattern string in the given text (from a fixed size alphabet)in O(m) time, where n...
Static Dictionaries Supporting Rank (2001)
Venkatesh Raman, S. Srinivasa Rao
A static dictionary is a data structure for storing a subset S of a finite universe U so that membership queries can be answered efficiently. We explore space efficient structures to also find the...
A Simplified NP-complete MAXSAT Problem (2001)
B. Ravikumar, S. Srinivasa Rao
It is shown that the MAX2SAT problem is NP-complete even if every variable appears in at most three clauses. However, if every variable appears in at most two clauses, it is shown that it (and even...
Space Efficient Suffix Trees (2001)
We first give a representation of a suffix tree that uses n lg n + O(n) bits of space and supports searching for a pattern in the given text (from a fixed size alphabet) in O(m) time, where n is the...
An Analysis of Environmental Sustainability Index for G-8 and SAARC Countries
In the year 1990, the OECD countries initiated a specific program on environmental indicator to track environmental progress and integrate environmental concerns into decision-making. Subsequently,...