G
Geraint Jones
Researcher at University of Oxford
Publications - 20
Citations - 586
Geraint Jones is an academic researcher from University of Oxford. The author has contributed to research in topics: Mathematical proof & Parallel algorithm. The author has an hindex of 11, co-authored 20 publications receiving 578 citations.
Papers
More filters
Proceedings ArticleDOI
The under-appreciated unfold
Jeremy Gibbons,Geraint Jones +1 more
TL;DR: A number of algorithms for computing the breadth-first traversal of a tree are presented, and a characterization of breadth- first traversal directly as an unfold turns out to be the 'standard' queue-based algorithm.
Journal ArticleDOI
Formal derivation of a pattern matching algorithm
TL;DR: This paper is devoted to the synthesis of a functional version of the Knuth-MorrisPratt algorithm for pattern matching, and the derivation makes use of the calculus of lists described by Bird.
Journal ArticleDOI
Designing arithmetic circuits by refinement in Ruby
Geraint Jones,Mary Sheeran +1 more
TL;DR: The systematic derivation of a static bit-level parallel algorithm to implement multiplication of integers serves both as an explanation of the circuit, and as a demonstration that it is correct ‘by construction’.
Linear−time Breadth−first Tree Algorithms: An Exercise in the Arithmetic of Folds and Zips
Geraint Jones,Jeremy Gibbons +1 more
TL;DR: An application of the mathematics of the zip, reduce (fold) and accumulate (scan) operations on lists gives an account of the derivation of a linear-time breadth-rst tree traversal algorithm and of a subtle and eecient breadth- rst tree labelling algorithm.