פרופ' שמואל זקס
Joan Callner-Miller Chair in Computer Science
- יצירת קשר
- דף בית:
- http://www.cs.technion.ac.il/~zaks/
- דואר אלקטרוני:
- zaks
![[at]](/images/shtru.gif)
cs.technion.ac.il - משרד:
- 724
- טלפון:
- 4329
- שעות קבלה:
- Thursday, 9:30-10:30
- תחומי עניין במחקר
- אלגוריתמים מבוזרים; רשתות ATM ורשתות אופטיות; אלגוריתמים בתורת הגרפים; קומבינטוריקה ותורת הגרפים; מתמטיקה דיסקרטית.
- פרסומים נבחרים
BIRAN, O., MORAN, S., and ZAKS, S., A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor, Journal of Algorithms, Vol. 11, pp. 420-440, 1990, an extension of PODC88 paper.
KOZEN, D., and ZAKS, S., "Optimal bounds for the change-making problem", Theoretical Computer Science, Vol. 123, pp. 377-388, 1994.
GERSTEL, O., and ZAKS, S., A new characterization of tree medians with applications to distributed algorithms, Networks, Vol. 24, No 1, pp. 23-29, January 1994, an extension of WG92 paper.
GERSTEL, O., WOOL, A., and ZAKS, S., Optimal layouts on a chain ATM network, to appear in Discrete Applied Mathematics, special issue on Network Communications, an extension of ESA95 paper.
EILAM, T., MORAN, S., and ZAKS, S., A lower bound for linear interval routing, Proceedings of the 10th International Workshop on Distributed Algorithms (WDAG), pp. 191-205, 1996.
DINITZ, Y., FEIGHELSTEIN, M., and ZAKS, S., On optimal graphs embedded into paths and rings, with analysis using l1-spheres, Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 1997.
CIDON, I., GERSTEL, O., and ZAKS, S., Optimal virtual path layout in ATM networks with shared routing table switches, The Chicago Journal of Theoretical Computer Science, Vol. 3, 1996, an extension of PODC94 paper.
van LEEUWEN, J., SANTORO, N., URRUTIA, J., and ZAKS, S., Guessing games and distributed computations in synchronous networks, Proceedings of the 14th International Colloquium on Automata, Languages and Programming (ICALP), Springer-Verlag Lecture Notes in Computer Science No. 267, pp. 347-356, 1987.
EILAM, T., FLAMMINI, M., and ZAKS, S., A complete characterization of the path layout construction problem for ATM Networks with given hop count and load, to appear in Parallel Processing Letters, an extension of ICALP97 paper.
ZAKS, S., "Path layout in ATM networks" (Invited talk), 24th SOFSEM conference (Theory and Practice of Informatics), November 22-29, 1997, Milovy, The Czech Republic, Springer-Verlag LNCS 1338, pp. 144-160.
ZAKS, S., "Duality in ATM layout problems" (Invited talk), Proceedings of the 4th Italian Conference on Algorithms and Complexity (CIAC)}, Rome, 2000.
ZAKS, S., "On the use of duality and geometry in layouts for ATM Networks (Invited talk), 25th International Symposium on Mathematical Foundation of Computer Science (MFCS), Bratislava, Slovakia, 2000.
