תמונה של פרופ' אברהם למפל

פרופ' אברהם למפל

Andrew and Erna Finci Viterby Chair of Information Systems

יצירת קשר
דואר אלקטרוני:
lempelcs.technion.ac.il
משרד:
714
טלפון:
04-829-4164
תחומי עניין במחקר
שימושים של מתמטיקה דיסקרטית למדעי המחשב ולתורת האינפורמציה.
פרסומים נבחרים

LEMPEL, A., EVEN, S., and CEDERBAUM, I., "An algorithm for planarity testing of graphs", Theory of Graphs: International Symposium, 1966, P. Rosentiehl (ed.), New York: Gordon & Breach; Paris: Dunod, pp. 215-233, 1967.

LEMPEL, A., "m-ary closed sequences", Journal of Combinatorial Theory, Vol. 10, pp. 253-258, 1971.

LEMPEL, A., and ZIV, J., "On the complexity of finite sequences", IEEE Transactions on Information Theory, Vol. 22, pp. 21-27, 1976.

LEMPEL, A., and WINOGRAD, S., "A new approach to error-correcting codes", IEEE Transactions on Information Theory, Vol. 23, pp. 503-508, 1977.

ZIV, J., and LEMPEL, A., "Compression of individual sequences via variable-rate coding", IEEE Transactions on Information Theory, Vol. 24, pp. 30-536, 1978.

SEROUSSI, G., and LEMPEL, A., "Maximum Likelihood Decoding of Certain Reed-Muller Codes", IEEE Transactions on Information Theory, Vol. 29, pp. 448-450, 1983.

ETZION, T., and LEMPEL, A., "Construction of de Bruijn sequences of minimal complexity", IEEE Transactions on Information Theory, Vol. 30, pp. 705-709, 1984.

LEMPEL, A., and ZIV, J., "Compression of two-dimensional data", IEEE Transactions on Information Theory, Vol. 32, pp. 2-8, 1986.

LEMPEL, A., "Characterization and synthesis of self-complementary normal bases in finite fields", Linear Algebra and its Applications, Vol., 98, pp. 331-346, 1988.

ROTH, R. M., and LEMPEL, A., "On MDS codes via cauchy matrices", IEEE Transactions on Information Theory, Vol. 35, pp. 1314-1319, 1989.