Mr. Amithabh Bagchi, is an Associate Professor of computer science at Indian Institute of Technology, Delhi.
He is considered a veteran, having accumulated more than 10 years of experience in the computer science domain.
He has started his teaching career with teaching topics like computers and programming and introduction to computer science. With the passage of time, he has been taking on a complex topic like Matrix Concentration Inequalities.
Along with the teaching experience with regards to curriculum vitae, he continues researching current topics like Data Algorithmics and Analytics, Probability and Networks.
With the astuteness and prominence of his knowledge, he has conducted several workshops or projects. The courses, under his supervision, range from 100 level to 700+ level.
With deep knowledge of the curricular 700+ level course, Mr. Bagchi holds the authority to provide a reference letter to his students, who have surpassed the course workshops under his supervision.
He has helped several students kick-start their career.
He is considered as a direct supervisor/professor, from IITD, whose comment holds utmost importance on the student’s academic achievements.
As a high-ranking community member of the computer science department, he sprinkles his wealth of knowledge through jotting down high-quality information.
Some of his co-authored recent publications
Border effects on connectivity for randomly oriented directional antenna networks.
With the intensive knowledge and problem-solving mindset, he provides solutions in his latest publication. He speaks about high complex topics like the two ways to transmit directional power of the antenna. The book mainly sheds light on a cellular wireless network, and point to point communication.
The book was published in 2018 17th Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net), a digital storehouse of engineering students.
The next treasure from the knowledge base of Mr. Bagchi comes in the form of co-authoring another such book.
Sampling and Reconstruction Using Bloom Filters
The book has been hosted and endorsed on the site of Cornell University. The book is available in variable formats.
This does not end here. There are a few more publications.
Efficiently answering regular simple path queries on large labelled networks. Configured to hosting an Intl. Conference on Management of Data (SIGMOD 2019), June-July 2019.
Beyond Shortest Paths: Route Recommendations for Ride-sharing. Configured to be hosted on The Web Conference (formerly WWW), May 2019.
ARROW: Approximating Reachability using Random-walks Over Web-scale Graphs. At 35th IEEE International Conference on Data Engineering (ICDE 2019), April 2019.
With the vastness of knowledge he has gathered, Mr. Bagchi is all set to take the knowledge to the international platform once again, this year. Adorned with jewellery of accurate understanding of Data Algorithmics and Analytics, Probability and Networks.
This man is a treasure for computer science and a wanted guide for every student who wants to excel in their academics.
