Springer Verlag / River / Springer / New York / Reading / Brooklyn / /
Company
Dell / M. / G ROMOV / Ck of K / Bjk / Red Hat / John Wiley & Sons Inc. / Zk / M. Hyperbolic / Bk / Ck / /
Country
United States / /
Currency
USD / / /
Event
Reorganization / /
Facility
University of Illinois / We store / University of Chicago / Prentice Hall / /
IndustryTerm
boundary / boundary groups / persistent homology / persistence software processes persistence complexes / kth chain / persistent / boundary operators / boundary operator / reduction algorithm / cycle / data acquisition systems / kth homology / natural algorithm / homology / chain groups / normal form algorithms / inductive systems / classic reduction algorithm / persistence algorithm / /
OperatingSystem
Red Hat Linux / GNU / /
Organization
National Science Foundation / Laboratory for Astrophysics and Space Research / Stanford University Stanford / University of Illinois / the University of Chicago / /
Person
John Harer / Herbert Edelsbrunner / S ILVA / V / Anne Collins / W ELKER / V / Leo Guibas / Milena Micono / Andrea Malagoli / Afra Zomorodian Gunnar Carlsson / /
Position
first author / second author / design and analysis General / GNU MP / /
Product
Pentax K-x Digital Camera / Munkres / Linux / Morse / /
ProgrammingLanguage
K / /
ProvinceOrState
New Jersey / Illinois / New York / Massachusetts / /
Technology
natural algorithm / RAM / pairing algorithm / Linux / The algorithm / reduction algorithm / previous algorithm / persistence algorithm / classic reduction algorithm / 4.2 Algorithm / field algorithm / normal form algorithms / 6.2 Data Our algorithm / /
Computing Persistent Homology ∗ Afra Zomorodian