default search action
Julia Abrahams
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
- [j14]Julia Abrahams:
Code and parse tree for lossless source encoding. Commun. Inf. Syst. 1(2): 113-146 (2001)
1990 – 1999
- 1998
- [j13]Julia Abrahams:
Variable-Length Unequal Cost Parsing and Coding for Shaping. IEEE Trans. Inf. Theory 44(4): 1648-1650 (1998) - 1997
- [c1]Julia Abrahams:
Code and parse trees for lossless source encoding. SEQUENCES 1997: 145-171 - 1996
- [j12]Julia Abrahams:
Generation of discrete distributions from biased coins. IEEE Trans. Inf. Theory 42(5): 1541-1546 (1996) - 1995
- [j11]Marc J. Lipman, Julia Abrahams:
Minimum average cost testing for partially ordered components. IEEE Trans. Inf. Theory 41(1): 287-291 (1995) - 1994
- [j10]Julia Abrahams:
Codes with Monotonic Codeword Lengths. Inf. Process. Manag. 30(6): 759-764 (1994) - [j9]Julia Abrahams:
Parallelized Huffman and Hu-Tucker searching. IEEE Trans. Inf. Theory 40(2): 508-510 (1994) - 1993
- [j8]Julia Abrahams, Marc J. Lipman:
Relative uniformity of sources and the comparison of optimal code costs. IEEE Trans. Inf. Theory 39(5): 1695-1697 (1993) - 1992
- [j7]Julia Abrahams, Marc J. Lipman:
Zero-redundancy coding for unequal code symbol costs. IEEE Trans. Inf. Theory 38(5): 1583-1586 (1992)
1980 – 1989
- 1987
- [j6]Bruce L. Montgomery, Julia Abrahams:
On the redundancy of optimal binary prefix-condition codes for finite and infinite sources. IEEE Trans. Inf. Theory 33(1): 156-160 (1987) - 1986
- [j5]Bruce L. Montgomery, Julia Abrahams:
Synchronization of binary source codes. IEEE Trans. Inf. Theory 32(6): 849-854 (1986) - 1984
- [j4]Julia Abrahams:
Ramp crossings for Slepian's process. IEEE Trans. Inf. Theory 30(3): 574-575 (1984) - 1982
- [j3]Julia Abrahams:
On the selection of measures of distance between probability distributions. Inf. Sci. 26(2): 109-113 (1982) - [j2]Julia Abrahams:
The zero-crossing problem for some nonstationary Gaussian processes. IEEE Trans. Inf. Theory 28(4): 677-678 (1982) - 1981
- [j1]Julia Abrahams, John B. Thomas:
Some comments on conditionally Markov and reciprocal Gaussian processes. IEEE Trans. Inf. Theory 27(4): 523-525 (1981)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: