Periklis A. Papakonstantinou

	2009
6		Periklis A. Papakonstantinou: On the Structure of Optimal Greedy Computation (for Job Scheduling). MFCS 2009: 612-623
5		Christophe Meyer, Periklis A. Papakonstantinou: On the complexity of constructing Golomb Rulers. Discrete Applied Mathematics 157(4): 738-748 (2009)
4		Periklis A. Papakonstantinou: A note on width-parameterized SAT: An exact machine-model characterization. Inf. Process. Lett. 110(1): 8-12 (2009)
	2008
3		Dan Boneh, Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis, Brent Waters: On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations. FOCS 2008: 283-292
2		Konstantinos Georgiou, Periklis A. Papakonstantinou: Complexity and Algorithms for Well-Structured k-SAT Instances. SAT 2008: 105-118
	2006
1		Periklis A. Papakonstantinou: Hierarchies for classes of priority algorithms for Job Scheduling. Theor. Comput. Sci. 352(1-3): 181-189 (2006)

Coauthor Index

1	Dan Boneh	[3]
2	Konstantinos Georgiou	[2]
3	Christophe Meyer	[5]
4	Charles Rackoff	[3]
5	Yevgeniy Vahlis	[3]
6	Brent Waters (Brent R. Waters)	[3]

Colors in the list of coauthors