Meet Taraviya
MS Computer Science @UCLA / AI Researcher / IIT Bombay CSE graduate
You May Also Enjoy
Publication: A Tighter Analysis of Randomised Policy Iteration
1 minute read
Authors: Meet Taraviya, Shivaram Kalyanakrishnan
Research seminar: Recursive Timed Automata
less than 1 minute read
Recursive Timed Automata (RTA) generalizes both Recursive State Machines and Timed Automata. This added power makes the problem of termination in RTA games u...
Research seminar: Applications of Color Coding in Randomised Algorithms
less than 1 minute read
We demonstrate how color coding can be used to obtain algorithms with fixed parameter tractable complexity for NP-hard problems k-CYCLE and k-PATH.
Research seminar: Lower bounds for monotone circuits
less than 1 minute read
We present lower bounds for the size of Monotone circuits computing the clique function. We use a combinatorial result called Sunflower Lemma for the proof.