ARKAPRAVA SAHA

3^rd Year Postgraduate (PhD) Student
School of Computer Science and Engineering
Nanyang Technological University, Singapore

This is my Bachelors Thesis under Prof. Maya Ramanath.
It aims to implement random walks on large Bloom graphs, whose adjacency lists are stored as lists of Bloom filters.
This helps to answer reachability queries on large graphs like those of social networks with a much smaller memory footprint than it was possible before.
Here is the link to the code.
This project has resulted in this research paper.

This is a course project during my undergraduate studies under Prof. Huzur Saran.
It is an app for playing Sudoku.
It generates a random Sudoku puzzle according to the level chosen by the player.
The player enters a value at an empty position and can check whether it is possible or not.
In the end the player can ask for the solution.
This app was created using HTML, CSS, JavaScript and was deployed on the Heroku cloud platform.

This is an independent project during my undergraduate studies under Prof. Kolin Paul.
It is based on symmetry in Boolean circuits.
Binary Decision Diagrams (BDDs) are appended with symmetry information to create Symmetric Decision Diagrams (SDDs).
Using the Cudd package (programmed in C), the symmetric nodes of a boolean function are first found.
The various operations on BDDs (AND, OR, NOT) are extended for SDDs.
The Boolean function was then represented by an SDD.