Bibtex entries of Associate Professor Ran El-Yaniv

@book{BorodinE98,
  author = {A. Borodin and R. El-Yaniv},
  title = {Online Computation and Competitive Analysis},
  year = {1998},
  publisher = {Cambridge University Press},
}

@inproceedings{BekkermanEM05,
  author = {R. Bekkerman and R. El-Yaniv and A. McCallum},
  title = {Multi-Way Distributional Clustering via Pairwise Interactions},
  booktitle = {Proceedings of the 22nd International Conference on Machine Learning (ICML)},
  year = {2005},
  pages = {41--48},
}

@techreport{BegleiterE05,
  author = {R. Begleiter and R. El-Yaniv},
  title = {Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition},
  year = {2005},
  month = {August},
  number = {CS-2005-13},
  type = {Technical Report},
  institution = {Technion - Israel Institute of Technology},
}

@article{DerbekoEM04,
  author = {P. Derbeko and R. El-Yaniv and R. Meir},
  title = {Explicit Learning Curves for Transductive Learning and Application to Clustering and Compression Algorithms},
  journal = {Journal of Artificial Intelligence Research (JAIR)},
  year = {2004},
  volume = {22},
  pages = {117--142},
}

@article{BorodinEG04,
  author = {A. Borodin and R. El-Yaniv and V. Gogan},
  title = {Can We Learn to Beat the Best Stock},
  journal = {Journal of Artificial Intelligence Research},
  year = {2004},
  volume = {21},
  pages = {579-594},
  month = {May},
}

@article{El-YanivFKT01,
  author = {R. El-Yaniv and A. Fiat and R.M. Karp and G. Turpin},
  title = {Optimal Search and One-Way Trading Online Algorithms},
  year = {2001},
  journal = {Algorithmica},
  volume = {30},
  number = {1},
  pages = {101--139},
}

@article{El-YanivK97,
  author = {R. El-Yaniv and R.M. Karp},
  title = {Nearly Optimal Competitive Online Replacement Policies},
  journal = {Mathematics of Operations Research},
  volume = {22},
  number = {4},
  year = {1997},
  pages = {814--839},
}