Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Jeffrey Lagarias

Known as: Jeffrey C Lagarias, Lagarias, Jeffrey Clark Lagarias 
Jeffrey Clark Lagarias (born November 16, 1949 in Pittsburgh, Pennsylvania, United States) is a mathematician and professor at the University of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
We construct a simple fully homomorphic encryption scheme, using only elementary modular arithmetic. We use Gentry’s technique to… Expand
  • figure 1
Is this relevant?
2004
2004
For an expanding integral s×s matrix A with |detA|=p, it is well known that if D={d0,…,dp−1}⊂Zs is a complete set of coset… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We show simple constant-round interactive proof systems for problems capturing the approximability, to within a factor of n, of… Expand
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Abstract Apollonian circle packings arise by repeatedly filling the interstices between mutually tangent circles with further… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We show that the shortest vector problem in lattices with La norm is NP-hard for randomized reductions. Moreover we also show… Expand
Is this relevant?
1996
1996
Let π(x) denote the number of primes ≤ x. Our aim in this paper is to present some refinements of a combinatorial method for… Expand
  • figure 1
  • table 1
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Classic cryptographic protocols based on user-chosen keys allow an attacker to mount password-guessing attacks. A combination of… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
In this note are proved two conjectures of Daubechies and Lagarias. The first asserts that if Z is a bounded set of matrices such… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
We give a simple analysis of an algorithm for solving subset-sum problems proposed by Lagarias and Odlyzko [2]. 
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… Expand
Is this relevant?