Select Publications

Conference Papers

Kaminski M; Shparlinski IE, 2021, 'Sets of Linear Forms Which Are Hard to Compute', in Leibniz International Proceedings in Informatics, LIPIcs, http://dx.doi.org/10.4230/LIPIcs.MFCS.2021.66

Shparlinski I; Childs AM; van Dam W, 2016, 'Optimal Quantum Algorithm for Polynomial Interpolation', in Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi (ed.), Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, DROPS, Rome, pp. 16:1 - 16:13, presented at 43rd International Colloquium on Automata, Languages, and Programming, Rome, 11 July 2016 - 15 July 2016, http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.16

Shparlinski IE, 2016, 'Dynamical systems of non-algebraic origin: Fixed points and orbit lengths', in Kolyada S; Moller M; Moree P; Ward T (eds.), DYNAMICS AND NUMBERS, AMER MATHEMATICAL SOC, Max Planck Inst Math, Bonn, GERMANY, pp. 261 - 283, presented at International Conference on Dynamics and Numbers, Max Planck Inst Math, Bonn, GERMANY, 21 July 2014 - 25 July 2014, http://dx.doi.org/10.1090/conm/669/13432

Kohel D; Shparlinski I, 2016, 'Preface', in Contemporary Mathematics, pp. vii - viii

Shparlinski IE, 2008, 'OPEN PROBLEMS ON EXPONENTIAL AND CHARACTER SUMS', in Aoki T; Kanemitsu S; Liu JY (eds.), NUMBER THEORY: DREAMING IN DREAMS, WORLD SCIENTIFIC PUBL CO PTE LTD, Kinki Univ, Higashiosaka, JAPAN, pp. 222 - 242, presented at 5th China-Japan Seminar on Number Theory, Kinki Univ, Higashiosaka, JAPAN, 27 August 2008 - 31 August 2008, http://dx.doi.org/10.1142/9789814289924_0010

Shparlinski IE, 2008, 'Pseudorandom Points on Elliptic Curves over Finite Fields', in Algebraic Geometry and Its Applications, WORLD SCIENTIFIC, presented at Proceedings of the First SAGA Conference, http://dx.doi.org/10.1142/9789812793430_0006

Luca F; Shparlinski IE, 2007, 'On Special Finite Fields', in Lachaud G; Ritzenthaler C; Tsfasman MA (eds.), ARITHMETIC, GEOMETRY, CRYPTOGRAPHY AND CODING THEORY, AMER MATHEMATICAL SOC, Ctr Int Rencontres Math, Marseilles, FRANCE, pp. 163 - 167, presented at 11th Conference on Arithmetic, Geometry, Cryptography and Coding Theory, Ctr Int Rencontres Math, Marseilles, FRANCE, 05 November 2007 - 09 November 2007, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000267679700010&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

EI-Mahassni E; Shparlinski IE, 2007, 'On the distribution of the elliptic curve power generator', in Mullen GL; Panario D; Shparlinski IE (eds.), FINITE FIELDS AND APPLICATIONS, AMER MATHEMATICAL SOC, Melbourne, AUSTRALIA, pp. 111 - 118, presented at 8th International Conference on Finite Fields and Applications, Melbourne, AUSTRALIA, 09 July 2007 - 13 July 2007, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000257880200009&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Shparlinski IE; Steinfeld R, 2007, 'Collision in the DSA Function', in Li Y; Ling S; Niederreiter H; Wang H; Xing C; Zhang S (eds.), CODING AND CRYPTOLOGY, WORLD SCIENTIFIC PUBL CO PTE LTD, Fujian Normal Univ, Wuui Mt, PEOPLES R CHINA, pp. 226 - 232, presented at 1st International Workshop on Coding and Cryptology, Fujian Normal Univ, Wuui Mt, PEOPLES R CHINA, 11 June 2007 - 15 June 2007, http://dx.doi.org/10.1142/9789812832245_0017

Shparlinski IE, 2006, 'DISTRIBUTION OF POINTS ON MODULAR HYPERBOLAS', in Kanemitsu S; Liu JY (ed.), NUMBER THEORY: SAILING ON THE SEA OF NUMBER THEORY, WORLD SCIENTIFIC PUBL CO PTE LTD, Weihai, PEOPLES R CHINA, pp. 155 - 189, presented at 4th China-Japan Seminar on Number Theory, Weihai, PEOPLES R CHINA, 30 August 2006 - 03 September 2006, http://dx.doi.org/10.1142/9789812770134_0007

Shparlinski IE, 2005, 'Pseudorandom Number Generators from Elliptic Curves', in Luengo I (ed.), RECENT TRENDS IN CRYPTOGRAPHY, AMER MATHEMATICAL SOC, Real Soc Mat Espanola, Santander, SPAIN, pp. 121 - 141, presented at Summer School on Recent Trends in Cryptography, Real Soc Mat Espanola, Santander, SPAIN, 11 July 2005 - 15 July 2005, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000263678500005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Shparlinski IE, 2003, 'Orders of points on elliptic curves', in Gutierrez J; Shpilrain V; Yu JT (eds.), AFFINE ALGEBRAIC GEOMETRY, AMER MATHEMATICAL SOC, Seville, SPAIN, pp. 245 - 251, presented at 1st RSME-AMS Joint Meeting, Seville, SPAIN, 19 June 2003 - 21 June 2003, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000227464800015&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Banks WD; Shparlinski IE, 2003, 'Congruences and exponential sums with the Euler function', in VanDerPoorten A; Stein A (ed.), HIGH PRIMES AND MISDEMEANOURS: LECTURES IN HONOUR OF THE 60TH BIRTHDAY OF HUGH COWIE WILLIAMS, AMER MATHEMATICAL SOC, Banff, CANADA, pp. 49 - 59, presented at Conference in Number Theory in Honour of Hugh C Williams, Banff, CANADA, 24 May 2003 - 30 May 2003, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000223282500004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Banks WD; Friedlander JB; Pomerance C; Shparlinski IE, 2003, 'Multiplicative structure of values of the Euler function', in VanDerPoorten A; Stein A (ed.), HIGH PRIMES AND MISDEMEANOURS: LECTURES IN HONOUR OF THE 60TH BIRTHDAY OF HUGH COWIE WILLIAMS, AMER MATHEMATICAL SOC, Banff, CANADA, pp. 29 - 47, presented at Conference in Number Theory in Honour of Hugh C Williams, Banff, CANADA, 24 May 2003 - 30 May 2003, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000223282500003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Shparlinski IE, 2003, 'Playing "hide-and-seek" with numbers: The hidden number problem, lattices and exponential sums', in Garret P; Lieman D (ed.), PUBLIC-KEY CRYPTOGRAPHY, AMER MATHEMATICAL SOC, Baltimore, MD, pp. 153 - 177, presented at Joint Annual Meeting of the American-Mathematical-Society/Mathematical-Association-of-America, Baltimore, MD, 17 January 2003, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000235211700007&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Von Zur Gathen J; Shokrollahi A; Shparlinski I, 2003, 'An authentication scheme based on roots of sparse polynomials', in Proceedings - 2003 IEEE Information Theory Workshop, ITW 2003, pp. 159 - 162, http://dx.doi.org/10.1109/ITW.2003.1216719

Banks WD; Shparlinski IE, 2002, 'A variant of NTRU with non-invertible polynomials', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 62 - 70, http://dx.doi.org/10.1007/3-540-36231-2_6

Shparlinski IE; Steinfeld R, 2002, 'Chinese remaindering for algebraic numbers in a hidden field', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 349 - 356, http://dx.doi.org/10.1007/3-540-45455-1_28

Li WCW; Näslund M; Shparlinski IE, 2002, 'Hidden number problem with the trace and bit security of XTR and LUC', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 433 - 448, http://dx.doi.org/10.1007/3-540-45708-9_28

Lenstra AK; Shparlinski IE, 2002, 'Selective forgery of rsa signatures with fixed-pattern padding', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 228 - 236, http://dx.doi.org/10.1007/3-540-45664-3_16

Pomerance C; Shparlinski IE, 2002, 'Smooth orders and cryptographic applications', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 338 - 348, http://dx.doi.org/10.1007/3-540-45455-1_27

Vasco MIG; Näslund M; Shparlinski IE, 2002, 'The hidden number problem in extension fields and its applications', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 105 - 117

Shparlinski IE, 2001, 'Exponential sums and lattice reduction: Applications to cryptography', in Mullen GL; Stichtenoth H; TapiaRecillas H (eds.), FINITE FIELDS WITH APPLICATIONS TO CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS, SPRINGER-VERLAG BERLIN, OAXACA, MEXICO, pp. 286 - 298, presented at 6th International Conference on Finite Fields and Applications (Fq6), OAXACA, MEXICO, 21 May 2001 - 26 May 2001, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000179469500023&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

El Mahassni E; Shparlinski I, 2001, 'On the uniformity of distribution of congruential generators over elliptic curves', in Helleseth T; Kumar PV; Yang K (eds.), SEQUENCES AND THEIR APPLICATIONS, PROCEEDINGS, SPRINGER-VERLAG LONDON LTD, BERGEN, NORWAY, pp. 257 - 264, presented at International Conference on Sequences and their Applications (SETA 01), BERGEN, NORWAY, 13 May 2001 - 17 May 2001, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000174706300019&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Allender E; Saks M; Shparlinski I, 2001, 'A lower bound for primality', in Journal of Computer and System Sciences, pp. 356 - 366, http://dx.doi.org/10.1006/jcss.2000.1725

Banks WD; Lieman D; Shparlinski IE; Van To T, 2001, 'Cryptographic applications of sparse Polynomials over Finite Rings', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 206 - 220, http://dx.doi.org/10.1007/3-540-45247-8_17

Plaku E; Shparlinski IE, 2001, 'On polynomial representations of boolean functions related to some number theoretic problems', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 305 - 316, http://dx.doi.org/10.1007/3-540-45294-x_26

Shparlinski IE, 2001, 'On the generalised hidden number problem and bit security of XTR', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 268 - 277, http://dx.doi.org/10.1007/3-540-45624-4_28

Nguyen PQ; Shparlinski IE, 2001, 'On the insecurity of a server-aided RSA protocol', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 21 - 35, http://dx.doi.org/10.1007/3-540-45682-1_2

Lenstra AK; Shparlinski IE, 2001, 'On the security of Lenstra’s variant of DSA without long inversions', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 64 - 72, http://dx.doi.org/10.1007/3-540-44586-2_5

Mahassni EE; Nguyen PQ; Shparlinski IE, 2001, 'The insecurity of nyberg–rueppel and other DSA-like signature schemes with partially known nonces', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 97 - 109, http://dx.doi.org/10.1007/3-540-44670-2_9

Niederreiter H; Shparlinski IE, 2000, 'Recent advances in the theory of nonlinear pseudorandom number generators', in Fang KT; Hickernell FJ; Niederreiter H (eds.), MONTE CARLO AND QUASI-MONTE CARLO METHODS 2000, SPRINGER-VERLAG BERLIN, HONG KONG BAPTIST UNIV, HONG KONG, PEOPLES R CHINA, pp. 86 - 102, presented at 4th International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (MCQMC 2000), HONG KONG BAPTIST UNIV, HONG KONG, PEOPLES R CHINA, 27 November 2000 - 01 December 2000, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000175526000006&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Friedlander JB; Hansen JSD; Shparlinski IE, 2000, 'On the distribution of the power generator modulo a prime power', in Nathanson MB (ed.), UNUSUAL APPLICATIONS OF NUMBER THEORY, AMER MATHEMATICAL SOC, Piscataway, NJ, pp. 71 - 79, presented at DIMACS Workshop on Unusual Applications of Number Theory, Piscataway, NJ, 10 January 2000 - 14 January 2000, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000224833300008&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Banks WD; Lieman D; Shparlinski IE, 2000, 'An Extremely Small and Efficient identification scheme', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 378 - 384, http://dx.doi.org/10.1007/10718964_31

Banks WD; Lieman D; Shparlinski IE, 2000, 'An identification scheme based on sparse polynomials', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 68 - 74, http://dx.doi.org/10.1007/978-3-540-46588-1_6

Banks WD; Griffin F; Lieman D; Shparlinski IE, 2000, 'Non-linear complexity of the naor-reingold pseudo-random function', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 53 - 59, http://dx.doi.org/10.1007/10719994_5

Kohel DR; Shparlinski IE, 2000, 'On exponential sums and group generators for elliptic curves over finite fields', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 395 - 404, http://dx.doi.org/10.1007/10722028_24

Nguyen PQ; Shparlinski IE; Stern J, 1999, 'Distribution of modular sums and the security of the server aided exponentiation', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 331 - 342, presented at Workshop on Cryptography and Computational Number Theory (CCNT 99), SINGAPORE, SINGAPORE, 22 November 1999 - 26 November 1999, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000169016800024&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Vasco MIG; Shparlinski IE, 1999, 'On the security of Diffie-Hellman bits', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 257 - 268, presented at Workshop on Cryptography and Computational Number Theory (CCNT 99), SINGAPORE, SINGAPORE, 22 November 1999 - 26 November 1999, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000169016800019&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Friedlander JB; Pomerance C; Shparlinski IE, 1999, 'Small values of the Carmichael function and cryptographic applications', in Lam KY; Shparlinski I; Wang H; Xing CP (eds.), CRYPTOGRAPHY AND COMPUTATIONAL NUMBER THEORY, BIRKHAUSER VERLAG AG, SINGAPORE, SINGAPORE, pp. 25 - 32, presented at Workshop on Cryptography and Computational Number Theory (CCNT 99), SINGAPORE, SINGAPORE, 22 November 1999 - 26 November 1999, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000169016800004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

von zur Gathen J; Shparlinski I, 1999, 'Gauss periods in finite fields', in Jungnickel D; Niederreiter H (ed.), FINITE FIELDS AND APPLICATIONS, SPRINGER-VERLAG BERLIN, UNIV AUGSBURG, DEPT MATH, AUGSBURG, GERMANY, pp. 162 - 177, presented at 5th International Conference on Finite Fields and Applications, UNIV AUGSBURG, DEPT MATH, AUGSBURG, GERMANY, 02 August 1999 - 06 August 1999, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000169087900014&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Bernasconi A; Shparlinski I, 1999, 'Circuit complexity of testing square-free numbers', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 47 - 56, http://dx.doi.org/10.1007/3-540-49116-3_4

Von Zur Gathen J; Shparlinski I, 1999, 'Constructing elements of large order in finite fields', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 404 - 409, http://dx.doi.org/10.1007/3-540-46796-3_38

Allender E; Saks M; Shparlinski I, 1999, 'Lower bound for primality', in Proceedings of the Annual IEEE Conference on Computational Complexity, pp. 10 - 14

Cai JY; Havas G; Mans B; Nerurkar A; Seifert JP; Shparlinski I, 1999, 'On routing in circulant graphs', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 360 - 369, http://dx.doi.org/10.1007/3-540-48686-0_36

Bernasconi A; Damm C; Shparlinski IE, 1999, 'On the average sensitivity of testing square-free numbers', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 291 - 299, http://dx.doi.org/10.1007/3-540-48686-0_29

Karpinski M; Shparlinski I, 1999, 'On the computational hardness of testing square-freeness of sparse polynomials', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 492 - 497, http://dx.doi.org/10.1007/3-540-46796-3_47

Griffin F; Niederreiter H; Shparlinski IE, 1999, 'On the distribution of nonlinear recursive congruential pseudorandom numbers of higher orders', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 87 - 93, http://dx.doi.org/10.1007/3-540-46796-3_9

Griffin F; Shparlinski IE, 1999, 'On the linear complexity of the naor—reingold pseudo-random function', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 301 - 308, http://dx.doi.org/10.1007/978-3-540-47942-0_25

Grant D; Krastev K; Lieman D; Shparlinski I, 1998, 'A public key cryptosystem based on sparse polynomials', in Buchmann J; Hoholdt T; Stichtenoth H; TapiaRecillas H (eds.), CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS, SPRINGER-VERLAG BERLIN, GUANAJUATO, MEXICO, pp. 114 - 121, presented at International Conference on Coding Theory, Cryptography and Related Areas, GUANAJUATO, MEXICO, 20 April 1998 - 24 April 1998, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000085321900010&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1


Back to profile page