Amir Rothschild

According to our database, Amir Rothschild authored at least 8 papers between 2007 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

Polynomials: a new tool for length reduction in binary discrete convolutions.

Amihood Amir, Oren Kapah, Ely Porat, Amir Rothschild

CoRR, 2014

2012

Mismatch sampling.

Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild

Inf. Comput., 2012

2011

Explicit Nonadaptive Combinatorial Group Testing Schemes.

Ely Porat, Amir Rothschild

IEEE Trans. Inf. Theory, 2011

2010

Pattern matching with don't cares and few errors.

Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild

J. Comput. Syst. Sci., 2010

2009

From coding theory to efficient pattern matching.

Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Improved Deterministic Length Reduction

Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild

CoRR, 2008

Explicit Non-adaptive Combinatorial Group Testing Schemes.

Ely Porat, Amir Rothschild

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

<i>k</i> -Mismatch with Don't Cares.

Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild

Proceedings of the Algorithms, 2007