Julia Abrahams

According to our database1, Julia Abrahams authored at least 15 papers between 1981 and 2001.

Collaborative distances:

Timeline

1985
1990
1995
2000
0
1
2
3
1
1
1
1
2
1
1
1
1
1
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2001
Code and parse tree for lossless source encoding.
Commun. Inf. Syst., 2001

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

1997
Code and parse trees for lossless source encoding.
Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

1996
Generation of discrete distributions from biased coins.
IEEE Trans. Inf. Theory, 1996

1995
Minimum average cost testing for partially ordered components.
IEEE Trans. Inf. Theory, 1995

1994
Parallelized Huffman and Hu-Tucker searching.
IEEE Trans. Inf. Theory, 1994

Codes with Monotonic Codeword Lengths.
Inf. Process. Manag., 1994

1993
Relative uniformity of sources and the comparison of optimal code costs.
IEEE Trans. Inf. Theory, 1993

1992
Zero-redundancy coding for unequal code symbol costs.
IEEE Trans. Inf. Theory, 1992

1987
On the redundancy of optimal binary prefix-condition codes for finite and infinite sources.
IEEE Trans. Inf. Theory, 1987

1986
Synchronization of binary source codes.
IEEE Trans. Inf. Theory, 1986

1984
Ramp crossings for Slepian's process.
IEEE Trans. Inf. Theory, 1984

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

On the selection of measures of distance between probability distributions.
Inf. Sci., 1982

1981
Some comments on conditionally Markov and reciprocal Gaussian processes.
IEEE Trans. Inf. Theory, 1981


  Loading...