Publications :: Search

Show venue

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

Conference
Name:	Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005
DBLP:	db/conf/stoc/stoc2005.html
Bookmark:

Below you find the publications assigned to this venue.

Show item 1 to 85 of 85  

Select a publication
Show	Title	Venue	Rating	Date
	Conference paper Miklós Ajtai. Representing hard lattices with O(n log n) bits.	Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005	(0)	2005
	Conference paper Scott Aaronson. The complexity of agreement.	Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005	(0)	2005
	Conference paper Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore. On the bias of traceroute sampling: or, power-law degree distributions in regular graphs.	Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005	(0)	2005
	Conference paper Michael Alekhnovich. Lower bounds for k-DNF resolution on random 3-CNFs.	Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005	(0)	2005
	Conference paper Micah Adler, Jeff Edmonds, Jirí Matousek. Towards asymptotic optimality in probabilistic packet marking.	Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005	(0)	2005
	Conference paper Michael Alekhnovich, Sanjeev Arora, Iannis Tourlakis. Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy.	Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005	(0)	2005
	Conference paper Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev. O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems.	Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005	(0)	2005
	Conference paper Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor. Quadratic forms on graphs.	Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005	(0)	2005
	Conference paper Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan. Derandomization of auctions.	Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005	(0)	2005
	Conference paper Noga Alon, Asaf Shapira. Every monotone graph property is testable.	Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005	(0)	2005

Show item 1 to 85 of 85  

Your query returned 85 matches in the database.