The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Igor Shparlinski" ( http://dblp.L3S.de/Authors/Igor_Shparlinski )

URL (Homepage):  http://www.comp.mq.edu.au/~igor/  Author page on DBLP  Author page in RDF  Community of Igor Shparlinski in ASPL-2

Publication years (Num. hits)
1987-1997 (15) 1998-1999 (20) 2000 (19) 2001 (19) 2002-2003 (26) 2004 (16) 2005-2006 (28) 2007-2009 (19) 2010-2012 (16)
Publication types (Num. hits)
article(115) incollection(3) inproceedings(59) proceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 64 occurrences of 39 keywords

Results
Found 178 publication records. Showing 178 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1San Ling, Igor Shparlinski, Ron Steinfeld, Huaxiong Wang On the modular inversion hidden number problem. Search on Bibsonomy J. Symb. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jorge Jiménez Urroz, Florian Luca, Igor Shparlinski On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves. Search on Bibsonomy Math. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Reza Rezaeian Farashahi, Igor Shparlinski Pseudorandom Bits From Points on Elliptic Curves. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Bernard Mans, Igor Shparlinski Random Walks and Bisections in Random Circulant Graphs. Search on Bibsonomy LATIN The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jean Bourgain, Sergei Konyagin, Igor Shparlinski On the Hidden Shifted Power Problem Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Alina Ostafe, Igor Shparlinski Pseudorandomness and Dynamics of Fermat Quotients. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski Computational Diffie-Hellman Problem. Search on Bibsonomy Encyclopedia of Cryptography and Security (2nd Ed.) The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Maurice Mignotte, Igor Shparlinski Approximate polynomial GCD: Small degree and small height perturbations. Search on Bibsonomy J. Symb. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Alina Ostafe, Elena Pelican, Igor Shparlinski On pseudorandom numbers from multivariate polynomial systems. Search on Bibsonomy Finite Fields and Their Applications The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Neal Koblitz, Alfred Menezes, Igor Shparlinski Discrete Logarithms, Diffie-Hellman, and Reductions. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2010 DBLP  BibTeX  RDF
1Reza Rezaeian Farashahi, Pierre-Alain Fouque, Igor Shparlinski, Mehdi Tibouchi, José Felipe Voloch Indifferentiable Deterministic Hashing to Elliptic and Hyperelliptic Curves. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2010 DBLP  BibTeX  RDF
1Alina Ostafe, Igor Shparlinski Pseudorandom numbers and hash functions from iterations of multivariate polynomials. Search on Bibsonomy Cryptography and Communications The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Reza Rezaeian Farashahi, Igor Shparlinski Pseudorandom Bits From Points on Elliptic Curves Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Igor Shparlinski On the Distribution of Orbits of PGL2(q) in Fqn and the Klapper Conjecture. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Lev Glebsky, Igor Shparlinski Short cycles in repeated exponentiation modulo a prime. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Reza Rezaeian Farashahi, Igor Shparlinski On the number of distinct elliptic curves in some families. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Alina Carmen Cojocaru, Igor Shparlinski On the embedding degree of reductions of an elliptic curve. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Nicholas M. Katz, Igor Shparlinski, Maosheng Xiong On character sums with distances on the upper half plane over a finite field. Search on Bibsonomy Finite Fields and Their Applications The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski On the values of Kloosterman sums. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1David Naccache, Igor Shparlinski Divisibility, Smoothness and Cryptographic Applications. Search on Bibsonomy Algebraic Aspects of Digital Communications The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1John Friedlander, Igor Shparlinski Elliptic Twin Prime Conjecture. Search on Bibsonomy IWCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski Bilinear character sums over elliptic curves. Search on Bibsonomy Finite Fields and Their Applications The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski On the elliptic curve analogue of the sum-product problem. Search on Bibsonomy Finite Fields and Their Applications The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1David Naccache, Igor Shparlinski Divisibility, Smoothness and Cryptographic Applications. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1David Naccache, Igor Shparlinski Divisibility, Smoothness and Cryptographic Applications Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Sidney W. Graham, Igor Shparlinski On RSA moduli with almost half of the bits prescribed. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski Pseudorandom Graphs from Elliptic Curves. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Pseudorandom graph, elliptic curve, exponential sum
1Joachim von zur Gathen, Igor Shparlinski Approximate Polynomial gcd: Small Degree and Small Height Perturbations. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Euclidean algorithm, gcd, approximate computation
1Wim van Dam, Igor Shparlinski Classical and Quantum Algorithms for Exponential Congruences. Search on Bibsonomy TQC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski, Arne Winterhof Quantum period reconstruction of approximate sequences. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski Bounds on the Fourier coefficients of the weighted sum function. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Simon R. Blackburn, Igor Shparlinski Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131]. Search on Bibsonomy Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski Communication complexity of some number theoretic functions. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski, Ron Steinfeld Chinese Remaindering with Multiplicative Noise. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski A computational introduction to number theory and algebra. Search on Bibsonomy Math. Comput. The full citation details ... 2007 DBLP  BibTeX  RDF
1Moubariz Z. Garaev, Florian Luca, Igor Shparlinski Catalan and Apéry numbers in residue classes. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Simon R. Blackburn, Igor Shparlinski Character sums and nonlinear recurrence sequences. Search on Bibsonomy Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski GCD of Random Linear Combinations. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski Exponential sums with Dickson polynomials. Search on Bibsonomy Finite Fields and Their Applications The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski, Arne Winterhof On the nonlinearity of linear recurrence sequences. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski Reconstructing noisy polynomial evaluation in residue rings. Search on Bibsonomy J. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Florian Luca, Igor Shparlinski Elliptic Curves with Low Embedding Degree. Search on Bibsonomy J. Cryptology The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Ian F. Blake, Theodoulos Garefalakis, Igor Shparlinski On the bit security of the Diffie-Hellman key. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Diffie-Hellman protocol, Bit security, Exponential sums
1Scott Contini, Ernie Croot, Igor Shparlinski Complexity of inverting the Euler function. Search on Bibsonomy Math. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski On RSA Moduli with Prescribed Bit Patterns. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2006 DBLP  DOI  BibTeX  RDF AMS Classification 11N25, 11T23, 11T71
1Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski Testing set proportionality and the Ádám isomorphism of circulant graphs. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Moubariz Z. Garaev, Florian Luca, Igor Shparlinski, Arne Winterhof On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski, Arne Winterhof On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences. Search on Bibsonomy SETA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski, Arne Winterhof Constructions of Approximately Mutually Unbiased Bases. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski Bounds on the Fourier Coefficients of the Weighted Sum Function. Search on Bibsonomy Complexity of Boolean Functions The full citation details ... 2006 DBLP  BibTeX  RDF
1Igor Shparlinski, Arne Winterhof On the linear complexity of bounded integer sequences over different moduli. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski On the singularity of generalised Vandermonde matrices over finite fields. Search on Bibsonomy Finite Fields and Their Applications The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Florian Luca, Igor Shparlinski Elliptic Curves with Low Embedding Degree. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2005 DBLP  BibTeX  RDF
1Tanja Lange, Igor Shparlinski Collisions in Fast Generation of Ideal Classes and Points on Hyperelliptic and Elliptic Curves. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Public Key Cryptography, Collisions, Discrete Logarithm, Hyperelliptic Curves, Koblitz Curves
1Igor Shparlinski, Arne Winterhof Noisy interpolation of sparse polynomials in finite fields. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Noisy interpolation, Finite fields, Lattice reduction, Exponential sums, Sparse polynomials, Hidden number problem
1Igor Shparlinski, Arne Winterhof A hidden number problem in small subgroups. Search on Bibsonomy Math. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski Predicting nonlinear pseudorandom number generators. Search on Bibsonomy Math. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski Report on global methods for combinatorial isoperimetric problems. Search on Bibsonomy Math. Comput. The full citation details ... 2005 DBLP  BibTeX  RDF
1Florian Hess, Igor Shparlinski On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2005 DBLP  DOI  BibTeX  RDF elliptic curves, exponential sums, pseudorandom number generators
1Éric Levieil, Florian Luca, Igor Shparlinski Prime divisors of some shifted products. Search on Bibsonomy Int. J. Math. Mathematical Sciences The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski Diffie-Hellman Problem. Search on Bibsonomy Encyclopedia of Cryptography and Security The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Scott Contini, Igor Shparlinski On Stern's Attack Against Secret Truncated Linear Congruential Generators. Search on Bibsonomy ACISP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Sean Hallgren, Alexander Russell, Igor Shparlinski Quantum Noisy Rational Function Reconstruction. Search on Bibsonomy COCOON The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Scott Contini, Ernie Croot, Igor Shparlinski Complexity of Inverting the Euler Function Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Alexander Russell, Igor Shparlinski Classical and quantum function reconstruction via character evaluation. Search on Bibsonomy J. Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski, Ron Steinfeld Noisy Chinese remaindering in the Lee norm. Search on Bibsonomy J. Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski Security of polynomial transformations of the Diffie-Hellman key. Search on Bibsonomy Finite Fields and Their Applications The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Mark Goresky, Andrew Klapper, Ram Murty, Igor Shparlinski On Decimations of l-Sequences. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1William D. Banks, Alessandro Conflitti, Igor Shparlinski Number Theoretic Designs for Directed Regular Graphs of Small Diameter. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Alessandro Conflitti, Igor Shparlinski On the multidimensional distribution of the subset sum generator of pseudorandom numbers. Search on Bibsonomy Math. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski Polynomial interpolation from multiples. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF black box polynomial, hidden polynomial, integer lattices, short vectors, approximate computation
1Steven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski Secure Bilinear Diffie-Hellman Bits. Search on Bibsonomy ACISP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Bernard Mans, Igor Shparlinski Bisecting and Gossiping in Circulant Graphs. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski, Arne Winterhof A Nonuniform Algorithm for the Hidden Number Problem in Subgroups. Search on Bibsonomy Public Key Cryptography The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Maria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski New Results on the Hardness of Diffie-Hellman Bits. Search on Bibsonomy Public Key Cryptography The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski Predicting Subset Sum Pseudorandom Generators. Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski GCD of Random Linear Forms. Search on Bibsonomy ISAAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Gudmund Skovbjerg Frandsen, Igor Shparlinski On reducing a system of equations to a single equation. Search on Bibsonomy ISSAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF system of equations
1Igor Shparlinski, Arne Winterhof Hidden Number Problem in Small Subgroups. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2003 DBLP  BibTeX  RDF
1Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski Complexity of some arithmetic problems for binary polynomials. Search on Bibsonomy Computational Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000). ((no classification))
1Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation. Search on Bibsonomy Math. Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski, Alistair Sinclair Finding Points on Curves over Finite Fields. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Phong Q. Nguyen, Igor Shparlinski The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2003 DBLP  DOI  BibTeX  RDF cryptanalysis, distribution, lattices, elliptic curves, discrepancy, exponential sums, ECDSA, LLL, closest vector problem
1Sergei Konyagin, Tanja Lange, Igor Shparlinski Linear Complexity of the Discrete Logarithm. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2003 DBLP  BibTeX  RDF
1Jaime Gutierrez, Igor Shparlinski, Arne Winterhof On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Venkatesan Guruswami, Igor Shparlinski Unconditional proof of tightness of Johnson bound. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Simon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski Predicting the Inversive Generator. Search on Bibsonomy IMA Int. Conf. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Harald Niederreiter, Igor Shparlinski Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity. Search on Bibsonomy IMA Int. Conf. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Mats Näslund, Igor Shparlinski, William Whyte On the Bit Security of NTRUEncrypt. Search on Bibsonomy Public Key Cryptography The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Harald Niederreiter, Igor Shparlinski Dynamical Systems Generated by Rational Functions. Search on Bibsonomy AAECC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski Security of most significant bits of gx2. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Bruno Codenotti, Igor Shparlinski Non-approximability of the Permanent of Structured Matrices over Finite Fields Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2002 DBLP  BibTeX  RDF
1Bernard Mans, Francesco Pappalardi, Igor Shparlinski On the spectral Ádám property for circulant graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Steven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski Secure Bilinear Diffie-Hellman Bits. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2002 DBLP  BibTeX  RDF
1Bruno Codenotti, Igor Shparlinski, Arne Winterhof On the hardness of approximating the permanent of structured matrices. Search on Bibsonomy Computational Complexity The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000). 11T23, 15A15, 68Q17
1Phong Q. Nguyen, Igor Shparlinski The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. Search on Bibsonomy J. Cryptology The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Igor Shparlinski On the Uniformity of Distribution of the ElGamal Signature. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF ElGamal signature scheme, Exponential sums, Uniform distribution
1Maria Isabel Gonzalez Vasco, Igor Shparlinski Security of the most significant bits of the Shamir message passing scheme. Search on Bibsonomy Math. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Maria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski The Hidden Number Problem in Extension Fields and Its Applications. Search on Bibsonomy LATIN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 178 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.