Journal Publications
Neural Networks
Theory
X. Wang, A. Jagota, F. Botelho, M. Garzon.
Absence of Cycles in Symmetric Neural Networks. Neural
Computation,10(5), 1998. PDF | http://citeseer.nj.nec.com/wang95absence.html
A. Jagota. Hopfield Neural Networks and
Self-Stabilization, Chicago Journal of Theoretical Computer
Science. online info
Associative Memories
N. Duffy, A. Jagota. Connectionist Password
Quality Tester. IEEE Transactions on Knowledge and Data
Engineering, 14(4), 920-922, 2002. PDF, manuscript
A. Jagota, G. Narasimhan, K.W. Regan.
Information Capacity of Binary-Weights Associative Memories.
Neurocomputing,19(1-3), 1998. http://citeseer.nj.nec.com/jagota96information.html
A. Jagota, J. Mandziuk, Experimental Study of
Perceptron-type Local Learning Rule for Hopfield Associative
Memory, Information Sciences, 111, 65-81, 1998. http://citeseer.nj.nec.com/8193.html
A. Jagota, J. Ueberla, and D. Kaznachey, A Hybrid
Connectionist Associative Memory with Perfect Storage, Fuzzy Sets
and Systems,1995.
J. Ueberla, A. Jagota, Integrating Neural and
Symbolic Approaches: A Symbolic Learning Scheme for a
Connectionist Associative Memory, Connection Science, 5(3-4), p.
377--393, 1994.
A. Jagota, A Hopfield-Style Network with a
Graph-Theoretic Characterization, Journal of Artificial Neural
Networks, 1(1), p. 145--166, 1994.
A. Jagota, Contextual Word Recognition Using a
Hopfield-style Net, Neural, Parallel, and Scientific
Computations, 2(2), p. 245--271, 1994.
Optimization
D. Kaznachey, A. Jagota, S. Das. Neural network-based heuristic algorithms for hypergraph coloring problems with applications.
Journal of Parallel and Distributed Computing, 63(9), September 2003, 786--800.
A. Jagota, Approximating Maximum Clique with a
Hopfield Network. IEEE Transactions on Neural Networks , 6(3),
1995. http://citeseer.nj.nec.com/jagota95approximating.html
A. Diblas, A. Jagota, R. P. Hughey. Energy
function based approaches to graph coloring, IEEE Transactions of
Neural Networks, to appear. PDF
A. Jagota, K.W. Regan. Performance of Neural
Net Heuristics for Maximum Clique on Diverse Highly Compressible
Graphs, Journal of Global Optimization, 7, p. 1--26, 1997.
A. Jagota, L. Sanchis, Adaptive, Randomized
Restart Heuristics for Maximum Clique, Journal of Heuristics, to
appear. PDF
L. Sanchis, A. Jagota, Some Experimental and
Theoretical Results on Test Case Generators for the Maximum
Clique Problem, INFORMS Journal on Computing, 1996. PDF
A. Jagota, An Adaptive, Multiple Restarts Neural
Network Algorithm for Graph Coloring, European Journal of
Operational Research, 93, p. 257--270, 1996
D. Kaznachey, A. Jagota, Approximating Minimum
Set Cover in a Hopfield-style Network, Information Sciences,
1996.
M. Pelillo ,A. Jagota, Feasible and Infeasible Maxima
in a Quadratic Program for the Maximum Clique Problem, Journal of
Artificial Neural Networks ,1995. http://citeseer.nj.nec.com/pelillo95feasible.html
Discrete Math
A. Jagota, G. Narasimhan, L. Soltes, A
Generalization of Maximal Independent Sets, Discrete Applied
Mathematics. PDF
A. Gyarfas, A. Jagota, R.H. Schelp,
Monochromatic Path Covers in Nearly Complete Graphs, Journal of
Combinatorial Mathematics and Combinatorial Computing.
P. Erdos, R. Faudree, A. Jagota, T. Luczak, Large
Subgraphs of Minimal Density or Degree, Journal of Combinatorial
Mathematics and Combinatorial Computing, 22, p. 87--96, 1996.