- Michael Lugo confirms that Analytic Combinatorics IS out !
- David E reports on two interesting theory-experimental papers from ALENEX
- David E mentions in passing a new result by Gabriel Nivasch on DS sequences, giving very tight upper and lower bounds for order 3 and higher.
Ruminations on computational geometry, algorithms, theoretical computer science and life
Sunday, January 04, 2009
SODA Days 0/1...
Subscribe to:
Post Comments (Atom)
And SODA 2010 in Austin, Texas, and SODA 2011 in Paris, France (of course unless SIAM and SODA steering committee will change the outcome of the majority vote, what is most likely to happen, in which case it should be San Francisco)
ReplyDelete