Quantum Network Simulator:
Performance of a quantum network can't be measured by classical simulators. That's why I wrote a quantum network network simulator as a part
of the research team in Center For Quantum Technology, National University of Singapore. It will be released in 2015 after finalization. I have
used python and simpy discrete event simulator in this project. Also worked on designing protocol for quantum networks.An efficient method for extracting subtrees against forest query:
In this research paper, we present an algorithm to search and rank
top-k approximately matched subtrees from a tree database,
where the query is a collection of trees i.e. a forest. Even
though existing algorithms can handle a single tree query,
we argue that forest query would be significantly useful in
some real life applications. This paper was published in 2015 ACM IMCOM conference in Bali. You can
download it from here.Few programming contest problems created by me:
Prime Distance (ACM ICPC Dhaka regionals 2016)Extreme Xor Sum (ACM ICPC Dhaka regionals 2016)
Precious Stones (ACM ICPC Kolkata regionals 2016)
Bob The Builder (National Programming Contest IUT 2014, Bangladesh)
To Infinity and Beyond (9th IIUC Inter-University Programming Contest, Bangladesh)
A Colorful World (Bangladesh Informatics Olympiad, National Round)
Move The Coins (HackerRank World Codesprint April 2016)
New Year Chaos (HourRank-13)