#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1998

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Talya Eden, Amit Levi, Dana Ron
- 2015 IEEE 56th Annual Symposium on Foundations of…
- 2015

We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read the entire graph. In this work we design a sublinear-time algorithm for approximating the number of triangles in a graph, where the algorithm is given query access to the graph. The… (More)

- C. Bochna, B. P. Terburg, +86 authors C. Yan
- 1998

The first measurements of the differential cross section for the d͑g, p͒n reaction up to 4.0 GeV were performed at the Continuous Electron Beam Accelerator Facility (CEBAF) at Thomas Jefferson Laboratory. We report the cross sections at the proton center-of-mass angles of 36

- Talya Eden, Dana Ron, Seshadhri Comandur
- ArXiv
- 2016

- G. M. Huber, H. P. Blok, +74 authors X. Zheng
- 2008

The charged pion form factor, F π (Q 2), is an important quantity that can be used to advance our knowledge of hadronic structure. However, the extraction of F π from data requires a model of the 1 H(e, e π +)n reaction and thus is inherently model dependent. Therefore, a detailed description of the extraction of the charged pion form factor from… (More)

- T Eden
- Occupational health & safety
- 2000

- Talya Eden, Dana Ron, C. Seshadhri
- 2016

We revisit the classic problem of estimating the degree distribution moments of an undirected graph. Consider an undirected graph G = (V, E) with n (non-isolated) vertices, and define (for s > 0) µ s = 1 n · v∈V d s v. Our aim is to estimate µ s within a multiplicative error of (1 + ε) (for a given approximation parameter ε > 0) in sublinear time. We… (More)

- Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron
- Electronic Colloquium on Computational Complexity
- 2016

The function f : {−1, 1} n → {−1, 1} is a k-junta if it depends on at most k of its variables. We consider the problem of tolerant testing of k-juntas, where the testing algorithm must accept any function that is ǫ-close to some k-junta and reject any function that is ǫ ′-far from every k ′-junta for some ǫ ′ = O(ǫ) and k ′ = O(k). Our first result is an… (More)

- R. M. Mohring, D. Abbott, +87 authors B. Zeidman
- 2008

We report measurements of cross sections for the reaction p(e,e ′ K +)Y, for both the Λ and Σ 0 hyperon states, at an invariant mass of W =1.84 GeV and four-momentum transfers 0.5 < Q 2 < 2 (GeV/c) 2. Data were taken for three values of virtual photon polarization ǫ, allowing the decomposition of the cross sections into longitudinal and transverse… (More)

- T Eden
- Occupational health & safety
- 2000

- ‹
- 1
- ›