# Collision problem

## Papers overview

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

2017

2017

- ICALP
- 2017

The Orbit Problem consists of determining, given a matrix A âˆˆ RdÃ—d and vectors x, y âˆˆ R, whether there exists n âˆˆ N such that Aâ€¦Â (More)

Is this relevant?

2009

2009

- Personal and Ubiquitous Computing
- 2009

With the emergence of wireless RFID technologies, the problem of scheduling transmissions in dynamic RFID systems has beenâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- International Symposium on Applications and theâ€¦
- 2006

HiQ is a hierarchical, online learning algorithm that finds dynamic solutions to the reader collision problem in RFID systemsâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE International Symposium on Microwaveâ€¦
- 2005

In a multi-reader environment, RFID system performance will be limited by the reader collision problem. RFID readers useâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- 13th IEEE International Conference on Networksâ€¦
- 2005

Radio frequency identification (RFID) is a means to identify and track objects using radio frequency transmission. An RFID systemâ€¦Â (More)

Is this relevant?

2005

2005

- Theory of Computing
- 2005

We extend Aaronson and Shiâ€™s quantum lower bound for the -to-one collision problem. Anr-to-one function is one where everyâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- J. ACM
- 2004

Given a function <i>f</i> as an oracle, the collision problem is to find two distinct indexes <i>i</i> and <i>j</i> such that <iâ€¦Â (More)

Is this relevant?

2003

2003

- 2003

This thesis presents HiQ, a hierarchical, online learning algorithm that finds dynamic solutions to the Reader Collision Problemâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- STOC
- 2002

(MATH) The collision problem is to decide whether a function <i>X</i>: { 1,&ldots;,<i>n</i>} â†’ { 1, &ldots;,<i>n</i>} is one-toâ€¦Â (More)

Is this relevant?

Highly Cited

2002