Lexicographic generation of ordered trees S Zaks Theoretical Computer Science 10 (1), 63-82, 1980 | 267 | 1980 |
Tight lower and upper bounds for some distributed algorithms for a complete network of processors E Korach, S Moran, S Zaks Proceedings of the third annual ACM symposium on Principles of distributed …, 1984 | 166 | 1984 |
Enumerations of ordered trees. N Dershowitz, S Zaks Discret. Math. 31 (1), 9-28, 1980 | 133 | 1980 |
A combinatorial characterization of the distributed 1-solvable tasks O Biran, S Moran, S Zaks Journal of algorithms 11 (3), 420-440, 1990 | 115 | 1990 |
The cycle lemma and some applications N Dershowitz, S Zaks Europ. J. Comb 11, 35-40, 1990 | 92 | 1990 |
On the complexity of the regenerator placement problem in optical networks M Flammini, A Marchetti-Spaccamela, G Monaco, L Moscardelli, S Zaks IEEE/ACM Transactions on Networking (TON) 19 (2), 498-511, 2011 | 90 | 2011 |
A COMBINATORIAL CHARACTERIZATION OF THE DISTRIBUTED TASKS O Biran, S Moran, S Zaks Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed …, 1988 | 90* | 1988 |
Minimizing total busy time in parallel scheduling with application to optical networks M Flammini, G Monaco, L Moscardelli, H Shachnai, M Shalom, T Tamir, ... Theoretical Computer Science 411 (40-42), 3553-3562, 2010 | 79 | 2010 |
The layout of virtual paths in ATM networks O Gerstel, I Cidon, S Zaks IEEE/ACM transactions on networking 4 (6), 873-884, 1996 | 74 | 1996 |
Optimal distributed algorithms for sorting and ranking S Zaks IEEE Transactions on computers 100 (4), 376-379, 1985 | 73 | 1985 |
A new algorithm for generation of permutations S Zaks BIT Numerical Mathematics 24 (2), 196-204, 1984 | 72 | 1984 |
The virtual path layout problem in fast networks O Gerstel, S Zaks Proceedings of the Thirteenth Annual ACM Symposium on Principles of …, 1994 | 70 | 1994 |
Generating trees and other combinatorial objects lexicographically S Zaks, D Richards SIAM Journal on Computing 8, 73, 1979 | 63 | 1979 |
Efficient elections in chordal ring networks H Attiya, J van Leeuwen, N Santoro, S Zaks Algorithmica 4 (1), 437-446, 1989 | 62 | 1989 |
On sets of Boolean n-vectors with all k-projections surjective AK Chandra, LT Kou, G Markowsky, S Zaks Acta Informatica 20 (1), 103-111, 1983 | 59 | 1983 |
Synchronizing asynchronous bounded delay networks CT Chou, I Cidon, IS Gopal, S Zaks IEEE Transactions on communications 38 (2), 144-147, 1990 | 57 | 1990 |
Optimal lower bounds for some distributed algorithms for a complete network of processors E Korach, S Moran, S Zaks Theoretical Computer Science 64 (1), 125-132, 1989 | 56 | 1989 |
Ordered trees and non-crossing partitions N Dershowitz, S Zaks Discrete mathematics 62 (2), 215-218, 1986 | 54 | 1986 |
The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors E Korach, S Moran, S Zaks Proceedings of the fourth annual ACM symposium on Principles of distributed …, 1985 | 52 | 1985 |
A scalable approach to routing in ATM networks I Cidon, O Gerstel, S Zaks Distributed Algorithms, 209-222, 1994 | 50 | 1994 |