University of Leicester

informatics

Publications in Algorithms and Complexity 2003

  1. R. Bruce, M. Hoffmann, D. Krizanc and R. Raman. Efficient update strategies for geometric computing with uncertainty. In Proceedings of the 5th Conference on Algorithms and Complexity (CIAC 2003), LNCS 2653, pp. 12-23, 2003.
  2. Stefan S. Dantchev and Soren Riis. On Relativisation and Complexity Gap. In Proceedings of CSL 2003, LNCS 2803, pp. 142-154, 2003.
  3. H. Doostie, R. Gholamie and R. M. Thomas, Certain extensions of (l, m | n, k)-groups. Southeast Asian Bulletin of Mathematics 27 (2003), pp. 21-34.
  4. M. Hoffmann and R. M. Thomas. Notions of automaticity in semigroups. Semigroup Forum 66 (2003), 337-367.
  5. J. I. Munro, R. Raman, V. Raman and S. Srinivasa Rao. Succinct representations of permutations. In Proceedings of the 30th International Colloquium on Automata; Languages and Computation (ICALP 2003), LNCS 2719, pp. 357-368, 2003.
  6. Antonio Puricella and Iain A. Stewart. Greedy algorithms, H-colourings and a complexity-theoretic dichotomy. Theoretical Computer Science, 290(3), pp. 1897-1913, 2003
  7. N. Rahman. Algorithms for Hardware Caches and TLB. In Algorithms for Memory Hierarchies, Advanced Lectures. U. Meyer, P. Sanders and J. Sibeyn (editors). Springer LNCS 2625, pp. 171-192, 2003.
  8. R. Raman and S. Srinivasa Rao. Succinct dynamic dictionaries and trees. In Proceedings of the 30th International Colloquium on Automata; Languages and Computation (ICALP 2003), LNCS 2719, pp. 345-356, 2003.
  9. G. Rosenberger, M. Scheer and R. M. Thomas. Finite generalized tetrahedron groups with a cubic relator. In C. M. Campbell, E. F. Robertson and G. C. Smith (editors), Groups St Andrews 2001 in Oxford, 2 (London Mathematical Society Lecture Note Series 305, Cambridge University Press, 2003), pp. 455-486.
  10. S. Yang. Statistics-based Adaptive Non-Uniform Mutation for Genetic Algorithms. In E. Cantu-Paz, J.A. Foster, K. Deb, L. D. Davis, R. Roy, U.-M. O'Reilly, H.-G. Beyer, R. Standish, G. Kendall, S. Wilson, M. Harman, J. Wegener, D. Dasgupta. M. A. Potter, A. C. Schultz, K. A. Dowsland, N. Jonoska, and J. Miller (editors), Proceedings of the Genetic and Evolutionary Computation Conference - GECCO 2003, pp. 1618-1619, 2003. Berlin: Springer-Verlag (LNCS 2724).
  11. S. Yang. Adaptive mutation using statistics mechanism for genetic algorithms. In F. Coenen, A. Preece and A. Macintosh (editors). Research and Development in Intelligent Systems XX (2003), pp. 19-32. London: Springer-Verlag.
  12. S. Yang. PDGA: the primal-dual genetic algorithm. In A. Abraham, M. Koppen and K. Franke (editors), Design and Application of Hybrid Intelligent Systems, pp. 214-223, 2003. IOS Press.
  13. S. Yang. Non-stationary problem optimization using the primal-dual genetic algorithm. In R. Sarker, R. Reynolds, H. Abbass, K.-C. Tan, R. McKay, D. Essam and T. Gedeon (editors), Proceedings of the 2003 Congress on Evolutionary Computation, 3, pp. 2246-2253, 2003.
  14. S. Yang and X. Yao. Dual population-based incremental learning for problem optimization in dynamic environments. In M. Gen et. al. (editors), Proceedings of the 7th Asia Pacific Symposium on Intelligent and Evolutionary Systems, pp. 49-56, 2003.

Author: Rajeev Raman (r.raman at mcs.le.ac.uk), T: +44 (0)116 252 3894.
University of Leicester January 2003. Last modified: 16th September 2004, 11:28:10.
Informatics Web Maintainer. This document has been approved by the Head of Department.