- S. Even, A. Pnueli, and A. Lempel. Permutation graphs and transitive
graphs. Journal of the ACM, 19(3):400-410, July 1972.
Citations,
etc.
- Y. Perl, M. R. Garey, and S. Even. Efficient generation of optimal
prefix code: Equiprobable words using unequal cost letters.
Journal of the ACM, 22(2):202-214, April 1975.
Citations.
- S. Even and R. E. Tarjan. A
combinatorial problem which is complete in polynomial space.
Journal of the ACM, 23(4):710-719, October 1976.
Citations.
- Shimon Even and Yossi Shiloach. An on-line edge-deletion problem.
Journal of the ACM, 28(1):1-4, January 1981.
Citations.
- Michael Rodeh, Vaughan R. Pratt, and Shimon Even. Linear algorithm for data
compression via string matching. Journal of the ACM,
28(1):16-24, January 1981.
Citations.
- Shimon Even, Alan L. Selman, and Yacov Yacobi. Hard-core theorems for complexity
classes. Journal of the ACM, 32(1):205-217, January
1985.
Citations.
Shortcuts: