Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Julia Abrahams
Observed names:
Abrahams, Julia,
J. Abrahams
Observed institutions:
Rutgers, The State University of New Jersey,
Office of Naval Research,
Princeton University,
Center for Discrete Mathematics and Theoretical Computer Science,
Office of Naval Research,
Rice University,
Carnegie Mellon University
show all 7
OpenAlex ID:
A5111401038
Works
46
Awards
2
Probability, Random Variables, and Stochastic Processes.
1984
·
Julia Abrahams
, Athanasios Papoulis
·
Journal of the American Statistical Association
·
16,266
Code and parse trees for lossless source encoding
2002
·
J. Abrahams
·
Compression and Complexity of Sequences (SEQUENCES)
·
76
Code and parse tree for lossless source encoding
2001
·
Julia Abrahams
·
Communications in Information and Systems
·
62
PDF
A Survey of Recent Progress on Level-Crossing Problems for Random Processes
1986
·
Julia Abrahams
·
Springer eBooks
·
61
Synchronization of binary source codes (Corresp.)
1986
·
B. Montgomery
, J. Abrahams
·
IEEE Transactions on Information Theory
·
47
Communications and networks : a survey of recent advances
1986
·
Ian F. Blake
, H. Vincent Poor
, et al.
·
Springer eBooks
·
43
On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
1987
·
B. Montgomery
, J. Abrahams
·
IEEE Transactions on Information Theory
·
39
Some comments on conditionally Markov and reciprocal Gaussian processes (Corresp.)
1981
·
J. Abrahams
, J. Thomas
·
IEEE Transactions on Information Theory
·
38
A note on the characterization of bivariate densities by conditional densities
1984
·
Julia Abrahams
, John B. Thomas
·
Communication in Statistics- Theory and Methods
·
27
Generation of discrete distributions from biased coins
1996
·
J. Abrahams
·
IEEE Transactions on Information Theory
·
24
Huffman-type codes for infinite source distributions
1994
·
Julia Abrahams
·
Journal of the Franklin Institute
·
22
Minimum average cost testing for partially ordered components
1995
·
M.J. Lipman
, J. Abrahams
·
IEEE Transactions on Information Theory
·
20
On the selection of measures of distance between probability distributions
1982
·
Julia Abrahams
·
Information Sciences
·
14
Parallelized Huffman and Hu-Tucker searching
1994
·
J. Abrahams
·
IEEE Transactions on Information Theory
·
13
Ramp crossings for Slepian's process (Corresp.)
1984
·
J. Abrahams
·
IEEE Transactions on Information Theory
·
10
Varn Codes and Generalized Fibonacci Trees
1995
·
Julia Abrahams
·
The Fibonacci Quarterly
·
8
Relative uniformity of sources and the comparison of optimal code costs
1993
·
J. Abrahams
·
IEEE Transactions on Information Theory
·
7
The zero-crossing problem for some nonstationary Gaussian processes (Corresp.)
1982
·
J. Abrahams
·
IEEE Transactions on Information Theory
·
7
Variable-length unequal cost parsing and coding for shaping
1998
·
J. Abrahams
·
IEEE Transactions on Information Theory
·
6
Zero-redundancy coding for unequal code symbol costs
1992
·
J. Abrahams
, M.J. Lipman
·
IEEE Transactions on Information Theory
·
6
On Miroshin’s Second-Order Reciprocal Processes
1984
·
Julia Abrahams
·
SIAM Journal on Applied Mathematics
·
6
Huffman-type codes for infinite source distributions
2002
·
J. Abrahams
·
DCC
·
5
Correspondences Between Variable Length Parsing and Coding Problems
1999
·
Julia Abrahams
·
The IMA volumes in mathematics and its applications
·
4
Properties of the maximal correlation function
1980
·
Julia Abrahams
, John B. Thomas
·
Journal of the Franklin Institute
·
4
An Improved Lower Bound on the Minimum Expected Number of Binomial Group Tests
1993
·
Julia Abrahams
·
Probability in the Engineering and Informational Sciences
·
3
Show more works
View as search
Works count:
46
Citation count:
16,830
H-index:
13
I10-index:
15
Year
Topic
Type
