My Biased Coin

My take on computer science --
algorithms, networking, information theory --
and related items.

Wednesday, November 28, 2007

NSF FIND Working Meeting

›
I'm writing this while stuck at attending an NSF FIND (Future Internet Design) working meeting (Nov 27-28). Part of the FIND program i...
Monday, November 26, 2007

Introducing New Scientific Ideas, and D-Wave

›
Apropos of my last post on Digital Fountain is Scott's Aaronson's current report on D-Wave researchers giving talks about what'...
1 comment:
Sunday, November 25, 2007

What's Up, Digital Fountain?

›
Every now and again, I get asked about Digital Fountain , the startup that initially grew out of work I was involved with on Tornado codes, ...
Wednesday, November 21, 2007

Page Limits on Journal Papers

›
I know of at least two journals that I publish in that have page limits on the length of papers. I am completely puzzled by this. A journa...
16 comments:
Sunday, November 18, 2007

David Parkes talk Monday, 4pm

›
David Parkes will be giving a talk on computational mechanism design in Maxwell-Dworkin G115 at 4pm on the 19th. This is what at Harvard ...
5 comments:
Friday, November 16, 2007

Should IP issues affect our research?

›
Since I've done some legal consulting, I've become interested in intellectual property (IP) issues, and the question of whether IP ...
3 comments:
Monday, November 12, 2007

An Experiment in Viral Marketing : Buying Tickets Online

›
(Warning: the following post is highly crass and commercial. If that offends you in any way, please don't read on.) Thanks to some fri...
2 comments:
Saturday, November 10, 2007

Koblitz follow-up

›
Luca points to the letters to the editor (and Koblitz's response) regarding the Koblitz affair .
1 comment:
Thursday, November 08, 2007

Service and the NSF

›
I recently returned from an NSF (National Science Foundation) review panel. (Of course, I'm not allowed to say when, or for what.) On ...
5 comments:
Monday, November 05, 2007

Graduate Students, Socialize!

›
The discussion that in my mind connected breadth requirements to social networks reminded me of my time as a graduate student at Berkeley, ...
7 comments:
Friday, November 02, 2007

Breadth Requirements

›
In our department we're looking at the class requirements for Ph.D. students, and in particular breadth requirements. I'll state cle...
24 comments:
Wednesday, October 31, 2007

New Book : Algorithmic Game Theory

›
I recently received my "desk copy" of the new book Algorithmic Game Theory , edited by Nisan, Roughgarden, Tardos, and Vazirani. W...
2 comments:
Monday, October 29, 2007

Consulting

›
I enjoy consulting, for several reasons: It fulfills a need to be more directly relevant to the real world. It gives me a chance to work wit...
11 comments:
Sunday, October 28, 2007

Academic jobs this season?

›
I’ve already mentioned Harvard is doing a junior faculty search – although not specifically for a theorist. Any other faculty hiring announc...
5 comments:
Monday, October 22, 2007

Service to the Academic Community: Goals?

›
Except for the rare award (like the ACM-SIGACT Distingushed Service Award or Aaron D. Wyner Distinguished Service Award ), our academic com...
9 comments:
Saturday, October 20, 2007

Brief FOCS Update

›
I went to FOCS for the day of tutorials . Great talks by all of the speakers (Terence Tao, Dan Boneh, and Dan Spielman) -- and it seemed to...
Friday, October 19, 2007

Harvard Computer Science Hiring

›
We're eagerly looking for candidates in CS in all areas at the junior level (i.e., assistant profs). (Be sure to tell your non-theory f...
6 comments:
Wednesday, October 17, 2007

Harry Lewis's book, Excellence Without a Soul

›
Since my colleague Harry Lewis is kind enough to stop by and post comments from time to time, I would be remiss not to encourage everyone wi...
2 comments:
Monday, October 15, 2007

Broadening the Teaching of Theory

›
Offhand, I can think the following primary "types" of computer science classes: Classes specialized for graduate students in a sub...
6 comments:
Tuesday, October 09, 2007

The simplest insertion/deletion channel

›
The simplest binary insertion/deletion channel that I can think of is the following: with probability p, each bit independently results in t...
‹
›
Home
View web version

Contributors

  • Michael Mitzenmacher
  • Michael Mitzenmacher
Powered by Blogger.