# 0xDE

### Description

Professor of Computer Science at UC Irvine, researching graph algorithms and computational geometry. Wikipedian. Amateur photographer. Father of two.

### 0xDE's Latest Posts

### Tags

### Comments

Log in to leave a comment

X

Name

0xDE

Categories

URL

Feed

- Unknown

Professor of Computer Science at UC Irvine, researching graph algorithms and computational geometry. Wikipedian. Amateur photographer. Father of two.

+

Unexpected shapes in smoke plumes, as photographed by Thomas Herbrich (G+)ISAAC 2014 and COCOA 2014 accepted paper lists (G+)FOCS 2014 program and best paper winners (G+)Kinetic sculpture made of wooden balls on threads, with some extensive software simulation behind its design (G+)How a 19th century math genius taught us the best way to hold a pizza slice, or, a practical application of the theorem that when a flat surface is embedded in 3d, it remains flat in at least one direction
[…]

+

Just some test shots with my new travel lens (Canon's 17-40/F4 L, replacing a mysteriously nonfunctional and optically not as good 17-85IS).

+

Did you ever wonder why different states of the US have the numbers of representatives in congress that they do? It's supposed to be proportional to population but that's not actually true: for instance the ratio of representatives to population is about 40% higher in Montana than California. What formula or algorithm do they use to pick the numbers?This has varied over the years but, Wikipedia tells me, currently it's the Huntington–Hill method. One way of describing this is by a simple
[…]

+

The Rado graph has interesting symmetry properties and plays an important role in the logic of graphs. But it's an infinite graph, so how can we say anything about the complexity of algorithms on it?There are algorithmic problems that involve this graph and are independent of any representation of it, such as checking whether a first-order logic sentence is true of it (PSPACE-complete). But I'm interested here in problems involving the Rado graph where different ways of constructing and
[…]

+

More Google+ links from the last couple of weeks:An interview with Haida artist Jim Hart (G+):Persi Diaconis discusses mathematics and magic (G+)A still-unsolved question about whether it's possible to compute edit distance in sublinear space and polynomial time (G+)A New York Times story about how scheduling software makes part-time workers' lives harder. Or does it? The MF discussion of the article makes it clear that managers have been doing the same things with lower tech for a long time.
[…]

Log in to leave a comment

About ScienceSeeker

ScienceSeeker collects science articles from sources around the world, so you can find the latest science news and discussion on any topic.

Are you a science blogger?

Submit your blog today.

X