Welcome to theroyakash Publication

Updated November 14, 20201 min readMarkdown

Welcome to theroyakash publication, here you’ll get the latest in publications from theroyakash on whatever I'm working on. I also have a subreddit for announcement purposes & I have a discord server. Join and connect with me there. Cool researches, projects and other things coming very soon.

Computer scientist theroyakash researches computer vision and artificial intelligence. This is the publications from theroyakash.

Announcement subreddit: r/theroyakash
Join our discord server here.

About the author

theroyakash
I go by theroyakash on the internet. I am a computer scientist, with research in high performance algorithms, data structures, distributed systems, and beyond. See my work searching google for theroyakash.

Comments

Join the discussion

No comments yet. Be the first to comment.

More from this blog

How to use graph as a data structure in C++
Graph implementation and usage in C++
Apr 11, 20222 min read
Pre order, In order and Post Order Traversal under 2 minutes
Clearing pre order, in order and post order traversal confusion under 2 minutes
May 24, 20212 min read
Set-up an audio version of your blog articles [Works Automatically]
Setup audio version of your articles for free.
Feb 10, 20214 min read
Priority Queues with Binary Heaps
Build and run algorithms on Priority Queues (as binary heaps) with just a few lines of code with AKDSFramework.
Jan 7, 20218 min read
Introducing an efficient Big O analyzer
Introducing an efficient Big O analyzer, a premium state-of-the-art AKDSFramework feature to analyze Big O for any function without any human intervention. As you already know calculating big O is a big part of what we do to approximate the running t...
Dec 29, 20209 min read

About the author

Comments

More from this blog

How to use graph as a data structure in C++

Pre order, In order and Post Order Traversal under 2 minutes

Set-up an audio version of your blog articles [Works Automatically]

Priority Queues with Binary Heaps

Introducing an efficient Big O analyzer