Erik Ordentlich

According to our database1, Erik Ordentlich authored at least 65 papers between 1990 and 2022.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2011, "For contributions to universal algorithms and data compression".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization.
EURO J. Comput. Optim., 2022

2020
Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions.
CoRR, 2020

2019
On the Pointwise Threshold Behavior of the Binary Erasure Polarization Subchannels.
IEEE Trans. Inf. Theory, 2019

2018
Scalable Query N-Gram Embedding for Improving Matching and Relevance in Sponsored Search.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

2016
Scalable Semantic Matching of Queries to Ads in Sponsored Search Advertising.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Network-Efficient Distributed Word2vec Training System for Large Vocabularies.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2014
When data must satisfy constraints upon writing.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Twice-Universal Denoising.
IEEE Trans. Inf. Theory, 2013

Hamming-weight constrained coded arrays based on covering codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Denoising as well as the best of any two denoisers.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Low Complexity Two-Dimensional Weight-Constrained Codes.
IEEE Trans. Inf. Theory, 2012

Asymptotic Enumeration of Binary Matrices with Bounded Row and Column Sums.
SIAM J. Discret. Math., 2012

Piecewise constant prediction.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On q-ary antipodal matchings and applications.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
On Multi-Directional Context Sets.
IEEE Trans. Inf. Theory, 2011

Two-Dimensional Maximum-Likelihood Sequence Detection Is NP Hard.
IEEE Trans. Inf. Theory, 2011

Analysis of Deterministic Binary Interference Channels Via a General Outer Bound.
IEEE Trans. Inf. Theory, 2011

The iDUDE Framework for Grayscale Image Denoising.
IEEE Trans. Image Process., 2011

Energy-optimized lossless compression: Rate-variability tradeoff.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Asymptotic enumeration of binary matrices with bounded row and column weights.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Error exponents of optimum decoding for the interference channel.
IEEE Trans. Inf. Theory, 2010

Toward properties of twice-universality in denoising.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Lower Limits of Discrete Universal Denoising.
IEEE Trans. Inf. Theory, 2009

The degrees-of-freedom of the K-user Gaussian interference channel is discontinuous at rational channel coefficients.
IEEE Trans. Inf. Theory, 2009

Joint source-channel coding for transmitting correlated sources over broadcast networks.
IEEE Trans. Inf. Theory, 2009

On concentration for denoiser-loss estimators.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Approximate enumerative coding for 2-D constraints through ratios of maprix Products.
Proceedings of the IEEE International Symposium on Information Theory, 2009

On the Degrees-of-Freedom of the K-user Gaussian interference channel.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Universal Algorithms for Channel Decoding of Uncompressed Sources.
IEEE Trans. Inf. Theory, 2008

Defect List Compression.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

2007
Universal Filtering Via Prediction.
IEEE Trans. Inf. Theory, 2007

Capacity Lower Bounds and Approximate Enumerative Coding for 2-D Constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Discrete Memoryless Interference Channel: New Outer Bound.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
On the optimality of symbol-by-symbol filtering and denoising.
IEEE Trans. Inf. Theory, 2006

Maximizing the entropy of a sum of independent bounded random variables.
IEEE Trans. Inf. Theory, 2006

On causal and semicausal codes for joint information embedding and source coding.
IEEE Trans. Inf. Theory, 2006

Maximum entropy lighting for physical objects.
Proceedings of the Visualization and Data Analysis 2006, 2006

Joint Source-Channel Decoding for Transmitting Correlated Sources over Broadcast Networks.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Universal discrete denoising: known channel.
IEEE Trans. Inf. Theory, 2005

The empirical distribution of rate-constrained source codes.
IEEE Trans. Inf. Theory, 2005

A distribution dependent refinement of Pinsker's inequality.
IEEE Trans. Inf. Theory, 2005

Multi-directional context sets with applications to universal denoising and compression.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Approximations for the entropy rate of a hidden Markov process.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Asymptotic filtering and entropy rate of a hidden Markov process in the rare transitions regime.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

The DUDE framework for continuous tone image denoising.
Proceedings of the 2005 International Conference on Image Processing, 2005

2004
Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints.
SIAM J. Discret. Math., 2004

Efficient pruning of bi-directional context trees with applications to universal denoising and compression.
Proceedings of the 2004 IEEE Information Theory Workshop, 2004

New bounds on the entropy rate of hidden Markov processes.
Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Channel decoding of systematically encoded unknown redundant sources.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Discrete Universal Filtering Through Incremental Parsing.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003
A discrete universal denoiser and its application to binary images.
Proceedings of the 2003 International Conference on Image Processing, 2003

2002
On delayed prediction of individual sequences.
IEEE Trans. Inf. Theory, 2002

On sequential strategies for loss functions with memory.
IEEE Trans. Inf. Theory, 2002

Embedded block coding in JPEG 2000.
Signal Process. Image Commun., 2002

Universal discrete denoising.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2000
Two-dimensional weight-constrained codes through enumeration bounds.
IEEE Trans. Inf. Theory, 2000

On-Line Decision Making for a Class of Loss Functions via Lempel-Ziv Parsing.
Proceedings of the Data Compression Conference, 2000

1999
Memory Efficient Scalable Line-based Image Coding.
Proceedings of the Data Compression Conference, 1999

1998
The Cost of Achieving the Best Portfolio in Hindsight.
Math. Oper. Res., 1998

A Low-Complexity Modeling Approach for Embedded Coding of Wavelet Coefficients.
Proceedings of the Data Compression Conference, 1998

1996
On the factor-of-two bound for Gaussian multiple-access channels with feedback.
IEEE Trans. Inf. Theory, 1996

Universal portfolios with side information.
IEEE Trans. Inf. Theory, 1996

On-Line Portfolio Selection.
Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

Max-min optimal investing.
Proceedings of the IEEE/IAFE 1996 Conference on Computational Intelligence for Financial Engineering, 1996

1990
Low-delay code-excited linear-predictive coding of wideband speech at 32 kbps.
Proceedings of the First International Conference on Spoken Language Processing, 1990


  Loading...