3 ms·
As a self taught developer with no formal education in CS, I'm amazed to know this. I'd love to read a paper outlining the solution of a rather simple algorithm
by tenaciousDaniel 8y ago
As a self taught developer with no formal education in CS, I'm amazed to know this. I'd love to read a paper outlining the solution of a rather simple algorithm (by today's standards). Sounds fascinating.
- mlevental 8y agoedmonds-karp, dijkstra search, kruskal mst, floyd-warshall, bellman-ford, tarjans least common ancestor, danzig's simplex method, etc. are all algos that were paper pubs throughout last century, covered in CLRS i.e. good undergrad algos class, and come up in interview style questions.