ANTS
1994
Springer
14 years 9 months ago
1994
Springer
STOC
2010
ACM
14 years 9 months ago
2010
ACM
STOC
2010
ACM
14 years 9 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
STOC
2010
ACM
14 years 9 months ago
2010
ACM
We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of ...
STOC
2010
ACM
14 years 9 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
STOC
2010
ACM
14 years 9 months ago
2010
ACM
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
AAECC
1993
Springer
14 years 9 months ago
1993
Springer
We give estimates for exponential sums over finite fields in several variables. We study the case where the phase is either quadratic or more generally invariant under the action ...
AAECC
1993
Springer
14 years 9 months ago
1993
Springer
Symplectic integrators are numerical integration schemes for hamiltonian systems. The integration step is an explicit symplectic map. We find symplectic integrators using universa...
CIAC
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a roote...
CIAC
2010
Springer
14 years 9 months ago
2010
Springer