The Mathematical Institute, University of Oxford, Eprints Archive

Complexity plots

Thiyagalingam, J. and Walton, S. and Duffy, B.R. and Trefethen, A. and Chen, M. (2013) Complexity plots. EuroVis . (Submitted)

[img]
Preview
PDF
1MB

Abstract

In this paper, we present a novel visualization technique for assisting in observation and analysis of algorithmic
complexity. In comparison with conventional line graphs, this new technique is not sensitive to the units of
measurement, allowing multivariate data series of different physical qualities (e.g., time, space and energy) to be juxtaposed together conveniently and consistently. It supports multivariate visualization as well as uncertainty visualization. It enables users to focus on algorithm categorization by complexity classes, while reducing visual impact caused by constants and algorithmic components that are insignificant to complexity analysis. It provides an effective means for observing the algorithmic complexity of programs with a mixture of algorithms and blackbox software through visualization. Through two case studies, we demonstrate the effectiveness of complexity plots in complexity analysis in research, education and application.

Item Type:Article
Subjects:D - G > General
Research Groups:Oxford Centre for Collaborative Applied Mathematics
ID Code:1719
Deposited By: Peter Hudston
Deposited On:30 Jul 2013 13:15
Last Modified:29 May 2015 19:24

Repository Staff Only: item control page