@inproceedings{AharonovR03,
	author = {D. Aharonov and O. Regev},
	title = {A Lattice Problem in Quantum {NP}},
	booktitle = {Proc. 44th Annual IEEE Symp. on Foundations of Computer Science (FOCS)},
	year = {2003},
	pages = {},
}

@inproceedings{KhotR03,
	author = {Khot, S. and Regev, O.},
	title = {Vertex Cover Might be Hard to Approximate to within $2-\varepsilon$},
	booktitle = {Proc. of 18th IEEE Annual Conference on Computational Complexity (CCC)},
	year = {2003},
	pages = {379--386},
}

@inproceedings{Regev03B,
	author = {O. Regev},
	title = {Improved inapproximability of lattice and coding problems with preprocessing},
	booktitle = {Proc. of 18th IEEE Annual Conference on Computational Complexity (CCC)},
	year = {2003},
	pages = {363--370},
}

@article{KempeR03,
	author = {J. Kempe and O. Regev},
	title = {3-Local Hamiltonian is {QMA}-complete},
	journal = {Quantum Information and Computation},
	volume = {3},
	number = {3},
	year = {2003},
	pages = {258--264},
}


@inproceedings{BaloghRSSS03,
	author = {J. Balogh and O. Regev and C. Smyth and W. Steiger and M. Szegedy},
	title = {Long monotone paths in line arrangements},
	booktitle = {Proc. 19th ACM Symp. on Computational Geometry (SOCG)},
	year = {2003},
	pages = {124--128},
}


@inproceedings{DinurGKR03,
	author = {I. Dinur and V. Guruswami and S. Khot and O. Regev},
	title = {A new multilayered {PCP} and the hardness of hypergraph vertex cover},
	booktitle = {Proc. 35th ACM Symp. on Theory of Computing (STOC)},
	year = {2003},
	pages = {595--601},
}

@inproceedings{Regev03A,
	author = {O. Regev},
	title = {New Lattice Based Cryptographic Constructions},
	booktitle = {Proc. 35th ACM Symp. on Theory of Computing (STOC)},
	year = {2003},
	pages = {407--416},
}

@inproceedings{DinurRS02,
	author = {I. Dinur and O. Regev and C. Smyth},
	title = {The hardness of hypergraph coloring},
	booktitle = {Proc. 43rd Annual IEEE Symp. on Foundations of Computer Science (FOCS)},
	year = {2002},
	pages = {33--40},
}

@inproceedings{Regev02B,
	author = {Regev, O.},
	title = {Quantum computation and lattice problems},
	booktitle = {Proc. 43rd Annual IEEE Symp. on Foundations of Computer Science (FOCS)},
	year = {2002},
	pages = {520-529},
}

@article{Regev02A,
	author = {O. Regev},
	title = {Priority algorithms for makespan minimization in the subset model},
	journal = {Information Processing Letters},
	volume = {84},
	number = {3},
	year = {2003},
	pages = {153--157},
}

@article{ArmonAER03B,
	author = {A. Armon and Y. Azar and L. Epstein and O. Regev},
	title = {On-line restricted assignment of temporary tasks with unknown durations},
	journal = {Information Processing Letters},
	volume = {85},
	number = {2},
	year = {2003},
	pages = {67--72},
}

@article{ArmonAER03A,
	author = {A. Armon and Y. Azar and L. Epstein and O. Regev},
	title = {Temporary tasks assignment resolved},
	journal = {Algorithmica},
	volume = {36},
	number = {3},
	year = {2003},
	pages = {295--314},
	note = {Preliminary version in {\em Proc. of SODA}, 2002},
}

@inproceedings{AzarR01B,
	author = {Y. Azar and O. Regev},
	title = {Strongly polynomial algorithms for the unsplittable flow problem},
	booktitle = {Proc. 8th Conf. on Integer Programming and Combinatorial Optimization (IPCO)},
	year = {2001},
	pages = {15--29},
}

@article{AwerbuchAR01,
	author = {B. Awerbuch and Y. Azar and O. Regev},
	title = {Maximizing job benefits on-line},
	journal = {Journal of Scheduling},
	volume = {4},
	number = {6},
	year = {2001},
	pages = {287--296},
	note = {Preliminary version in {\em Proc. of APPROX}, 2000},
}

@article{AwerbuchALR02,
	author = {B. Awerbuch and Y. Azar and S. Leonardi and O. Regev},
	title = {Minimizing the flow time without migration},
	journal = {SIAM Journal on Computing},
	volume = {31},
	number = {5},
	year = {2002},
	pages = {1370--1382},
	note = {Preliminary version in {\em Proc. of STOC}, 1999},
}

@article{AzarRSW02,
	author = {Y. Azar and O. Regev and J. Sgall and G. Woeginger},
	title = {Off-line temporary tasks assignment},
	journal ={Theoretical Computer Science},
	volume = {287},
	number = {2},
	year = {2002},
	pages = {419--428},
	note = {Preliminary version in {\em Proc. of ESA}, 1999},
}

@article{AzarR01A,
	author = {Y. Azar and O. Regev},
	title = {On-line bin stretching},
	journal = {Theoretical Computer Science},
	volume = {268},
	number = {1},
	year = {2001},
	pages = {17--41},
	note = {Preliminary version in {\em Proc. of RANDOM}, 1998},
}