default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid L. Millman
Person information
- affiliation: Blocky Inc, Bozeman, MT, USA
- affiliation (former): Montana State University, Gianforte School of Computing, Bozeman, MT, USA
- affiliation (former, PhD 2012): University of North Carolina at Chapel Hill, Department of Computer Science, Chapel Hill, NC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Brittany Terese Fasy, David L. Millman, Anna Schenfisch:
How Small Can Faithful Sets Be? Ordering Topological Descriptors. CCCG 2024: 257-269- [i9]Brittany Terese Fasy, David L. Millman, Anna Schenfisch:
Ordering Topological Descriptors. CoRR abs/2402.13632 (2024) - 2023
- [c14]Thiruvarangan Ramaraj, Bo Wen Liu, Britney Gibbs, Azalea Mendoza, David L. Millman, Brendan Mumey, Matthew Fields, Callum Bell:
Development of an ontology for biofilms. BIBM 2023: 2932-2937 - [c13]Hsien-Chih Chang
, Brittany Terese Fasy, Bradley McCoy, David L. Millman, Carola Wenk:
From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy. WADS 2023: 605-619 - [i8]Hsien-Chih Chang, Brittany Terese Fasy, Bradley McCoy, David L. Millman, Carola Wenk:
From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy. CoRR abs/2309.02383 (2023) - 2022
- [c12]Anna Schenfisch, Brittany Terese Fasy, Samuel Micka, David L. Millman, Lucia Williams:
Efficient Graph Reconstruction and Representation Using Augmented Persistence Diagrams. CCCG 2022: 284-292 - [c11]Saidur Rahman, Apostolos Kalatzis, Mike P. Wittie, David L. Millman, Laura M. Stanley:
Dynamic Checkpoint Initiation in Serverless MEC. COINS 2022: 1-6 - [i7]Brittany Terese Fasy, Samuel Micka, David L. Millman, Anna Schenfisch, Lucia Williams:
Efficient Graph Reconstruction and Representation Using Augmented Persistence Diagrams. CoRR abs/2212.13206 (2022) - 2021
- [c10]Kemal Turksonmez, Marcin Furtak, Mike P. Wittie, David L. Millman:
Two Ways Gas Price Oracles Miss The Mark. COINS 2021: 1-7 - [i6]Benjamin Holmgren, Bradley McCoy, Brittany Terese Fasy, David L. Millman:
If You Must Choose Among Your Children, Pick the Right One. CoRR abs/2103.13882 (2021) - 2020
- [j9]Robin Lynne Belton, Brittany Terese Fasy, Rostik Mertz, Samuel Micka, David L. Millman, Daniel Salinas, Anna Schenfisch, Jordan Schupbach, Lucia Williams:
Reconstructing embedded graphs from persistence diagrams. Comput. Geom. 90: 101658 (2020) - [c9]Brittany Terese Fasy, Benjamin Holmgren, Bradley McCoy, David L. Millman:
If You Must Choose Among Your Children, Pick the Right One. CCCG 2020: 336-344 - [c8]Hannah Bratterud, Mac Burgess, Brittany Terese Fasy, David L. Millman, Troy Oster, Eunyoung (Christine) Sung:
The Sung Diagram: Revitalizing the Eisenhower Matrix. Diagrams 2020: 498-502
2010 – 2019
- 2019
- [i5]Robin Lynne Belton, Brittany Terese Fasy, Rostik Mertz, Samuel Micka, David L. Millman, Daniel Salinas, Anna Schenfisch, Jordan Schupbach, Lucia Williams:
Reconstructing Embedded Graphs from Persistence Diagrams. CoRR abs/1912.08913 (2019) - [i4]Brittany Terese Fasy, Samuel Micka, David L. Millman, Anna Schenfisch, Lucia Williams:
Persistence Diagrams for Efficient Simplicial Complex Reconstruction. CoRR abs/1912.12759 (2019) - 2018
- [c7]Robin Lynne Belton, Brittany Terese Fasy, Rostik Mertz, Samuel Micka, David L. Millman, Daniel Salinas, Anna Schenfisch, Jordan Schupbach, Lucia Williams:
Learning Simplicial Complexes from Persistence Diagrams. CCCG 2018: 18-27 - [i3]Robin Lynne Belton, Brittany Terese Fasy, Rostik Mertz, Samuel Micka, David L. Millman, Daniel Salinas, Anna Schenfisch, Jordan Schupbach, Lucia Williams:
Learning Simplicial Complexes from Persistence Diagrams. CoRR abs/1805.10716 (2018) - [i2]Brittany Terese Fasy, Samuel Micka, David L. Millman, Anna Schenfisch, Lucia Williams:
Challenges in Reconstructing Shapes from Euler Characteristic Curves. CoRR abs/1811.11337 (2018) - [i1]Brittany Terese Fasy, Xiaozhou He, Zhihui Liu, Samuel Micka, David L. Millman, Binhai Zhu:
Approximate Nearest Neighbors in the Space of Persistence Diagrams. CoRR abs/1812.11257 (2018) - 2015
- [j8]Brittany Terese Fasy, David L. Millman:
Review of: Polyhedral and Algebraic Methods in Computational Geometry by Michael Joswig and Thorsten Theobald. SIGACT News 46(3): 17-20 (2015) - 2014
- [j7]Brittany Terese Fasy, David L. Millman:
Review of discrete and computational geometry by Satyan L. Devadoss and Joseph O'Rourke. SIGACT News 45(1): 27-30 (2014) - 2013
- [j6]Brittany Terese Fasy, David L. Millman:
Review of how to fold it by J. O'Rourke. SIGACT News 44(3): 17-19 (2013) - 2012
- [b1]David L. Millman:
Degree-Driven Design of Geometric Algorithms for Point Location, Proximity, and Volume Calculation. University of North Carolina, Chapel Hill, USA, 2012 - [c6]David L. Millman, Steven Love, Timothy M. Chan, Jack Snoeyink:
Computing the Nearest Neighbor Transform Exactly with Only Double Precision. ISVD 2012: 66-74 - 2011
- [j5]Brittany Terese Fasy, David L. Millman:
Review of Geometric folding algorithms by authors: E.D. Demaine and J. O'Rourke. SIGACT News 42(1): 43-46 (2011) - [j4]Brittany Terese Fasy, David L. Millman:
Review of Geometric algebra: an algebraic system for computer games and animation by J. Vince. SIGACT News 42(1): 46-48 (2011) - [c5]David L. Millman, Vishal Verma:
A Slow Algorithm for Computing the Gabriel Graph with Double Precision. CCCG 2011 - 2010
- [j3]Vicente H. F. Batista, David L. Millman, Sylvain Pion, Johannes Singler:
Parallel geometric algorithms for multi-core computers. Comput. Geom. 43(8): 663-677 (2010) - [c4]David L. Millman, Matthew O'Meara, Jack Snoeyink, Vishal Verma:
Maximum geodesic routing in the plane with obstacles. CCCG 2010: 107-108 - [c3]David L. Millman, Jack Snoeyink:
Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design. SCG 2010: 386-392
2000 – 2009
- 2009
- [j2]Brittany Terese Fasy, David L. Millman:
Review of higher arithmetic: an algorithmic introduction to number theory by H. M. Edwards (American Mathematical Society Student Mathematical Library Vol. 45 (2008). SIGACT News 40(2): 38-41 (2009) - [c2]Vicente H. F. Batista, David L. Millman, Sylvain Pion, Johannes Singler:
Parallel geometric algorithms for multi-core computers. SCG 2009: 217-226 - [c1]David L. Millman, Jack Snoeyink:
Computing the Implicit Voronoi Diagram in Triple Precision. WADS 2009: 495-506 - 2008
- [j1]Brittany Terese Fasy, David L. Millman:
Review of Geometric algebra for computer science by Leo Dorst, Daniel Fontijne, and Stephen Mann(Morgan Kaufmann Publishers, 2007). SIGACT News 39(4): 27-30 (2008)
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 2025-10-16 00:10 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:
