Shubhorup Biswas

Karma: 1

Shubhorup Biswas 21 Sep 2021 8:21 UTC
2 points
in reply to: TekhneMakre’s comment on: Up-to-date advice about what to do upon getting COVID?
I wonder why other antivirals(faviparivir, oral remdesivir) aren’t getting more attention compared to ivermectin.

Shubhorup Biswas 10 Nov 2020 15:57 UTC
1 point
in reply to: gjm’s comment on: The Best Textbooks on Every Subject
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.

Shubhorup Biswas 10 Nov 2020 15:55 UTC
1 point
in reply to: gjm’s comment on: The Best Textbooks on Every Subject
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.

Shubhorup Biswas 10 Nov 2020 15:54 UTC
1 point
in reply to: gjm’s comment on: The Best Textbooks on Every Subject
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.