default search action
John Harer
Person information
- affiliation: Duke University, Durham, NC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c17]Francis C. Motta, John Harer, Nick Leiby, Franco Marinozzi, Scott Novotney, Gabe Rocklin, Jed Singer, Devin Strickland, Matt Vaughn, Christopher J. Tralie, Rossella Bedini, Fabiano Bini, Gilberto Bini, Hamed Eramian, Marcio Gameiro, Steven B. Haase, Hugh Haddox:
Hyperparameter Optimization of Topological Features for Machine Learning Applications. ICMLA 2019: 1107-1114 - 2018
- [i9]Christopher J. Tralie, Paul Bendich, John Harer:
Multi-scale Geometric Summaries for Similarity-based Sensor Fusion. CoRR abs/1810.10324 (2018) - 2017
- [i8]Abraham D. Smith, Paul Bendich, John Harer, Jay Hineman:
Supervised Learning of Labeled Pointcloud Differences via Cover-Tree Entropy Reduction. CoRR abs/1702.07959 (2017) - [i7]Christopher J. Tralie, Abraham D. Smith, Nathan Borggren, Jay Hineman, Paul Bendich, Peter Zulch, John Harer:
Geometric Cross-Modal Comparison of Heterogeneous Sensor Data. CoRR abs/1711.08569 (2017) - 2016
- [j15]Paul Bendich, Sang Peter Chin, Jesse Clarke, Jonathan deSena, John Harer, Elizabeth Munch
, Andrew Newman, David Porter, David Rouse, Nate Strawn, Adam Watkins:
Topological and statistical behavior classifiers for tracking applications. IEEE Trans. Aerosp. Electron. Syst. 52(6): 2644-2661 (2016) - [c16]Paul Bendich, Ellen Gasparovic, John Harer, Christopher J. Tralie:
Geometric Models for Musical Audio Data. SoCG 2016: 65:1-65:5 - [i6]Paul Bendich, Ellen Gasparovic, Christopher J. Tralie, John Harer:
Scaffoldings and Spines: Organizing High-Dimensional Data Using Cover Trees, Local Principal Component Analysis, and Persistent Homology. CoRR abs/1602.06245 (2016) - 2015
- [j14]Jose A. Perea, Anastasia Deckard
SW1PerS: Sliding windows and 1-persistence scoring; discovering periodicity in gene expression time series data. BMC Bioinform. 16: 257:1-257:12 (2015) - [j13]Jose A. Perea, John Harer:
Sliding Windows and Persistence: An Application of Topological Methods to Signal Analysis. Found. Comput. Math. 15(3): 799-838 (2015) - [c15]Paul Bendich, Ellen Gasparovic, John Harer, Rauf Izmailov
Multi-scale local shape analysis and feature selection in machine learning applications. IJCNN 2015: 1-8 - 2014
- [j12]Katharine Turner
Fréchet Means for Distributions of Persistence Diagrams. Discret. Comput. Geom. 52(1): 44-70 (2014) - [i5]Paul Bendich, Sang Chin, Jesse Clarke, Jonathan deSena, John Harer, Elizabeth Munch, Andrew Newman, David Porter, David Rouse, Nate Strawn, Adam Watkins:
Topological and Statistical Behavior Classifiers for Tracking Applications. CoRR abs/1406.0214 (2014) - [i4]Paul Bendich, Ellen Gasparovic, John Harer, Rauf Izmailov, Linda Ness:
Multi-Scale Local Shape Analysis and Feature Selection in Machine Learning Applications. CoRR abs/1410.3169 (2014) - 2013
- [j11]Anastasia Deckard
Design and analysis of large-scale biological rhythm studies: a comparison of algorithms for detecting periodic signals in biological data. Bioinform. 29(24): 3174-3180 (2013) - [i3]Elizabeth Munch, Paul Bendich, Katharine Turner, Sayan Mukherjee, Jonathan Mattingly, John Harer:
Probabilistic Fréchet Means and Statistics on Vineyards. CoRR abs/1307.6530 (2013) - 2012
- [j10]Elizabeth Munch
Failure filtrations for fenced sensor networks. Int. J. Robotics Res. 31(9): 1044-1056 (2012) - 2011
- [j9]Paul Bendich, John Harer:
Persistent Intersection Homology. Found. Comput. Math. 11(3): 305-336 (2011) - [i2]Elizabeth Munch, Michael Shapiro, John Harer:
Failure Filtrations for Fenced Sensor Networks. CoRR abs/1109.6535 (2011) - 2010
- [b1]Herbert Edelsbrunner, John Harer:
Computational Topology - an Introduction. American Mathematical Society 2010, ISBN 978-0-8218-4925-5, pp. I-XII, 1-241 - [j8]David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Yuriy Mileyko:
Lipschitz Functions Have Lp-Stable Persistence. Found. Comput. Math. 10(2): 127-139 (2010)
2000 – 2009
- 2009
- [j7]David Cohen-Steiner, Herbert Edelsbrunner, John Harer:
Extending Persistence Using Poincaré and Lefschetz Duality. Found. Comput. Math. 9(1): 79-103 (2009) - [j6]David Cohen-Steiner, Herbert Edelsbrunner, John Harer:
Extending Persistence Using Poincaré and Lefschetz Duality. Found. Comput. Math. 9(1): 133-134 (2009) - [c14]Herbert Edelsbrunner, John Harer:
The Persistent Morse Complex Segmentation of a 3-Manifold. 3DPH 2009: 36-50 - [c13]David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Dmitriy Morozov:
Persistent homology for kernels, images, and cokernels. SODA 2009: 1011-1020 - 2008
- [j5]Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci
Time-varying Reeb graphs for continuous space-time data. Comput. Geom. 41(3): 149-166 (2008) - [c12]Herbert Edelsbrunner, John Harer, Amit K. Patel:
Reeb spaces of piecewise linear mappings. SCG 2008: 242-250 - 2007
- [j4]David Cohen-Steiner, Herbert Edelsbrunner, John Harer:
Stability of Persistence Diagrams. Discret. Comput. Geom. 37(1): 103-120 (2007) - [c11]Paul Bendich, David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Dmitriy Morozov:
Inferring Local Homology from Sampled Stratified Spaces. FOCS 2007: 536-546 - [c10]Dominique Attali, Herbert Edelsbrunner, John Harer, Yuriy Mileyko:
Alpha-Beta Witness Complexes. WADS 2007: 386-397 - 2006
- [j3]Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang:
Extreme Elevation on a 2-Manifold. Discret. Comput. Geom. 36(4): 553-572 (2006) - 2005
- [c9]David Cohen-Steiner, Herbert Edelsbrunner, John Harer:
Stability of persistence diagrams. SCG 2005: 263-271 - 2004
- [j2]Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci
Loops in Reeb Graphs of 2-Manifolds. Discret. Comput. Geom. 32(2): 231-244 (2004) - [c8]Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang:
Extreme elevation on a 2-manifold. SCG 2004: 357-365 - [c7]Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci:
Time-varying reeb graphs for continuous space-time data. SCG 2004: 366-372 - [c6]Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci
Local and Global Comparison of Continuous Functions. IEEE Visualization 2004: 275-280 - 2003
- [j1]Herbert Edelsbrunner, John Harer, Afra Zomorodian:
Hierarchical Morse - Smale Complexes for Piecewise Linear 2-Manifolds. Discret. Comput. Geom. 30(1): 87-107 (2003) - [c5]Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci:
Loops in reeb graphs of 2-manifolds. SCG 2003: 344-350 - [c4]Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci:
Morse-smale complexes for piecewise linear 3-manifolds. SCG 2003: 361-370 - [c3]Anne D. Collins, Pankaj K. Agarwal, John Harer:
HPRM: a hierarchical PRM. ICRA 2003: 4433-4438 - 2001
- [c2]Herbert Edelsbrunner, John Harer, Afra Zomorodian:
Hierarchical morse complexes for piecewise linear 2-manifolds. SCG 2001: 70-79 - [c1]Pankaj K. Agarwal, Anne D. Collins, John Harer:
Minimal Trap Design. ICRA 2001: 2243-2248
1990 – 1999
- 1999
- [i1]Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin:
Emerging Challenges in Computational Topology. CoRR cs.CG/9909001 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: