Web Access Research Portal

Individual Researchers Report

Researcher Bio

Researcher:Dr AV Kelarev
Commenced:1/7/1994    Ceased: 1/4/2007
Personal URL:Visit my personal web page

Citations sourced from WOS® and Scopus

Top 3 Fields of Research
Algebra and number theory
Coding, information theory and compression
Information retrieval and web search
Top 3 Research Objectives
Expanding knowledge in the mathematical sciences
Computer, electronic and communication equipment
Voice and data equipment

Research Funding

AdministeredResearch TeamInitial YearDuration (Years)Funding Body/ClientTitle of ProjectTotal Cash $Total In-Kind $
University of TasmaniaProfessor BH Kang; Dr AV Kelarev; Professor AHJ Sale; Dr RC Elliott; Dr DA Steane20052University of Tasmania: Grant-Institutional Research SchemeClassification Rules and Algorithms for Analysis of DNA Sequences15,000
University of TasmaniaDr AV Kelarev; Dr SJ Quinn20043Australian Research Council: Grant-Discovery ProjectsRing Constructions and Algorithms for Enhancing Performance of BCH Codes60,000
University of TasmaniaDr AV Kelarev20021University of Tasmania: Grant-Institutional Research SchemeMatrix Ring Approach To Efficient Error-Correcting Codes12,000
University of TasmaniaDr AV Kelarev20001Australian Research Council: Grant-SmallGraph Algebras, Shortest Path Algorithms and Applications to Geographic Information Systems6,000
University of TasmaniaDr AV Kelarev19991Australian Research Council: Grant-SmallApplications of Inverse Semigroups to Error-correcting Codes16,000
University of TasmaniaDr BJ Gardner; Dr AV Kelarev19971Australian Research Council: Grant-SmallGraded rings and applications to codes.8,300
University of TasmaniaDr AV Kelarev19961Australian Research Council: Grant-SmallAlgorithms for computing the radical of abelian group graded rings14,000
University of TasmaniaDr AV Kelarev19951University of Tasmania: Grant-School of Science & TechnologyNullstellensatz for graded PI-algebras11,000

Graduate Research Supervision (Current)

No records found.

Graduate Research Supervision (Graduands)

NameDegreeCompletedSupervisionCommencedCeasedTitle
Jilyana CazaranPhD6/10/1998Primary Supervisor1/1/19923/8/1998Artinian rings, finite principal ideal rings and algebraic error-correcting codes
Allison PlantPhD12/5/2008Primary Supervisor1/9/20066/8/2007Structural and Combinatorial Aspects of Graded Rings with Applications
Stephen John QuinnPhD15/10/2002Primary Supervisor1/2/199914/10/2002Directed graphs and combinatorial properties of groups and semigroups
Philip James UrenPhD4/9/2009Associate Supervisor7/2/20052/4/2007In Silico Detection and Characterisation of Biological Regulatory Elements

Career Best Publications

Journal Article
Kelarev, AV, “A Statistical Algorithm for Computing Information Rates of Codes with Computer Algebra Systems”, Advances and Applications in Statistics, 5 (1) pp. 87-90. ISSN 0972-3617 (2005) [Refereed Article] [Detail]
Kelarev, AV, “On the Structure of Incidence Rings of Group Automata”, International Journal of Algebra and Computation, 14 (4) pp. 505-511. doi:10.1142/S0218196704001888 ISSN 0218-1967 (2004) [Refereed Article] [Detail]
Kelarev, AV and Sokratova, OV*, “On congruences of automata defined by directed graphs”, Theoretical Computer Science, 301 (1-3) pp. 31-43. doi:10.1016/S0304-3975(02)00544-3 ISSN 0304-3975 (2003) [Refereed Article] [Full Text] [Detail]
Book
Kelarev, AV, Ring Constructions and Applications, World Scientific, New Jersey, London, Singapore, Hong Kong, pp. 160. ISBN 981-02-4745-1 (2002) [Authored Research Book] [Detail]
Conference Publication
Kelarev, AV, “A Polynomial Algorithm for Codes Based on Directed Graphs”, Proceedings of the 12th Computing: The Australasian Theory Symposium (CATS2006), 16-19 January 2006, Hobart, Tasmania, pp. 87-92. ISBN 1-920682-33-3 (2006) [Refereed Conference Paper] [Detail]
Kelarev, AV and Sokratova, OV, “Information Rates and Weights of Codes in Structural Matrix Rings”, Lecture Notes in Computer Science, November 26-30, 2001, Melbourne, pp. 151-158. ISBN 3-540-42911-5 (2001) [Refereed Conference Paper] [Detail]
Kelarev, AV and Quinn, SJ and Smolikova, R*, “On fuzzy regular languages”, AISAT 2000 Proceedings, 17-20 December 2000, Hobart, pp. 291-295. (2000) [Refereed Conference Paper] [Detail]

* This author is not affiliated with the University of Tasmania.

Research Publications

Journal Article
Alfaro, R* and Kelarev, AV, “On Cyclic Codes in Incidence Rings”, Studia Scientiarum Mathematicarum Hungarica, 43 (1) pp. 69-77. doi:10.1556/SScMath.43.2006.1.5 ISSN 0081-6906 (2006) [Refereed Article] [Detail]
Cazaran, J* and Kelarev, AV and Quinn, SW and Vertigan, D*, “An Algorithm for Computing the Minimum Distances of Extensions of BCH Codes Embedded in Semigroup Rings ”, Semigroup Forum, 73 (3) pp. 317-329. doi:10.1007/s00233-006-0647-9 ISSN 0037-1912 (2006) [Refereed Article] [Detail]
Kelarev, AV, “On Cayley Graphs of Inverse Semigroups”, Semigroup Forum, 72 (3) pp. 411-418. doi:10.1007/s00233-005-0526-9 ISSN 0037-1912 (2006) [Refereed Article] [Detail]
Kelarev, AV, “A new data structure for the engine of computer games programming”, Ultra Scientist of Physical Sciences, 18 (2) pp. 382-384. ISSN 0970-9150 (2006) [Refereed Article] [Detail]
Kelarev, AV, “Computing Statistics for Polynomial Codes: An Algorithm Based on the Mann-Whitney U-Test”, Advances and Applications in Statistics, 6 (1) pp. 53-56. ISSN 0972-3617 (2006) [Refereed Article] [Detail]
Kelarev, AV, “Algorithms for computing parameters of graph-based extensions of BCH codes”, Journal of Discrete Algorithms, 5 (3) pp. 553-563. doi:10.1016/j.jda.2006.08.002 ISSN 1570-8667 (2006) [Refereed Article] [Detail]
Alfaro, R* and Kelarev, AV, “Recent results on Ring Constructions for Error-Correcting Codes”, Contemporary Mathematics, 376 pp. 1-12. ISSN 0271-4132 (2005) [Refereed Article] [Detail]
Kelarev, AV, “Directed graphs and Lie superalgebras of matrices”, Journal of Algebra, 285 (1) pp. 1-10. doi:10.1016/j.jalgebra.2004.12.007 ISSN 0021-8693 (2005) [Refereed Article] [Full Text] [Detail]
Kelarev, AV, “A Statistical Algorithm for Computing Information Rates of Codes with Computer Algebra Systems”, Advances and Applications in Statistics, 5 (1) pp. 87-90. ISSN 0972-3617 (2005) [Refereed Article] [Detail]
Kelarev, AV and Miller, M* and Sokratova, O*, “Languages recognized by two-sided automata of graphs”, Estonian Academy of Sciences. Proceedings. Physics. Mathematics, 54 (1) pp. 46-54. ISSN 1406-0086 (2005) [Refereed Article] [Detail]
Araujo, IM* and Kelarev, AV and Solomon, A*, “An Algorithm for Commutative Semigroup Algebras Which are Principal Ideal Rings”, Communications in Algebra, 32 (4) pp. 1237-1254. doi:10.1081/AGB-120028778 ISSN 0092-7872 (2004) [Refereed Article] [Detail]
Bereg, S* and Kelarev, AV and Salagean, A*, “Directed graphs and minimum distances of error-correcting codes in matrix rings”, New Zealand Journal of Mathematics, 33 pp. 113-119. ISSN 1171-6096 (2004) [Refereed Article] [Detail]
Dascalescu, S* and Jarvis, PD and Kelarev, AV and Nastasescu, C*, “On Associative Superalgebras of Matrices”, Rocky Mountain Journal of Mathematics, 34 (Number 2, Summer 2004) pp. 585-598. doi:10.1216/rmjm/1181069869 ISSN 0035-7596 (2004) [Refereed Article] [Detail]
Kelarev, AV and Quinn, SJ, “A combinatorial property and power graphs of semigroups”, Commentationes Mathematicae Universitatis Carolinae, 45 (1) pp. 1-7. ISSN 0010-2628 (2004) [Refereed Article] [Detail]
Kelarev, AV, “On the Structure of Incidence Rings of Group Automata”, International Journal of Algebra and Computation, 14 (4) pp. 505-511. doi:10.1142/S0218196704001888 ISSN 0218-1967 (2004) [Refereed Article] [Detail]
Kelarev, AV, “Labelled Cayley graphs and minimal automata”, Australasian Journal of Combinatorics, 30 pp. 95-101. ISSN 1034-4942 (2004) [Refereed Article] [Full Text] [Detail]
Kelarev, AV, “On group automata over finite fields”, Finite Fields and their Applications, 10 (1) pp. 65-71. doi:10.1016/S1071-5797(03)00043-1 ISSN 1071-5797 (2004) [Refereed Article] [Detail]
Bereg, SN* and Kelarev, AV, “An Algorithm for Analysis of Images in Spatial Information Systems1”, Journal of Automata, Languages and Combinatorics 8 (2003), 8 (4) pp. 557-565. ISSN 1430-189X (2003) [Refereed Article] [Detail]
Bespamyatnikh, S* and Kelarev, AV, “Algorithms for shortest paths and d-cycle problems”, Journal of Discrete Algorithms, 1 (1) pp. 1-9. doi:10.1016/S1570-8667(03)00002-9 ISSN 1570-8667 (2003) [Refereed Article] [Detail]
Kelarev, AV, “On Incidence Rings of Group Automata”, Bulletin of the Australian Mathematical Society, 67 (3) pp. 407-411. doi:10.1017/S0004972700037217 ISSN 0004-9727 (2003) [Refereed Article] [Detail]
Kelarev, AV and Quinn, SJ, “A Combinatorial Property and Cayley Graphs of Semigroups”, Semigroup Forum, 66 (1) pp. 89-96. doi:10.1007/s002330010162 ISSN 0037-1912 (2003) [Refereed Article] [Full Text] [Detail]
Kelarev, AV, “Minimum Distances of Error-Correcting Codes in Incidence Rings”, International Journal of Mathematics and Mathematical Sciences, 2003 (13) pp. 827-833. doi:10.1155/S0161171203204063 ISSN 0161-1712 (2003) [Refereed Article] [Detail]
Kelarev, AV and Praeger, CE*, “On transitive Cayley graphs of groups and semigroups”, European Journal of Combinatorics, 24 (1) pp. 59-72. doi:10.1016/S0195-6698(02)00120-8 ISSN 0195-6698 (2003) [Refereed Article] [Detail]
Kelarev, AV and Sokratova, OV*, “On congruences of automata defined by directed graphs”, Theoretical Computer Science, 301 (1-3) pp. 31-43. doi:10.1016/S0304-3975(02)00544-3 ISSN 0304-3975 (2003) [Refereed Article] [Full Text] [Detail]
Kelarev, AV, “An Algorithm for 3D Image Analysis”, Far East Journal of Applied Mathematics, 10 (1) pp. 49-53. ISSN 0972-0960 (2003) [Refereed Article] [Detail]
Fearnley-Sander, DP and Kelarev, AV and Stokes, T*, “Non-commutative Modal Rings and Internalized Equality”, Algebra Colloquium, 9 (1) pp. 65-80. ISSN 1005-3867 (2002) [Refereed Article] [Detail]
Kelarev, AV and Sokratova, OV*, “Two algorithms for languages recognized by graph algebras”, International Journal of Computer Mathematics, 79 (12) pp. 1317-1327. doi:10.1080/0020716021000049765 ISSN 0020-7160 (2002) [Refereed Article] [Detail]
Kelarev, AV and Quinn, SJ, “Directed Graphs and Combinatorial Properties of Semigroups”, Journal of Algebra, 251 (1) pp. 16-26. doi:10.1006/jabr.2001.9128 ISSN 0021-8693 (2002) [Refereed Article] [Detail]
Kelarev, AV, “An algorithm for repeated convex regions in geographic information systems”, Far East Journal of Applied Mathematics, 8 (1) pp. 75-79. ISSN 0972-0960 (2002) [Refereed Article] [Detail]
Kelarev, AV, “On undirected Cayley graphs”, Australasian Journal of Combinatorics, 25 pp. 73-78. ISSN 1034-4942 (2002) [Refereed Article] [Detail]
Kelarev, AV, “On Graded Rings and Varieties”, Fundamental and Applied Mathematics, 8 (3) pp. 721-727. ISSN 1560-5159 (2002) [Refereed Article] [Detail]
Dascalescu, S* and Kelarev, AV and Nastasescu, C*, “Semigroup gradings of upper triangular matrix rings”, Revue Roumaine de Mathematiques Pures et Appliquees, 46 (5) pp. 611-615. ISSN 0035-3965 (2001) [Refereed Article] [Detail]
Dascalescu, S* and Kelarev, AV and van Wyk, L*, “Semigroup gradings of full matrix rings”, Communications in Algebra, 29 (11) pp. 5023-5031. doi:10.1081/AGB-100106799 ISSN 0092-7872 (2001) [Refereed Article] [Detail]
Jespers, E and Kelarev, AV and Okninski, J, “On the Jacobson radical of graded rings”, Communications in Algebra, 29 (5) pp. 2185-2191. doi:10.1081/AGB-100002177 ISSN 0092-7872 (2001) [Refereed Article] [Detail]
Kelarev, AV and Quinn, SJ and Smolikova, R*, “Power graphs and semigroups of matrices”, Bulletin of the Australian Mathematical Society, 63 (2) pp. 341-344. doi:10.1017/S0004972700019390 ISSN 0004-9727 (2001) [Refereed Article] [Detail]
Kelarev, AV, “On a theorem of Cohen and Montgomery for graded rings”, Proceedings of the Royal Society of Edinburgh, Section A, 131 pp. 1163-1166. doi:10.1017/S0308210500001311 ISSN 0308-2105 (2001) [Refereed Article] [Detail]
Kelarev, AV and Sokratova, OV, “Languages Recognised by a Class of Finite Automata”, Acta Cybernetica, 15 (1) pp. 45-52. ISSN 0324-721X (2001) [Refereed Article] [Detail]
Kelarev, AV and Stokes, TE*, “Rings Used in Modal Logic and Their Radicals”, Vietnam Journal of Mathematics, 29 (2) pp. 179-190. ISSN 0866-7179 (2001) [Refereed Article] [Detail]
Kelarev, AV and Sokratova, OV, “Directed graphs and syntactic algebras of tree languages”, Journal of Automata, Languages and Combinatorics, 6 (3) pp. 305-311. ISSN 1430-189X (2001) [Refereed Article] [Detail]
Kelarev, AV and Sokratova, OV, “A class of semisimple automata”, Journal of Applied Mathematics and Computing, 8 (1) pp. 1-8. doi:10.1007/BF03011618 ISSN 1598-5865 (2001) [Refereed Article] [Detail]
Kelarev, AV and Sokratova, OV, “Syntactic semigroups and graph algebras”, Bulletin of the Australian Mathematical Society, 62 (3) pp. 471-477. doi:10.1017/S0004972700018992 ISSN 0004-9727 (2000) [Refereed Article] [Detail]
Kelarev, AV, “Finiteness conditions and sums of rings”, Publicationes Mathematicae, 57 (1-2) pp. 115-119. ISSN 0033-3883 (2000) [Refereed Article] [Detail]
Kelarev, AV, “Varieties and sums of rings”, Contributions to Algebra and Geometry, 41 (2) pp. 325 - 328. ISSN 0138-4821 (2000) [Refereed Article] [Detail]
Kelarev, AV and Stokes, TE*, “Equality algebras and varieties”, Fundamental Applications in Mathematics, 6 pp. 1-5. ISSN 1560-5159 (2000) [Refereed Article] [Detail]
Cazaran, J and Kelarev, AV, “Semisimple Artinian graded rings”, Communications in Algebra, 27 (8) pp. 3863-3874. doi:10.1080/00927879908826669 ISSN 0092-7872 (1999) [Refereed Article] [Detail]
Cazaran, J and Kelarev, AV, “On finite principal ideal rings”, Acta Mathematicae Universitatis Comenianae, 68 (1) pp. 77-84. ISSN 0231-6986 (1999) [Refereed Article] [Detail]
Dascalescu, S and Kelarev, AV, “Finiteness conditions for semigroup-graded modules”, Revue Roumaine Math matiques Pures et Appliqu es, XLIV (1) pp. 37-50. ISSN 0035-3965 (1999) [Refereed Article] [Detail]
Kelarev, AV and Stokes, T*, “Interior algebras and varieties”, Journal of Algebra, 221 (1) pp. 50-59. doi:10.1006/jabr.1999.7939 ISSN 0021-8693 (1999) [Refereed Article] [Detail]
Kelarev, AV, “Band-graded rings”, Mathematica Japonica, 49 (3) pp. 467--479. ISSN 0025-5513 (1999) [Refereed Article] [Detail]
Kelarev, AV, “Semigroup rings which are finite direct products of Galois rings”, Semigroup Forum, 59 (3) pp. 467-469. doi:10.1007/s002339900065 ISSN 0037-1912 (1999) [Refereed Article] [Detail]
Kelarev, AV, “Semigroup varieties and semigroup algebras”, Semigroup Forum, 59 (3) pp. 461-466. doi:10.1007/s002339900064 ISSN 0037-1912 (1999) [Refereed Article] [Detail]
Kelarev, AV and Stokes, T*, “Central internal algebras and varieties”, Communications in Algebra, 27 (8) pp. 3851-3862. doi:10.1080/00927879908826668 ISSN 0092-7872 (1999) [Refereed Article] [Detail]
Kelarev, AV, “On rings with inverse adjoint semigroup”, Southeast Asian Bulletin of Mathematics, 23 (3) pp. 431-436. ISSN 0129-2021 (1999) [Refereed Article] [Detail]
Kelarev, AV, “Rings which are sums of finite fields”, Finite Fields and their Applications, 5 (1) pp. 89-95. doi:10.1006/ffta.1998.0240 ISSN 1071-5797 (1999) [Refereed Article] [Detail]
Kelarev, AV, “Two ring constructions and sums of fields”, New Zealand Journal of Mathematics, 28 (1) pp. 43-46. ISSN 1171-6096 (1999) [Refereed Article] [Detail]
Gardner, BJ and Kelarev, AV, “Two generalizations of T-nilpotence”, Algebra Colloquium, 5 (4) pp. 449-458. ISSN 1005-3867 (1998) [Refereed Article] [Detail]
Justin, J* and Kelarev, AV, “Factorizations of infinite sequences in semigroups”, Annali di Matematica Pura ed Applicata, 174 (1) pp. 87-96. doi:10.1007/BF01759367 ISSN 0373-3114 (1998) [Refereed Article] [Detail]
Kelarev, AV, “Semigroup rings in semisimple varieties”, Bulletin of Australian Mathematical Society, 57 (3) pp. 387-391. doi:10.1017/S0004972700031798 ISSN 0004-9727 (1998) [Refereed Article] [Detail]
Kelarev, AV, “An answer to a question of Kegel on sums of rings”, Canadian Mathematical Bulletin, 41 (1) pp. 79-80. doi:10.4153/CMB-1998-012-5 ISSN 0008-4395 (1998) [Refereed Article] [Detail]
Kelarev, AV and van der Merwe, B* and van Wyk, L*, “The minimum number of idempotent generators of an upper triangular matrix algebra”, Journal of Algebra, 205 (2) pp. 605-616. doi:10.1006/jabr.1997.7405 ISSN 0021-8693 (1998) [Refereed Article] [Detail]
Kelarev, AV, “Semisimple ring graded by inverse semigroups”, Journal of Algebra, 205 (2) pp. 451-459. doi:10.1006/jabr.1997.7391 ISSN 0021-8693 (1998) [Refereed Article] [Detail]
Kelarev, AV and Okninski, J, “A combinatorial property and growth for semigroups of matrices”, Communications in Algebra, 26 (9) pp. 2789-2805. doi:10.1080/00927879808826310 ISSN 0092-7872 (1998) [Refereed Article] [Detail]
Kelarev, AV, “Directed Graphs and Nilpotent Rings”, Journal of Australian Mathematical Society, 65 pp. 326-332. doi:10.1017/S1446788700035916 ISSN 0263-6115 (1998) [Refereed Article] [Detail]
Kelarev, AV, “Recent results and open questions on semigroup-graded rings”, Fundamental and Applied Mathematics, 4 (4) pp. 1115-1139. ISSN 1560-5159 (1998) [Refereed Article] [Detail]
Cazaran, J and Kelarev, AV, “Generators and weights of polynomial codes”, Archiv der Mathematik, 69 (6) pp. 479-486. doi:10.1007/s000130050149 ISSN 0003-889X (1997) [Refereed Article] [Detail]
Dascalescu, S and Kelarev, AV and Torrecillis, B*, “FBN Hopf module algebras”, Communications in Algebra, 25 (11) pp. 3521-3529. doi:10.1080/00927879708826067 ISSN 0092-7872 (1997) [Refereed Article] [Detail]
Gardner, BJ and Kelarev, AV, “Invariant radicals”, Proceedings of the Royal Society of Edinburgh, 127 pp. 773-780. doi:10.1017/S0308210500023817 ISSN 0308-2105 (1997) [Refereed Article] [Detail]
Kelarev, AV, “A primitive ring which is a sum of two Wedderburn radical subrings”, Proceedings of the American Mathematical Society, 125 (7) pp. 2191-2193. doi:10.1090/S0002-9939-97-04169-5 ISSN 0002-9939 (1997) [Refereed Article] [Detail]
Kelarev, AV, “On classical Krull dimension of group-graded rings”, Bulletin of the Australian Mathematical Society, 55 (2) pp. 255-259. doi:10.1017/S000497270003392X ISSN 0004-9727 (1997) [Refereed Article] [Detail]
Kelarev, AV and Pirillo, G*, “A note on rewritable products in groups and semigroups”, Bollettino Unione Mathematica Italiana, 11A (3) pp. 667-670. ISSN 0041-7084 (1997) [Refereed Article] [Detail]
Kelarev, AV, “Generalised radical semigroup rings”, Southeast Asian Bulletin of Mathematics, 21 pp. 85-90. ISSN 0129-2021 (1997) [Refereed Article] [Detail]
Kelarev, AV, “Radicals of algebras graded by cancellative linear semigroups”, Proceedings of the American Mathematical Society, 124 (1) pp. 61-65. doi:10.1090/S0002-9939-96-03036-5 ISSN 0002-9939 (1996) [Refereed Article] [Detail]
Kelarev, AV and Plant, A, “On rings with invariant radicals”, Bulletin of the Australian Mathematical Society, 53 (1) pp. 143-147. doi:10.1017/S0004972700016816 ISSN 0004-9727 (1996) [Refereed Article] [Detail]
Kelarev, AV and Okninski, J*, “The Jacobson Radical of Graded PI-Rings and Related Classes of Rings”, Journal of Algebra, 186 (3) pp. 818-830. doi:10.1006/jabr.1996.0397 ISSN 0021-8693 (1996) [Refereed Article] [Detail]
Kelarev, AV, “On left self distributive rings”, Acta Mathematicae Hungaricae, 71 (1-2) pp. 121-122. doi:10.1007/BF00052200 ISSN 0236-5294 (1996) [Refereed Article] [Detail]
Kelarev, AV, “On the structure of the Jacobson radical of graded rings”, Quaestiones Mathematicae, 19 pp. 331-340. (1996) [Refereed Article] [Detail]
Kelarev, AV and Shumyatsky, PV*, “Soluble and linear repetitive groups”, Bulletin of the Australian Mathematical Society, 52 (2) pp. 253-261. doi:10.1017/S0004972700014684 ISSN 0004-9727 (1995) [Refereed Article] [Detail]
Kelarev, AV and Okninski, J*, “On group graded rings satisfying polynomial identities”, Glasgow Mathematical Journal, 37 pp. 205-210. doi:10.1017/S0017089500031104 ISSN 0017-0895 (1995) [Refereed Article] [Detail]
Kelarev, AV, “On the description of radicals of semigroup rings of commutative semigroups”, Izvestiya Vysshikh Uchebnykh Zavedenii Matematika, 397 (6) pp. 37-41. ISSN 0021-3446 (1995) [Refereed Article] [Detail]
Kelarev, AV, “On groupoid graded rings”, Journal of Algebra, 178 (2) pp. 391-399. doi:10.1006/jabr.1995.1355 ISSN 0021-8693 (1995) [Refereed Article] [Detail]
Kelarev, AV, “Radicals of contracted graded rings”, Journal of Algebra, 176 (2) pp. 561-568. doi:10.1006/jabr.1995.1259 ISSN 0021-8693 (1995) [Refereed Article] [Detail]
Kelarev, AV and Clase, MV* and Jespers, J* and Okninski, J*, “Artinian semigroup-graded rings”, Bulletin of the London Mathematical Society., 27 pp. 441-446. doi:10.1112/blms/27.5.441 ISSN 0024-6093 (1995) [Refereed Article] [Detail]
Kelarev, AV and McConnell, NR, “Two versions of graded rings”, Publicationes Mathematicae - Debrecen, 47 (3-4) pp. 219-227. ISSN 0033-3883 (1995) [Refereed Article] [Detail]
Kelarev, AV, “Application of epigroups to graded ring theory”, Semigroup Forum, 50 (3) pp. 327-350. doi:10.1007/BF02573530 ISSN 0037-1912 (1995) [Refereed Article] [Detail]
Kelarev, AV and Plant, A, “Bergman's lemma for graded rings”, Communications in Algebra, 23 (12) pp. 4613-4624. doi:10.1080/00927879508825490 ISSN 0092-7872 (1995) [Refereed Article] [Detail]
Kelarev, AV, “Artinian band sums of rings”, Australian Mathematical Society. Journal. Series A. Pure Mathematics and Statistics, 58 pp. 66-72. doi:10.1017/S1446788700038106 ISSN 0263-6115 (1995) [Refereed Article] [Detail]
Kelarev, AV, “On the nilpotency of the Jacobson radical of semigroup rings”, Acta Mathematicae Universitatis Comenianae, 63 (1) pp. 161-166. ISSN 0231-6986 (1994) [Refereed Article] [Detail]
Book
Kelarev, AV, Graph Algebras and Automata, Marcel Dekker Inc, New York, pp. 344. ISBN 0-8247-4708-9 (2003) [Authored Other Book] [Detail]
Kelarev, AV, Ring Constructions and Applications, World Scientific, New Jersey, London, Singapore, Hong Kong, pp. 160. ISBN 981-02-4745-1 (2002) [Authored Research Book] [Detail]
Kelarev, AV and Gobel, R* and Rangaswamy, KM* and Schultz, P* and Vinsonhaler, C*, Abelian groups, Rings and Modules, American Mathematical Society, Providence, Rhode Island, pp. 320. ISBN 0-8218-2751-0 (2001) [Edited Book] [Detail]
Review
Kelarev, AV, “MR2146569 (2006d:94047) Goubault-Larrecq, Jean; Roger, Muriel; Verma, Kumar Neeraj 'Abstraction and resolution modulo AC: how to verify Diffie-Hellman-like protocols automatically”, Mathematical Review (MR) (2006) EJ (2006) [Review Single Work] [Detail]
Kelarev, AV, “MR2147510 (2006d:94052) Joux, Antoine ' Multicollisions in iterated hash functions. Application to cascaded constructions'”, Mathematical Review (MR) EJ (2006) [Review Single Work] [Detail]
Kelarev, AV, “MR2153228 (2006b:11162) Hu, Lei 'Maximal periodic two-dimensional arrays over Galois rings'”, Mathematical Review (MR) (2006) EJ (2006) [Review Single Work] [Detail]
Kelarev, AV, “MR2153691 (2006b:16074) Abramov, S A; Le, Kh K; Li, Z 'Ore polynomial rings in one variable in computer algebra'”, Mathematical Review (MR) (2006) EJ (2006) [Review Single Work] [Detail]
Kelarev, AV, “MR2156522(2006d:94021) Golomb, Soloman W.; Gong, Guang 'Signal Design for Good Correlation. For Wireless Communication, Cryptography, and Radar', Cambridge Press, Cambridge, 2005”, Mathematical Review (MR) EJ (2006) [Review Single Work] [Detail]
Kelarev, AV, “MR2167701 (20063:13038) Torstensson, Anna; Ufnarovski, Victor; Ofverbeck, Hans 'Using resultants for SAGBI basi verification in the univariate polynomial ring'”, Mathematical Review (MR) (2006) EJ (2006) [Review Single Work] [Detail]
Kelarev, AV, “Boolean functions in coding theory and cryptology”, Information Security: Cryptography, 1 (2004) pp. 470-470. (2005) [Review Single Work] [Detail]
Kelarev, AV, “Braid-based cryptography”, Contemporary Mathematics, 360 (2004) pp. 5-33. (2005) [Review Single Work] [Detail]
Kelarev, AV, “Entropy and expected acceptance counts for finite automata”, IEEE Transactions on Information Theory, 50 (1) pp. 78-88. (2005) [Review Single Work] [Detail]
Kelarev, AV, “Finiteness conditions for rewiriting systems”, International Journal of Algebra and Computation, 15 (2005, 1) pp. 175-205. (2005) [Review Single Work] [Detail]
Kelarev, AV, “Improvements for evaluation codes and new characterizations of Arf semi-groups”, Lecture Notes in Computer Science, 1 (1) pp. 204-215. (2005) [Review Single Work] [Detail]
Kelarev, AV, “Linear time universal coding and time reversal of tree sources via FSM closure”, IEEE Transactions on Information Theory , 50 (7) pp. 1442-1468. (2005) [Review Single Work] [Detail]
Kelarev, AV, “On maximum length convolutional codes under a trellis complexity constraint”, Journal of Complexity, 20 (2-3) pp. 372-403. (2005) [Review Single Work] [Detail]
Kelarev, AV, “Relative duality in MacWilliams identity”, Lecture Notes in Computer Science, 2643 (2003) pp. 108-118. (2005) [Review Single Work] [Detail]
Kelarev, AV, “Solution of a system of polynomial equations over the Galois-Eisenstein ring using a canonical system of generators of a polynomial ideal”, Discrete Mathematics, 16 (1) pp. 21-51. (2005) [Review Single Work] [Detail]
Kelarev, AV, “The Theory of Information and Coding”, Mathematical Reviews, 1 (2004) pp. 397. (2005) [Review Single Work] [Detail]
Kelarev, AV, “Early termination in sparse interpolation algorithms”, International Symposium on Symbolic and Algebraic Computation (ISSAC' 2002), 36 (3-4) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “Factorizations in the monoid of languages”, Soochow Journal of Mathematics, 30 (1) pp. 103-125. (2004) [Review Single Work] [Detail]
Kelarev, AV, “Generator polynomials of characteristic ideal of maximal periodic arrays over Galois rings”, Discrete Mathematics, 278 (1-3) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “Maximising the Shannon capacity of constrained systems with two constraints”, Discrete Mathematics, 17 (2) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003a:68076, H.K. Hsiao, C.C. Huang, S.S. Yu, Word operation closure and primitivity of languages Advances and trends in automata and formal languages”, Journal of Universal Computer Science, 8 (2) (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003a:68102, Symeon Bozapalidis, Transduction in polypodes”, Where mathematics, Computer Science, Linguistics and Biology meet, 1 (2001) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003a:94005, V.N. Gridin, R.B. Mazepa, B.V. Roshchin, Majority multiplexing and coding of binary signals” (2001) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003a:94020, V.K. Leont'ev, Yu.G. Smetanin, Problems of information on the set of words”, Maths Science, 108 (2002 (1)) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003b:20061, M. Delgado, S. Margolis, B. Steinberg, Combinatorial group theory, inverse monoids, automata, and global semigroup theory”, International Journal of Algebra and Computation, 12 (2002) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003d:94053, P. Bradford, M.J. Golin, L.L. Larmore, W. Rytter, Optimal prefix-free codes for unequal letter costs: dynamic programming with the Monge property J”, Algorithms , 42 (2002) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003d:94114, G. Skersys, Computing permutation groups of error-correcting codes”, Lithuanian Mathematical Journal, 40 (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003d:94130 Michael E. O'Sullivan, The key equation for one-point codes and efficient error evaluation”, Journal of Pure and Applied Algebra, 169 (2002) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003e:68085, Ferenc Gecseg, On quasi-products of tree automata”, Universal Computer Science, 8 (2002 (2)) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003h:68101, Symeon Bozapalidis, Olympia Louscou-Bozapalidou, Polytopic codes”, Theoretical Informatics and Applications, 36 (2002) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003h:68107, Julien Cassaigne, Juhani Karhumaki, Jan Manuch, On conugacy of languages”, Theoretical Informatics and Applications, 1 (1) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003i:16065, Li, Huishi, Noncommutative Grobner bases and filtered-graded transfer”, Lecture Notes in Mathematics, 1 (2002) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003i:94001, Han, Te Sun, 'Information-spectrum methods in information theory”, Applications of Mathematics, 50. Stochastic Modelling and Applied Probability, 50 (2003) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003k:94013, R Togneri, C.J.S. de Silva, Fundamentals of Information Theory and Coding Design”, Discrete Mathematics and its Applications, 1 (2002) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003k:94028, Hoffstein, Jeffrey: Silverman, Joseph H., Polynomial rings and efficient public key authentication”, Crytography and computational number theory (1999) (1999) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2003m:68092, Werner Kuich, Automata on power series and tree automata on tree series”, Publicationes Mathematicae, 60 (2002) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2004c:05203, J. Korner, A Monti, Compact representations of the intersection structure of families of finite sets”, SIAM Journal on Discrete Mathematics, 14 (2001 (2)) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2004c:68064, Decision procedures for inductive Boolean functions based on alternating automata”, Theoretical Computer Science, 300 EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2004e:94040 Norton, G.H., Salagean, A., Strong Grobner bases and cyclic codes over a finite-chain ring”, International Workshop on Coding and Cryptography, 6 (2001) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2004g:94108, Properties of codes with one check symbol from a quasigroup point of view”, The Bulletin of the Academy of Sciences of Moldova , 3, 2002 (1) pp. 71-86. (2004) [Review Single Work] [Detail]
Kelarev, AV, “MR2004h:94064,VLSI architecture of modified Euclidean algorithm for Reed-Soloman code”, Information Science, 155 (1-2) pp. 139-150. (2004) [Review Single Work] [Detail]
Kelarev, AV, “On a class of functions computable by index grammars”, Cibernetics & Systems Analysis, 191 (1) EJ (2004) [Review Single Work] [Detail]
Kelarev, AV, “A method for the compact coding of an image (N.Sh.Dzhikiya)”, Mathematical Reviews, 2002 (j) pp. 1. (2002) [Review Single Work] [Detail]
Kelarev, AV, “An algebraic construction of codes for Slepian-Wolf source networks (T.Uyematsu)”, Mathematical Reviews, 2002 (m) pp. 1. (2002) [Review Single Work] [Detail]
Kelarev, AV, “Finite state automata (B. Steinberg)”, Mathematical Reviews, 2002 (c) pp. 1. (2002) [Review Single Work] [Detail]
Kelarev, AV, “Grobner bases over Galois rings with an application to decoding alternant codes (E. Byrne, P. Fitzpatrick)”, Mathematical Reviews, 2002 (d) pp. 1. (2002) [Review Single Work] [Detail]
Kelarev, AV, “Mathematics of information and coding (T.S.Han, K.Kobayashi)”, Mathematical Reviews, 2002 (m) pp. 1. (2002) [Review Single Work] [Detail]
Kelarev, AV, “One-sided noncommutative Grobner bases with applications to computing Green's relations (A.Heyworth)”, Mathematical Reviews, 2002 (e) pp. 1. (2002) [Review Single Work] [Detail]
Kelarev, AV, “Slender matrix languages (R. Stiebe)”, Mathematical Reviews, 2002 (k) pp. 1. (2002) [Review Single Work] [Detail]
Kelarev, AV, “Some new results on primitive words and language classes (M. Kudlek)”, Mathematical Reviews, 2002 (d) pp. 1. (2002) [Review Single Work] [Detail]
Kelarev, AV, “Triangular matrix representations (G.F.Birkenmeier, H.E.Heatherly, J.Y.Kim, J.K.Park)”, Mathematical Reviews, 2002 (d) pp. 1. (2002) [Review Single Work] [Detail]
Kelarev, AV, “Inverse automata and monoids and the undecidability of the Cayley subgraph problem for groups: by A Oliveira and P Silva (Glasgow Math. J. (2000))”, Mathematical Reviews, 2001 (h) pp. 2. (2001) [Review Single Work] [Detail]
Kelarev, AV, “Omega rings, their flat and projective acts with some applications; by Olga Sokratova (Dissertationes Mathematicae Universitatis Tartuensis)”, Mathematical Reviews, 2001 (m) pp. 1. (2001) [Review Single Work] [Detail]
Kelarev, AV, “On Dehn functions of finitely presented bi-automatic monoids: by Friedrich Otto (J.Autom. Lang. Comb)”, Mathematical Reviews, 2001 (h) pp. 1. (2001) [Review Single Work] [Detail]
Kelarev, AV, “On some polynomial GCD algorithms: by Drago Pop (Stud. Univ. Babes-Bolyai Inform.)”, Mathematical Reviews, 2001 (m) pp. 1. (2001) [Review Single Work] [Detail]
Kelarev, AV, “On the computation of Hilbert series and Poincare series for algebras with Grobner bases: by Jonas Mansson (Comput. Sci. J. Moldovia)”, Mathematical Reviews, 2001 (g) pp. 1. (2001) [Review Single Work] [Detail]
Kelarev, AV, “Rewriting as a special case of non-commutative Grobner basis theory: by Anne Heyworth (London Math. Soc. Lecture Note Ser. 275) Series”, Mathematical Reviews, 2001 (f) pp. 1. (2001) [Review Single Work] [Detail]
Kelarev, AV, “Algebra Interactive! Learning algebra in an exciting way”, Mathematical Reviews, 2000 (October) pp. 1 . (2000) [Review Single Work] [Detail]
Kelarev, AV, “Semigroups of matrices”, Semigroup Forum, 59 (1) pp. 155-158. (1999) [Review Single Work] [Detail]
Conference Publication
Kang, BH and Kelarev, AV and Sale, AHJ and Williams, RN, “A New Model for Classifying DNA Code Inspired by Neural Networks and FSA”, Advances in Knowledge Acquisition and Management, 7-8 August 2006, Guilin, China, pp. 187-198. ISBN 3-540-68955-9 (2006) [Refereed Conference Paper] [Full Text] [Detail]
Kelarev, AV, “A combinatorial algorithm for BCH codes extended with FSA”, Proceedings of the 17th Australasian Workshop on Combinatorial Algorithms, 13-16 July 2006, Uluru, Northern Territory, pp. 26-36. ISBN 0 64 646310 1 (2006) [Refereed Conference Paper] [Detail]
Kelarev, AV, “A Polynomial Algorithm for Codes Based on Directed Graphs”, Proceedings of the 12th Computing: The Australasian Theory Symposium (CATS2006), 16-19 January 2006, Hobart, Tasmania, pp. 87-92. ISBN 1-920682-33-3 (2006) [Refereed Conference Paper] [Detail]
Kelarev, AV and Kang, BH and Steane, DA, “Clustering Algorithms for ITS Sequence Data with Alignment Metrics”, AI 2006: Advances in Artificial Intelligence 19th Australian Joint Conference on Artificial Intelligence, 4-8 December, 2006, Hobart, Tasmania, pp. 1027-1031. ISBN 3-540-49787-0 (2006) [Refereed Conference Paper] [Full Text] [Detail]
Kelarev, AV, “Computing the information rates for a class of polynomial codes”, Proceeding of the 5th Workshop on the Internet, Telecommunications and Signal Processing, 11-13th December 2006, Hobart, Tasmania, pp. EJ6. ISBN 0 9756934 2 5 (2006) [Refereed Conference Paper] [Detail]
Kelarev, AV and Kang, BH and Sale, AHJ and Williams, RN, “Labeled directed graphs and FSA as classifiers of strings”, Proceedings of the 17th Australasian Workshop on Combinatorial Algorithms, 13-16 July 2006, Uluru, Northern Territory, pp. 93-109. ISBN 0 64 646310 1 (2006) [Refereed Conference Paper] [Full Text] [Detail]
Kelarev, AV, “Computing parameters of graph-based extensions of BCH codes”, Proceedings of the Sixteenth Australasian Workshop of Combinatorial Algorithms (AWOCA 2005), September 18-21, 2005, Ballarat, Australia, pp. 137-146. ISBN 0-646-45252-5 (2005) [Refereed Conference Paper] [Detail]
Kelarev, AV, “Combinatorial and statistical algorithms for information rates of codes defined by graphs”, AWOCA 2004 - Fifteenth Australasian Workshop on Combinatorial Algorithms, July 6-9, 2004, Ballina, New South Wales, pp. 43-51. ISBN 1 86487 628 X (2004) [Refereed Conference Paper] [Detail]
Kelarev, AV, “Minimum distances and information rates for matrix extensions of BCH codes”, Proceedings WITSP'04, 20-22 December 2004, Adelaide, South Australia, pp. 1-6. ISBN 0-9756934-0-9 (2004) [Refereed Conference Paper] [Detail]
Kelarev, AV, “On genetic algorithms minimizing a class of FSA with fuzzy automata”, Proceedings AISAT 2004 The 2nd International Conference on Artificial Intelligence in Science and Technology, 21-25 November 2004, Hobart, Tasmania, pp. 192-195. ISBN 1 86295 209 4 (2004) [Refereed Conference Paper] [Full Text] [Detail]
Kelarev, AV and Trotter, PG, “A combinatorial property of languages and monoids”, Proceedings of the International Conference Words, Languages and Combinatorics III, 14-18 March, 2000, Kyoto, Japan, pp. 228-239. ISBN 981-02-4948-9 (2003) [Refereed Conference Paper] [Detail]
Bespamyatnikh, SN* and Kelarev, AV, “An algorithm for analysis of data in geographic information systems”, Proceedings of the Thirteenth Australasian Workshop on Combinatorial Algorithms, July 7-10, 2002, Queensland, pp. 1-10. ISBN 1 86499 638 2 (2002) [Refereed Conference Paper] [Detail]
Kelarev, AV, “Labelled Cayley graphs and minimal automata”, 27th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing; Abstracts, 9-13 December 2002, Newcastle, pp. 29. (2002) [Conference Extract] [Detail]
Kelarev, AV, “On error-correcting codes as ideals in group rings”, 46th Annual Meeting of the Australian Mathematical Society: Abstracts, 30 September-3 October 2002, Newcastle, pp. 96. (2002) [Conference Extract] [Detail]
Kelarev, AV, “A combinatorial property defined in terms of power graphs”, Workshop on Model Theory, Profinite Topology and Semigroups: Abstracts, June 11-13, 2001, Coimbra, Portugal, pp. 8-10. (2001) [Conference Extract] [Detail]
Kelarev, AV and Miller, M* and Sokratova, OV, “Directed Graphs and Closure Properties For Languages”, Proceedings of the 12th Australasian Workshop on Combinatorial Algorithms, July 14-17, 2001, Bandung, Indonesia, pp. 118-125. (2001) [Refereed Conference Paper] [Detail]
Kelarev, AV and Sole, P*, “Error-correcting Codes as Ideals in Group Rings”, Contemporary Mathematics, July 9-15, 2000, Perth, Western Australia, pp. 12-18. ISBN 0-8218-2751-0 (2001) [Refereed Conference Paper] [Detail]
Kelarev, AV, “Error-correcting codes as ideals in ring constructions”, Workshop "Algebra and its applications" at Kaariku: Abstracts, 11-13 May, 2001, Estonia, pp. 2. (2001) [Conference Extract] [Detail]
Kelarev, AV and Sokratova, OV, “Information Rates and Weights of Codes in Structural Matrix Rings”, Lecture Notes in Computer Science, November 26-30, 2001, Melbourne, pp. 151-158. ISBN 3-540-42911-5 (2001) [Refereed Conference Paper] [Detail]
Kelarev, AV and Meakin, J*, “On complete and bipartite Cayley graphs”, Arbeitstagung Allgemeine Algebra 62: Abstracts, June 14-17, 2001, Linz, Austria, pp. 25. (2001) [Conference Extract] [Detail]
Kelarev, AV and Sokratova, OV, “On information rates and weights of codes in structural matrix rings”, Proceedings of AAECC-14 Symposium, 26-30 November 2001, Melbourne, pp. 73-74. (2001) [Non Refereed Conference Paper] [Detail]
Kelarev, AV and Quinn, SJ, “A Combinatorial Property and Power Graphs of Groups”, Contributions to General Algebra 12,, June 1999, Vienna, Austria, pp. 229-236. ISBN 3 8536 6951 4 (2000) [Refereed Conference Paper] [Detail]
Kelarev, AV, “A combinatorial property of languages and syntactic monoids”, Abstracts, July 2000, Brisbane, pp. 75. (2000) [Conference Extract] [Detail]
Kelarev, AV and Sokratova, OV, “An Algorithm for Languages Recognised by Graph Algebras”, Proceedings of the Eleventh Australasian Workshop on Combinatorial Algorithms, July 2000, Newcastle, New South Wales, pp. 43-52. ISBN 0 7259 1098 4 (2000) [Refereed Conference Paper] [Detail]
Kelarev, AV and Quinn, SJ and Sokratova, OV, “Automata with languages recognised by graph algebras”, AISAT 2000 Proceedings, 17-20 December 2000, Hobart, pp. 296-301. (2000) [Refereed Conference Paper] [Detail]
Kelarev, AV, “Error-correcting codes in group rings”, ACRAM 2000 Abstracts, July 2000, Perth, pp. 4. (2000) [Conference Extract] [Detail]
Kelarev, AV and Quinn, SJ and Smolikova, R*, “On fuzzy regular languages”, AISAT 2000 Proceedings, 17-20 December 2000, Hobart, pp. 291-295. (2000) [Refereed Conference Paper] [Detail]
Bespamyatnikh, SN* and Kelarev, AV, “Shortest paths and d-cycle problem”, Combinatorial Algorithms, August 1999, Perth, pp. 152-156. (1999) [Refereed Conference Paper] [Detail]
Kelarev, AV and Trotter, PG, “A combinatorial property of automata, languages, and syntactic monoids”, Words, Languages, Combinatorics, March 1999, Kyoto, pp. 66-67. (1999) [Conference Extract] [Detail]
Kelarev, AV, “Algorithms for computing the Jacobson radical of group rings”, Group Theory and Computation, December, 1999, Sydney, pp. 25. (1999) [Conference Extract] [Detail]
Kelarev, AV, “Directed graphs and combinatorial properties for groups and semigroups”, Australian Mathematical Society Joint Annual Conference with American Mathematical Society, 43, 11-16 July, 1999, Melbourne, pp. 13. (1999) [Conference Extract] [Detail]
Kelarev, AV, “Directed graphs and combinatorial properties of groups”, Arbeitung Algemene Algebra, 3-6 June, 1999, Vienna, pp. 8. (1999) [Conference Extract] [Detail]
Cazaran, J and Kelarev, AV, “Polynomial codes and principal ideal rings”, Proc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, pp. 502. (1997) [Non Refereed Conference Paper] [Detail]
Kelarev, AV, “Combinatorial Properties of Sequences in Groups and Semigroups”, DMTCS '96, Auckland, pp. 289-298. (1996) [Refereed Conference Paper] [Detail]
Kelarev, AV, “New results on combinatorial properties of sequences of semigroup elements.”, CANT'95, Sydney, pp. 121-127. (1995) [Non Refereed Conference Paper] [Detail]
Entry
Kelarev, AV, “Cayley Graph”, Concise Encyclopedia of Supersymmetry, S. Duplij, W. Siegel, J. Bagger (ed), Dordrecht, 1, pp. 84 (2004) [Entry] [Detail]

* This author is not affiliated with the University of Tasmania.