[Manim] Algorithms and Data Structures

Rassska commented 2 years ago

Portfolio

Hi there! I'm Rasul, third-year CS student at ITMO University!

Target topic categories

I would like to work on some topics related to CS. Maybe, explaining solutions for various problems, some complex algorithms and etc...

Check out my demo video here, where I've explained some random problem from leetcode.com:

https://youtu.be/P4Z9XdHAE4o

Target medium

Producing video content by using Manim lib.

Contact details

Feel free to choose the most convenient for you:

Email: rasuldag220@gmail.com Telegram: @Road220

Thanks, Rasul!

Notnilc-N commented 2 years ago

I'm not an expert (just a passionate undergrad) but I'd love to see a video on krylov subspaces and krylov methods for solving large linear systems. There's an algorithm for it, but idk if I'm the right person to talk about it since I only learned about it this semester.

sbuller commented 2 years ago

Sorry, just a passerby, but one of my favourite Aha! moments came from Data Structures and Algorithms. Learning to use recurrence relations to analyze time complexity of algorithms is a moment that's stuck with me for years. I think there's potential there.

deadalnix commented 2 years ago

So you are looking for an algorithm and data-structure domain expert? I think I can help. I myself would like to learn a bit about producing videos, so maybe there is something that can happen here?

I have worked on databases, distributed systems, compilers, cryptography, signal processing, and a bunch of other stuff. There is a ton of interesting topics in there, and if the math angle is important, here is what I would go for:

compression (huffman, then ASN/zstd style compression).
error code? An interesting topic, but it seems like the space is a bit crowded.
schnorr signatures? We can present them as zero knowledge proofs using the sigma protocol, and explain how it can be made non interractive using Fiat Shamir. This would make for excellent content, IMO, and, contrary to the scary sounding terms, it's actually fairly easy to understand.
- Probabilistic datastructures. A good angle would be set reconciliation using bloom filters and IBLT.
What do you think?

noamtashma commented 2 years ago

I would like to participate. I'm have a mathematics and CS bachelor's degree, hoping to get a master's degree in the future. I also participated in the IMO and IOI.

I'm interested in algorithms and data structures, but from a cleaner, more mathematical perspective (at least relative to the previous commenter).

Some topics I might want to make a video about are:

data structures: anything from basic heaps to binomial heaps to hollow heaps, segment trees, persistent data structures, union-find, dynamic trees structure, suffix trees / arrays, and everything else. There are many possible levels of difficulty.
detailed walk through of the thought process and solution of interesting problems (perhaps from IOI, perhaps project euler style problems)
a more philosophical video about how "dynamic programming" is actually just the simple idea that you shouldn't recompute the same things over and over again.

Good luck and productive SOME to us all!

dkoslicki commented 2 years ago

If interested, I'd like to help out with this! I'm a mathematician by training (PhD) and now an Associate Professor of CS at Penn State University.

With regard to topics, as @deadalnix mentioned at the end of their post, probabilistic data structures could be really fun to cover. They're a nice blend of math theory resulting in insanely fast algorithms that have real-world applications (so basically something for everyone!). As one cutting edge development, there's a nifty new hashing technique that is quite simple to explain, but turns out to have an application in metagenomics (the study of environmental microbes from their sampled DNA) that results in one of the best kinds of tools in its class.

So be it FracMinHash, MinHash, CMash, Bloom filters, or any of the locality sensitive hashing schemes, I'd be more than happy to collaborate on this.

TvoozMagnificent commented 2 years ago

Can you do #178? Thank you. @Rassska

dkoslicki commented 2 years ago

@TvoozMagnificent who do you mean by "you"? Feel free to use @ and the GitHub username to specify who you are referring to

TvoozMagnificent commented 2 years ago

Sorry, @dkoslicki.

AndriusKulikauskas commented 2 years ago

@Rassska I am looking for collaborators on explaining the minimization operator μ and how it illustrates, in a very precise way, the concepts One, All, Many. I write about that here: #183 I think it would be nice to have some visuals using Manim. I have uploaded my "work-in-progress" video here and the visuals would be relevant starting at 7:30. Although I would want to talk through with you (perhaps by Zoom?) what exactly you would do, if you were interested. @dkoslicki @noamtashma @deadalnix and all, would you be interested to help in some way? Please let me know! I welcome your thoughts and questions.

deadalnix commented 2 years ago

@AndriusKulikauskas I'm afraid this one is a a bit outside my expertise. I don't think I would be the best person to help.

leios / SoME_Topics