1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2011★ 1 cited
Streaming algorithms for language recognition problems
Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan +1
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-p…
cs.DM2010
An entropy based proof of the Moore bound for irregular graphs
S. Ajesh Babu, Jaikumar Radhakrishnan
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, girt…