Computational complexity and other fun stuff in math and computer science as viewed by Lance Fortnow and Bill Gasarch.
Bill's Home Page
Lance's Home Page
Weblog Home
Weblog Archives and Search
Podcast
Mailing List
Feeds: Posts Comments
Foundations of Complexity
Graduate Student Guide
Favorite Theorems
Announcements
I would bet on INTRADE that INTRADE will do badly ...
The Big Aggregators
The Ultimate Wallet
If a Hobby relates to your work, is it a Hobby?
While I Was Gone
What to teach in grad course in Comm Comp- some no...
A nice result, but not good for...
Ways Scott could have gotten his question answered...
Acknowledging anonymous blog comments
IEEE Conference on Computational Complexity
Electronic Colloquium on Computational Complexity
BEATCS Computational Complexity Column
Complexity Zoo
Favorite Complexity Books
Abie Flaxman
Andy Drucker
Ars Mathematica
Computing Research Policy
D. Sivakumar
David Eppstein
David Molnar
David Pennock
Doron Zeilberger
Jeff Erickson
John Langford
Kurt Van Etten
Luca Aceto
Luca Trevisan
Michael Mitzenmacher
Muthu Muthukrishnan
Michael Nielsen
Paul Goldberg
Oded Goldreich
Scott Aaronson
Sorelle Friedler
Suresh Venkatasubramanian
Terence Tao
DMANET
FYI
Nielsen's Principles of Research
Parberry's TCS Guides
Theory Matters
Theorynet
Computer Science Theory
Theory Edge
This work is licensed under a Creative Commons License.
Tracking Trends in Computer Science Posted by GASARCH What are the trends in computer science? This is a hard question to quantify; however, Brighten Godfrey has given it a shot on his blog here: trends. He counts how often certain words appear. What other ways could one measure this? ~ 10:51 AM # 1 comments
Posted by GASARCH
10:51 AM # 1 comments
Comment Feeds: This Post All
Create a Link