<p>It might come as no surprise, but there is a substantial overlap between cstheory Q&amp;A power-users and the blogosphere. We even had a <a href="http://cstheory.blogoverflow.com/" rel="noreferrer">dedicated blog</a> for a while, with some great posts but it fell into disuse. However, I thought I would list some of the blogs run by our <a href="https://cstheory.stackexchange.com/users?tab=Reputation&amp;filter=all">top 38 users</a> that have had new posts since 2012:</p>

<ul>
<li>David Eppstein's <strong><a href="https://11011110.github.io/blog/" rel="noreferrer">0xDE</a></strong>: graph-theory and algorithms.</li>
<li>Suresh Venkatasubramanian's <strong><a href="http://geomblog.blogspot.com/" rel="noreferrer">The Geomblog</a></strong>: computational geometry, algorithms, and discussions of academic life.</li>
<li>Jeff Erickson's <strong><a href="http://3dpancakes.typepad.com/" rel="noreferrer">Ernie's 3D Pancakes</a></strong>: computational topology, and community announcements.</li>
<li>Neel Krishnaswami's <strong><a href="http://semantic-domain.blogspot.com/" rel="noreferrer">Semantic Domain</a></strong>: programming languages, logic, and formal languages.</li>
<li>Joe Fitzsimons's <strong><a href="http://blog.jfitzsimons.org/" rel="noreferrer">Quantized Thoughts</a></strong>: quantum information and computation, theoretical physics, and community building.</li>
<li>Andrej Bauer's <strong><a href="http://math.andrej.com/" rel="noreferrer">Mathematics and Computation</a></strong>: HoTT, logic, category theory, and philosophy of math.</li>
<li>András Salamon's <strong><a href="http://constraints.wordpress.com/" rel="noreferrer">Constraints</a></strong>: computational complexity through the lens of constraint satisfaction.</li>
<li>Marzio De Biasi's <strong><a href="http://www.nearly42.org/" rel="noreferrer">... nearly 42 ...</a></strong>: computational complexity highlighted through NP-completeness and puzzles.</li>
<li>Scott Aaronson's <strong><a href="http://www.scottaaronson.com/blog/" rel="noreferrer">Shtetl-Optimized</a></strong>: computational complexity, with a primary focus on quantum computing, philosophy, humour, and community building.</li>
<li>Lev Reyzin's <strong><a href="http://levreyzin.blogspot.com/" rel="noreferrer">Room for Doubt</a></strong>: theory and practice of machine learning, and academic life.</li>
<li>Noam Nisan's <strong><a href="http://agtb.wordpress.com/" rel="noreferrer">Turing's Invisible Hand</a></strong>: computational economics, algorithmic game theory, and community building.</li>
<li>Sariel Har-Peled's <strong><a href="http://sarielhp.org/blog/" rel="noreferrer">Vanity of Vanities, all is Vanity</a></strong>: computational geometry, and general social and academic commentary.</li>
<li>Shiva Kintali's <strong><a href="http://kintali.wordpress.com/" rel="noreferrer">My Brain is Open</a></strong>: computational complexity, polyhedral combinatorics, algorithms, and graph theory.</li>
<li>Artem Kaznatcheev's <strong><a href="http://egtheory.wordpress.com/" rel="noreferrer">Theory, Evolution, and Games Group</a></strong>: evolutionary game theory, and algorithmic lens on evolution, learning and philosophy.</li>
<li>Hsien-Chih Chang's <strong><a href="http://finiteplayground.wordpress.com/" rel="noreferrer">Finite Playground</a></strong>: bilingual blog on computational complexity, formal languages, and concrete math.</li>
<li>Aaron Sterling's <strong><a href="http://nanoexplanations.wordpress.com/" rel="noreferrer">Nanoexplanations</a></strong>: distributed computing, chemoinformatics, and general social commentary.</li>
<li>Lance Fortnow and Bill Gasarch's <strong><a href="http://blog.computationalcomplexity.org/" rel="noreferrer">Computational Complexity </a></strong>: Computational Complexity and other fun stuff in math and computer science.</li>
<li>Emanuele Viola's <strong><a href="http://emanueleviola.wordpress.com/" rel="noreferrer">Thoughts</a></strong>: computational complexity and general commentary -- started Summer 2014.</li>
</ul>

CC BY-SA 3.0
2014-04-23T00:47:21.767Z
Note, I specifically violated the one blog per post rule, to **highlight one community** -- ours. If I missed your blog, if you want to expand your blurb a bit (try to keep it to a sentence or so), or if your blog is no longer active (and you want to remove it) then please edit my post!
Artem Kaznatcheev
CC BY-SA 3.0
2014-04-23T02:27:28.590Z
Jeff Erickson's blog isn't very active, but it's one of the first ones: http://3dpancakes.typepad.com/
Suresh Venkat
CC BY-SA 3.0
2014-07-16T05:41:01.893Z
One more possible site: The Windows On Theory blog at: http://windowsontheory.org.
lgidwani
CC BY-SA 4.0
2014-04-23T00:46:28.200Z
2018-08-02T15:47:43.490Z
2018-08-02T15:47:43.490Z
Artem Kaznatcheev
<p>It is not active anymore, but Mihai Patrascu's "<a href="http://infoweekly.blogspot.com">WebDiarios de Motocicleta</a>" blog is one of my all-time favorites. Highly recommended especially to those new to the TCS community. </p>

CC BY-SA 3.0
2014-04-21T19:26:46.863Z
2014-04-21T19:26:46.863Z
Dan
<p>blog preferences tend to be highly personal in contrast to other sometimes-definitive TCS resources eg books. however there are two standout/ leading/ popular TCS blogs already cited, lively and highly active for many years, with some background/profiles. both blogs have extensive indexes to other leading TCS blogs. both experts/teachers/leaders in TCS with many published papers, and very much involved with promoting TCS to the wider community eg through popular books. note both have also joined/contributed to tcs.se. maybe not coincidentally (and in <a href="https://cstheory.meta.stackexchange.com/questions/274/is-it-ok-to-ask-about-the-correctness-of-preprints-on-crank-friendly-topics">some contrast</a> to this site) they do not shy away and are both quite keen on discussing key or famous open problems in the field eg P=?NP. blog comments are open and an interesting/diverse part of the blogs. they routinely cover important proofs in the field. Lipton was closely involved with the cyberspatial peer review of the Deolalikar attack years ago.</p>

<ul>
<li><p><a href="http://rjlipton.wordpress.com/" rel="nofollow noreferrer">RJ Lipton P=?NP blog</a> by <a href="http://www.scs.gatech.edu/features/career-solution" rel="nofollow noreferrer">Lipton</a> also cowritten by Regan. author of <a href="http://rads.stackoverflow.com/amzn/click/3642414214" rel="nofollow noreferrer">People, Problems &amp; Proofs</a> and <a href="http://rads.stackoverflow.com/amzn/click/1441971548" rel="nofollow noreferrer">The P=NP question and Godel's lost letter</a>. (<a href="https://cstheory.stackexchange.com/users/2825/dick-lipton">tcs.se profile</a>). Lipton is also an expert in deep mathematics eg number theory, group theory etc &amp; regularly ties it into TCS.</p></li>
<li><p><a href="http://blog.computationalcomplexity.org/" rel="nofollow noreferrer">computational complexity</a> by <a href="http://www.cc.gatech.edu/features/fortnow" rel="nofollow noreferrer">Fortnow</a> with contributions by Gasarch. author of <a href="http://goldenticket.fortnow.com/" rel="nofollow noreferrer">Golden Ticket, P, NP &amp; the search for the impossible</a>. (<a href="https://cstheory.stackexchange.com/users/550/lance-fortnow">tcs.se profile</a>). Fortnow also is a comprehensive reviewer of "favorite great TCS theorems of last decade." Gasarch has done useful/comprehensive community polls on P=?NP.</p></li>
</ul>

<p>another well-read, leading/striking blog is Aaronsons "Shtetl optimized". Aaronson sometimes writes longer essays, quite passionately at times, and can sometimes be quite opinionated and polemical. comment sections are very lively and occasionally intense. a strong focus on quantum computing.</p>

<ul>
<li><a href="http://www.scottaaronson.com/blog/" rel="nofollow noreferrer">Shtetl Optimized</a>. author of <a href="http://rads.stackoverflow.com/amzn/click/0521199565" rel="nofollow noreferrer">Quantum computing since Democritus</a></li>
</ul>

CC BY-SA 3.0
2014-04-22T01:26:42.267Z
addendum, recent [Aaronson profile](http://newsoffice.mit.edu/2014/scott-aaronson-shapes-conventional-and-quantum-computing-0407)
vzn
CC BY-SA 3.0
2014-07-18T15:32:11.387Z
news, [Fortnow wins SIGACT prize](http://blog.computationalcomplexity.org/2014/06/stoc-2014.html) in part for blogging! he writes _"At the just completed STOC conference I received the 2014 SIGACT Distinguished Service Prize. Part of this citation reads"His blog, and many others that followed, changes the way our field communicates, both with itself and with the outside world." I owe this award to you, my readers and commenters. May the conversations always continue."_
vzn
CC BY-SA 3.0
2014-04-21T15:37:17.053Z
2014-04-21T15:43:17.610Z
2017-04-13T12:32:28.053Z
vzn
<p>One of my all time favorites for deep posts and amazing diversity of content is <a href="http://blog.sigfpe.com/" rel="noreferrer">Neighborhood of Infinity</a>. It mostly focuses on type and category theory and applications of Haskell, but the applications are always so creative and the explanations so clear that I find myself wanting to read it despite it not being my area of expertise.</p>

CC BY-SA 3.0
2014-07-14T03:55:24.570Z
2014-07-14T03:55:24.570Z
Stan
<p>I recommend <a href="http://teachingintrotocs.blogspot.in" rel="nofollow">A CS Professor's Blog</a> by Claire Mathieu. She has many interesting posts on academia and CS. A few articles under the label `<a href="http://teachingintrotocs.blogspot.in/search/label/TCS" rel="nofollow">TCS</a>' have informal descriptions of  technical results.</p>

CC BY-SA 3.0
2014-11-20T03:20:06.683Z
Just a note: this blog does not seem to be updated very frequently.
Ryan Dougherty
CC BY-SA 3.0
2014-11-19T06:06:43.587Z
2014-11-19T06:14:35.140Z
2014-11-19T06:14:35.140Z
Jagadish
<p>Many top notch computer science researchers and research groups) maintain active blogs that keep us updated on the latest research in the authors' fields of interest.  In most cases, blog posts are easier to understand than formal papers, because they omit most of the gory technical details and emphasize intuition (which papers generally omit).</p>

<p>Thus, it would be useful to have a list of recommended blogs, in the same spirit as other lists of recommended resources:</p>

<ul>
<li><a href="https://cstheory.stackexchange.com/q/1168/873">What papers should everyone read?</a></li>
<li><a href="https://cstheory.stackexchange.com/q/3253/873">What books should everyone read?</a></li>
<li><a href="https://cstheory.stackexchange.com/q/3540/873">What are the recent TCS books whose drafts are available online?</a></li>
<li><a href="https://cstheory.stackexchange.com/q/1198/873">What videos should everybody watch?</a></li>
<li><a href="https://cstheory.stackexchange.com/q/4074/111">What lecture notes should everyone read?</a></li>
</ul>

<p>Of course one can follow the excellent <a href="http://cstheory-feed.org/" rel="noreferrer">Theory of Computing Blog Aggregator</a>, but that list is rather overwhelming, especially for beginners.</p>

<p><strong>Please highlight why you recommend them.</strong></p>

CC BY-SA 3.0
2014-04-19T15:55:41.650Z
really like the (T)CS expert blogs too & regard them as useful/ valuable/ colorful/ lively/ informal public/ community resource, some are even associated with CS societies, research centers/corps (team edited), etc. there is a great high quality running feed known to insiders & maintained by [Narayanan](http://feedworld.net/toc/) incl several (high rep) tcs.se users. but re "should", following them is more an optional choice.
vzn
CC BY-SA 3.0
2014-04-19T17:32:20.940Z
Yes, Arvind's feed is the way to go: as you see the posts coming in you can then customize as you see fit. And most of us who blog will mention new blogs that come up, so you'll hear about new entrants as well, before they show up on his feed. I should point out that when you go to the page there's a long list of blogs right there.
Suresh Venkat
CC BY-SA 3.0
2014-04-19T21:13:35.007Z
Another great list can be "built" merging the entries of the ["Blog List" on Lance Fortnow's blog](http://blog.computationalcomplexity.org/) and the entries of the ["Blog Roll" on Lipton's blog](http://rjlipton.wordpress.com/)
Marzio De Biasi
CC BY-SA 3.0
2014-04-20T17:11:37.990Z
@SureshVenkat: Instead of listing down the all the blogs in a single answer, we could have each answer with only one blog name, the area which the blog specializes. Also the answer could include the top articles from the blog.
Vivek Bagaria
CC BY-SA 3.0
2014-04-20T17:12:06.213Z
@Bagaria, we don't do popularity contests on cstheory, see [the meta discussion about the list of conferences question](http://meta.cstheory.stackexchange.com/q/56/186). Look at the blogs on [Theory of Computing Blog Aggregator](http://feedworld.net/toc/) and see which one you like.
Kaveh
CC BY-SA 3.0
2014-04-20T17:19:33.237Z
@Kaveh: I guess did not convey myself properly, apologies for that. I wanted to answers to be categorized like it is done in "https://cstheory.stackexchange.com/questions/3253/what-books-should-everyone-read".
Vivek Bagaria
CC BY-SA 3.0
2014-04-20T17:22:47.167Z
I see. That might make sense (I am not sure there are that many TCS blogs).
Kaveh
CC BY-SA 3.0
2014-04-20T19:05:12.743Z
Edited to mirror earlier "What ice cream should everyone eat?" questions.
Jeffε
CC BY-SA 3.0
2014-04-20T19:05:16.407Z
I don't think TCS blogs are that specialized though. I know I talk about all kinds of topics on mine, and so do Lipton/Regan and Fortnow/Gasarch. There are a few specialized blogs like the polylog blog for streaming, but generally speaking it's just easier to subscribe to the feed.
Suresh Venkat
<soft-question>
What CS blogs should everyone read?
Vivek Bagaria
# What CS blogs should everyone read?

(Asked by: username_0 on 2014-04-19)

Many top notch computer science researchers and research groups) maintain active blogs that keep us updated on the latest research in the authors' fields of interest. In most cases, blog posts are easier to understand than formal papers, because they omit most of the gory technical details and emphasize intuition (which papers generally omit).

Thus, it would be useful to have a list of recommended blogs, in the same spirit as other lists of recommended resources:

* [What papers should everyone read?](https://cstheory.stackexchange.com/q/1168/873)
* [What books should everyone read?](https://cstheory.stackexchange.com/q/3253/873)
* [What are the recent TCS books whose drafts are available online?](https://cstheory.stackexchange.com/q/3540/873)
* [What videos should everybody watch?](https://cstheory.stackexchange.com/q/1198/873)
* [What lecture notes should everyone read?](https://cstheory.stackexchange.com/q/4074/111)

Of course one can follow the excellent [Theory of Computing Blog Aggregator](http://cstheory-feed.org/), but that list is rather overwhelming, especially for beginners.

**Please highlight why you recommend them.**

**Tags:** soft-question
> **Comments:**
> **username_1**: really like the (T)CS expert blogs too & regard them as useful/ valuable/ colorful/ lively/ informal public/ community resource, some are even associated with CS societies, research centers/corps (team edited), etc. there is a great high quality running feed known to insiders & maintained by [Narayanan](http://feedworld.net/toc/) incl several (high rep) tcs.se users. but re "should", following them is more an optional choice.  
> **username_2**: Yes, Arvind's feed is the way to go: as you see the posts coming in you can then customize as you see fit. And most of us who blog will mention new blogs that come up, so you'll hear about new entrants as well, before they show up on his feed. I should point out that when you go to the page there's a long list of blogs right there.  
> **username_3**: Another great list can be "built" merging the entries of the ["Blog List" on Lance Fortnow's blog](http://blog.computationalcomplexity.org/) and the entries of the ["Blog Roll" on Lipton's blog](http://rjlipton.wordpress.com/)  
> **username_0**: @SureshVenkat: Instead of listing down the all the blogs in a single answer, we could have each answer with only one blog name, the area which the blog specializes. Also the answer could include the top articles from the blog.  
> **username_4**: @Bagaria, we don't do popularity contests on cstheory, see [the meta discussion about the list of conferences question](http://meta.cstheory.stackexchange.com/q/56/186). Look at the blogs on [Theory of Computing Blog Aggregator](http://feedworld.net/toc/) and see which one you like.  
> **username_0**: @Kaveh: I guess did not convey myself properly, apologies for that. I wanted to answers to be categorized like it is done in "https://cstheory.stackexchange.com/questions/3253/what-books-should-everyone-read".  
> **username_4**: I see. That might make sense (I am not sure there are that many TCS blogs).  
> **username_5**: Edited to mirror earlier "What ice cream should everyone eat?" questions.  
> **username_2**: I don't think TCS blogs are that specialized though. I know I talk about all kinds of topics on mine, and so do Lipton/Regan and Fortnow/Gasarch. There are a few specialized blogs like the polylog blog for streaming, but generally speaking it's just easier to subscribe to the feed.  

---

## 5 answers

### Answer by username_6 on 2014-04-23. Score: 43

It might come as no surprise, but there is a substantial overlap between cstheory Q&A power-users and the blogosphere. We even had a [dedicated blog](http://cstheory.blogoverflow.com/) for a while, with some great posts but it fell into disuse. However, I thought I would list some of the blogs run by our [top 38 users](https://cstheory.stackexchange.com/users?tab=Reputation&filter=all) that have had new posts since 2012:

* David Eppstein's **[0xDE](https://11011110.github.io/blog/)**: graph-theory and algorithms.
* Suresh Venkatasubramanian's **[The Geomblog](http://geomblog.blogspot.com/)**: computational geometry, algorithms, and discussions of academic life.
* Jeff Erickson's **[Ernie's 3D Pancakes](http://3dpancakes.typepad.com/)**: computational topology, and community announcements.
* Neel Krishnaswami's **[Semantic Domain](http://semantic-domain.blogspot.com/)**: programming languages, logic, and formal languages.
* Joe Fitzsimons's **[Quantized Thoughts](http://blog.jfitzsimons.org/)**: quantum information and computation, theoretical physics, and community building.
* Andrej Bauer's **[Mathematics and Computation](http://math.andrej.com/)**: HoTT, logic, category theory, and philosophy of math.
* András Salamon's **[Constraints](http://constraints.wordpress.com/)**: computational complexity through the lens of constraint satisfaction.
* Marzio De Biasi's **[... nearly 42 ...](http://www.nearly42.org/)**: computational complexity highlighted through NP-completeness and puzzles.
* Scott Aaronson's **[Shtetl-Optimized](http://www.scottaaronson.com/blog/)**: computational complexity, with a primary focus on quantum computing, philosophy, humour, and community building.
* Lev Reyzin's **[Room for Doubt](http://levreyzin.blogspot.com/)**: theory and practice of machine learning, and academic life.
* Noam Nisan's **[Turing's Invisible Hand](http://agtb.wordpress.com/)**: computational economics, algorithmic game theory, and community building.
* Sariel Har-Peled's **[Vanity of Vanities, all is Vanity](http://sarielhp.org/blog/)**: computational geometry, and general social and academic commentary.
* Shiva Kintali's **[My Brain is Open](http://kintali.wordpress.com/)**: computational complexity, polyhedral combinatorics, algorithms, and graph theory.
* Artem Kaznatcheev's **[Theory, Evolution, and Games Group](http://egtheory.wordpress.com/)**: evolutionary game theory, and algorithmic lens on evolution, learning and philosophy.
* Hsien-Chih Chang's **[Finite Playground](http://finiteplayground.wordpress.com/)**: bilingual blog on computational complexity, formal languages, and concrete math.
* Aaron Sterling's **[Nanoexplanations](http://nanoexplanations.wordpress.com/)**: distributed computing, chemoinformatics, and general social commentary.
* Lance Fortnow and Bill Gasarch's **[Computational Complexity](http://blog.computationalcomplexity.org/)** : Computational Complexity and other fun stuff in math and computer science.
* Emanuele Viola's **[Thoughts](http://emanueleviola.wordpress.com/)**: computational complexity and general commentary -- started Summer 2014.

> **Comments:**
> **username_6**: Note, I specifically violated the one blog per post rule, to **highlight one community** -- ours. If I missed your blog, if you want to expand your blurb a bit (try to keep it to a sentence or so), or if your blog is no longer active (and you want to remove it) then please edit my post!  
> **username_2**: Jeff Erickson's blog isn't very active, but it's one of the first ones: http://3dpancakes.typepad.com/  
> **username_7**: One more possible site: The Windows On Theory blog at: http://windowsontheory.org.  

---

### Answer by username_8 on 2014-04-21. Score: 12

It is not active anymore, but Mihai Patrascu's "[WebDiarios de Motocicleta](http://infoweekly.blogspot.com)" blog is one of my all-time favorites. Highly recommended especially to those new to the TCS community.


---

### Answer by username_1 on 2014-04-21. Score: 11

blog preferences tend to be highly personal in contrast to other sometimes-definitive TCS resources eg books. however there are two standout/ leading/ popular TCS blogs already cited, lively and highly active for many years, with some background/profiles. both blogs have extensive indexes to other leading TCS blogs. both experts/teachers/leaders in TCS with many published papers, and very much involved with promoting TCS to the wider community eg through popular books. note both have also joined/contributed to tcs.se. maybe not coincidentally (and in [some contrast](https://cstheory.meta.stackexchange.com/questions/274/is-it-ok-to-ask-about-the-correctness-of-preprints-on-crank-friendly-topics) to this site) they do not shy away and are both quite keen on discussing key or famous open problems in the field eg P=?NP. blog comments are open and an interesting/diverse part of the blogs. they routinely cover important proofs in the field. Lipton was closely involved with the cyberspatial peer review of the Deolalikar attack years ago.

* [RJ Lipton P=?NP blog](http://rjlipton.wordpress.com/) by [Lipton](http://www.scs.gatech.edu/features/career-solution) also cowritten by Regan. author of [People, Problems & Proofs](http://rads.stackoverflow.com/amzn/click/3642414214) and [The P=NP question and Godel's lost letter](http://rads.stackoverflow.com/amzn/click/1441971548). ([tcs.se profile](https://cstheory.stackexchange.com/users/2825/dick-lipton)). Lipton is also an expert in deep mathematics eg number theory, group theory etc & regularly ties it into TCS.
* [computational complexity](http://blog.computationalcomplexity.org/) by [Fortnow](http://www.cc.gatech.edu/features/fortnow) with contributions by Gasarch. author of [Golden Ticket, P, NP & the search for the impossible](http://goldenticket.fortnow.com/). ([tcs.se profile](https://cstheory.stackexchange.com/users/550/lance-fortnow)). Fortnow also is a comprehensive reviewer of "favorite great TCS theorems of last decade." Gasarch has done useful/comprehensive community polls on P=?NP.

another well-read, leading/striking blog is Aaronsons "Shtetl optimized". Aaronson sometimes writes longer essays, quite passionately at times, and can sometimes be quite opinionated and polemical. comment sections are very lively and occasionally intense. a strong focus on quantum computing.

* [Shtetl Optimized](http://www.scottaaronson.com/blog/). author of [Quantum computing since Democritus](http://rads.stackoverflow.com/amzn/click/0521199565)

> **Comments:**
> **username_1**: addendum, recent [Aaronson profile](http://newsoffice.mit.edu/2014/scott-aaronson-shapes-conventional-and-quantum-computing-0407)  
> **username_1**: news, [Fortnow wins SIGACT prize](http://blog.computationalcomplexity.org/2014/06/stoc-2014.html) in part for blogging! he writes _"At the just completed STOC conference I received the 2014 SIGACT Distinguished Service Prize. Part of this citation reads"His blog, and many others that followed, changes the way our field communicates, both with itself and with the outside world." I owe this award to you, my readers and commenters. May the conversations always continue."_  

---

### Answer by username_9 on 2014-07-14. Score: 8

One of my all time favorites for deep posts and amazing diversity of content is [Neighborhood of Infinity](http://blog.sigfpe.com/). It mostly focuses on type and category theory and applications of Haskell, but the applications are always so creative and the explanations so clear that I find myself wanting to read it despite it not being my area of expertise.


---

### Answer by username_10 on 2014-11-19. Score: 1

I recommend [A CS Professor's Blog](http://teachingintrotocs.blogspot.in) by Claire Mathieu. She has many interesting posts on academia and CS. A few articles under the label `[TCS](http://teachingintrotocs.blogspot.in/search/label/TCS)' have informal descriptions of technical results.

> **Comments:**
> **username_11**: Just a note: this blog does not seem to be updated very frequently.  

---

