default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul C. Shields
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j20]Imre Csiszár, Paul C. Shields:
Information Theory and Statistics: A Tutorial. Found. Trends Commun. Inf. Theory 1(4) (2004)
1990 – 1999
- 1999
- [j19]Paul C. Shields:
Performance of LZ Algorithms on Individual Sequences. IEEE Trans. Inf. Theory 45(4): 1283-1288 (1999) - 1998
- [j18]David L. Neuhoff, Paul C. Shields:
Simplistic Universal Coding. . IEEE Trans. Inf. Theory 44(2): 778-781 (1998) - [j17]Paul C. Shields:
The Interactions Between Ergodic Theory and Information Theory. IEEE Trans. Inf. Theory 44(6): 2079-2093 (1998) - 1996
- [j16]Imre Csiszár, Paul C. Shields:
Redundancy rates for renewal and other processes. IEEE Trans. Inf. Theory 42(6): 2065-2072 (1996) - 1995
- [j15]Paul C. Shields, Benjamin Weiss:
Universal redundancy rates for the class of B-processes do not exist. IEEE Trans. Inf. Theory 41(2): 508-512 (1995) - 1994
- [j14]Paul C. Shields:
Probability, Random Processes, and Ergodic Properties (Robert M. Gray). SIAM Rev. 36(1): 143-145 (1994) - 1993
- [j13]Paul C. Shields:
Universal redundancy rates do not exist. IEEE Trans. Inf. Theory 39(2): 520-524 (1993) - 1991
- [j12]Paul C. Shields:
Cutting and stacking: A method for constructing stationary processes. IEEE Trans. Inf. Theory 37(6): 1605-1617 (1991) - [j11]Paul C. Shields:
The entropy theorem via coding bounds. IEEE Trans. Inf. Theory 37(6): 1645-1647 (1991)
1980 – 1989
- 1987
- [j10]Paul C. Shields:
The ergodic and entropy theorems revisited. IEEE Trans. Inf. Theory 33(2): 263-266 (1987) - 1982
- [j9]David L. Neuhoff, Paul C. Shields:
Channel Distances and Representation. Inf. Control. 55(1-3): 238-264 (1982) - [j8]David L. Neuhoff, Paul C. Shields:
Indecomposable finite state channels and primative approximation. IEEE Trans. Inf. Theory 28(1): 11-18 (1982)
1970 – 1979
- 1979
- [j7]Paul C. Shields:
Stationary coding of processes. IEEE Trans. Inf. Theory 25(3): 283-291 (1979) - [j6]David L. Neuhoff, Paul C. Shields:
Channels with almost finite memory. IEEE Trans. Inf. Theory 25(4): 440-447 (1979) - 1978
- [j5]David L. Neuhoff, Paul C. Shields:
Fixed-rate universal codes for Markov sources. IEEE Trans. Inf. Theory 24(3): 360-367 (1978) - 1977
- [j4]Robert M. Gray, Paul C. Shields:
The Maximum Mutual Information between Two Random Processes. Inf. Control. 33(4): 273-280 (1977) - [j3]Jerome A. Feldman, Paul C. Shields:
Total Complexity and the Inference of Best Programs. Math. Syst. Theory 10: 181-191 (1977) - [j2]Paul C. Shields, David L. Neuhoff:
Block and sliding-block source coding. IEEE Trans. Inf. Theory 23(2): 211-215 (1977) - 1973
- [j1]Paul C. Shields:
Cutting and Independent Stacking of Intervals. Math. Syst. Theory 7(1): 1-4 (1973)
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-25 05:50 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:
