Arjen Lenstra

Known as: A. K. Lenstra, Arjen Klaas Lenstra, Lenstra 
Arjen Klaas Lenstra (born 2 March 1956, Groningen) is a Dutch mathematician. He studied mathematics at the University of Amsterdam.He is currently a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
The recent emergence of artemisinin-resistant Plasmodium falciparum malaria in western Cambodia could threaten prospects for… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s… (More)
  • figure 1
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The central idea of this paper is that innovation systems are a very important determinant of technological change. We describe… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The use of Lenstra-Lenstra-Lovasz (LLL) lattice reduction significantly improves the performance of zero-forcing (ZF) and… (More)
  • figure 1
  • figure 2
Is this relevant?
2003
2003
ARJEN DOELMAN , BJÖRN SANDSTEDE , ARND SCHEEL 3 and GUIDO SCHNEIDER 4 1 Korteweg–de Vries Institute, University of Amsterdam… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In query-intensive database application areas, like decision support and data mining, systems that use vertical fragmentation… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
An alternative technique for finding small roots of univaxiate modular equations is described. This approach is then compared… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Supported by NSF grant ECS-8418392 I n t r o d u c t i o n The Integer Programming (feasibility) Problem is the problem of… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We present a hierarchy of polynomial time lattice basis reduction algorithms that stretch from Lenstra, Lenstra, Lovasz reduction… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
The integer programming problem is: Given m×n and m×l matrices A and b respectively of integers, find whether, there exists an… (More)
Is this relevant?