Grouped into the following rough categories (with the occasional duplication when a paper crosses boundaries).

- Communication, networks, security
- Information, probability, combinatorics
- Neural networks: computation, complexity, and learning
- Pattern recognition, associative memory
- Learning theory, capacity, algorithms
- Optical signal processing

S. B. Bulumulla and S. S. Venkatesh,
``On the Quantized Decorrelating Detector,'' *Conference on
Information Sciences and Systems*, Princeton University, Princeton,
New Jersey, March 1996.

S. B. Bulumulla, S. A. Kassam, and S.
S. Venkatesh, ``Optimum and Sub-Optimum Receivers for OFDM Signals
in Rayleigh Fading Channels,'' *Conference on Information Sciences
and Systems*, Johns Hopkins University, Baltimore, Maryland,
March 1997.

S. B. Bulumulla, S. A. Kassam and S.
S. Venkatesh, ``An Adaptive, Diversity Receiver for OFDM in Fading
Channels,'' *International Conference on Communications*,
1998.

S. B. Bulumulla, S. A. Kassam and S.
S. Venkatesh, ``Pilot Symbol Assisted Diversity Reception for
a Fading Channel,'' *International Conference on Acoustics,
Speech, and Signal Processing*, 1998.

S. S. Venkatesh, ``CDMA
Capacity,'' *2000 Conference on Information Sciences and
Systems*, Princeton University, March 15-17, 2000.

S. B. Bulumulla, S. A. Kassam, and S.
S. Venkatesh, ``Joint Channel Estimation and Detection for OFDM
Signals in a Rayleigh Fading Channel,'' *IEEE Transactions on
Communications*, May 2000.

C. Gunter, S. Khanna, K. Tan, and S.
S. Venkatesh, ``DoS Protection
for Reliably Authenticated Broadcast,'' *11th Annual Network
and Distributed System Security Symposium *, San Diego, California,
February 2004.

S. S. Kunniyur and S. S. Venkatesh, ``Network Devolution and the
Growth of Sensory Lacunae in Sensor Networks,'' *WiOpt'04:
Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks*,
University of Cambridge, UK, March 2004.

S. S. Kunniyur and S. S. Venkatesh, ``Sensor Network Devolution and Breakdown
in Survivor Connectivity,'' *2004 International Symposium
on Information Theory*, Chicago, Illinois, June 27-July 2,
2004.

S. S. Venkatesh, ``Connectivity of Metric Random Graphs,'' preprint, 2004.

M. Sherr, M. Greenwald, C. A. Gunter,
S. Khanna, and S. S. Venkatesh, ``Mitigating
DoS Attack Through Selective Bin Verification,'' *Proceedings
of the Workshop on Secure Network Protocols (NPSec)*, Boston,
Massachusetts, November 2005.

S. S. Venkatesh, ``Connectivity,
Devolution, and Lacunae in Geometric Random Digraphs,'' http://ita.ucsd.edu/workshop/papers/165.pdf,
in

*Proceedings of the Inaugural Workshop on Information Theory
and Applications*, San Diego, CA, February 2006.

S. S. Kunniyur and S. S. Venkatesh, ``Threshold Functions, Node
Isolation, and Emergent Lacunae in Sensor Networks,'' *IEEE
Transactions on Information Theory*, vol.~52, no.~12, pp.~5352--5372,
December 2006.

M. B. Greenwald, S. Khanna, and S. S.
Venkatesh, ``How Much Bandwidth Can
Attack Bots Commandeer?'' *Proceedings of the Workshop on
Information Theory and Applications*, San Diego, CA, January
2007.

S. S. Venkatesh, ``Epsilon Capacity of
Neural Networks,'' *Conference on Neural Networks for Computing*,
Snowbird, Utah, April 1986; reprinted in *Neural Networks for
Computing*, (ed. J. Denker). New York: AIP, 1986.

R. J. McEliece, E. C. Posner, E. R. Rodemich,
and S. S. Venkatesh, ``The Capacity of the Hopfield Associative
Memory,'' *IEEE Transactions on Information Theory*, vol.
IT-33, pp. 461-482, 1987.

P. Baldi and S. S. Venkatesh, ``Number
of Stable Points for Spin Glasses and Neural Networks of Higher
Orders,'' *Physics Review Letters*, vol. 58, pp. 913-916,
1987.

S. S. Venkatesh and D. Psaltis, ``Linear and Logarithmic Capacities
in Associative Neural Networks,'' *IEEE Transactions on
Information Theory*, vol. IT-35, pp. 558-568, 1989.

S. S. Venkatesh, ``What is the Capacity
of One Bit of Memory?,'' *IEEE International Symposium on Information
Theory*, San Diego, California, January 1990.

S. S. Venkatesh and D. Psaltis, ``Error
Tolerance and Neural Capacity,'' *IEEE International Symposium
on Information Theory*, San Diego, California, January 1990.

S. S. Venkatesh and P. Baldi, ``Programmed
Interactions in Higher-Order Neural Networks: Maximal Capacity,''
*Journal of Complexity*, vol. 7, no. 3, pp. 316-337, 1991.

S. S. Venkatesh and J. Franklin, ``How
Much Information Can One Bit of Memory Retain About a Bernoulli
Sequence?'' *IEEE Transactions on Information Theory*, vol.
IT-37, pp. 1595-1604, 1991.

S. S. Venkatesh and P. Baldi, ``Programmed
Interactions in Higher-Order Neural Networks: The Outer-Product
Algorithm,'' *Journal of Complexity*, vol. 7, no. 4, pp.
443-479, 1991.

S. Biswas and S. S. Venkatesh, ``The
Devil and the Network: What Sparsity Implies to Robustness and
Memory,'' *Conference on Neural Information Processing Systems*,
Denver, Colorado, November 1990; reprinted in *Advances in Neural
Information Processing Systems 3*, (eds. D. S. Touretzky and
R. Lippman). San Mateo, California: Morgan Kaufmann, 1991.

S. S. Venkatesh, ``Computation and Learning
in the Context of Neural Network Capacity,'' in *Neural Networks
for Perception*, (ed. H. Wechsler). New York: Academic Press,
1992.

S. S. Venkatesh and D. Psaltis, ``On
Reliable Computation with Formal Neurons'', *IEEE Transactions
on Pattern Analysis and Machine Intelligence*, vol. 14, no.
1, pp. 87-91, 1992.

S. S. Venkatesh, ``The Science of Making
*Erors*,'' *IEEE Transactions on Knowledge and Data Engineering*,
vol. 4, no. 2, pp. 135-144, 1992.

S. S. Venkatesh, ``Robustness in Neural
Computation: Random Graphs and Sparsity,'' *IEEE Transactions
on Information Theory*, vol. 38, no. 3, pp. 1114-1118, 1992.

I. Hu and S. S. Venkatesh, ``On the Minimum
Expected Duration of a Coin Tossing Game,'' *IEEE International
Symposium on Information Theory*, San Antonio, Texas, January
1993; reprinted in *Proceedings 1993 IEEE International Symposium
on Information Theory*. Piscataway, New Jersey: IEEE Press,
1993.

S. C. Fang and S. S. Venkatesh, ``On
the Average Tractability of Binary Integer Programming and the
Curious Transition to Perfect Generalisation in Learning Majority
Functions,'' *Workshop on Computational Learning Theory*,
University of California, Santa Cruz, California, July 1993; reprinted
in *Proceedings of the Sixth Workshop on Computational Learning
Theory*. Baltimore, Maryland: ACM Press, 1993.

B. Sarath and S. S. Venkatesh, ``Auditor
Liability for Management Fraud,'' *Fifth Annual Conference on
Intelligent Systems in Accounting, Finance, and Management*,
Palo Alto, California, November 1993.

S. S. Venkatesh and P. Baldi, ``Random
Interconnections in Higher-Order Neural Networks,'' *IEEE Transactions
on Information Theory*, vol. 39, no. 1, pp. 274-282, 1993.

I. Hu and S. S. Venkatesh, ``On the Minimum
Expected Duration of a Coin Tossing Game,'' *IEEE Transactions
on Information Theory*, vol. 39, no. 2, pp. 581-593, 1993.

C. Wang and S. S. Venkatesh, ``Criteria
for Approximation Error and Complexity Trade-Off in Learning,''
in *Workshop on Computational Learning Theory*, University
of California, Santa Cruz, California, July 1995; reprinted in
*Proceedings of the Eighth Annual Workshop on Computational
Learning Theory*. Baltimore, Maryland: ACM Press, 1995.

J. Ratsaby and S. S. Venkatesh, ``The
Complexity of Learning from a Mixture of Labelled and Unlabelled
Examples,'' in *Proceedings of the Thirty-third Annual Allerton
Conference on Communication, Control, and Computing*, Allerton,
Illinois, October 1995.

S. S. Venkatesh, ``Connectivity and Capacity
in the Hebb Rule,'' in *Advances in Neural Networks*, (eds.
A. Orlitsky, V. Roychoudhury, and S. Siu). New York: Kluver, 1995.

A. Orlitsky and S. S. Venkatesh, ``On
edge-colored interior planar graphs on a circle and the expected
number of RNA secondary structures,'' *Discrete Applied Mathematics*,
vol. 64, pp. 151-178, 1996.

S. C. Fang and S. S. Venkatesh, ``Learning
Binary Perceptrons Perfectly Efficiently,'' *Journal of Computer
and Systems Sciences*, vol. 52, no. 2, pp. 374-389, 1996.

S. C. Fang and S. S. Venkatesh, ``A Threshold
Function for Harmonic Update,'' *SIAM Journal of Discrete Mathematics*,
vol. 10, no. 3, pp. 482-498, 1997.

S. C. Fang and S. S. Venkatesh, ``The
Capacity of Majority Rule,'' *Random Structures and Algorithms*,
vol. 12, pp. 83-109, 1998.

S. S. Venkatesh, ``Epsilon Capacity of
Neural Networks,'' *Conference on Neural Networks for Computing*,
Snowbird, Utah, April 1986; reprinted in *Neural Networks for
Computing*, (ed. J. Denker). New York: AIP, 1986.

D. Psaltis, J. Hong, and S. S. Venkatesh,
``Shift Invariance in Optical Associative Memories,'' in *Proceedings
of SPIE: First Annual Symposium on Optoelectronics and Laser Applications*,
Los Angeles, California, 1986.

S. S. Venkatesh, ``Computation with Neural
Networks,'' *Proceedings of the Ninth Annual Conference on Engineering
in Medicine and Biology*, Boston, Massachusetts, 1987, pp.
1364-1365.

R. J. McEliece, E. C. Posner, E. R. Rodemich,
and S. S. Venkatesh, ``The Capacity of the Hopfield Associative
Memory,'' *IEEE Transactions on Information Theory*, vol.
IT-33, pp. 461-482, 1987.

P. Baldi and S. S. Venkatesh, ``Number
of Stable Points for Spin Glasses and Neural Networks of Higher
Orders,'' *Physics Review Letters*, vol. 58, pp. 913-916,
1987.

P. Baldi and S. S. Venkatesh, ``On Properties
of Networks of Neuron-Like Elements,'' *Conference on Neural
Information Processing Systems*, Denver, Colorado, November
1987; reprinted in *Neural Information Processing Systems*,
(ed. D. Anderson). New York: AIP, 1988.

S. S. Venkatesh, D. Psaltis, and G. Sirat,
``A Class of Spectral Algorithms for Neural Associative Memory,''
*IEEE International Symposium on Information Theory*, Kobe,
Japan, June 1988.

D. Psaltis and S. S. Venkatesh, ``Information
Storage in Fully Interconnected Networks,'' in *Evolution, Learning,
and Cognition*, (ed. Y. C. Lee). Teaneck, New Jersey: World
Scientific, 1989.

S. S. Venkatesh and D. Psaltis, ``Linear and Logarithmic Capacities
in Associative Neural Networks,'' *IEEE Transactions on
Information Theory*, vol. IT-35, pp. 558-568, 1989.

S. S. Venkatesh, ``Computation and Learning
in Neural Networks with Binary Weights,'' *IEEE International
Symposium on Information Theory*, San Diego, California, January
1990.

S. S. Venkatesh and D. Psaltis, ``Error
Tolerance and Neural Capacity,'' *IEEE International Symposium
on Information Theory*, San Diego, California, January 1990.

S. S. Venkatesh, G. Pancha, D. Psaltis,
and G. Sirat, ``Shaping Attraction Basins in Neural Networks,''
*Neural Networks*, vol. 3, no. 6, pp. 613-624, 1990.

S. S. Venkatesh and P. Baldi, ``Programmed
Interactions in Higher-Order Neural Networks: Maximal Capacity,''
*Journal of Complexity*, vol. 7, no. 3, pp. 316-337, 1991.

S. S. Venkatesh and P. Baldi, ``Programmed
Interactions in Higher-Order Neural Networks: The Outer-Product
Algorithm,'' *Journal of Complexity*, vol. 7, no. 4, pp.
443-479, 1991.

S. Biswas and S. S. Venkatesh, ``The
Devil and the Network: What Sparsity Implies to Robustness and
Memory,'' *Conference on Neural Information Processing Systems*,
Denver, Colorado, November 1990; reprinted in *Advances in Neural
Information Processing Systems 3*, (eds. D. S. Touretzky and
R. Lippman). San Mateo, California: Morgan Kaufmann, 1991.

S. S. Venkatesh, ``On Learning Binary
Weights for Majority Functions,'' *Workshop on Computational
Learning Theory*, University of California, Santa Cruz, California,
August 1991; reprinted in *Proceedings of the Fourth Workshop
on Computational Learning Theory*, (eds. L. G. Valiant and
M. K. Warmuth). San Mateo, California: Morgan Kaufmann, 1991.

S. S. Venkatesh, ``Computation and Learning
in the Context of Neural Network Capacity,'' in *Neural Networks
for Perception*, (ed. H. Wechsler). New York: Academic Press,
1992.

S. S. Venkatesh and D. Psaltis, ``On
Reliable Computation with Formal Neurons'', *IEEE Transactions
on Pattern Analysis and Machine Intelligence*, vol. 14, no.
1, pp. 87-91, 1992.

S. S. Venkatesh, ``The Science of Making
*Erors*,'' *IEEE Transactions on Knowledge and Data Engineering*,
vol. 4, no. 2, pp. 135-144, 1992.

S. S. Venkatesh, ``Robustness in Neural
Computation: Random Graphs and Sparsity,'' *IEEE Transactions
on Information Theory*, vol. 38, no. 3, pp. 1114-1118, 1992.

S. C. Fang and S. S. Venkatesh, ``On
the Average Tractability of Binary Integer Programming and the
Curious Transition to Perfect Generalisation in Learning Majority
Functions,'' *Workshop on Computational Learning Theory*,
University of California, Santa Cruz, California, July 1993; reprinted
in *Proceedings of the Sixth Workshop on Computational Learning
Theory*. Baltimore, Maryland: ACM Press, 1993.

C. Wang, S. J. Judd, and S. S. Venkatesh,
``When to Stop: On Optimal Stopping and Effective Machine Size
in Learning,'' *Conference on Neural Information Processing
Systems*, Denver, Colorado, November 1993.

G. Pancha and S. S. Venkatesh, ``Feature
and Memory Selective Error Correction in Neural Associative Memory,''
in *Associative Neural Memories: Theory and Implementation*
(ed. M. H. Hassoun). New York: Oxford University Press, 1993.

S. S. Venkatesh, ``Directed Drift: A
New Linear Threshold Algorithm for Learning Binary Weights On-Line,''
*Journal of Computer and Systems Sciences*, vol. 46, no.
2, pp. 198-217, 1993.

S. S. Venkatesh and P. Baldi, ``Random
Interconnections in Higher-Order Neural Networks,'' *IEEE Transactions
on Information Theory*, vol. 39, no. 1, pp. 274-282, 1993.

S. S. Venkatesh, ``On Approximations
of Functions by Depth-Two Neural Networks,'' *IEEE International
Symposium on Information Theory*, Trondheim, Norway, June 1994;
reprinted in *Proceedings 1994 IEEE International Symposium
on Information Theory*. Piscataway, New Jersey: IEEE Press,
1994.

C. Wang and S. S. Venkatesh, ``Machine
Size Selection for Optimal Generalisation,'' *Workshop on Applications
of Descriptional Complexity to Inductive, Statistical, and Visual
Inference*, New Brunswick, New Jersey, July 1994.

C. Wang and S. S. Venkatesh, ``Temporal
Dynamics of Generalization in Neural Networks,'' *Conference
on Neural Information Processing Systems*, Denver, Colorado,
November 1994; reprinted in *Advances in Neural Information
Processing Systems 7*, (eds. D. S. Touretzky, G. Tesauro, and
T. K. Leen). Cambridge, MA: MIT Press, 1995.

C. Wang and S. S. Venkatesh, ``Criteria
for Approximation Error and Complexity Trade-Off in Learning,''
in *Workshop on Computational Learning Theory*, University
of California, Santa Cruz, California, July 1995; reprinted in
*Proceedings of the Eighth Annual Workshop on Computational
Learning Theory*. Baltimore, Maryland: ACM Press, 1995.

C. Wang, S. S. Venkatesh, and J. S. Judd,
``Optimal Stopping and Effective Machine Complexity in Learning,''
*IEEE International Symposium on Information Theory*, Whistler,
Canada, September 1995; reprinted in *Proceedings 1995 IEEE
International Symposium on Information Theory*. Piscataway,
New Jersey: IEEE Press, 1995.

S. C. Fang and S. S. Venkatesh, ``On
Batch Learning in a Binary Weight Setting,'' *IEEE International
Symposium on Information Theory*, Whistler, Canada, September
1995; reprinted in *Proceedings 1995 IEEE International Symposium
on Information Theory*. Piscataway, New Jersey: IEEE Press,
1995.

S. S. Venkatesh, ``Connectivity and Capacity
in the Hebb Rule,'' in *Advances in Neural Networks*, (eds.
A. Orlitsky, V. Roychoudhury, and S. Siu). New York: Kluver, 1995.

S. C. Fang and S. S. Venkatesh, ``Learning
Finite Binary Sequences from Half-Space Data,'' in *Proceedings
of the International Conference on Neural Networks*, Perth,
Australia, November 1996.

S. C. Fang and S. S. Venkatesh, ``Learning
Binary Perceptrons Perfectly Efficiently,'' *Journal of Computer
and Systems Sciences*, vol. 52, no. 2, pp. 374-389, 1996.

S. C. Fang and S. S. Venkatesh, ``A Threshold
Function for Harmonic Update,'' *SIAM Journal of Discrete Mathematics*,
vol. 10, no. 3, pp. 482-498, 1997.

S. C. Fang and S. S. Venkatesh, ``The
Capacity of Majority Rule,'' *Random Structures and Algorithms*,
vol. 12, pp. 83-109, 1998.

S. R. Kulkarni, G. Lugosi, and S. S.
Venkatesh, ``Learning Pattern Classification--A Survey,'' *IEEE
Transactions on Information Theory, Special Commemorative Issue
1948-1998*, vol. 44, no. 6, pp. 2178-2206, 1998.

S. C. Fang and S. S. Venkatesh, ``Learning
Finite Binary Sequences from Half-Space Data,'' *Random Structures
and Algorithms*, vol. 14, pp. 345-381, 1999.

Jae H. Song, Santosh S. Venkatesh, Emily.
A. Conant, Peter H. Arger, and Chandra M. Sehgal, ``Artificial
Neural Network to aid differentiation between malignant and benign
breast masses by Ultrasound Imaging," *Ultrasonic Imaging
and Signal Processing, SPIE Conference on Medical Imaging*,
San Diego, California, February 12--17, 2005.

Jae H. Song, Santosh S. Venkatesh, PhD,
Emily A. Conant, MD, Peter H. Arger, MD, Chandra M. Sehgal, PhD,
``Comparative
Analysis of Logistic Regression and Artificial Neural Network
for Computer-Aided Diagnosis of Breast Masses,'' *Academic
Radiology*, vol.~12, pp.~487--495, 2005.

D. Psaltis, S. S. Venkatesh, and E. G.
Paek, ``Optical Image Correlation with a Binary Spatial Light
Modulator,'' *Optical Engineering*, vol. 23, no. 6, pp. 698-704,
1984.

D. Psaltis, J. Hong, and S. S. Venkatesh,
``Shift Invariance in Optical Associative Memories,'' in *Proceedings
of SPIE: First Annual Symposium on Optoelectronics and Laser Applications*,
Los Angeles, California, 1986.

R. J. McEliece, E. C. Posner, E. R. Rodemich,
and S. S. Venkatesh, ``The Capacity of the Hopfield Associative
Memory,'' *IEEE Transactions on Information Theory*, vol.
IT-33, pp. 461-482, 1987.

S. S. Venkatesh, D. Psaltis, and G. Sirat,
``A Class of Spectral Algorithms for Neural Associative Memory,''
*IEEE International Symposium on Information Theory*, Kobe,
Japan, June 1988.

S. S. Venkatesh and D. Psaltis, ``A General
Characterisation of Rotation-Invariant Image Classifiers,'' *IEEE
International Symposium on Information Theory*, Kobe, Japan,
June 1988.

D. Psaltis and S. S. Venkatesh, ``Information
Storage in Fully Interconnected Networks,'' in *Evolution, Learning,
and Cognition*, (ed. Y. C. Lee). Teaneck, New Jersey: World
Scientific, 1989.

S. S. Venkatesh and D. Psaltis, ``Binary
Filters for Pattern Classification,'' *IEEE Transactions on
Acoustics, Speech, Signal Processing*, vol. ASSP-37, pp. 604-611,
1989.

S. S. Venkatesh and D. Psaltis, ``Linear and Logarithmic Capacities
in Associative Neural Networks,'' *IEEE Transactions on
Information Theory*, vol. IT-35, pp. 558-568, 1989.

S. S. Venkatesh, G. Pancha, D. Psaltis,
and G. Sirat, ``Shaping Attraction Basins in Neural Networks,''
*Neural Networks*, vol. 3, no. 6, pp. 613-624, 1990.

S. S. Venkatesh and P. Baldi, ``Programmed
Interactions in Higher-Order Neural Networks: Maximal Capacity,''
*Journal of Complexity*, vol. 7, no. 3, pp. 316-337, 1991.

S. S. Venkatesh and P. Baldi, ``Programmed
Interactions in Higher-Order Neural Networks: The Outer-Product
Algorithm,'' *Journal of Complexity*, vol. 7, no. 4, pp.
443-479, 1991.

R. Snapp, D. Psaltis, and S. S. Venkatesh,
``Asymptotic Slowing Down of the Nearest Neighbour Classifier,''
*Conference on Neural Information Processing Systems*, Denver,
Colorado, November 1990; reprinted in *Advances in Neural Information
Processing Systems 3*, (eds. D. S. Touretzky and R. Lippman).
San Mateo, California: Morgan Kaufmann, 1991.

S. Biswas and S. S. Venkatesh, ``The
Devil and the Network: What Sparsity Implies to Robustness and
Memory,'' *Conference on Neural Information Processing Systems*,
Denver, Colorado, November 1990; reprinted in *Advances in Neural
Information Processing Systems 3*, (eds. D. S. Touretzky and
R. Lippman). San Mateo, California: Morgan Kaufmann, 1991.

S. S. Venkatesh, R. Snapp, and D. Psaltis,
``Bellman Strikes Again--The Rate of Growth of Sample Complexity
with Dimension for the Nearest Neighbour Classifier,'' *Workshop
on Computational Learning Theory*, University of Pittsburgh,
Pittsburgh, Pennsylvania, July 1992; reprinted in *Proceedings
of the Fifth Workshop on Computational Learning Theory*. Baltimore,
Maryland: ACM Press, 1992.

J. Ratsaby and S. S. Venkatesh, ``Learning
with Few Labelled Examples,'' *Conference on Neural Information
Processing Systems*, Denver, Colorado, November 1992.

S. S. Venkatesh, ``Computation and Learning
in the Context of Neural Network Capacity,'' in *Neural Networks
for Perception*, (ed. H. Wechsler). New York: Academic Press,
1992.

D. Psaltis, R. Snapp, and S. S. Venkatesh,
``On the Finite Sample Performance of the Nearest Neighbour Classifier,''
*IEEE International Symposium on Information Theory*, San
Antonio, Texas, January 1993; reprinted in *Proceedings 1993
IEEE International Symposium on Information Theory*. Piscataway,
New Jersey: IEEE Press, 1993.

G. Pancha and S. S. Venkatesh, ``Feature
and Memory Selective Error Correction in Neural Associative Memory,''
in *Associative Neural Memories: Theory and Implementation*
(ed. M. H. Hassoun). New York: Oxford University Press, 1993.

R. R. Snapp and S. S. Venkatesh, ``Asymptotic
Predictions of the Finite-Sample Risk of the $k$-Nearest Neighbor
Classifier,'' *Proceedings of the 12th International Conference
on Pattern Recognition*, vol. 2, pp. 1-7. Los Alamitos, California:
IEEE Computer Society Press, 1994.

D. Psaltis, R. Snapp, and S. S. Venkatesh,
``On the Finite Sample Performance of the Nearest Neighbour Algorithm,''
*IEEE Transactions on Information Theory*, vol. IT-40, pp.
820-837, 1994.

J. Ratsaby and S. S. Venkatesh, ``Learning
from a Mixture of Labelled and Unlabelled Examples with Parametric
Side-Information,'' *Workshop on Computational Learning Theory*,
University of California, Santa Cruz, California, July 1995; reprinted
in *Proceedings of the Eighth Annual Workshop on Computational
Learning Theory*. Baltimore, Maryland: ACM Press, 1995.

R. R. Snapp and S. S. Venkatesh, ``$k$-Nearest
Neighbors in Search of a Metric,'' *IEEE International Symposium
on Information Theory*, Whistler, Canada, September 1995; reprinted
in *Proceedings 1995 IEEE International Symposium on Information
Theory*. Piscataway, New Jersey: IEEE Press, 1995.

J. Ratsaby and S. S. Venkatesh, ``The
Complexity of Learning from a Mixture of Labelled and Unlabelled
Examples,'' in *Proceedings of the Thirty-third Annual Allerton
Conference on Communication, Control, and Computing*, Allerton,
Illinois, October 1995.

S. S. Venkatesh, ``Connectivity and Capacity
in the Hebb Rule,'' in *Advances in Neural Networks*, (eds.
A. Orlitsky, V. Roychoudhury, and S. Siu). New York: Kluver, 1995.

R. R. Snapp and S. S. Venkatesh, ``Asymptotic
Expansions of the k-Nearest Neighbor Risk,'' *Annals of Statistics*,
vol. 26, no. 3, pp. 850-878, 1998.

S. R. Kulkarni, G. Lugosi, and S. S.
Venkatesh, ``Learning Pattern Classification--A Survey,'' *IEEE
Transactions on Information Theory, Special Commemorative Issue
1948-1998*, vol. 44, no. 6, pp. 2178-2206, 1998.

S. S. Venkatesh and J. Ratsaby, ``On
Partially Blind Learning Complexity,'' *Special Session on Statistical
Learning, ISCAS 2000*, Geneva, May 28-31, 2000.

Jae H. Song, Santosh S. Venkatesh, Emily.
A. Conant, Peter H. Arger, and Chandra M. Sehgal, ``Artificial
Neural Network to aid differentiation between malignant and benign
breast masses by Ultrasound Imaging," *Ultrasonic Imaging
and Signal Processing, SPIE Conference on Medical Imaging*,
San Diego, California, February 12--17, 2005.

Jae H. Song, Santosh S. Venkatesh, PhD,
Emily A. Conant, MD, Peter H. Arger, MD, Chandra M. Sehgal, PhD,
``Comparative
Analysis of Logistic Regression and Artificial Neural Network
for Computer-Aided Diagnosis of Breast Masses,'' *Academic
Radiology*, vol.~12, pp.~487--495, 2005.

D. Psaltis, J. Hong, and S. S. Venkatesh,
``Shift Invariance in Optical Associative Memories,'' in *Proceedings
of SPIE: First Annual Symposium on Optoelectronics and Laser Applications*,
Los Angeles, California, 1986.

S. S. Venkatesh, ``Computation with Neural
Networks,'' *Proceedings of the Ninth Annual Conference on Engineering
in Medicine and Biology*, Boston, Massachusetts, 1987, pp.
1364-1365.

*IEEE Transactions on Information Theory*, vol.
IT-33, pp. 461-482, 1987.

S. S. Venkatesh, D. Psaltis, and G. Sirat,
``A Class of Spectral Algorithms for Neural Associative Memory,''
*IEEE International Symposium on Information Theory*, Kobe,
Japan, June 1988.

*IEEE Transactions on
Information Theory*, vol. IT-35, pp. 558-568, 1989.

S. S. Venkatesh, ``Computation and Learning
in Neural Networks with Binary Weights,'' *IEEE International
Symposium on Information Theory*, San Diego, California, January
1990.

S. S. Venkatesh, G. Pancha, D. Psaltis,
and G. Sirat, ``Shaping Attraction Basins in Neural Networks,''
*Neural Networks*, vol. 3, no. 6, pp. 613-624, 1990.

*Journal of Complexity*, vol. 7, no. 3, pp. 316-337, 1991.

*Journal of Complexity*, vol. 7, no. 4, pp.
443-479, 1991.

R. Snapp, D. Psaltis, and S. S. Venkatesh,
``Asymptotic Slowing Down of the Nearest Neighbour Classifier,''
*Conference on Neural Information Processing Systems*, Denver,
Colorado, November 1990; reprinted in *Advances in Neural Information
Processing Systems 3*, (eds. D. S. Touretzky and R. Lippman).
San Mateo, California: Morgan Kaufmann, 1991.

*Conference on Neural Information Processing Systems*,
Denver, Colorado, November 1990; reprinted in *Advances in Neural
Information Processing Systems 3*, (eds. D. S. Touretzky and
R. Lippman). San Mateo, California: Morgan Kaufmann, 1991.

S. S. Venkatesh, ``On Learning Binary
Weights for Majority Functions,'' *Workshop on Computational
Learning Theory*, University of California, Santa Cruz, California,
August 1991; reprinted in *Proceedings of the Fourth Workshop
on Computational Learning Theory*, (eds. L. G. Valiant and
M. K. Warmuth). San Mateo, California: Morgan Kaufmann, 1991.

S. S. Venkatesh, R. Snapp, and D. Psaltis,
``Bellman Strikes Again--The Rate of Growth of Sample Complexity
with Dimension for the Nearest Neighbour Classifier,'' *Workshop
on Computational Learning Theory*, University of Pittsburgh,
Pittsburgh, Pennsylvania, July 1992; reprinted in *Proceedings
of the Fifth Workshop on Computational Learning Theory*. Baltimore,
Maryland: ACM Press, 1992.

J. Ratsaby and S. S. Venkatesh, ``Learning
with Few Labelled Examples,'' *Conference on Neural Information
Processing Systems*, Denver, Colorado, November 1992.

*Neural Networks
for Perception*, (ed. H. Wechsler). New York: Academic Press,
1992.

D. Psaltis, R. Snapp, and S. S. Venkatesh,
``On the Finite Sample Performance of the Nearest Neighbour Classifier,''
*IEEE International Symposium on Information Theory*, San
Antonio, Texas, January 1993; reprinted in *Proceedings 1993
IEEE International Symposium on Information Theory*. Piscataway,
New Jersey: IEEE Press, 1993.

S. C. Fang and S. S. Venkatesh, ``On
the Average Tractability of Binary Integer Programming and the
Curious Transition to Perfect Generalisation in Learning Majority
Functions,'' *Workshop on Computational Learning Theory*,
University of California, Santa Cruz, California, July 1993; reprinted
in *Proceedings of the Sixth Workshop on Computational Learning
Theory*. Baltimore, Maryland: ACM Press, 1993.

B. Sarath and S. S. Venkatesh, ``Auditor
Liability for Management Fraud,'' *Fifth Annual Conference on
Intelligent Systems in Accounting, Finance, and Management*,
Palo Alto, California, November 1993.

C. Wang, S. J. Judd, and S. S. Venkatesh,
``When to Stop: On Optimal Stopping and Effective Machine Size
in Learning,'' *Conference on Neural Information Processing
Systems*, Denver, Colorado, November 1993.

G. Pancha and S. S. Venkatesh, ``Feature
and Memory Selective Error Correction in Neural Associative Memory,''
in *Associative Neural Memories: Theory and Implementation*
(ed. M. H. Hassoun). New York: Oxford University Press, 1993.

S. S. Venkatesh, ``Directed Drift: A
New Linear Threshold Algorithm for Learning Binary Weights On-Line,''
*Journal of Computer and Systems Sciences*, vol. 46, no.
2, pp. 198-217, 1993.

R. R. Snapp and S. S. Venkatesh, ``Asymptotic
Predictions of the Finite-Sample Risk of the $k$-Nearest Neighbor
Classifier,'' *Proceedings of the 12th International Conference
on Pattern Recognition*, vol. 2, pp. 1-7. Los Alamitos, California:
IEEE Computer Society Press, 1994.

C. Wang and S. S. Venkatesh, ``Machine
Size Selection for Optimal Generalisation,'' *Workshop on Applications
of Descriptional Complexity to Inductive, Statistical, and Visual
Inference*, New Brunswick, New Jersey, July 1994.

D. Psaltis, R. Snapp, and S. S. Venkatesh,
``On the Finite Sample Performance of the Nearest Neighbour Algorithm,''
*IEEE Transactions on Information Theory*, vol. IT-40, pp.
820-837, 1994.

C. Wang and S. S. Venkatesh, ``Temporal
Dynamics of Generalization in Neural Networks,'' *Conference
on Neural Information Processing Systems*, Denver, Colorado,
November 1994; reprinted in *Advances in Neural Information
Processing Systems 7*, (eds. D. S. Touretzky, G. Tesauro, and
T. K. Leen). Cambridge, MA: MIT Press, 1995.

J. Ratsaby and S. S. Venkatesh, ``Learning
from a Mixture of Labelled and Unlabelled Examples with Parametric
Side-Information,'' *Workshop on Computational Learning Theory*,
University of California, Santa Cruz, California, July 1995; reprinted
in *Proceedings of the Eighth Annual Workshop on Computational
Learning Theory*. Baltimore, Maryland: ACM Press, 1995.

C. Wang and S. S. Venkatesh, ``Criteria
for Approximation Error and Complexity Trade-Off in Learning,''
in *Workshop on Computational Learning Theory*, University
of California, Santa Cruz, California, July 1995; reprinted in
*Proceedings of the Eighth Annual Workshop on Computational
Learning Theory*. Baltimore, Maryland: ACM Press, 1995.

R. R. Snapp and S. S. Venkatesh, ``$k$-Nearest
Neighbors in Search of a Metric,'' *IEEE International Symposium
on Information Theory*, Whistler, Canada, September 1995; reprinted
in *Proceedings 1995 IEEE International Symposium on Information
Theory*. Piscataway, New Jersey: IEEE Press, 1995.

C. Wang, S. S. Venkatesh, and J. S. Judd,
``Optimal Stopping and Effective Machine Complexity in Learning,''
*IEEE International Symposium on Information Theory*, Whistler,
Canada, September 1995; reprinted in *Proceedings 1995 IEEE
International Symposium on Information Theory*. Piscataway,
New Jersey: IEEE Press, 1995.

S. C. Fang and S. S. Venkatesh, ``On
Batch Learning in a Binary Weight Setting,'' *IEEE International
Symposium on Information Theory*, Whistler, Canada, September
1995; reprinted in *Proceedings 1995 IEEE International Symposium
on Information Theory*. Piscataway, New Jersey: IEEE Press,
1995.

J. Ratsaby and S. S. Venkatesh, ``The
Complexity of Learning from a Mixture of Labelled and Unlabelled
Examples,'' in *Proceedings of the Thirty-third Annual Allerton
Conference on Communication, Control, and Computing*, Allerton,
Illinois, October 1995.

*Advances in Neural Networks*, (eds.
A. Orlitsky, V. Roychoudhury, and S. Siu). New York: Kluver, 1995.

S. C. Fang and S. S. Venkatesh, ``Learning
Finite Binary Sequences from Half-Space Data,'' in *Proceedings
of the International Conference on Neural Networks*, Perth,
Australia, November 1996.

S. C. Fang and S. S. Venkatesh, ``Learning
Binary Perceptrons Perfectly Efficiently,'' *Journal of Computer
and Systems Sciences*, vol. 52, no. 2, pp. 374-389, 1996.

S. C. Fang and S. S. Venkatesh, ``A Threshold
Function for Harmonic Update,'' *SIAM Journal of Discrete Mathematics*,
vol. 10, no. 3, pp. 482-498, 1997.

S. C. Fang and S. S. Venkatesh, ``The
Capacity of Majority Rule,'' *Random Structures and Algorithms*,
vol. 12, pp. 83-109, 1998.

R. R. Snapp and S. S. Venkatesh, ``Asymptotic
Expansions of the k-Nearest Neighbor Risk,'' *Annals of Statistics*,
vol. 26, no. 3, pp. 850-878, 1998.

S. R. Kulkarni, G. Lugosi, and S. S.
Venkatesh, ``Learning Pattern Classification--A Survey,'' *IEEE
Transactions on Information Theory, Special Commemorative Issue
1948-1998*, vol. 44, no. 6, pp. 2178-2206, 1998.

S. C. Fang and S. S. Venkatesh, ``Learning
Finite Binary Sequences from Half-Space Data,'' *Random Structures
and Algorithms*, vol. 14, pp. 345-381, 1999.

D. Psaltis, E. G. Paek, and S. S. Venkatesh,
``Acousto-Optic/CCD Image Processor,'' *Proceedings of the International
Optical Computing Conference*, MIT, Cambridge, Massachusetts,
pp. 204-208, 1983.

D. Psaltis, S. S. Venkatesh, and E. G.
Paek, ``Optical Image Correlation with a Binary Spatial Light
Modulator,'' *Optical Engineering*, vol. 23, no. 6, pp. 698-704,
1984.

*Proceedings
of SPIE: First Annual Symposium on Optoelectronics and Laser Applications*,
Los Angeles, California, 1986.