Nikhil Krishnan

Works (2)

Updated: July 5th, 2023 15:40

2015 journal article

A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm

IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 9(4), 741–748.

By: N. Krishnan n & D. Baron n 

author keywords: Big data; computational complexity; data compression; distributed computing; minimum description length; parallel algorithms; redundancy; two-pass code; universal compression; work-efficient algorithms
TL;DR: A novel lossless universal data compression algorithm that uses parallel computational units to increase the throughput and improves the compression by using different quantizers for states of the context tree based on the number of symbols corresponding to those states. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2014 conference paper

A Parallel two-pass MDL context tree algorithm for universal source coding

2014 ieee international symposium on information theory (isit), 1862–1865.

By: N. Krishnan n, D. Baron n  & M. Mihcak*

TL;DR: A novel lossless universal source coding algorithm that uses parallel computational units to increase the throughput and redundancy and is work-efficient, i.e., its computational complexity is O(N=B). (via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2025) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.