I am not a researcher in algorithms (I am a college freshman). I would like to implement an interesting recent algorithm from a data structure/algorithms paper.
How can find a good algorithms paper to implement?
$\begingroup$
$\endgroup$
10
-
3$\begingroup$ Tarjan just published this at SODA, should be accessible to an undergrad. madalgo.au.dk/img/SS2013/Course%20material/… $\endgroup$– Chad BrewbakerJan 16, 2014 at 19:27
-
5$\begingroup$ look at the proceedings of algorithms conferences (see the question cstheory.stackexchange.com/q/7900/4896), find a paper you understand enough to implement $\endgroup$– Sasho NikolovJan 16, 2014 at 19:28
-
7$\begingroup$ I believe many researchers will be very happy if a person comes and implements their recently-developed algorithm. Some of them may even help you understand their algorithm so that you can implement it better. Maybe you should go to a nearby university and put a note on the message board of the CS department? This may also lead you to fruitful cooperations in the future. $\endgroup$– Erel Segal-HaleviJan 16, 2014 at 19:37
-
4$\begingroup$ Maybe you could be more specific about what kinds of algorithms you're looking for? Many algorithms proposed in theoretical CS are quite easy (trivial?) to implement; the tricky part is the proof. I am thinking in particular of Buchbinder, Feldman, Naor, and Schwartz's 2012 "A Tight Linear Time (1/2)-Approximation For Unconstrained Submodular Maximiztion", an algorithm from The Book if there ever was one. cs.technion.ac.il/~moranfe/Publications/FOCS2012.pdf $\endgroup$– usulJan 17, 2014 at 13:54
-
4$\begingroup$ @usul Many algorithms proposed in theoretical CS are quite easy (trivial?) to implement — On the other hand, many algorithms proposed in theoretical CS are nearly impossible to implement. $\endgroup$– JeffεJan 19, 2014 at 1:05
|
Show 5 more comments