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

Andrew Clutterbuck

dblp:75/2509 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

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

Human-computer interaction and ubiquitous computing · 1

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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › document organization
hypertext
0.011994
A comparison of algorithms for hypertext notes network linearization · Int. J. Hum. Comput. Stud. 1994
YearPublicationVenuePosition
1994 A comparison of algorithms for hypertext notes network linearization
Mike Sharples, James Goodlet, Andrew Clutterbuck
Int. J. Hum. Comput. Stud.3