Mark McCann

dblp:76/5771 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2020
0000-0002-6100-1416ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 4 first-authorArtificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithms and data structures · 67% Mathematical optimization · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures
computer arithmetic
0.112005
SRT Division Algorithms as Dynamical Systems · SIAM J. Comput. 2005
Algorithms and data structures › symbolic computation
division algorithms
0.112005
SRT Division Algorithms as Dynamical Systems · SIAM J. Comput. 2005
Mathematical optimization
dynamical systems
0.112005
SRT Division Algorithms as Dynamical Systems · SIAM J. Comput. 2005

Methods — techniques the papers use, named apart from their topics

entropy analysis · 0.1dynamical systems theory · 0.1
YearPublicationVenuePosition
2020 Visual Causality: Investigating Graph Layouts for Understanding Causal Processes
Dong-Bach Vo, Kristina Lazarova, Helen C. Purchase, Mark McCann
Diagrams4
2013 Fault tolerance in cellular automata at low fault rates
Mark McCann, Nicholas Pippenger
J. Comput. Syst. Sci.1
2009 OpenGeoDa, open source software for the exploration and visualization of geospatial data
abstract
OpenGeoDa is the open source successor to GeoDa, a software package designed to introduce non-experts to spatial data analysis. was developed under the auspices of the NSF funded Center for Spatially Integrated Social Science (CSISS) [4]. Since its release in 2003, Legacy GeoDa has gained over 40,000 individual users and has become a standard to teach introductory spatial data analysis. (and Open GeoDa) was conceived as enabling researchers to move from geovisualization to exploratory data analysis, the study of spatial autocorrelation and ending up with spatial regression modeling.
Luc Anselin, Mark McCann
GIS2
2008 Fault tolerance in cellular automata at high fault rates
Mark McCann, Nicholas Pippenger
J. Comput. Syst. Sci.1
2005 SRT Division Algorithms as Dynamical Systems
abstract
Sweeney--Robertson--Tocher (SRT) division, as it was discovered in the late 1950s, represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division is still commonly implemented in computers today. Although some bounds on the performance of the original SRT division method were obtained, a great many questions remained unanswered. In this paper, the original version of SRT division is described as a dynamical system. This enables us to bring modern dynamical systems theory, a relatively new development in mathematics, to bear on an older problem. In doing so, we are able to show that SRT division is ergodic, and is even Bernoulli, for all real divisors and dividends. With the Bernoulli property, we are able to use entropy to prove that the natural extensions of SRT division are isomorphic by way of the Kolmogorov--Ornstein theorem. We demonstrate how our methods and results can be applied to a much larger class of division algorithms.
Mark McCann, Nicholas Pippenger
SIAM J. Comput.1
2003 SRT Division Algorithms as Dynamical Systems
abstract
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division is still commonly implemented in computers today. Although some bounds on the performance of the original SRT division method were obtained, a great many questions remained unanswered. The original version of SRT division is described as a dynamical system. This enables us to bring modern dynamical systems theory, a relatively new development in mathematics, to bear on an older problem. In doing so, we are able to show that SRT division is ergodic, and is even Bernoulli, for all real divisors and dividends. With the Bernoulli property, we are able to use entropy to prove that the natural extensions of SRT division are isomorphic by way of the Kolmogorov-Ornstein theorem. We demonstrate how our methods and results can be applied to a much larger class of division algorithms.
Mark McCann, Nicholas Pippenger
IEEE Symposium on Computer Arithmetic1