Publications by information theory research group member
Some selected older publications
Coding for constrained systems
 Independent sets in regular hypergraphs and multidimensional runlengthlimited
constraints.
Erik
Ordentlich and Ron M. Roth.
SIAM J. Disc. Math., 17 (2004), 615623. See also
HP Labs Tech. Report HPL2002348, December
2002.
 On the
redundancy of twodimensional balanced codes.
Erik
Ordentlich and Ron M. Roth. HP Labs Tech. Report
HPL97143, December 1997 and IEEE Trans. on Inform. Theory, Vol.
IT46, No. 4, July 2000.
 Nested
block decodable runlength limited codes.
Josh Hogan, Ron M. Roth,
Gitit Ruckenstein. HP Labs Tech. Report
HPL200091, July 2000 and IEEE Trans. on Inform. Theory, 47
(2001), 16301638.
 Nested
inputconstrained codes.
J. Hogan, R.M. Roth, G. Ruckenstein.
HP Labs Tech. Report HPL98165, and IEEE Trans. on Inform. Theory,
46 (2000), 13021316.Top of page
Cryptography
 Two
topics in hyperelliptic cryptography.
F. Hess, G. Seroussi and N.P. Smart.
Selected Areas in Cryptography, Lecture Notes in Computer Science, 2259,
SpringerVerlag, Berlin, pp. 181–189 (2001). Also HP Labs Tech.
Report HPL2000118.
 Elliptic
Curves in Cryptography.
Ian F. Blake, Gadiel Seroussi
and Nigel P. Smart. Cambridge University Press, 1999.

Curves, codes and cryptography.
Ian F. Blake. In
Codes, curves and signals: Common threads in communications,
A. Vardy editor, Dordrecht: Kluwer Academic Press, 1998.
Top of page
Source coding
 Multidirectional context sets
with applications to universal denoising and compression.
E. Ordentlich, M. J. Weinberger, and T. Weissman.
Proceedings of the 2005 IEEE Intl. Symp. on Inform.
Theory (ISIT'05), Adelaide, Australia, September 2005.
 Linear
time universal coding and time reversal of tree sources via FSM closure.
A. Martín, G. Seroussi and M.J. Weinberger.
HP Labs Tech. Report HPL200387R1 and IEEE Trans. on Inform. Theory, July, 2004.
 Optimal prefix codes for sources with
twosided geometric distributions.
Neri Merhav, Gadiel Seroussi and Marcelo J. Weinberger.
IEEE Trans. on Inform. Theory, Vol. IT46, No. 1, pp.
121135, January 2000.

Coding of sources with twosided geometric
distributions and unknown parameters.
Neri Merhav, Gadiel Seroussi and Marcelo J. Weinberger.
IEEE Trans. on Inform. Theory, Vol. IT46, No. 1, pp. 229236, January
2000.

Sequential prediction and ranking in universal context modeling and data compression .
Marcelo J. Weinberger and Gadiel Seroussi. HP Labs Tech. Report HPL94111 (R.1), January 1997, and IEEE Trans.
on Inform. Theory, Vol. IT43, No. 5, pp. 16971706, September 1997.

On adaptive strategies for an extended family of Golombtype codes.
Gadiel Seroussi and Marcelo J. Weinberger. HP Labs Tech. Report HPL9708 , January 1997, and in Proc. of the 1997 IEEE Data Compression Conf., pp. 131140, Snowbird, Utah, USA, March 1997.
 On tree sources, finitestate machines, and time reversal.
Gadiel Seroussi and Marcelo J. Weinberger. In
Proc. of the 1995 Intl. Symp. on Inform. Theory, p. 390, Whistler, British Columbia, Canada, September 1995.
 A universal finite memory source.
Marcelo J. Weinberger, Jorma Rissanen, and Meir Feder.
IEEE Trans. on Inform. Theory, IT41, pp. 643652, May 1995.
 Optimal sequential probability assignment for individual sequences.
Marcelo J. Weinberger, Neri Merhav, and Meir Feder.
IEEE Trans. on Inform. Theory, IT40, pp. 384396, March 1994.
 Predictive stochastic complexity and model estimation for finitestate processes.
Marcelo J. Weinberger and Meir Feder.
Journal of Statistical Planning and Inference, 39:353372, 1994.
Top of page
Image compression
 Embedded
block coding in JPEG2000.
David Taubman, Erik Ordentlich, Marcelo J. Weinberger, and Gadiel
Seroussi.
HP Labs Tech. Report HPL200135 and
European Signal Processing Journal: Image Communication 17 (2002)
49–72. Also, in Proc. of the IEEE Intl. Conf. on Image Processing (ICIP'00), Vancouver,
Canada, September 2000.

Lossless
compression of continuoustone images.
Bruno Carpentieri, Marcelo J. Weinberger, and Gadiel Seroussi.
HP Labs Tech. Report HPL2000163, and Proc. of
the IEEE, Vol. 88, No. 11, pp. 1797—1809, November 2000.
 Compression
of polynomial texture maps.
Giovanni Motta and Marcelo J. Weinberger.
HP Labs Tech. Report HPL2000143 (R.2),
April 2001.

On modeling and ordering for embedded image coding.
Erik Ordentlich, Marcelo J. Weinberger, and Gadiel Seroussi.
In Proc. of the 2000 IEEE Intl. Symp. on Inform. Theory (ISIT'00),
p. 297, Sorrento, Italy, June 2000.
 The
LOCOI lossless image
compression algorithm: Principles and standardization into JPEGLS.
Marcelo J. Weinberger, Gadiel Seroussi and Guillermo Sapiro.
HP Labs Tech. Report HPL98193 (R1), November 1998
(revised October 1999), and IEEE Trans. on Image Processing,
Vol. 9, No. 8, pp. 1309—1324, August 2000. PDF
Postscript
 From
LOCOI to the JPEGLS standard.
Marcelo J. Weinberger, Gadiel Seroussi and Guillermo Sapiro.
HP Labs Tech. Report HPL19993, January 1999, and in
Proc. of the 1999 IEEE Intl. Conf. on Image Processing, Kobe,
Japan, October 1999.
 Memory
efficient scalable linebased image coding.
Erik Ordentlich, David Taubman, Marcelo J. Weinberger, Gadiel
Seroussi and Michael W. Marcellin. HP Labs Tech. Report HPL19991, January 1999, and in
Proc.
of the 1999 IEEE Data Compression Conf., Snowbird, Utah,
USA, March 1999.
 A lowcomplexity modeling approach for embedded coding of wavelet coefficients.
Erik Ordentlich, Marcelo J. Weinberger, and Gadiel Seroussi.
HP Labs Tech. Report HPL97150, December 1997, and in
Proc. of the 1998 IEEE Data Compression Conf., Snowbird, Utah, USA, March 1998.
 Modeling and lowcomplexity adaptive coding for image prediction residuals.
Neri Merhav, Gadiel Seroussi, and Marcelo J. Weinberger. In
Proc. of the 1996 Intl. Conf. on Image Processing, volume II, pp. 353356, Lausanne, Switzerland, September 1996.
 LOCOI: A low complexity, contextbased, lossless image compression algorithm.
Marcelo J. Weinberger, Gadiel Seroussi, and Guillermo Sapiro. In
Proc. of the 1996 IEEE Data Compression Conf., pp. 140149, Snowbird, Utah, USA, March 1996.
 Applications of universal context modeling to lossless compression of grayscale images.
Marcelo J. Weinberger, Jorma Rissanen, and Ron Arps.
IEEE Trans. on Image Processing, 5(4):575586, April 1996.
 Comparing the lossless image compression standards and universal context modelling.
Ronald Arps, Marcelo J. Weinberger, Thomas Truong, and Jorma Rissanen. In
Proc. of the 1994 Intl. Picture Coding Symposium, Sacramento, California, September 1994.
Top of page
Error correcting codes

Resistorlogic demultiplexers for nanoelectronics based on
constantweight codes.
P. J. Kuekes, W. Robinett, R. M. Roth, G. Seroussi, G. S. Snider, R. S. Williams.
submitted to Nanotechnology.

On the second moment of the distance distribution of binary
codes.
R. M. Roth, G. Seroussi,
IEEE Intl. Symp. on Inform. Theory, Adelaide, Australia, September
2005.

Stopping Set distribution of LDPC code ensembles.
A. Orlitsky, K. Viswanathan, J. Zhang.
IEEE Trans. on Inform. Theory, March 2005.

Defecttolerant
interconnect to nanoelectronic circuits: Internallyredundant demultiplexers
based on errorcorrecting codes.
Philip J. Kuekes, Warren Robinett, Gadiel Seroussi, Stanley R.Williams.
HP Labs Tech. Report HPL2004121.

Crosssymbol codes.
R. M. Roth, G. Seroussi.
IEEE Int'l Symp. on Information Theory, Chicago, Illinois (June 2004).

Channel decoding of systematically encoded unknown redundant
sources.
E. Ordentlich, G. Seroussi, S. Verdu, K. Viswanathan, M. J. Weinberger, and T.
Weissman.
Proceedings of the 2004 IEEE Intl. Symp. on Inform. Theory (ISIT'04), Chicago, IL, June  July 2004, p.
165.

Symbolintersecting
codes.
R.M. Roth, G. Seroussi.
HP Labs Tech. Report HPL2004117 and
IEEE Trans. on Inform. Theory, 51, 2005,
22662281.

Oneway communication and errorcorrecting codes.
A. Orlitsky and K. Viswanathan.
IEEE Trans. on Inform. Theory, June 2003.

On Capacity achieving sequences of degree distributions and
their optimality.
A. Orlitsky, K. Viswanathan, J. Zhang.
IEEE Intl. Symp. on Inform. Theory, June 2003.

On hats and other covers.
Hendrik W. Lenstra, Jr. and Gadiel Seroussi. Extended summary, October 2001.
IEEE International Symposium on Information Theory, Lausanne, Switzerland, June 30July 5, 2002.

Stopping sets and the girth of Tanner graphs.
A. Orlitsky, R. Urbanke, K. Viswanathan, and J. Zhang.
IEEE Intl. Symp. on Inform. Theory, June 2002.
 A lowcomplexity algorithm for the construction of AlgebraicGeometric codes better than the GilbertVarshamov bound.
Kenneth Shum, Iliya Aleshnikov, Vijay Kumar, Henning Stichtenoth, and Vinay Deolalikar. IEEE Trans. Inform. Theory, Vol. 47, No. 6, Sept. 2001.
 (Book Chapter) Towards a basis for the space of regular functions in a tower of function fields meeting the DrinfeldVladut bound.
Iliya Aleshnikov, Vinay Deolalikar, Vijay Kumar, and Henning Stichtenoth. In
Finite Fields and Applications (Chapter 2), Dieter Jungnickel and Harold Niedderreiter (eds.), Springer, 2000.
 Results on basis construction for a tower of function fields meeting the DrinfeldVladut bound.
Iliya Aleshnikov, Vinay Deolalikar, Vijay Kumar, and Henning Stichtenoth. In
Proceedings of Algebraic Geometry and Coding Theory, Luminy, France, 2000.
 Results relating to code construction on a tower of function fields meeting the DrinfeldVladut bound.
Iliya Aleshnikov, Vinay Deolalikar, Vijay Kumar, and Henning Stichtenoth. In
Proceedings of Int. Symp. on Inform. Theory, Sorrento, Italy, June 2000.
 Algebraic geometry codes.
Ian F. Blake, Chris Heegard, Tom Hoeholdt, and Victor Wei.
IEEE Trans. on Inform. Theory , IT44, October (1998), 25962618 (invited paper).
 On the solutions of an elliptic curve over a field of characteristic two.
Ian F. Blake, Ron M. Roth, and Gadiel Seroussi. In
Proceedings 1998 IEEE Intl. Symp. on Inform. Theory, Cambridge, Massachusetts, USA, August 1998.
 Reducedredundancy product codes for burst error correction.
Ron M. Roth and Gadiel Seroussi.
HP Labs Tech. Report HPL9725, January 1997, and
IEEE Trans. on Inform. Theory , IT44 (1998), 13951406.
 Probabilistic
crisscross error correction.
Ron M. Roth.
HP Labs Tech. Report HPL95109, September 1995, and
IEEE Trans. on Inform. Theory , IT43 (1997), 14251438.
 Locationcorrecting codes.
Ron M. Roth and Gadiel Seroussi.
HP Labs Tech. Report HPL9520, February 1995, and
IEEE Trans. on Inform. Theory , IT42 (1996), 554565.
 A hypersystolic ReedSolomon decoder.
Elwyn R. Berlekamp, Gadiel Seroussi, and Po Tong.
ReedSolomon Codes and Their Applications. Stephen B. Wicker and Vijay K. Bhargava (eds.), Chapter 10, IEEE Press, New York, 1994.
Top of page
Finite fields
 Explicit constructions of extensions of the rational function field with
prescribed splitting.
Vinay Deolalikar.
Finite Fields and their Applications 9 (2003) 222236.
 Determining irreducibility and ramification groups for an additive
extension of the rational function field.
Vinay Deolalikar.
Journal of Number Theory 97 (2002) 269286.
 On extensions of function fields in which all rational places split
completely.
Vinay Deolalikar. Communications in Algebra, 30,
No.6 (2002) 26872698.

Table of lowweight binary irreducible polynomials.
Gadiel Seroussi. HP Labs Tech. Report HPL98135, August 1998.

Efficient arithmetic in GF(2^{n}) through palindromic representation.
Ian F. Blake, Ron M. Roth, and Gadiel Seroussi. HP Labs Tech. Report HPL98134, August 1998.

Curves with many points.
Ian F. Blake. Thirtyfifth Annual Allerton
Conf. on Communication, Control and Computing , September 29  October 1, 1997.
Top of page
Sequential decisions and prediction
 On
delayed prediction of individual sequences.
Marcelo J. Weinberger and Erik Ordentlich. HP Labs Tech. Report HPL2001162, June 2001. IEEE Trans.
on Inform. Theory,
Vol. 48, pp. 19591976, July 2002.

On sequential
strategies for loss functions with memory.
Neri Merhav, Erik Ordentlich, Gadiel Seroussi, and Marcelo J. Weinberger. IEEE Trans.
on Inform. Theory, Vol. 48, pp. 19471958, July 2002. HP Labs Tech. Report HPL200152, March 2001.

Online decision making for a class of loss functions via LempelZiv Parsing.
Marcelo J. Weinberger and Erik Ordentlich. Proc. of the 2000 IEEE Data Compression Conf., pp. 163—172, Snowbird, Utah, USA, March 2000.

The equivalence of optimal market gains and minimax regret universal portfolios.
Thomas M. Cover and Erik Ordentlich. In Proc. of the 1997 Intl.
Symp. on Inform. Theory, Ulm, Germany, June 1997.

The cost of achieving the best portfolio in hindsight.
Erik Ordentlich and Thomas M. Cover.
Math. of Operations Research, 23(4):960982, November 1998..
Top of page
Shannon theory

Universal delaylimited simulation.
N. Merhav, G. Seroussi, and M. J. Weinberger. Proceedings of the 2005 IEEE
Intl. Symp. on Inform. Theory (ISIT'05), Adelaide,
Australia, September 2005.

Addendum to "On universal simulation
of information sources using training data."
N. Merhav and M. J. Weinberger.
IEEE Trans. on Inform. Theory, Vol.51, pp. 33813383, September 2005.

On causal and
semicausal codes for joint information embedding and source coding.
Neri
Merhav and Erik Ordentlich. HP Labs Tech. Report
HPL200438, and IEEE Trans. on Inform. Theory,
January, 2006.

The empirical
distribution of rate constrained source codes.
Tsachy Weissman and Erik
Ordentlich. HP Labs Tech. Report
HPL2003253, and IEEE Trans. on Inform. Theory, Vol. 51, No. 11,
Nov. 2005 pp. 3718
 3733.

Achievable
key rates for universal simulation of random data with respect to a set of
statistical tests.
Neri Merhav. HP
Labs Tech. Report HPL2002271 and IEEE Trans. Inform. Theory, vol.50,
pp. 2130, January 2004.

On universal
simulation of information sources using training data.
Neri Merhav and Marcelo J. Weinberger. HP
Labs Tech. Report HPL2002263, and IEEE Trans. Inform. Theory, vol.50,
pp. 520, January 2004.

Universally attainable errorexponents for rateconstrained denoising of noisy sources
Tsachy Weissman.
IEEE Trans. Inform. Theory, vol.50,
June 2004, and HP Labs Tech. Report
HPL2002214.

Maximizing the entropy of a sum of independent random variables.
Erik Ordentlich.
IEEE Trans. on Inform. Theory, Vol. IT52, May 2006 and
HP Labs Tech. Report HPL99120, October 1999.

Hierarchical guessing with a fidelity criterion.
Neri Merhav, Ron M. Roth, and Erdal Arikan. HP Labs Tech. Report HPL9707, January 1997, and IEEE Trans.
on Inform. Theory, Vol. IT45, pp. 330337, January 1999.

Guessing subject to distortion.
Erdal Arikan and Neri Merhav. HP Labs Tech. Report HPL9648, April 1996, and IEEE Trans. on Inform. Theory, Vol. IT44, pp. 10411056, May 1998.

On list size exponents in ratedistortion coding.
Neri Merhav. HP Labs Tech. Report HPL9633, March 1996, and IEEE Trans. on Inform. Theory,Vol. IT43, No. 2, pp. 765769, March 1997.

On the factoroftwo bound for Gaussian multipleaccess channels with feedback.
Erik Ordentlich. IEEE Trans. on Inform. Theory, Vol. IT42, No. 6, November 1996.
Top of page
Mathematical foundations of machine
intelligence
 A two layer paradigm capable of forming arbitrary decision regions in input space.
Vinay Deolalikar. HP Labs Tech. Report HPL200163R1, March 2001, also IEEE Trans. on Neural Networks, Vol. 13, No. 1, Jan 2002 .

Mapping Boolean functions with neural networks with zero thresholds and binary weights.
Vinay Deolalikar. HP Labs Tech. Report HPL200164, March 2001, also IEEE Trans. on Neural Networks, Vol. 12, No. 3, May 2001.
Top of page
Quantum computation and information theory

Comment
on "Quantum identification schemes with entanglements".
Wim van Dam.
Physical Review A, Volume 68, Number 2, Article 026301 (2003), and arXiv eprint, quantph/0307126, July
2003.

The
statistical strength of nonlocality proofs.
Wim van Dam, Richard Gill and Peter Grünwald.
IEEE Trans. on Inform. Theory, Vol. 51, No. 8, pp. 28122835
(2005),
and arXiv eprint, quantph/0307125, July 2003.

Think
Nonlocally (book review of Amir Aczel's "Entanglement: The Greatest Mystery
in Physics").
Wim van Dam.
American Scientist, Volume 91, No. 3, MayJune 2003.

Experimental
implementation of an adiabatic quantum optimization algorithm.
Matthias Steffen, Wim van Dam, Tad Hogg, Greg Breyta and Isaac Chuang.
Physical Review Letters, Volume 90, Number 6, 067903, 2003; arXiv eprint,
quantph/0302057, February 2003.

Quantum
algorithms for some hidden shift problems.
Wim van Dam, Sean Hallgren and Lawrence Ip.
Proceedings of the ACMSIAM Symposium on Discrete Algorithms, pp. 489498,
2003; arXiv eprint, quantph/0211140, November 2002.

Efficient
quantum algorithms for estimating Gauss sums.
Wim van Dam and Gadiel Seroussi. HP
Labs Tech. Report HPL2002208, July 2002.
 Renyientropic bounds on quantum communication.
Wim van Dam and Patrick Hayden. arXiv eprint, quantph/0204093, April 2002.
 Universal
entanglement transformation without communication.
Wim van Dam and Patrick Hayden.
Physical Review A, Rapid Communications, Volume 67, Number 6,
060302(R), 2003.
under the title "Embezzling Entangled Quantum States", arXiv
eprint, quantph/0201041, January 2002.
 How
powerful is adiabatic quantum computation?
Wim van Dam, Michele Mosca and Umesh Vazirani. Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, pp. 279287, October
2001.
Top of page
Denoising

Universal filtering via prediction.
T. Weissman, E. Ordentlich, M. J. Weinberger, A. SomekhBaruch, and N. Merhav.
HP Labs Tech. Report HPL200675, April 2006.
 Lower
limits of discrete universal denoising.
K. Viswanathan and E. Ordentlich
HP Labs Tech. Report HPL200671, April 2006 and to appear
Proceedings 2006 IEEE Intl. Symp. on Inform. Theory (ISIT'06), Seattle,
WA, July 2006.
 The DUDE framework for continuous tone image denoising.
G. Motta, E. Ordentlich, I. Ramirez, G. Seroussi, and M. J. Weinberger.
2005 IEEE Intl. Conf. on Image Processing (ICIP'05),
Genoa, Italy, September 2005.
 Multidirectional context sets
with applications to universal denoising and compression.
E. Ordentlich, M. J. Weinberger, and T. Weissman.
Proceedings of the 2005 IEEE Intl. Symp. on Inform.
Theory (ISIT'05), Adelaide, Australia, September 2005.
 Channel decoding of systematically encoded unknown redundant
sources.
E. Ordentlich, G. Seroussi, S. Verdu, K. Viswanathan, M. J. Weinberger, and T.
Weissman.
Proceedings of the 2004 IEEE Intl. Symp. on Inform. Theory (ISIT'04), Chicago, IL, June  July 2004, p.
165.
 Discrete universal filtering through incremental
parsing.
E. Ordentlich, T. Weissman, M. J. Weinberger, A. SomekhBaruch, and N. Merhav.
Proceedings of the Data Compression Conference (DCC'04), Snowbird,
UT, March 2004, pp. 352361.
 On the
optimality of symbolbysymbol filtering and denoising.
Erik Ordentlich and Tsacy Weissman
HP Labs Tech. Report HPL2003254, and IEEE Trans.
Inform. Theory, January, 2006.
 A discrete universal denoiser and
its application to binary images.
Erik Ordentlich, Gadiel Seroussi, Sergio Verdú and Marcelo J. Weinberger,
Tsachy Weissman.
In Proc. of IEEE Intl. Conf. on Image Processing
(ICIP’03), Barcelona, Spain, September 2003.
 Universal
discrete denoising: known channel.
Tsachy Weissman, Erik Ordentlich, Gadiel Seroussi, Sergio Verdu, and
Marcelo J. Weinberger.
HP Labs Tech. Report HPL200329,
February 2003 and IEEE Trans. Inform. Theory, Vol. 51, No. 1,
Jan. 2005, pp. 5 – 28.
Top of page
Image processing
Combinatorics
Random processes and sequences
 Approximations for the entropy rate of a hidden Markov process.
Erik Ordentlich, Tsachy Weissman.
IEEE Intl. Symp. on Inform. Theory 2005, Proceedings, Sept. 49, 2005,
pp. 2198 – 2202.
 Asymptotic
filtering and entropy rate of a hidden Markov process in the rare
transitions regime.
Chandra Nair, Erik Ordentlich, Tsachy Weissman. IEEE Intl. Symp. on Inform.
Theory 2005, Proceedings, Sept. 49, 2005, pp. 1838 – 1842.
 Limit results on pattern entropy.
A. Orlitsky, N. P. Santhanam, K. Viswanathan, J. Zhang.
submitted to the IEEE Trans. on Inform. Theory.
 On the
entropy rate of pattern processes.
George M. Gemelos, Tsachy Weissman
HP Labs Tech. Report HPL2004159, September 2004.
 On universal types.
Gadiel Seroussi
HP Labs Tech. Report HPL2004153, September 2004.
Top of page
Probability and statistics
 Convergence of profile based estimators.
A. Orlitsky, N. P. Santhanam, K. Viswanathan, J. Zhang,
IEEE Intl. Symp. on Inform. Theory, September 2005.
 A distribution dependent
refinement of Pinsker's inequality.
Erik Ordentlich, Marcelo J. Weinberger.
IEEE Trans. on Inform. Theory, Vol. IT51, pp. 18361840, May 2005.
 On modeling profiles instead of values.
A. Orlitsky, N. P. Santhanam, K. Viswanathan, J. Zhang.
Uncertainty in Artificial Intelligence, July 2004.
 Algorithms for modeling distributions over large alphabets.
A. Orlitsky, Sajama, N. P. Santhanam, K. Viswanathan, J. Zhang.
IEEE Intl. Symp. on Inform. Theory, June 2004.
 Low size and order in distribution modeling.
A. Orlitsky, N. P. Santhanam, K. Viswanathan, J. Zhang.
Conf. on Inform. Systems and Sciences, March 2004.
Top of page
Interactive communication
 Oneway communication and errorcorrecting codes.
A. Orlitsky and K. Viswanathan.
IEEE Trans. on Inform. Theory, June 2003.
 Practical protocols for interactive communication.
A. Orlitsky and K. Viswanathan.
IEEE Intl. Symp. on Inform. Theory, June 2001.
Top of page
Complexity theory
Top of page


