Остановите войну!
for scientists:
default search action
John C. Kieffer
- > Home > Persons > John C. Kieffer
Publications
- 2014
- [j49]Jie Zhang, En-Hui Yang, John C. Kieffer:
A Universal Grammar-Based Code for Lossless Compression of Binary Trees. IEEE Trans. Inf. Theory 60(3): 1373-1386 (2014) - 2013
- [c19]Jie Zhang, En-Hui Yang, John C. Kieffer:
Redundancy analysis in lossless compression of a binary tree via its minimal DAG representation. ISIT 2013: 1914-1918 - [i4]Jie Zhang, En-Hui Yang, John C. Kieffer:
A Universal Grammar-Based Code For Lossless Compression of Binary Trees. CoRR abs/1304.7392 (2013) - 2011
- [i3]John C. Kieffer, Philippe Flajolet, En-Hui Yang:
Universal Lossless Data Compression Via Binary Decision Diagrams. CoRR abs/1111.1432 (2011) - 2009
- [c14]John C. Kieffer, En-Hui Yang, Wojciech Szpankowski:
Structural complexity of random binary trees. ISIT 2009: 635-639 - 2005
- [c11]En-Hui Yang, Lihua Song, Gil I. Shamir, John C. Kieffer:
On the pointwise redundancy of the LZ78 algorithm. ISIT 2005: 495-499 - 2004
- [j42]John C. Kieffer, Wojciech Szpankowski, En-Hui Yang:
Problems on Sequences: Information Theory and Computer Science Interface. IEEE Trans. Inf. Theory 50(7): 1385-1392 (2004) - [j41]John C. Kieffer, En-Hui Yang:
Grammar-based lossless universal refinement source coding. IEEE Trans. Inf. Theory 50(7): 1415-1424 (2004) - [c8]En-Hui Yang, Da-ke He, John C. Kieffer:
Grammar-based coding: new perspectives. ITW 2004: 105-110 - 2002
- [j40]John C. Kieffer, En-Hui Yang:
Structured grammar-based codes for universal lossless data compression. Commun. Inf. Syst. 2(1): 29-52 (2002) - 2001
- [j39]En-Hui Yang, Alexei Kaltchenko, John C. Kieffer:
Universal lossless data compression with side information by using a conditional MPM grammar transform. IEEE Trans. Inf. Theory 47(6): 2130-2150 (2001) - 2000
- [j38]John C. Kieffer, En-Hui Yang:
Grammar-based codes: A new class of universal lossless source codes. IEEE Trans. Inf. Theory 46(3): 737-754 (2000) - [j37]En-Hui Yang, John C. Kieffer:
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - Part one: Without context models. IEEE Trans. Inf. Theory 46(3): 755-777 (2000) - [j36]John C. Kieffer, En-Hui Yang, Gregory J. Nelson, Pamela C. Cosman:
Universal lossless compression via multilevel pattern matching. IEEE Trans. Inf. Theory 46(4): 1227-1245 (2000) - 1999
- [c4]John C. Kieffer, En-Hui Yang:
A Simple Technique for Bounding the Pointwise Redundancy of the 1978 Lempel-Ziv Algorithm. Data Compression Conference 1999: 434-442 - 1998
- [j35]En-Hui Yang, John C. Kieffer:
On the Performance of Data Compression Algorithms Based Upon String Matching. IEEE Trans. Inf. Theory 44(1): 47-65 (1998) - [c3]John C. Kieffer, En-Hui Yang, Trevor Park, Sidney Yakowitz:
Complexity of Preprocessor in MPM Data Compression System. Data Compression Conference 1998: 554 - 1997
- [j34]En-Hui Yang, John C. Kieffer:
On the redundancy of the fixed-database Lempel-Ziv algorithm for phi -mixing sources. IEEE Trans. Inf. Theory 43(4): 1101-1111 (1997) - 1996
- [j33]John C. Kieffer, En-Hui Yang:
Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity. IEEE Trans. Inf. Theory 42(1): 29-39 (1996) - [j32]En-Hui Yang, John C. Kieffer:
Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm. IEEE Trans. Inf. Theory 42(1): 239-245 (1996)
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-21 17:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint