#### Filter Results:

#### Publication Year

2010

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ajesh Babu, Nutan Limaye, Girish Varma
- Electronic Colloquium on Computational Complexity
- 2010

In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. If the input data is massive , the conventional deterministic log-space algorithms may not run efficiently. We study the complexity of the problems when the number of passes is bounded. The… (More)

- Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, Girish Varma
- Theor. Comput. Sci.
- 2013

We study the complexity of the following problems in the streaming model. Membership testing for DLIN. We show that every language in DLIN can be recognised by a randomized one-pass O(log n) space algorithm with inverse polynomial one-sided error, and by a deterministic p-pass O(n/p) space algorithm. We show that these algorithms are optimal. Membership… (More)

- Ajesh Babu, Jaikumar Radhakrishnan
- ArXiv
- 2010

We provide proofs of the following theorems by considering the entropy of random walks. Theorem 1.(Alon, Hoory and Linial) Let G be an undirected simple graph with n vertices, girth g, minimum degree at least 2 and average degree ¯ d.

- Ajesh Babu, Paritosh K. Pandya
- Modern Applications of Automata Theory
- 2012

- A. G. T. BABU, WEI SHEN HSIA
- 2010

A Fibonacci-rowed matrix is defined to be a matrix in which each row consists of consecutive Fibonacci numbers in increasing order. Laderman [1] presented a noncommutative algorithm for multiplying two 3 x 3 matrices using 23 multiplications. It still needs 18 multiplications if Laderman 1 s algorithm is applied to the product of two 3 x 3 Fibonacci-rowed… (More)

- ‹
- 1
- ›