Share This Author
Practical fast searching in strings
- R. N. Horspool
- Computer Science, EducationSoftw. Pract. Exp.
- 1 June 1980
It is discovered that a method developed by Boyer and Moore can outperform even special‐purpose search instructions that may be built into the computer hardware for very short substrings.
Data Compression Using Dynamic Markov Modelling
Experimental results reported here indicate that the Markov modelling approach generally achieves much better data compression than that observed with competing methods on typical computer data.
Near Optimal Hierarchical Encoding of Types
A new algorithm based on graph coloring which computes a near optimal hierarchical encoding of type hierarchies is presented which improves significantly on previous results - it is faster, simpler and generates smaller bit vectors.
Efficient type inclusion tests
Three new encodings of the subtype relation, the packed encoding, the bit-packed encoding and the compact encoding are presented, which have different characteristics and are compared with other constant-time type inclusion tests.
Code Hunt: Experience with Coding Contests at Scale
- J. Bishop, R. N. Horspool, Tao Xie, N. Tillmann, J. D. Halleux
- Computer Science, EducationIEEE/ACM 37th IEEE International Conference on…
- 16 May 2015
This paper describes Code Hunt and the contest experience it offers, and shows some early results that demonstrate how Code Hunt can accurately discriminate between good and bad coders.
Faster Generalized LR Parsing
Tomita devised a method of generalized LR (GLR) parsing to parse ambiguous grammars efficiently, falling back on more expensive general techniques when necessary.
Constructing word-based text compression algorithms
The authors consider choosing Sigma to be an alphabet whose symbols are the words of English or, in general, alternate maximal strings of alphanumeric characters and nonalphanumeric characters to take advantage of longer-range correlations between words and achieve better compression.
Partial redundancy elimination driven by a cost-benefit analysis
- R. N. Horspool, H. C. Ho
- Computer ScienceProceedings of the Eighth Israeli Conference on…
- 18 June 1997
The new technique is much more aggressive, performing more code motion and thereby reducing the number of expression evaluations as compared to the standard optimization.
Simple Generation of Static Single-Assignment Form
A new, simple method for converting to SSA form is presented, which produces correct solutions for nonreducible control-flow graphs, and produces minimal solutions for reducible ones.
Developing principles of GUI programming using views
It is proposed that principles of GUIs can be extracted and learnt, and that they do enhance good programming practice and have been implemented in the Views system, which features an XML-based GUI description notation coupled with an engine that shields the programmer from much of the intricate complexity associated with events, listeners and handlers.