Name: Drawing Rooted Trees in Linear Time
Start: 2016-02-15T19:00:00-06:00
End: 2016-02-15T22:00:00-06:00
Location: Observable Networks

Deech will discuss Drawing Rooted Trees in Linear Time (https://github.com/tristanpenman/n-puzzle/blob/master/doc/reference/Drawing%20Rooted%20Trees%20in%20Linear%20Time.pdf).

Food & Drinks will be provided by SBS Creatix (http://www.sbscreatix.com/) this month.

Matt Follett

Deech

Papers We Love (Saint Louis Chapter)

Technology

Artificial Intelligence

Statistical Computing

Computer Programming

Programming Languages

Computer Science

High Scalability Computing

Machine Learning

High Performance Computing

Computational Science and Engineering

Drawing Rooted Trees in Linear Time

Observable Networks

Share this event

Drawing Rooted Trees in Linear Time

Details