#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1971

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

A Gbit/sec optical fiber communication experiment was performed. The maximum speed was 3 Gbit/sec with a BH laser and 5 Gbits/sec with a TJS laser. A 500-m single-mode fiber was used, and the power was coupled by mounting the laser butt-end to the fiber, giving a minimum loss of 10 dB. The receiver employed a Si-avalanche photodiode with an impulse-response… (More)

- S Milham, J B Hatfield, R Tell
- Bioelectromagnetics
- 1999

Magnetic fields emanate from radial tires due to the presence of reinforcing belts which are made of magnetized steel wire. When these tires spin, they generate alternating magnetic fields of extremely low frequency (ELF), usually below 20 Hz. The fundamental frequency of these fields is determined by tire rotation rate and has a sinusoidal waveform with a… (More)

- R T Tell, R J Sydiskis, R D Isaacs, W M Davidson
- American journal of orthodontics and dentofacial…
- 1988

The purpose of this study was to examine the potential toxic effects of several orthodontic adhesives immediately after polymerization and at various time intervals up to 2 years postopolymerization by means of an in vitro overlay assay. Adhesive samples were incubated on tissue cultures containing an agar overlay with a vital dye (neutral red). Viable… (More)

- Roei Tell
- Electronic Colloquium on Computational Complexity
- 2014

We provide an alternative proof for a known result stating that Ω(k) queries are needed to test k-sparse linear Boolean functions. Similar to the approach of Blais and Kane (2012), we reduce the proof to the analysis of Hamming weights of vectors in a ne subspaces of the Boolean hypercube. However, we derive our proof from a general result by Linial and… (More)

- Roei Tell
- Electronic Colloquium on Computational Complexity
- 2014

A few years ago, Blais, Brody, and Matulef (2012) presented a methodology for proving lower bounds for property testing problems by reducing them from problems in communication complexity. Recently, Bhrushundi, Chakraborty, and Kulkarni (2014) showed that some reductions of this type can be deconstructed to two separate reductions, from communication… (More)

- Roei Tell
- Electronic Colloquium on Computational Complexity
- 2016

- Roei Tell
- Electronic Colloquium on Computational Complexity
- 2016

This work studies the question of quantified derandomization, which was introduced by Goldreich and Wigderson (STOC 2014). The generic quantified derandomization problem is the following: For a circuit class C and a parameter B = B(n), given a circuit C ∈ C with n input bits, decide whether C rejects all of its inputs, or accepts all but B(n) of its inputs.… (More)

- Decision Trees, Roei Tell
- 2014

A few years ago, Blais, Brody, and Matulef (2012) presented a methodology for proving lower bounds for property testing problems by reducing them from problems in communication complexity. Recently, Bhrushundi, Chakraborty, and Kulkarni (2014) showed that some reductions of this type can be deconstructed to two separate reductions, from communication… (More)

- Roei Tell
- Electronic Colloquium on Computational Complexity
- 2015

This work studies a new type of problems in property testing, called <i>dual problems</i>. For a set Ϊ in a metric space and δ > 0, denote by <b>F</b><sub>δ</sub>(Ϊ) the set of elements that are δ-far from Ϊ. Then, in property testing, a δtester for π is required to accept inputs from Ϊ and reject inputs from… (More)