In cryptography and the theory of computation, Yao's test is a test defined by Andrew Chi-Chih Yao in 1982, against pseudo-random sequences. Aâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Sam Khater, Matt Nichols, +4 authors Stijn van Nieuwerburgh
- 2016

Our fifth annual Fall Symposium focused on how the upcoming elections will shape the real estate industry. The morning wasâ€¦Â (More)

Is this relevant?

2014

2014

On average only fifty percent of people with long term conditions are adherent to their treatment across diverse disease andâ€¦Â (More)

Is this relevant?

2008

2008

2008

- Eli Biham, Yaron J. Goren, Yuval Ishai
- TCC
- 2008

In one of the pioneering papers on public-key cryptography, Ralph Merkle suggested a heuristic protocol for exchanging a secretâ€¦Â (More)

Is this relevant?

2007

2007

- Satyen Kale
- Electronic Colloquium on Computational Complexity
- 2007

We revisit the connection between boosting algorithms and hard-core set constructions discovered by Klivans and Servedio. Weâ€¦Â (More)

Is this relevant?

2005

2005

- Thomas Fevens, Alaa Eddien Abdallah, Badr Naciri Bennani
- ADHOC-NOW
- 2005

One common design for routing protocols in mobile ad hoc networks is to use positioning information. We combine the class ofâ€¦Â (More)

Is this relevant?

Review

2005

Review

2005

Recently network analyses have seen a rapid growth in various areas. It has been shown that analyzing systems as networks willâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Luca Trevisan
- FOCS
- 2003

We show that Yaoâ€™s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a wayâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Ronen Shaltiel
- computational complexity
- 2001

A fundamental question of complexity theory is the direct product question. A famous example is Yaoâ€™s XOR-lemma, in which oneâ€¦Â (More)

Is this relevant?

1993

1993

- Shin-ichi Kawamura, Ashushi Shimbo
- IEEE Journal on Selected Areas in Communications
- 1993

Four efficient server-aided computation protocols for the modular exponentiation operation are proposed. The serveraidedâ€¦Â (More)

Is this relevant?