dblp.uni-trier.dewww.uni-trier.de

Igor Shparlinski Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
142EEJohn Friedlander, Igor Shparlinski: Elliptic Twin Prime Conjecture. IWCC 2009: 77-81
141EEAlina Carmen Cojocaru, Igor Shparlinski: On the embedding degree of reductions of an elliptic curve. Inf. Process. Lett. 109(13): 652-654 (2009)
2008
140EEJoachim von zur Gathen, Igor Shparlinski: Approximate Polynomial gcd: Small Degree and Small Height Perturbations. LATIN 2008: 276-283
139EEIgor Shparlinski: Pseudorandom Graphs from Elliptic Curves. LATIN 2008: 284-292
138EEWim van Dam, Igor Shparlinski: Classical and Quantum Algorithms for Exponential Congruences. TQC 2008: 1-10
137EEDavid Naccache, Igor Shparlinski: Divisibility, Smoothness and Cryptographic Applications CoRR abs/0810.2067: (2008)
136EESidney W. Graham, Igor Shparlinski: On RSA moduli with almost half of the bits prescribed. Discrete Applied Mathematics 156(16): 3150-3154 (2008)
2007
135EEIgor Shparlinski: Communication complexity of some number theoretic functions. Appl. Math. Lett. 20(8): 872-875 (2007)
134EESimon R. Blackburn, Igor Shparlinski: Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131]. Discrete Mathematics 307(9-10): 1218-1219 (2007)
133EEIgor Shparlinski: Bounds on the Fourier coefficients of the weighted sum function. Inf. Process. Lett. 103(3): 83-87 (2007)
132EEIgor Shparlinski, Arne Winterhof: Quantum period reconstruction of approximate sequences. Inf. Process. Lett. 103(6): 211-215 (2007)
131EEIgor Shparlinski, Ron Steinfeld: Chinese Remaindering with Multiplicative Noise. Theory Comput. Syst. 40(1): 33-41 (2007)
2006
130EEIgor Shparlinski: Bounds on the Fourier Coefficients of the Weighted Sum Function. Complexity of Boolean Functions 2006
129EEIgor Shparlinski, Arne Winterhof: Constructions of Approximately Mutually Unbiased Bases. LATIN 2006: 793-799
128EEIgor Shparlinski, Arne Winterhof: On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences. SETA 2006: 295-303
127EEJoachim von zur Gathen, Igor Shparlinski: GCD of Random Linear Combinations. Algorithmica 46(1): 137-148 (2006)
126EEIan F. Blake, Theodoulos Garefalakis, Igor Shparlinski: On the bit security of the Diffie-Hellman key. Appl. Algebra Eng. Commun. Comput. 16(6): 397-404 (2006)
125EEIgor Shparlinski, Arne Winterhof: On the nonlinearity of linear recurrence sequences. Appl. Math. Lett. 19(4): 340-344 (2006)
124EEIgor Shparlinski: On RSA Moduli with Prescribed Bit Patterns. Des. Codes Cryptography 39(1): 113-122 (2006)
123EESimon R. Blackburn, Igor Shparlinski: Character sums and nonlinear recurrence sequences. Discrete Mathematics 306(12): 1126-1131 (2006)
122EEMoubariz Z. Garaev, Florian Luca, Igor Shparlinski, Arne Winterhof: On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences. IEEE Transactions on Information Theory 52(7): 3299-3304 (2006)
121EESimon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Reconstructing noisy polynomial evaluation in residue rings. J. Algorithms 61(2): 47-59 (2006)
120EEMoubariz Z. Garaev, Florian Luca, Igor Shparlinski: Catalan and Apéry numbers in residue classes. J. Comb. Theory, Ser. A 113(5): 851-865 (2006)
119EEFlorian Luca, Igor Shparlinski: Elliptic Curves with Low Embedding Degree. J. Cryptology 19(4): 553-562 (2006)
118EEDon Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski: Testing set proportionality and the Ádám isomorphism of circulant graphs. J. Discrete Algorithms 4(2): 324-335 (2006)
2005
117EEScott Contini, Igor Shparlinski: On Stern's Attack Against Secret Truncated Linear Congruential Generators. ACISP 2005: 52-60
116EESean Hallgren, Alexander Russell, Igor Shparlinski: Quantum Noisy Rational Function Reconstruction. COCOON 2005: 420-429
115EEIgor Shparlinski: Diffie-Hellman Problem. Encyclopedia of Cryptography and Security 2005
114EETanja Lange, Igor Shparlinski: Collisions in Fast Generation of Ideal Classes and Points on Hyperelliptic and Elliptic Curves. Appl. Algebra Eng. Commun. Comput. 15(5): 329-337 (2005)
113EEIgor Shparlinski, Arne Winterhof: Noisy interpolation of sparse polynomials in finite fields. Appl. Algebra Eng. Commun. Comput. 16(5): 307-317 (2005)
112EEFlorian Hess, Igor Shparlinski: On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves. Des. Codes Cryptography 35(1): 111-117 (2005)
111EEIgor Shparlinski, Arne Winterhof: On the linear complexity of bounded integer sequences over different moduli. Inf. Process. Lett. 96(5): 175-177 (2005)
2004
110EESteven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski: Secure Bilinear Diffie-Hellman Bits. ACISP 2004: 370-378
109EEJoachim von zur Gathen, Igor Shparlinski: GCD of Random Linear Forms. ISAAC 2004: 464-469
108EEGudmund Skovbjerg Frandsen, Igor Shparlinski: On reducing a system of equations to a single equation. ISSAC 2004: 163-166
107EEBernard Mans, Igor Shparlinski: Bisecting and Gossiping in Circulant Graphs. LATIN 2004: 589-598
106EEMaria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski: New Results on the Hardness of Diffie-Hellman Bits. Public Key Cryptography 2004: 159-172
105EEIgor Shparlinski, Arne Winterhof: A Nonuniform Algorithm for the Hidden Number Problem in Subgroups. Public Key Cryptography 2004: 416-424
104EEJoachim von zur Gathen, Igor Shparlinski: Polynomial interpolation from multiples. SODA 2004: 1132-1137
103EEJoachim von zur Gathen, Igor Shparlinski: Predicting Subset Sum Pseudorandom Generators. Selected Areas in Cryptography 2004: 241-251
102EEScott Contini, Ernie Croot, Igor Shparlinski: Complexity of Inverting the Euler Function Electronic Colloquium on Computational Complexity (ECCC)(035): (2004)
101EEIgor Shparlinski: On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA. Inf. Process. Lett. 92(3): 143-147 (2004)
100EEAlexander Russell, Igor Shparlinski: Classical and quantum function reconstruction via character evaluation. J. Complexity 20(2-3): 404-422 (2004)
99EEIgor Shparlinski, Ron Steinfeld: Noisy Chinese remaindering in the Lee norm. J. Complexity 20(2-3): 423-437 (2004)
98 Alessandro Conflitti, Igor Shparlinski: On the multidimensional distribution of the subset sum generator of pseudorandom numbers. Math. Comput. 73(246): 1005-1011 (2004)
97EEWilliam D. Banks, Alessandro Conflitti, Igor Shparlinski: Number Theoretic Designs for Directed Regular Graphs of Small Diameter. SIAM J. Discrete Math. 17(3): 377-383 (2004)
96EEMark Goresky, Andrew Klapper, Ram Murty, Igor Shparlinski: On Decimations of l-Sequences. SIAM J. Discrete Math. 18(1): 130-140 (2004)
2003
95EEHarald Niederreiter, Igor Shparlinski: Dynamical Systems Generated by Rational Functions. AAECC 2003: 6-17
94EEHarald Niederreiter, Igor Shparlinski: Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity. IMA Int. Conf. 2003: 183-189
93EESimon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Predicting the Inversive Generator. IMA Int. Conf. 2003: 264-275
92EEMats Näslund, Igor Shparlinski, William Whyte: On the Bit Security of NTRUEncrypt. Public Key Cryptography 2003: 62-70
91EEVenkatesan Guruswami, Igor Shparlinski: Unconditional proof of tightness of Johnson bound. SODA 2003: 754-755
90EEEric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski: Complexity of some arithmetic problems for binary polynomials. Computational Complexity 12(1-2): 23-47 (2003)
89 Sergei Konyagin, Tanja Lange, Igor Shparlinski: Linear Complexity of the Discrete Logarithm. Des. Codes Cryptography 28(2): 135-146 (2003)
88EEPhong Q. Nguyen, Igor Shparlinski: The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces. Des. Codes Cryptography 30(2): 201-217 (2003)
87 Jaime Gutierrez, Igor Shparlinski, Arne Winterhof: On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators. IEEE Transactions on Information Theory 49(1): 60-64 (2003)
86 Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski: Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation. Math. Comput. 72(243): 1473-1485 (2003)
85EEJoachim von zur Gathen, Igor Shparlinski, Alistair Sinclair: Finding Points on Curves over Finite Fields. SIAM J. Comput. 32(6): 1436-1448 (2003)
2002
84EECarl Pomerance, Igor Shparlinski: Smooth Orders and Cryptographic Applications. ANTS 2002: 338-348
83EEIgor Shparlinski, Ron Steinfeld: Chinese Remaindering for Algebraic Numbers in a Hidden Field. ANTS 2002: 349-356
82EEWen-Ching W. Li, Mats Näslund, Igor Shparlinski: Hidden Number Problem with the Trace and Bit Security of XTR and LUC. CRYPTO 2002: 433-448
81EEWilliam D. Banks, Igor Shparlinski: A Variant of NTRU with Non-invertible Polynomials. INDOCRYPT 2002: 62-70
80EEMaria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski: The Hidden Number Problem in Extension Fields and Its Applications. LATIN 2002: 105-117
79EEArjen K. Lenstra, Igor Shparlinski: Selective Forgery of RSA Signatures with Fixed-Pattern Padding. Public Key Cryptography 2002: 228-236
78EEIgor Shparlinski: On the Uniformity of Distribution of the ElGamal Signature. Appl. Algebra Eng. Commun. Comput. 13(1): 9-16 (2002)
77EEBruno Codenotti, Igor Shparlinski, Arne Winterhof: On the hardness of approximating the permanent of structured matrices. Computational Complexity 11(3-4): 158-170 (2002)
76EEBernard Mans, Francesco Pappalardi, Igor Shparlinski: On the spectral Ádám property for circulant graphs. Discrete Mathematics 254(1-3): 309-329 (2002)
75EEBruno Codenotti, Igor Shparlinski: Non-approximability of the Permanent of Structured Matrices over Finite Fields Electronic Colloquium on Computational Complexity (ECCC)(071): (2002)
74EEIgor Shparlinski: Security of most significant bits of gx2. Inf. Process. Lett. 83(2): 109-113 (2002)
73EEPhong Q. Nguyen, Igor Shparlinski: The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. J. Cryptology 15(3): 151-176 (2002)
72 Maria Isabel Gonzalez Vasco, Igor Shparlinski: Security of the most significant bits of the Shamir message passing scheme. Math. Comput. 71(237): 333-342 (2002)
2001
71 Serdar Boztas, Igor Shparlinski: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 14th International Symposium, AAECC-14, Melbourne, Australia November 26-30, 2001, Proceedings Springer 2001
70EEIgor Shparlinski: On the Generalised Hidden Number Problem and Bit Security of XTR. AAECC 2001: 268-277
69EEPhong Q. Nguyen, Igor Shparlinski: On the Insecurity of a Server-Aided RSA Protocol. ASIACRYPT 2001: 21-35
68EEDan Boneh, Igor Shparlinski: On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme. CRYPTO 2001: 201-212
67EEEdwin El Mahassni, Phong Q. Nguyen, Igor Shparlinski: The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces. CaLC 2001: 97-109
66EEErion Plaku, Igor Shparlinski: On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems. FSTTCS 2001: 305-316
65EEArjen K. Lenstra, Igor Shparlinski: On the Security of Lenstra's Variant of DSA without Long Inversions. Public Key Cryptography 2001: 64-72
64EEIgor Shparlinski: Sparse polynomial approximation in finite fields. STOC 2001: 209-215
63 Igor Shparlinski: On the Linear Complexity of the Power Generator. Des. Codes Cryptography 23(1): 5-10 (2001)
62 Igor Shparlinski: On Some Properties of the Shrinking Generator. Des. Codes Cryptography 23(2): 147-156 (2001)
61 Igor Shparlinski, Joseph H. Silverman: On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves. Des. Codes Cryptography 24(3): 279-289 (2001)
60EEEdwin El Mahassni, Igor Shparlinski: On Some Uniformity of Distribution Properties of ESIGN. Electronic Notes in Discrete Mathematics 6: 132-139 (2001)
59 Anna Bernasconi, Carsten Damm, Igor Shparlinski: Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Inf. Comput. 168(2): 113-124 (2001)
58 Eric Allender, Michael E. Saks, Igor Shparlinski: A Lower Bound for Primality. J. Comput. Syst. Sci. 62(2): 356-366 (2001)
57 Igor Shparlinski: On the uniformity of distribution of the RSA pairs. Math. Comput. 70(234): 801-808 (2001)
56 Harald Niederreiter, Igor Shparlinski: On the distribution of inversive congruential pseudorandom numbers in parts of the period. Math. Comput. 70(236): 1569-1574 (2001)
55 John Friedlander, Igor Shparlinski: On the distribution of the power generator. Math. Comput. 70(236): 1575-1589 (2001)
54 John Friedlander, Carl Pomerance, Igor Shparlinski: Period of the power generator and small values of Carmichael's function. Math. Comput. 70(236): 1591-1605 (2001)
53EEJohn Friedlander, Igor Shparlinski: On the Distribution of Diffie-Hellman Triples with Sparse Exponents. SIAM J. Discrete Math. 14(2): 162-169 (2001)
2000
52 William D. Banks, Daniel Lieman, Igor Shparlinski: An Extremely Small and Efficient Identification Scheme. ACISP 2000: 378-384
51 David R. Kohel, Igor Shparlinski: On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields. ANTS 2000: 395-404
50EEWilliam D. Banks, Daniel Lieman, Igor Shparlinski, Van Thuong To: Cryptographic Applications of Sparse Polynomials over Finite Rings. ICISC 2000: 206-220
49 Igor Shparlinski: Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key. LATIN 2000: 259-268
48 William D. Banks, Daniel Lieman, Igor Shparlinski: An Identification Scheme Based on Sparse Polynomials. Public Key Cryptography 2000: 68-74
47EEHarald Niederreiter, Igor Shparlinski: On the Distribution of Pseudorandom Numbers and Vectors Generated by Inversive Methods. Appl. Algebra Eng. Commun. Comput. 10(3): 189-202 (2000)
46EEIgor Shparlinski: On the Naor-Reingold Pseudo-Random Function from Elliptic Curves. Appl. Algebra Eng. Commun. Comput. 11(1): 27-34 (2000)
45EEAnna Bernasconi, Carsten Damm, Igor Shparlinski: The average sensitivity of square-freeness. Computational Complexity 9(1): 39-51 (2000)
44EEMaria Isabel Gonzalez Vasco, Igor Shparlinski: Security of the Most Significant Bits of the Shamir Message Passing Scheme Electronic Colloquium on Computational Complexity (ECCC) 7(40): (2000)
43EEIgor Shparlinski: Security of Polynomial Transformations of the Diffie--Hellma Electronic Colloquium on Computational Complexity (ECCC) 7(41): (2000)
42EEMaria Isabel Gonzalez Vasco, Igor Shparlinski: On the Security of Diffie-Hellman Bits Electronic Colloquium on Computational Complexity (ECCC) 7(45): (2000)
41 Frances Griffin, Igor Shparlinski: On the linear complexity profile of the power generator. IEEE Transactions on Information Theory 46(6): 2159-2162 (2000)
40EEIgor Shparlinski: Linear complexity of the Naor-Reingold pseudo-random function. Inf. Process. Lett. 76(3): 95-99 (2000)
39 Igor Shparlinski: Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications. J. Algorithms 36(2): 241-252 (2000)
38EEDon Coppersmith, Igor Shparlinski: On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping. J. Cryptology 13(3): 339-360 (2000)
37 Joachim von zur Gathen, Igor Shparlinski: The CREW PRAM Complexity of Modular Inversion. SIAM J. Comput. 29(6): 1839-1857 (2000)
36EEMarek Karpinski, Alfred J. van der Poorten, Igor Shparlinski: Zero testing of p-adic and modular polynomials. Theor. Comput. Sci. 233(1-2): 309-317 (2000)
1999
35EEJoachim von zur Gathen, Igor Shparlinski: Constructing Elements of Large Order in Finite Fields. AAECC 1999: 404-409
34EEMarek Karpinski, Igor Shparlinski: On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials. AAECC 1999: 492-497
33EEFrances Griffin, Harald Niederreiter, Igor Shparlinski: On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders. AAECC 1999: 87-93
32EEAnna Bernasconi, Carsten Damm, Igor Shparlinski: On the Average Sensitivity of Testing Square-Free Numbers. COCOON 1999: 291-299
31EEJin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor Shparlinski: On Routing in Circulant Graphs. COCOON 1999: 360-369
30 Frances Griffin, Igor Shparlinski: On the Linear Complexity of the Naor-Reingold Pseudo-Random Function. ICICS 1999: 301-308
29 William D. Banks, Frances Griffin, Daniel Lieman, Igor Shparlinski: Non-linear Complexity of the Naor-Reingold Pseudo-random Function. ICISC 1999: 53-59
28EEEric Allender, Michael E. Saks, Igor Shparlinski: A Lower Bound for Primality. IEEE Conference on Computational Complexity 1999: 10-14
27EEAnna Bernasconi, Igor Shparlinski: Circuit Complexity of Testing Square-Free Numbers. STACS 1999: 47-56
26 John Friedlander, Michael Larsen, Daniel Lieman, Igor Shparlinski: On The Correlation of Binary Sequences. Des. Codes Cryptography 16(3): 249-256 (1999)
25EEEric Allender, Igor Shparlinski, Michael E. Saks: A Lower Bound for Primality Electronic Colloquium on Computational Complexity (ECCC) 6(10): (1999)
24EEIgor Shparlinski: On the Uniformity of Distribution of a Certain Pseudo-Random Function Electronic Colloquium on Computational Complexity (ECCC) 6(21): (1999)
23EEMarek Karpinski, Igor Shparlinski: On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials Electronic Colloquium on Computational Complexity (ECCC) 6(27): (1999)
1998
22EEBernard Mans, Francesco Pappalardi, Igor Shparlinski: On the Ádám Conjecture on Circulant Graphs. COCOON 1998: 251-260
21EEJoachim von zur Gathen, Igor Shparlinski: The CREW PRAM Complexity of Modular Inversion. LATIN 1998: 305-315
20EEJoachim von zur Gathen, Igor Shparlinski: Orders of Gauss Periods in Finite Fields. Appl. Algebra Eng. Commun. Comput. 9(1): 15-24 (1998)
19EEIgor Shparlinski: On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems Electronic Colloquium on Computational Complexity (ECCC) 5(54): (1998)
18EEAnna Bernasconi, Igor Shparlinski: Circuit Complexity of Testing Square-Free Numbers Electronic Colloquium on Computational Complexity (ECCC) 5(56): (1998)
17 Joachim von zur Gathen, Igor Shparlinski: Computing components and projections of curves over finite fields. SIAM J. Comput. 28(3): 822-840 (1998)
16 Anna Bernasconi, Carsten Damm, Igor Shparlinski: Circuit and Decision Tree Complexity of Some Number Theoretic Problems Universität Trier, Mathematik/Informatik, Forschungsbericht 98-21: (1998)
1997
15 Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski: Counting Curves and Their Projections. Computational Complexity 6(1): 64-99 (1997)
1996
14EEIgor Shparlinski: On Irreducible Polynomials of Small Height over Finite Fields. Appl. Algebra Eng. Commun. Comput. 7(6): 427-431 (1996)
13EEMarek Karpinski, Igor Shparlinski: On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields. Theor. Comput. Sci. 157(2): 259-266 (1996)
12EEIgor Shparlinski: On Finding Primitive Roots in Finite Fields. Theor. Comput. Sci. 157(2): 273-275 (1996)
1995
11 Joachim von zur Gathen, Igor Shparlinski: Finding Points on Curves over Finite Fields (Extended Abstract). FOCS 1995: 284-292
10EEJoachim von zur Gathen, Igor Shparlinski: Orders of Gauss Periods in Finite Fields. ISAAC 1995: 208-215
1994
9 Igor Shparlinski: On some applications of finitely generated semi-groups. ANTS 1994: 265-279
8EEJoachim von zur Gathen, Igor Shparlinski: Components and Projections of Curves over Finite Fields. ISAAC 1994: 297-305
1993
7EEJoachim von zur Gathen, Marek Karpinski, Igor Shparlinski: Counting curves and their projections. STOC 1993: 805-812
6 Igor Shparlinski: Finding Irreducible and Primitive Polynomials. Appl. Algebra Eng. Commun. Comput. 4: 263-268 (1993)
5EEIgor Shparlinski: On Parameters of Some Graphs from Finite Fields. Eur. J. Comb. 14(6): 589-591 (1993)
1992
4 Igor Shparlinski: A Deterministic Test for Permutation Polynomials. Computational Complexity 2: 129-132 (1992)
3 V. I. Galiev, A. F. Polupanov, Igor Shparlinski: Distances from Differences of Roots of Polynomials to the Nearest Integers. Inf. Process. Lett. 43(3): 143-146 (1992)
1991
2EEIgor Shparlinski: On Gaussian Sums for Finite Fields and Elliptic Curves. Algebraic Coding 1991: 5-15
1987
1 S. A. Stepanov, Igor Shparlinski: On Structure Complexity of Normal Basis of Finite Field. FCT 1987: 414-416

Coauthor Index

1Eric Allender [25] [28] [58] [90]
2William D. Banks [29] [48] [50] [52] [81] [97]
3Anna Bernasconi [16] [18] [27] [32] [45] [59] [90]
4Simon R. Blackburn [93] [121] [123] [134]
5Ian F. Blake [126]
6Dan Boneh [68]
7Serdar Boztas [71]
8Jin-yi Cai [31]
9Bruno Codenotti [75] [77]
10Alina Carmen Cojocaru [141]
11Alessandro Conflitti [97] [98]
12Scott Contini [102] [117]
13Don Coppersmith [38] [118]
14Ernie Croot [102]
15Wim van Dam [138]
16Carsten Damm [16] [32] [45] [59] [90]
17Gudmund Skovbjerg Frandsen [108]
18John Friedlander [26] [53] [54] [55] [142]
19Steven D. Galbraith [110]
20V. I. Galiev [3]
21Moubariz Z. Garaev [120] [122]
22Theodoulos Garefalakis [126]
23Joachim von zur Gathen [7] [8] [10] [11] [15] [17] [20] [21] [35] [37] [85] [90] [103] [104] [109] [127] [140]
24Domingo Gomez-Perez [93] [121]
25Mark Goresky [96]
26Sidney W. Graham [136]
27Frances Griffin [29] [30] [33] [41]
28Venkatesan Guruswami [91]
29Jaime Gutierrez [87] [93] [121]
30Sean Hallgren [116]
31George Havas [31]
32Florian Hess [112]
33Herbie J. Hopkins [110]
34Nick Howgrave-Graham [86] [118]
35Marek Karpinski [7] [13] [15] [23] [34] [36]
36Andrew Klapper [96]
37David R. Kohel [51]
38Sergei Konyagin [89]
39Tanja Lange [89] [114]
40Michael Larsen [26]
41Arjen K. Lenstra [65] [79]
42Wen-Ching W. Li [82]
43Daniel Lieman [26] [29] [48] [50] [52]
44Florian Luca [119] [120] [122]
45Edwin El Mahassni [60] [67]
46Bernard Mans [22] [31] [76] [107]
47Ram Murty [96]
48David Naccache [137]
49Mats Näslund [80] [82] [92] [106]
50Ajay Nerurkar [31]
51Phong Q. Nguyen [67] [69] [73] [86] [88] [118]
52Harald Niederreiter [33] [47] [56] [94] [95]
53Francesco Pappalardi [22] [76]
54Erion Plaku [66]
55A. F. Polupanov [3]
56Carl Pomerance [54] [84]
57Alfred J. van der Poorten [36]
58Alexander Russell [100] [116]
59Michael E. Saks [25] [28] [58] [90]
60Jean-Pierre Seifert [31]
61Joseph H. Silverman [61]
62Alistair Sinclair [85]
63Ron Steinfeld [83] [99] [131]
64S. A. Stepanov [1]
65Van Thuong To [50]
66Maria Isabel Gonzalez Vasco [42] [44] [72] [80] [106]
67William Whyte [92]
68Arne Winterhof [77] [87] [105] [111] [113] [122] [125] [128] [129] [132]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)