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â€¦ (More)

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,â€¦ (More)

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â€¦ (More)

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â€¦ (More)

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â€¦ (More)

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â€¦ (More)