Olgica Milenkovic

CoRR, 2024

Online Distribution Learning with Local Private Constraints.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Optimal Stopping Methodology for the Secretary Problem with Random Queries - ADDENDUM.

[BibT_eX]

[DOI]

J. Appl. Probab., December, 2023

Query-based selection of optimal candidates under the Mallows model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., November, 2023

Coding for Polymer-Based Data Storage.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, August, 2023

Provably accurate and scalable linear classifiers in hyperbolic spaces.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., April, 2023

Reconstruction of Sets of Strings From Prefix/Suffix Compositions.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2023

Small-Sample Estimation of the Mutational Support and Distribution of SARS-CoV-2.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2023

DNA-Based Data Storage Systems: A Review of Implementations and Code Constructions.

[BibT_eX]

[DOI]

CoRR, 2023

Federated Classification in Hyperbolic Spaces via Secure Aggregation of Convex Hulls.

[BibT_eX]

[DOI]

CoRR, 2023

Semi-Quantitative Group Testing for Efficient and Accurate qPCR Screening of Pathogens with a Wide Range of Loads.

[BibT_eX]

[DOI]

CoRR, 2023

On Constant-Weight Binary B<sub>2</sub>-Sequences.

[BibT_eX]

[DOI]

CoRR, 2023

A combinatorial proof for the secretary problem with multiple choices.

[BibT_eX]

[DOI]

CoRR, 2023

Unlearning Graph Classifiers with Limited Data Resources.

[BibT_eX]

[DOI]

Proceedings of the ACM Web Conference 2023, 2023

Differentially Private Decoupled Graph Convolutions for Multigranular Topology Protection.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

A Combinatorial Proof for the Dowry Problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2023

Perturbation-Resilient Sets for Dynamic Service Balancing.

[BibT_eX]

[DOI]

Jin Sima

Proceedings of the IEEE International Symposium on Information Theory, 2023

On Constant-Weight Binary B2-Sequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Finding a Burst of Positives via Nonadaptive Semiquantitative Group Testing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

PINA: Leveraging Side Information in eXtreme Multi-label Classification via Predicted Instance Neighborhood Aggregation.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Efficient Model Updates for Approximate Unlearning of Graph-Structured Data.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Machine Unlearning of Federated Clusters.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

Finding the second-best candidate under the Mallows model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Unlearning Nonlinear Graph Classifiers in the Limited Training Data Regime.

[BibT_eX]

[DOI]

CoRR, 2022

Coordinated Science Laboratory 70th Anniversary Symposium: The Future of Computing.

[BibT_eX]

[DOI]

CoRR, 2022

Certified Graph Unlearning.

[BibT_eX]

[DOI]

CoRR, 2022

HyperAid: Denoising in Hyperbolic Spaces for Tree-fitting and Hierarchical Clustering.

[BibT_eX]

[DOI]

Puoya Tabaghi

Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Balanced and Swap-Robust Trades for Dynamical Distributed Storage.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

The Gapped k-Deck Problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

You are AllSet: A Multiset Function Framework for Hypergraph Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Conference on Learning Representations, 2022

Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Conference on Learning Representations, 2022

2021

Directed Intersection Representations and the Information Content of Digraphs.

[BibT_eX]

[DOI]

Roberto Assis Machado

IEEE Trans. Inf. Theory, 2021

Repairing Reed-Solomon Codes via Subspace Polynomials.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Optimal Stopping Methodology for the Secretary Problem with Random Queries.

[BibT_eX]

[DOI]

CoRR, 2021

Linear Classifiers in Mixed Constant Curvature Spaces.

[BibT_eX]

[DOI]

CoRR, 2021

Landing Probabilities of Random Walks for Seed-Set Expansion in Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

The Postdoc Problem under the Mallows Model.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Support Estimation with Sampling Artifacts and Errors.

[BibT_eX]

[DOI]

Angelia Nedich

Proceedings of the IEEE International Symposium on Information Theory, 2021

Semiquantitative Group Testing in at Most Two Rounds.

[BibT_eX]

[DOI]

Mahdi Cheraghchi

Proceedings of the IEEE International Symposium on Information Theory, 2021

Adaptive Universal Generalized PageRank Graph Neural Network.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Learning Representations, 2021

Highly Scalable and Provably Accurate Classification in Poincaré Balls.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Data Mining, 2021

2020

Motif and Hypergraph Correlation Clustering.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Coded Trace Reconstruction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Set-Codes with Small Intersections and Small Discrepancies.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Quadratic Decomposable Submodular Function Minimization: Theory and Practice.

[BibT_eX]

[DOI]

Niao He

J. Mach. Learn. Res., 2020

On the triangle clique cover and Kt clique cover problems.

[BibT_eX]

[DOI]

Discret. Math., 2020

Access balancing in storage systems by labeling partial Steiner systems.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

Joint Adaptive Feature Smoothing and Topology Extraction via Generalized PageRank GNNs.

[BibT_eX]

[DOI]

CoRR, 2020

Reconstructing Mixtures of Coded Strings from Prefix and Suffix Compositions.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Mass Error-Correction Codes for Polymer-Based Data Storage.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Group Testing with Runlength Constraints for Topological Molecular Storage.

[BibT_eX]

[DOI]

Abhishek Agarwal

João Ribeiro

Proceedings of the IEEE International Symposium on Information Theory, 2020

Image Processing in DNA.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Multi-MotifGAN (MMGAN): Motif-Targeted Graph Generation And Prediction.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2019

Unique Reconstruction of Coded Strings From Multiset Substring Spectra.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes.

[BibT_eX]

[DOI]

Khodakhast Bibak

IEEE Trans. Commun., 2019

Online Convex Dictionary Learning.

[BibT_eX]

[DOI]

Abhishek Agarwal

Jianhao Peng

CoRR, 2019

Support Estimation via Regularized and Weighted Chebyshev Approximations.

[BibT_eX]

[DOI]

I (Eli) Chien

CoRR, 2019

Online Convex Matrix Factorization with Representative Regions.

[BibT_eX]

[DOI]

Jianhao Peng

Abhishek Agarwal

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Optimizing Generalized PageRank Methods for Seed-Expansion Community Detection.

[BibT_eX]

[DOI]

I (Eli) Chien

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Reconstruction and Error-Correction Codes for Polymer-Based Data Storage.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Directed Intersection Representations and the Information Content of Digraphs.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

Roberto Assis Machado

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Mutually Uncorrelated Primers for DNA-Based Data Storage.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Correlation Clustering and Biclustering With Locally Bounded Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction.

[BibT_eX]

[DOI]

Eitan Yaakobi

IEEE Trans. Inf. Theory, 2018

Repairing Reed-Solomon Codes With Multiple Erasures.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

MaxMinSum Steiner Systems for Access Balancing in Distributed Storage.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Paired threshold graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Higher-Order Spectral Clustering under Superimposed Stochastic Block Model.

[BibT_eX]

[DOI]

Subhadeep Paul

Yuguo Chen

CoRR, 2018

ChIPWig: a random access-enabling lossless and lossy compression method for ChIP-seq data.

[BibT_eX]

[DOI]

Bioinform., 2018

METHCOMP: a special purpose compression platform for DNA methylation data.

[BibT_eX]

[DOI]

Jianhao Peng

Idoia Ochoa

Bioinform., 2018

Revisiting Decomposable Submodular Function Minimization with Incidence Relations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Quadratic Decomposable Submodular Function Minimization.

[BibT_eX]

[DOI]

Niao He

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Query K-means Clustering and the Double Dixie Cup Problem.

[BibT_eX]

[DOI]

I (Eli) Chien

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Unique Reconstruction of Coded Sequences from Multiset Substring Spectra.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Weight Enumerators of Some Classes of Deletion Correcting Codes.

[BibT_eX]

[DOI]

Khodakhast Bibak

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

2017

Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2017

Asymmetric Lee Distance Codes for DNA-Based Storage.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Computing similarity distances between rankings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Inhomogeneous Hypergraph Clustering with Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Multiclass MinMax rank aggregation.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

The hybrid k-deck problem: Reconstructing sequences from short and long traces.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Optimal repair schemes for some families of full-length reed-solomon codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Repairing reed-solomon codes with two erasures.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Motif clustering and overlapping clustering for social network analysis.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Efficient Rank Aggregation via Lehmer Codes.

[BibT_eX]

[DOI]

Arya Mazumdar

Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016

Synchronization and Deduplication in Coded Distributed Storage Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2016

Codes for DNA Sequence Profiles.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing With Nonuniform Thresholds.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

MetaCRAM: an integrated pipeline for metagenomic taxonomy identification and compression.

[BibT_eX]

[DOI]

Venugopal V. Veeravalli

BMC Bioinform., 2016

smallWig: parallel compression of RNA-seq WIG files.

[BibT_eX]

[DOI]

Zhiying Wang

Tsachy Weissman

Bioinform., 2016

A new correlation clustering method for cancer mutation analysis.

[BibT_eX]

[DOI]

Bioinform., 2016

Doubly threshold graphs for social network modeling.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Weakly mutually uncorrelated codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Codes in the damerau distance for DNA storage.

[BibT_eX]

[DOI]

Eitan Yaakobi

Proceedings of the IEEE International Symposium on Information Theory, 2016

Balanced permutation codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Inference of latent network features via co-intersection representations of graphs.

[BibT_eX]

[DOI]

Son Hoang Dau

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Poisson Group Testing: A Probabilistic Model for Boolean Compressed Sensing.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2015

DNA-Based Storage: Trends and Methods.

[BibT_eX]

[DOI]

IEEE Trans. Mol. Biol. Multi Scale Commun., 2015

Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds.

[BibT_eX]

[DOI]

SIAM J. Optim., 2015

String Reconstruction from Substring Compositions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

A Rewritable, Random-Access DNA-Based Storage System.

[BibT_eX]

[DOI]

CoRR, 2015

Community Detection via Minimax Correlation Clustering and Biclustering.

[BibT_eX]

[DOI]

CoRR, 2015

A Perspective on Future Research Directions in Information Theory.

[BibT_eX]

[DOI]

Jeffrey G. Andrews

Alexandros G. Dimakis

CoRR, 2015

HyDRA: gene prioritization via hybrid distance-score rank aggregation.

[BibT_eX]

[DOI]

Minji Kim

Bioinform., 2015

Codes for DNA storage channels.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Asymmetric Lee distance codes: New bounds and constructions.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Synchronizing edits in distributed storage networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Compensating for sneak currents in multi-level crosspoint resistive memories.

[BibT_eX]

[DOI]

Tianqiong Luo

Borja Peleato

Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, 2015

2014

An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Semiquantitative Group Testing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Multipermutation Codes in the Ulam Metric for Nonvolatile Memories.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2014

Synchronizing rankings via interactive communication.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Similarity distances between permutations.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Multipermutation codes in the Ulam metric.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Group testing for non-uniformly quantized adder channels.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Quadratic-backtracking algorithm for string reconstruction from substring compositions.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Poisson group testing: A probabilistic model for nonadaptive streaming boolean compressed sensing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2014

Smooth representation of rankings.

[BibT_eX]

[DOI]

Arya Mazumdar

Proceedings of the 48th Annual Conference on Information Sciences and Systems, 2014

2013

Hybrid Noncoherent Network Coding.

[BibT_eX]

[DOI]

Vitaly Skachek

Angelia Nedic

IEEE Trans. Inf. Theory, 2013

Error-Correction in Flash Memories via Codes in the Ulam Metric.

[BibT_eX]

[DOI]

Vitaly Skachek

IEEE Trans. Inf. Theory, 2013

Computing Similarity Distances Between Rankings.

[BibT_eX]

[DOI]

CoRR, 2013

MCUIUC - A new framework for metagenomic read compression.

[BibT_eX]

[DOI]

Venugopal V. Veeravalli

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Aggregating rankings with positional constraints.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Compression of noisy signals with information bottlenecks.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Weighted rank aggregation via relaxed integer programming.

[BibT_eX]

[DOI]

Fardad Raisali

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Building consensus via iterative voting.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

MetaPar: Metagenomic sequence assembly via iterative reclassification.

[BibT_eX]

[DOI]

Venugopal V. Veeravalli

Proceedings of the IEEE Global Conference on Signal and Information Processing, 2013

Gene prioritization via weighted Kendall rank aggregation.

[BibT_eX]

[DOI]

Proceedings of the 5th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2013

A general framework for distributed vote aggregation.

[BibT_eX]

[DOI]

Proceedings of the American Control Conference, 2013

Foreword.

[BibT_eX]

[DOI]

Tamer Basar

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

Sorting of Permutations by Cost-Constrained Transpositions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

A Geometric Approach to Low-Rank Matrix Completion.

[BibT_eX]

[DOI]

Ely Kerman

IEEE Trans. Inf. Theory, 2012

Structured sublinear compressive sensing via belief propagation.

[BibT_eX]

[DOI]

Phys. Commun., 2012

A Novel Distance-Based Approach to Constrained Rank Aggregation

[BibT_eX]

[DOI]

Behrouz Touri

CoRR, 2012

Semi-Quantitative Group Testing: a General Paradigm with Applications in Genotyping

[BibT_eX]

[DOI]

CoRR, 2012

Nonuniform Vote Aggregation Algorithms

[BibT_eX]

[DOI]

Behrouz Touri

CoRR, 2012

Causal compressive sensing for gene network inference.

[BibT_eX]

[DOI]

Mo Deng

Proceedings of the IEEE Statistical Signal Processing Workshop, 2012

Rank modulation for translocation error correction.

[BibT_eX]

[DOI]

Vitaly Skachek

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Alternating Markov chains for distribution estimation in the presence of errors.

[BibT_eX]

[DOI]

Narayana P. Santhanam

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Semi-quantitative group testing.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Session TA7a: Biological networks and machine learning (partially invited).

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Forty Sixth Asilomar Conference on Signals, 2012

2011

Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion.

[BibT_eX]

[DOI]

Ely Kerman

IEEE Trans. Signal Process., 2011

Information Theoretical and Algorithmic Approaches to Quantized Compressive Sensing.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2011

Structured sublinear compressive sensing via dense belief propagation

[BibT_eX]

[DOI]

CoRR, 2011

Symmetric group testing and superimposed codes.

[BibT_eX]

[DOI]

Jun Shen

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Decomposing permutations via cost-constrained transpositions.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Low-rank matrix completion with geometric performance guarantees.

[BibT_eX]

[DOI]

Ely Kerman

Proceedings of the IEEE International Conference on Acoustics, 2011

Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2011

2010

Introduction to the special issue on information theory in molecular biology and neuroscience.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

On the hardness of approximating stopping and trapping sets.

[BibT_eX]

[DOI]

Andrew McGregor

IEEE Trans. Inf. Theory, 2010

Multiple-bases belief-propagation decoding of high-density cyclic codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2010

A graphical model for computing the minimum cost transposition distance.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

On reconstructing a string from its substring compositions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Compressive list-support recovery for colluder identification.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2010

SET: An algorithm for consistent matrix completion.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2010

2009

The Trapping Redundancy of Linear Block Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Subspace pursuit for compressive sensing signal reconstruction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Weighted superimposed codes and constrained integer compressed sensing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Compressive Sensing DNA Microarrays.

[BibT_eX]

[DOI]

EURASIP J. Bioinform. Syst. Biol., 2009

List-decoding methods for inferring polynomials in finite dynamical gene network models.

[BibT_eX]

[DOI]

Bioinform., 2009

On modeling gene regulatory networks using Markov random fields.

[BibT_eX]

[DOI]

Narayana Santhanam

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Distortion-rate functions for quantized compressive sensing.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Sublinear compressive sensing reconstruction via belief propagation decoding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Small-sample distribution estimation over sticky channels.

[BibT_eX]

[DOI]

Narayana P. Santhanam

Proceedings of the IEEE International Symposium on Information Theory, 2009

A comparative study of quantized compressive sensing schemes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity

[BibT_eX]

[DOI]

CoRR, 2008

Coding-theoretic methods for reverse engineering of gene regulatory networks.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Weighted Euclidean superimposed codes for integer compressed sensing.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE Information Theory Workshop, 2008

A list-decoding approach for inferring the dynamics of gene regulatory networks.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Sparse weighted Euclidean superimposed coding for integer compressed sensing.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

Probe Design for Compressive Sensing DNA Microarrays.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Conference on Bioinformatics and Biomedicine, 2008

2007

High-throughput VLSI Implementations of Iterative Decoders and Related Code Construction Problems.

[BibT_eX]

[DOI]

J. VLSI Signal Process., 2007

Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles.

[BibT_eX]

[DOI]

Philip Whiting

IEEE Trans. Inf. Theory, 2007

LDPC Codes Based on Latin Squares: Cycle Structure, Stopping Set, and Trapping Set Analysis.

[BibT_eX]

[DOI]

Stefan Laendner

IEEE Trans. Commun., 2007

Two Methods for Reducing the Error-Floor of LDPC Codes

[BibT_eX]

[DOI]

CoRR, 2007

On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes

[BibT_eX]

[DOI]

Andrew McGregor

CoRR, 2007

Hybrid ARQ: Theory, State of the Art and Future Directions.

[BibT_eX]

[DOI]

Christopher Lott

Proceedings of the IEEE Information Theory Workshop on Information Theory for Wireless Networks, 2007

Constrained Coding for Context-Free Languages with Applications to Genetic Sequence Modelling.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Multiple-Bases Belief-Propagation for Decoding of Short Block Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Shortened Array Codes of Large Girth.

[BibT_eX]

[DOI]

David Leyba

IEEE Trans. Inf. Theory, 2006

On unequal error protection LDPC codes based on plotkin-type constructions.

[BibT_eX]

[DOI]

Vidya Kumar

IEEE Trans. Commun., 2006

Trapping Sets in Irregular LDPC Code Ensembles.

[BibT_eX]

[DOI]

Philip Whiting

Proceedings of IEEE International Conference on Communications, 2006

When Does One Redundant Parity-Check Equation Matter?

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

Stopping and Trapping Sets in Generalized Covering Arrays.

[BibT_eX]

[DOI]

Philip Whiting

Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

2005

On graphical representations of algebraic codes suitable for iterative decoding.

[BibT_eX]

[DOI]

Vidya Kumar

IEEE Commun. Lett., 2005

Support Weight Enumerators and Coset Weight Distributions of Isodual Codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2005

Average Case Analysis of Gosper's Algorithm for a Class of Urn Model Inputs.

[BibT_eX]

[DOI]

Kevin J. Compton

Algorithmica, 2005

On the Design of Codes for DNA Computing.

[BibT_eX]

[DOI]

Proceedings of the Coding and Cryptography, International Workshop, 2005

DNA codes that avoid secondary structures.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On DNA Computers Controlling Gene Expression Levels.

[BibT_eX]

[DOI]

Proceedings of the 44th IEEE IEEE Conference on Decision and Control and 8th European Control Conference Control, 2005

2004

Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Probabilistic Transforms for Combinatorial Urn Models.

[BibT_eX]

[DOI]

Kevin J. Compton

Comb. Probab. Comput., 2004

Information theory and coding problems in genetics.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Analysis of Bin models with applications in coding theory.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Structured LDPC codes over GF(2<sup>2</sup>) and companion matrix based decoding.

[BibT_eX]

[DOI]

Vidya Kumar

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Analysis of the cycle-structure of LDPC codes based on Latin squares.

[BibT_eX]

[DOI]

Stefan Laendner

Proceedings of IEEE International Conference on Communications, 2004

High-throughput VLSI implementations of iterative decoders and related code construction problems.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

Data Storage and Processing in Cells: An Information Theoretic Approach.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information Recording, 2004

2003

The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes.

[BibT_eX]

[DOI]

T. S. Coffey

Kevin J. Compton

IEEE Trans. Inf. Theory, 2003

Asymptotic analysis of A* maximum-likelihood decoding with reliability reordering.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002

Combinatorial problems in analysis of algorithms and coding theory.

[BibT_eX]

[DOI]

PhD thesis, 2002

2000

Permutation (d, k) codes: Efficient enumerative coding and phrase length distribution shaping.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

1998

Shannon Capacity of M-ary Redundant Multitrack Runlength Limited Codes.

[BibT_eX]

[DOI]

Bane V. Vasic

Steven W. McLaughlin