Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Shparlinski, Igor E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Products with variables from low-dimensional affine spaces and shifted power identity testing in finite fields
Igor E. Shparlinski
Journal Symbolic Computation
64
, 2014, pp. 35-41
Evasive properties of sparse graphs and some linear equations in primes
Igor E. Shparlinski
Theoretical Computer Science
547
, 2014, pp. 117-121
Correcting noisy exponentiation black-boxes modulo a prime
Igor E. Shparlinski
Information Processing Letters
113
(12), 2013, pp. 414-417
Additive decompositions of subgroups of finite fields
Igor E. Shparlinski
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 1870-1879
On the hidden shifted power problem
Jean Bourgain
,
Moubariz Z. Garaev
,
Sergei V. Konyagin
,
Igor E. Shparlinski
SIAM Journal on Computing
41
(6), 2012, pp. 1524-1557
On the modular inversion hidden number problem
San Ling
,
Igor E. Shparlinski
,
Ron Steinfeld
,
Huaxiong Wang
Journal Symbolic Computation
47
(4), 2012, pp. 358-367
On the power generator and its multivariate analogue
Alina Ostafe
,
Igor E. Shparlinski
Journal of Complexity
28
(2), 2012, pp. 238-249
Pseudorandomness and dynamics of Fermat quotients
Alina Ostafe
,
Igor E. Shparlinski
SIAM Journal on Discrete Mathematics
25
(1), 2011, pp. 50-71
Approximate polynomial GCD: Small degree and small height perturbations
Joachim von zur Gathen
,
Maurice Mignotte
,
Igor E. Shparlinski
Journal Symbolic Computation
45
(8), 2010, pp. 879-886
On the embedding degree of reductions of an elliptic curve
Alina Carmen Cojocaru
,
Igor E. Shparlinski
Information Processing Letters
109
(13), 2009, pp. 652-654
On the distribution of orbits of
\mathrm{PGL_2(q)}
in
{\mathbb F}_{q^n}
and the Klapper conjecture
Igor E. Shparlinski
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 2093-2099
Chinese remaindering with multiplicative noise
Igor E. Shparlinski
,
Ron Steinfeld
Theory of Computing Systems
40
(1), 2007, pp. 33-41
Quantum period reconstruction of approximate sequences
Igor E. Shparlinski
,
Arne Winterhof
Information Processing Letters
103
(6), 2007, pp. 211-215
Bounds on the Fourier coefficients of the weighted sum function
Igor E. Shparlinski
Information Processing Letters
103
(3), 2007, pp. 83-87
Reconstructing noisy polynomial evaluation in residue rings
Simon R. Blackburn
,
Domingo Gomez-Perez
,
Jaime Gutierrez
,
Igor E. Shparlinski
Journal of Algorithms
61
(2), 2006, pp. 47-59
Catalan and Apéry numbers in residue classes
Moubariz Z. Garaev
,
Florian Luca
,
Igor E. Shparlinski
Journal of Combinatorial Theory Series A
113
(5), 2006, pp. 851-865
GCD of random linear combinations
Joachim von zur Gathen
,
Igor E. Shparlinski
Algorithmica
46
(1), 2006, pp. 137-148
Quantum noisy rational function reconstruction
Sean Hallgren
,
Alexander Russell
,
Igor E. Shparlinski
Lecture Notes in Computer Science
3595
, 2005, pp. 420-429
On the linear complexity of bounded integer sequences over different moduli
Igor E. Shparlinski
,
Arne Winterhof
Information Processing Letters
96
(5), 2005, pp. 175-177
Number theoretic designs for directed regular graphs of small diameter
William D. Banks
,
Alessandro Conflitti
,
Igor E. Shparlinski
SIAM Journal on Discrete Mathematics
17
(3), 2004, pp. 377-383
On reducing a system of equations to a single equation
Gudmund S. Frandsen
,
Igor E. Shparlinski
Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, ISSAC'2004 (University of Cantabria, Santander, Spain, July 04-07, 2004)
, 2004, pp. 163-166
Classical and quantum function reconstruction via character evaluation
Alexander Russell
,
Igor E. Shparlinski
Journal of Complexity
20
(2-3), 2004, pp. 404-422
Noisy Chinese remaindering in the Lee norm
Igor E. Shparlinski
,
Ron Steinfeld
Journal of Complexity
20
(2-3), 2004, pp. 423-437
On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
Igor E. Shparlinski
Information Processing Letters
92
(3), 2004, pp. 143-147
GCD of random linear forms
Joachim von zur Gathen
,
Igor E. Shparlinski
Lecture Notes in Computer Science
3341
, 2004, pp. 464-469
Seiten 1
2
3
4
>