Uriel Feige, Publications, JanuaryPapers are sorted by categories. For papers that have more than one version (typically, journal version and conference proceedings), the diﬀerent versions are combined into one

First Page		Document Content
Date: 2015-01-02 09:14:39 Uriel Feige NP-complete problems Computational complexity theory Adi Shamir Symposium on Theory of Computing International Colloquium on Automata Languages and Programming Symposium on Foundations of Computer Science Approximation algorithm Uriel Theoretical computer science Applied mathematics Mathematics		Uriel Feige, Publications, JanuaryPapers are sorted by categories. For papers that have more than one version (typically, journal version and conference proceedings), the diﬀerent versions are combined into one Add to Reading List Source URL: www.wisdom.weizmann.ac.il Download Document from Source Website File Size: 61,01 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document