Other Papers

Reuven Bar-Yehuda

1.   Bar-Yehuda, R. and U. Vishkin. Complexity of finding k-path-free dominating sets in graphs. Information Processing Letters, 14(5):228--232, 1982. BibTeX

2.   Bar-Yehuda, R., T. Etzion, and S. Moran. Rotating-table games and derivatives of words. Theoretical Computer Science, 108:311--329, 1993. BibTeX+Abstract

3.   Bar-Yehuda, R. and T. Etzion. Connections between two cycles -- A new design of dense processor interconnection networks. Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 38:29--43, 1992. BibTeX+Abstract

4.   Bar-Yehuda, R. G. Even and S. Naor. Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems
5.   Becker, A., R. Bar-Yehuda, and D. Geiger. Random algorithms for the loop cutset problem. Journal Artificial Intelligence Research. PostScript BibTeX+Abstract

• About this document ...