Publications :: Search

Show venue

On this page you see the details of the selected venue.

Conference
Name:	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009
DBLP:	db/conf/stoc/stoc2009.html
Bookmark:

Below you find the publications assigned to this venue.

Show item 1 to 10 of 79  

Select a publication
Show	Title	Venue	Rating	Date
	Conference paper Nam H. Nguyen, Thong T. Do, Trac D. Tran. A fast and efficient algorithm for low-rank approximation of a matrix.	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009	(0)	2009
	Conference paper Yevgeniy Dodis, Yael Tauman Kalai, Shachar Lovett. On cryptography with auxiliary input.	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009	(0)	2009
	Conference paper Yi-Kai Liu. Quantum algorithms using the curvelet transform.	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009	(0)	2009
	Conference paper Robin A. Moser. A constructive proof of the Lovász local lemma.	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009	(0)	2009
	Conference paper Anupam Gupta, Amit Kumar. A constant-factor approximation for stochastic Steiner forest.	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009	(0)	2009
	Conference paper Ravi Montenegro, Prasad Tetali. How long does it take to catch a wild kangaroo?	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009	(0)	2009
	Conference paper Ken-ichi Kawarabayashi, Bruce A. Reed. Hadwiger's conjecture is decidable.	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009	(0)	2009
	Conference paper Yossi Azar, Iftah Gamzu, Xiaoxin Yin. Multiple intents re-ranking.	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009	(0)	2009
	Conference paper Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan. On the complexity of differentially private data release: efficient algorithms and hardness results.	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009	(0)	2009
	Conference paper Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty. Fault-tolerant spanners for general graphs.	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009	(0)	2009

Show item 1 to 10 of 79  

Your query returned 79 matches in the database.