• Publications
  • Influence
Singularity Analysis of Generating Functions
TLDR
This work presents a class of methods by which one can translate, on a term-by-term basis, an asymptotic expansion of a function around a dominant singularity into a corresponding expansion for the Taylor coefficients of the function. Expand
Solving low density subset sum problems
  • J. Lagarias, A. Odlyzko
  • Computer Science, Mathematics
  • 24th Annual Symposium on Foundations of Computer…
  • 1983
TLDR
The subset sum problem is to decide whether or not the 0-1 integer programming problem Σi=1n aixi = M; all xi = 0 or 1; has a solution, where the ai and M are given positive integers. Expand
Algebraic properties of cellular automata
Cellular automata are discrete dynamical systems, of simple construction but complex and varied behaviour. Algebraic techniques are used to give an extensive analysis of the global properties of aExpand
Random Mapping Statistics
TLDR
This paper introduces a general framework in which the analysis of about twenty characteristic parameters of random mappings is carried out: These parameters are studied systematically through the use of generating functions and singularity analysis. Expand
Asymptotic enumeration methods
TLDR
Asymptotic enumeration methods provide quantitative information about the rate of growth of functions that count combinatorial objects. Expand
On the distribution of spacings between zeros of the zeta function
Etude numerique de la distribution des espacements des zeros de la fonction zeta de Riemann. Observation de certains phenomenes inatendus
A bound for the least prime ideal in the Chebotarev Density Theorem
as x --, oc. In [7] two versions of the Chebotarev density theorem were proved, one unconditional and the other on the assumption of the Generalized Riemann Hypothesis (GRH), each of which expressedExpand
Discrete Logarithms in Finite Fields and Their Cryptographic Significance
  • A. Odlyzko
  • Mathematics, Computer Science
  • EUROCRYPT
  • 1 December 1985
TLDR
This paper surveys and analyzes known algorithms in this area, with special attention devoted to algorithms for the fields GF(2n). Expand
New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions
TLDR
New upper bounds are given for the maximum number, τ n , of nonoverlapping unit spheres that can touch a unit sphere in n -dimensional Euclidean space, for n ⩽24. Expand
Paris metro pricing for the internet
TLDR
A simple approach, called PMP (Paris Metro Pricing), is suggested for providing differentiated services in packet networks, each of which would treat all packets equally on a best effort basis. Expand
...
1
2
3
4
5
...