Some comments on conditionally Markov and reciprocal Gaussian processes. - Julia Abrahams; John B. Thomas (IEEE Trans. Inf. Theory, 1981)

On the selection of measures of distance between probability distributions. - Julia Abrahams (Inf. Sci., 1982)

The zero-crossing problem for some nonstationary Gaussian processes. - Julia Abrahams (IEEE Trans. Inf. Theory, 1982)

Ramp crossings for Slepian's process. - Julia Abrahams (IEEE Trans. Inf. Theory, 1984)

Synchronization of binary source codes. - Bruce L. Montgomery; Julia Abrahams (IEEE Trans. Inf. Theory, 1986)

On the redundancy of optimal binary prefix-condition codes for finite and infinite sources. - Bruce L. Montgomery; Julia Abrahams (IEEE Trans. Inf. Theory, 1987)

Zero-redundancy coding for unequal code symbol costs. - Julia Abrahams; Marc J. Lipman (IEEE Trans. Inf. Theory, 1992)

Relative uniformity of sources and the comparison of optimal code costs. - Julia Abrahams; Marc J. Lipman (IEEE Trans. Inf. Theory, 1993)

Codes with Monotonic Codeword Lengths. - Julia Abrahams (Inf. Process. Manag., 1994)

Parallelized Huffman and Hu-Tucker searching. - Julia Abrahams (IEEE Trans. Inf. Theory, 1994)

Minimum average cost testing for partially ordered components. - Marc J. Lipman; Julia Abrahams (IEEE Trans. Inf. Theory, 1995)

Generation of discrete distributions from biased coins. - Julia Abrahams (IEEE Trans. Inf. Theory, 1996)

Code and parse trees for lossless source encoding. - Julia Abrahams (SEQUENCES, 1997)

Variable-Length Unequal Cost Parsing and Coding for Shaping. - Julia Abrahams (IEEE Trans. Inf. Theory, 1998)

Code and parse tree for lossless source encoding. - Julia Abrahams (Commun. Inf. Syst., 2001)