P olynomial Time Algorithms F orNet w ork Information Flo wP eter Sanders Sebastian Egnery and Ludo T olh uizenyOctob er 28 2002AbstractThe min-cut in a net w ork denes an upp er b ound for the (data

arXiv: [] 5 Oct 2007Preprint submitted to Phys. Rev. ow within stochastic dynamical systemsX. San LiangCourant Institute of Mathematical SciencesNew York New York 10012(Dated: February 2 2008)Abstr

The Cognitive Consequences ofPatterns of Information FlowEdwin HutchinsDepartment of Cognitive ScienceUniversity of California San DiegoAbstractThis paper examines the instruments and procedures found