Matthew Cary

According to our database, Matthew Cary authored at least 10 papers between 2001 and 2014.

Collaborative distances:

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

2014

Convergence of Position Auctions under Myopic Best-Response Dynamics.

Matthew Cary, Aparna Das, Benjamin Edelman, Ioannis Giotis, Kurtis Heimerl, Anna R. Karlin, Scott Duke Kominers, Claire Mathieu, Michael Schwarz

ACM Trans. Economics and Comput., 2014

2010

Floodlight illumination of infinite wedges.

Matthew Cary, Atri Rudra, Ashish Sabharwal, Erik Vee

Comput. Geom., 2010

2008

Auctions for structured procurement.

Matthew Cary, Abraham D. Flaxman, Jason D. Hartline, Anna R. Karlin

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

The Long-Short-Key Primitive and Its Applications to Key Security.

Matthew Cary, Matthias Jacob, Mariusz H. Jakubowski, Ramarathnam Venkatesan

Proceedings of the Advances in Information and Computer Security, 2008

2007

On profit maximization in mechanism design.

Matthew Cary

PhD thesis, 2007

Greedy bidding strategies for keyword auctions.

Matthew Cary, Aparna Das, Benjamin Edelman, Ioannis Giotis, Kurtis Heimerl, Anna R. Karlin, Claire Mathieu, Michael Schwarz

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics.

Matthew Cary, Atri Rudra, Ashish Sabharwal

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2003

A Message Authentication Code Based on Unimodular Matrix Groups.

Matthew Cary, Ramarathnam Venkatesan

Proceedings of the Advances in Cryptology, 2003

2002

Oblivious Hashing: A Stealthy Software Integrity Verification Primitive.

Yuqun Chen, Ramarathnam Venkatesan, Matthew Cary, Ruoming Pang, Saurabh Sinha, Mariusz H. Jakubowski

Proceedings of the Information Hiding, 5th International Workshop, 2002

2001

Toward Optimal epsilon-Approximate Nearest Neighbor Algorithms.

Matthew Cary

J. Algorithms, 2001