#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2010

2013

- This year (0)
- Last 5 years (3)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

- 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̄. Odd girth: If g = 2r + 1, then n ≥ 1 + d̄ r−1 ∑ i=0 (d̄− 1)i. Even girth: If g = 2r, then n ≥ 2 r−1 ∑ i=0 (d̄− 1)i. Theorem… (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-passO(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, 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)

- D. Kumara Swamy, Ajesh Babu, K. Phaneendra
- 2013

In this paper, we have described a numerical integration technique for solving singularly perturbed delay differential equations. The second order singularly perturbed boundary value problem is transformed into an asymptotically equivalent first order neutral differential equation. Then numerical integration and linear interpolation is used to get the… (More)

- Ajesh Babu
- 2010

We will continue the survey of approximation algorithms in this lecture. First, we will discuss a (1+ε)-approximation algorithm for Knapsack in time poly(n, 1/ε). We will then see applications of some heavy hammers such as linear programming (LP) and semi-definite programming (SDP) towards approximation algorithms. More specifically, we will see LPbased… (More)

- ‹
- 1
- ›