Prof. Shimon Even

Prof. Shimon Even (deceased)

Contact information
Email:
z__even@cs
Selected publications

EVEN, S., and GRANOT, G., "Grid layout of block diagrams - bounding the number of bends in each connection in graph drawing", R., Tamassia and I.G. Tollis (eds.). Lecture Notes in Computer Science, Vol. 894, pp. 64-75, Springer-Verlag 1995.

EVEN, S., and RAJSBAUM, S., "Unison, canon and sluggish clocks in networks controlled by a synchronizer", Mathematical Systems Theory, Vol. 28, pp. 421-435. 1995.

EVEN, S., GOLDREICH, O., and MICALI, S., "On-line/off-line digital signatures", Journal of Cryptology, Vol. 9, No. 1, pp. 35-67, 1996.

EVEN, S., and RAJSBAUM, S., "The use of a synchronizer yields maximum computation rate in distributed networks", Theory of Computing Systems, Vol. 30, pp. 447-474, 1997.

EVEN, S., LITMAN, A., and WINKLER, P., "Computing with snakes in directed networks of automata", Journal of Algorithms, Vol. 24, pp. 158-170, 1997.

EVEN, S., and MANSOUR, Y., "A construction of a pseudorandom cipher from a single pseudorandom permutation". Journal of Cryptology, Vol. 10, pp. 151-161, 1997.

EVEN, S., and LITMAN, A., "Layered cross product - a technique to construct interconnection networks", Networks, Vol. 29, pp. 219-223, 1997.

EVEN, S., LITMAN, A., and ROSENBERG, A.L., "Monochromatic paths and triangulated graphs", SIAM Journal on Discrete Mathematics, Vol. 11, No. 4, pp. 546-556, 1998.

EVEN, S., ITKIS, G., and RAJSBAUM, S., "On mixed connectivity certificates algorithms", Theoretical Computer Science, Vol. 203, pp. 253-269, 1998.

AVIOR, A., CALAMONERI, T., EVEN, S., LITMAN, A., and ROSENBERG, A.L., "A Tight layout of the butterfly", Theory of Computing Systems, Vol. 31, pp. 475-487, 1998.

COFFMAN, E.G. Jr. and EVEN, S., "A note on limited preemption", Parallel Processing Letters, Vol. 8, No. 1, pp. 3-6, 1998.

EVEN, S., MUTHUKRISHNAN, S., PATERSON, M.S. and SAHINALP, S.C., "Layout of the Batcher Bitonic Sorter", SPAA'98 -Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 172-181, 1998.

EVEN, S., "Four value-adding algorithms", IEEE Spectrum, Vol. 35, No. 5, pp. 33-38, 1998.

DINITZ, Y., EVEN, S., KUPERSHTOK, R. and ZAPOLOTSKY, M., "Some compact layouts of the butterfly", SPAA'99 - Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 54-63, 1999.

EVEN, G. and EVEN S., "Embedding interconnection networks in grids via the layered cross product", Networks, Vol. 36, No. 2, pp. 91-95, 2000.

BHATT, S., EVEN S., GREENBERG, D., and TAYAR, R., "Traversing directed eulerian mazes'', Graph Theoretic Concepts in Computer Science, Proceedings of WG'2000, U. Brandes and D. Wagner (eds), Lecture Notes in Computer Science No. 1928, pp. 35-46, Springer, 2000.