Skip to search formSkip to main contentSkip to account menu
Practical fast searching in strings
  • R. N. Horspool
  • Computer Science, Education
    Softw. Pract. Exp.
  • 1 June 1980
TLDR
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.
View on Wiley
Data Compression Using Dynamic Markov Modelling
TLDR
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.
View via Publisher
Near Optimal Hierarchical Encoding of Types
TLDR
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.
View via Publisher
Efficient type inclusion tests
TLDR
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.
View on ACM
Code Hunt: Experience with Coding Contests at Scale
TLDR
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.
View on ACM
Faster Generalized LR Parsing
TLDR
Tomita devised a method of generalized LR (GLR) parsing to parse ambiguous grammars efficiently, falling back on more expensive general techniques when necessary.
View via Publisher
Constructing word-based text compression algorithms
TLDR
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.
View on IEEE
Partial redundancy elimination driven by a cost-benefit analysis
TLDR
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.
View on IEEE
Simple Generation of Static Single-Assignment Form
TLDR
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.
View via Publisher
Developing principles of GUI programming using views
TLDR
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.
View on ACM
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License