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 VLDB 2026 / reviewers in the wild / expert

Andrew J. T. Colin

dblp:14/2121 · DBLP profile ↗
← Back
9ranked-venue papers
8as first author
0since 2021 · last 1980
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 5 · 5 first-authorSoftware engineering, systems software and programming languages · 2 · 2 first-authorTheory of computation · 2 · 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.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 100%
Artificial intelligence
1 paper
Language models and text generation · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › text analysis
dictionary construction		 0.011960
On the Efficiency of a New Method of Dictionary Construction · Inf. Control. 1960
Information retrieval
text analysis		 0.011960
The Automatic Construction of a Glossary · Inf. Control. 1960
YearPublicationVenuePosition
1980 Sorting Trains
abstract
The control of model railways by computer is an interesting student project. One particular problem that arises in this connection is the problem of sorting the wagons of a train into some prespecified sequence, given certain assumptions about the topology of track available. In this paper we examine some of the possibilities.
Andrew J. T. Colin, Andrew D. McGettrick, P. D. Smith
 Comput. J.1
1975 The Translation and Interpretation of STAB-12
abstract
Abstract This paper describes two of the abstract machines used to support the STAB‐1 language, and discusses some problems of implementing the language on two different computers, the DEC PDP‐11 and CTL's Modular‐1, Interpretation of the abstract machine code and direct translation is considered for both computers.
Andrew J. T. Colin, K. Shorey, W. Teasdale
 Softw. Pract. Exp.1
1972 The Implementation
abstract
Abstract This paper describes the implementation of STAB‐1, a BCPL‐like language for a small PDP‐11 computer. The paper lays considerable emphasis on the actual techniques of implementation, and highlights some of the practical difficulties which were encountered. Finally, the experience gained is distilled into a set of precepts for compiler writers. The paper is seen as mainly tutorial in nature.
Andrew J. T. Colin
 Softw. Pract. Exp.1
1970 DOLPHIN - A Text Filing System for University Use
abstract
This paper describes a filing and editing system which was constructed at the University of Lancaster as part of a project supported by the Science Research Council. The editor works by context rather than by line number, and the whole system is closely integrated with the local operating system, although the filing system can also be used on-line in an independent manner.
Andrew J. T. Colin
 Comput. J.1
1966 A Simple Program for Use in the "Conversational Mode"
abstract
This paper describes a simple “conversational mode” program and some of the experience gained in using it. Originally, the program was written to afford some direct experience in man-machine communication. The results confirm widely held opinions about the usefulness of this facility.
Andrew J. T. Colin
 Comput. J.1
1964 The Multiple Variate Counter
abstract
The body of this paper is concerned with a description of M.V.C. Mark 5, a special-purpose language for General Survey Analysis. The paper ends with some remarks about the implementation of the language on the I.C.T. (Ferranti) Atlas.
Andrew J. T. Colin
 Comput. J.1
1963 Note on coding Reverse Polish expressions for single-address computers with one accumulator
abstract
This note give a general methods of coding Reverse Polish expressions into machine orders for single-address computers with one accumulator, and includes the description of an algorithm which improves the efficiency of the compiled program, by manipulating the expression before translation.
Andrew J. T. Colin
 Comput. J.1
1960 On the Efficiency of a New Method of Dictionary Construction
Andrew Donald Booth, Andrew J. T. Colin
 Inf. Control.2
1960 The Automatic Construction of a Glossary
Andrew J. T. Colin
 Inf. Control.1