Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Matthew D. Russell

dblp:53/5465 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2003
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author

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.

Human-computer interaction and pervasive computing
1 paper
User interface design and tools · 77% Interaction techniques and input · 23%

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

TopicWeightPapersLastEvidence papers
User interface design and tools › user interface design
interface design process		 0.011992
Action Assignable Graphics: A Flexible Human-Computer Interface Design Process · CHI 1992
YearPublicationVenuePosition
2003 Making the most of two heuristics: breaking transposition ciphers with ants
abstract
Multiple anagramming is a general method for the cryptanalysis of transposition ciphers, and has a graph theoretic representation. Inspired by a partially mechanised approach used in World War II, we consider the possibility of a fully automated attack. Two heuristics based on measures of natural language are used - one to recognise plaintext, and another to guide construction of the secret key. This is shown to be unworkable for cryptograms of a certain difficulty due to random variation in the constructive heuristic. A solver based on an ant colony optimisation (AGO) algorithm is then introduced, increasing the range of cryptograms that can be treated; the pheromone feedback provides a mechanism for the recognition heuristic to correct the noisy constructive heuristic.
Matthew D. Russell, John A. Clark, Susan Stepney
 IEEE Congress on Evolutionary Computation1
2003 Using Ants to Attack a Classical Cipher
Matthew D. Russell, John A. Clark, Susan Stepney
 GECCO1
1992 Action Assignable Graphics: A Flexible Human-Computer Interface Design Process
abstract
No abstract available.
Matthew D. Russell, Howard Xu
 CHI1