The LISP 2 programming language and system. - Paul W. Abrahams; Jeffrey A. Barnett; Erwin Book; Donna Firth; Stanley L. Kameny; Clark Weissman; Lowell Hawkinson; Michael I. Levin; Robert A. Saunders (AFIPS Fall Joint Computing Conference, 1966)

Garbage Collection versus Swapping. - Jeffrey A. Barnett (ACM SIGOPS Oper. Syst. Rev., 1979)

Computational Methods for a Mathematical Theory of Evidence. - Jeffrey A. Barnett (IJCAI, 1981)

Optimal Searches From AND and OR Nodes. - Jeffrey A. Barnett (IJCAI, 1983)

A Wrinkle on Satisficing Search Problems. - Jeffrey A. Barnett; Don Cohen (IJCAI, 1983)

Priority is a Limited Property. - Jeffrey A. Barnett; Alvin S. Cooperband (ACM SIGOPS Oper. Syst. Rev., 1983)

How much is Control Knowledge Worth? A Primitive Example. - Jeffrey A. Barnett (Artif. Intell., 1984)

An AIer's Lament. - Jeffrey A. Barnett (AI Mag., 1985)

Combining Opinions About the Order of Rule Execution. - Jeffrey A. Barnett (AAAI, 1991)

Optimal Satisficing Tree Searches. - Dan Geiger; Jeffrey A. Barnett (AAAI, 1991)

Calculating Dempster-Shafer Plausibility. - Jeffrey A. Barnett (IEEE Trans. Pattern Anal. Mach. Intell., 1991)

Dynamic Task-Level Voltage Scheduling Optimizations. - Jeffrey A. Barnett (IEEE Trans. Computers, 2005)

Computational Methods for A Mathematical Theory of Evidence. - Jeffrey A. Barnett (Classic Works of the Dempster-Shafer Theory of Belief Functions, 2008)