Posts

Comments

Comment by Shubhorup Biswas (shubhorup-biswas) on Up-to-date advice about what to do upon getting COVID? · 2021-09-21T08:21:22.657Z · LW · GW

I wonder why other antivirals(faviparivir, oral remdesivir) aren't getting more attention compared to ivermectin.

Comment by Shubhorup Biswas (shubhorup-biswas) on The Best Textbooks on Every Subject · 2020-11-10T15:57:02.544Z · LW · GW

I would like to suggest Algorithm Design by Kleinberg and Tardos over CLRS.

I find it superior to CLRS although I have not read either completely.

In my undergrad CS course we used CLRS for Intro to Algorithms and Kleinberg Tardos was a recommended text for an advanced(but still mandatory, for CS) algorithms course, but I feel it does not have prerequisites much higher than CLRS does.

I feel that while KT 'builds on' knowledge and partitions algorithms by paradigm(and it develops each of these 'paradigms'—i.e. Dynamic Programming, Greedy, Divide and Conquer— from the start) CLRS is more like a cookbook or a list of algorithms.

Comment by Shubhorup Biswas (shubhorup-biswas) on The Best Textbooks on Every Subject · 2020-11-10T15:55:40.488Z · LW · GW

I would like to suggest \href{Algorithm Design by Kleinberg and Tardos}{http://www.cs.sjtu.edu.cn/~jiangli/teaching/CS222/files/materials/Algorithm%20Design.pdf} over CLRS.

I find it superior to CLRS although I have not read either completely.

In my undergrad CS course we used CLRS for Intro to Algorithms and Kleinberg Tardos was a recommended text for an advanced(but still mandatory, for CS) algorithms course, but I feel it does not have prerequisites much higher than CLRS does.

I feel that while KT 'builds on' knowledge and partitions algorithms by paradigm(and it develops each of these 'paradigms'—i.e. Dynamic Programming, Greedy, Divide and Conquer— from the start) CLRS is more like a cookbook or a list of algorithms.

Comment by Shubhorup Biswas (shubhorup-biswas) on The Best Textbooks on Every Subject · 2020-11-10T15:54:15.058Z · LW · GW

I would like to suggest \href{Algorithm Design by Kleinberg and Tardos}{http://www.cs.sjtu.edu.cn/~jiangli/teaching/CS222/files/materials/Algorithm%20Design.pdf} over CLRS.

I find it superior to CLRS although I have not read either completely.

In my undergrad CS course we used CLRS for Intro to Algorithms and Kleinberg Tardos was a recommended text for an advanced(but still mandatory, for CS) algorithms course, but I feel it does not have prerequisites much higher than CLRS does.

I feel that while KT 'builds on' knowledge and partitions algorithms by paradigm(and it develops each of these 'paradigms'—i.e. Dynamic Programming, Greedy, Divide and Conquer— from the start) CLRS is more like a cookbook or a list of algorithms.