×
Author ID: zaks.shmuel Recent zbMATH articles by "Zaks, Shmuel"
Published as: Zaks, Shmuel; Zaks, S.
Homepage: https://www.cs.technion.ac.il/~zaks/
External Links: MGP · Wikidata

Publications by Year

Citations contained in zbMATH Open

93 Publications have been cited 568 times in 423 Documents Cited by Year
Lexicographic generation of ordered trees. Zbl 0422.05026
Zaks, S.
49
1980
Enumerations of ordered trees. Zbl 0443.05049
Dershowitz, Nachum; Zaks, Shmuel
40
1980
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Zbl 1290.68014
Fernández Anta, Antonio; Milani, Alessia; Mosteiro, Miguel A.; Zaks, Shmuel
34
2010
The cycle lemma and some applications. Zbl 0715.05004
Dershowitz, Nachum; Zaks, Shmuel
32
1990
Generating trees and other combinatorial objects lexicographically. Zbl 0406.05026
Zaks, S.; Richards, D.
27
1979
A combinatorial characterization of the distributed 1-solvable tasks. Zbl 0705.68018
Biran, Ofer; Moran, Shlomo; Zaks, Shmuel
25
1990
A new algorithm for generation of permutations. Zbl 0542.68054
Zaks, Shmuel
18
1984
Optimal lower bounds for some distributed algorithms for a complete network of processors. Zbl 0681.68067
Korach, E.; Moran, S.; Zaks, S.
17
1989
Minimizing total busy time in parallel scheduling with application to optical networks. Zbl 1207.68110
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shachnai, Hadas; Shalom, Mordechai; Tamir, Tami; Zaks, Shmuel
17
2010
Ordered trees and non-crossing partitions. Zbl 0646.05004
Dershowitz, Nachum; Zaks, Shmuel
15
1986
Efficient elections in chordal ring networks. Zbl 0685.68039
Attiya, Hagit; van Leeuwen, Jan; Santoro, Nicola; Zaks, Shmuel
15
1989
The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors. Zbl 0632.68065
Korach, E.; Moran, S.; Zaks, S.
13
1987
Decomposition of graphs into trees. Zbl 0402.05052
Zaks, S.; Liu, C. L.
10
1977
The complexity of the characterization of networks supporting shortest-path interval routing. Zbl 1061.68009
Eilam, T.; Moran, S.; Zaks, S.
10
2002
The virtual path layout problem in fast networks (extended abstract). Zbl 1373.68046
Gerstel, Ornan; Zaks, Shmuel
10
1994
Patterns in trees. Zbl 0725.05034
Dershowitz, Nachum; Zaks, Shmuel
9
1989
The recognition of tolerance and bounded tolerance graphs. Zbl 1235.05098
Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel
9
2011
On sets of Boolean \(n\)-vectors with all \(k\)-projections surjective. Zbl 0519.94017
Chandra, Ashok K.; Kou, Lawrence T.; Markowsky, George; Zaks, Shmuel
8
1983
Applied tree enumerations. Zbl 0462.68038
Dershowitz, Nachum; Zaks, Shmuel
8
1981
Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Zbl 1335.05172
Gözüpek, Didem; Shachnai, Hadas; Shalom, Mordechai; Zaks, Shmuel
7
2016
On the complexity of constructing minimum changeover cost arborescences. Zbl 1360.68479
Gözüpek, Didem; Shalom, Mordechai; Voloshin, Ariella; Zaks, Shmuel
7
2014
Optimal distributed algorithms for sorting and ranking. Zbl 0556.68026
Zaks, Shmuel
6
1985
Profit maximization in flex-grid all-optical networks. Zbl 1406.68005
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
6
2013
Optimizing busy time on parallel machines. Zbl 1303.90050
Mertzios, George B.; Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Zaks, Shmuel
6
2015
Optimal bounds for the change-making problem. Zbl 0801.68079
Kozen, Dexter; Zaks, Shmuel
6
1994
Optimal layouts on a chain ATM network. Zbl 0907.90135
Gerstel, Ornan; Wool, Avishai; Zaks, Shmuel
6
1998
A new intersection model and improved algorithms for tolerance graphs. Zbl 1207.05132
Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel
5
2009
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Zbl 1284.68070
Fernández Anta, Antonio; Milani, Alessia; Mosteiro, Miguel A.; Zaks, Shmuel
5
2012
Deficient generalized Fibonacci maximum path graphs. Zbl 0451.05028
Perl, Y.; Zaks, S.
5
1981
Lower bounds for linear interval routing. Zbl 0959.90007
Eilam, T.; Moran, S.; Zaks, S.
5
1999
Optimizing regenerator cost in traffic grooming. Zbl 1229.90032
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
5
2011
Approximating the traffic grooming problem. (Extended abstract). Zbl 1175.90089
Flammini, Michele; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
5
2005
A new characterization of tree medians with applications to distributed sorting. Zbl 0799.90073
Gerstel, O.; Zaks, S.
5
1994
Placing regenerators in optical networks to satisfy multiple sets of requests. Zbl 1288.68014
Mertzios, George B.; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel
5
2010
Guessing games and distributed computations in synchronous networks. Zbl 0643.68020
van Leeuwen, Jan; Santoro, Nicola; Urrutia, Jorge; Zaks, Shmuel
4
1987
Online optimization of busy time on parallel machines. (Extended abstract). Zbl 1354.90053
Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Yung, Fencol C. C.; Zaks, Shmuel
4
2012
Approximating the traffic grooming problem in tree and star networks. Zbl 1243.68028
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
4
2008
On the complexity of the traffic grooming problem in optical networks. Zbl 1201.68021
Shalom, Mordechai; Unger, Walter; Zaks, Shmuel
4
2007
On the complexity of edge labelings for trees. Zbl 0478.68069
Perl, Y.; Zaks, S.
4
1982
Golden ratios in a pairs covering problem. Zbl 0489.05021
Shiloach, Y.; Vishkin, U.; Zaks, S.
4
1982
An NP-complete matching problem. Zbl 0489.68064
Plaisted, David A.; Zaks, Shmuel
4
1980
Path layout in ATM networks – A survey. Zbl 0929.68007
Zaks, Shmuel
4
1999
Making distributed spanning tree algorithms fault-resilient. Zbl 0612.68028
Bar-Yehuda, Reuven; Kutten, Shay; Wolfstahl, Yaron; Zaks, Shmuel
3
1987
On the bit complexity of distributed computations in a ring with a leader. Zbl 0636.68038
Mansour, Y.; Zaks, S.
3
1987
Opportunistic information dissemination in mobile ad-hoc networks: adaptiveness vs. obliviousness and randomization vs. determinism. Zbl 1353.68009
Farach-Colton, Martín; Fernández Anta, Antonio; Milani, Alessia; Mosteiro, Miguel A.; Zaks, Shmuel
3
2012
Labelled trees and pairs of input–output permutations in priority queues. Zbl 0917.68048
Golin, M.; Zaks, S.
3
1998
Optimal virtual path layout in ATM networks with shared routing tables switches. Zbl 0924.68003
Gerstel, Ornan; Cidon, Israel; Zaks, Shmuel
3
1996
More patterns in trees: up and down, young and old, odd and even. Zbl 1242.05125
Dershowitz, Nachum; Zaks, Shmuel
3
2009
A lower bound on the period length of a distributed scheduler. Zbl 0786.68039
Malka, Yossi; Moran, Shlomo; Zaks, Shmuel
3
1993
Optimal linear broadcast. Zbl 0774.68014
Bitan, Sara; Zaks, Shmuel
2
1993
Fair derivations in context-free grammars. Zbl 0535.68038
Porat, Sara; Francez, Nissim; Moran, Shlomo; Zaks, Shmuel
2
1982
Tight bounds on the round complexity of distributed 1-solvable tasks. Zbl 0874.68144
Biran, Ofer; Moran, Shlomo; Zaks, Shmuel
2
1995
The bit complexity of distributed sorting. Zbl 0879.68027
Gerstel, O.; Zaks, S.
2
1997
On optimal graphs embedded into paths and rings, with analysis using \(l_ 1\)-spheres. Zbl 0890.68092
Dinitz, Yefim; Feighelstein, Marcelo; Zaks, Shmuel
2
1997
Graphs of edge-intersecting non-splitting paths in a tree: towards hole representations (extended abstract). Zbl 1400.05163
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai; Zaks, Shmuel
2
2013
On minimizing the number of ADMs in a general topology optical network. Zbl 1155.68312
Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel
2
2007
A self-stabilizing algorithm with tight bounds for mutual exclusion on a ring. (Extended abstract). Zbl 1161.68863
Chernoy, Viacheslav; Shalom, Mordechai; Zaks, Shmuel
2
2008
On minimizing the number of ADMs–tight bounds for an algorithm without preprocessing. Zbl 1115.68017
Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel
2
2007
Intersection representations of matrices by subtrees and unicycles on graphs. Zbl 1146.05033
Gavril, Fanica; Pinter, Ron Y.; Zaks, Shmuel
2
2008
On the performance of Beauquier and Debas’ self-stabilizing algorithm for mutual exclusion. Zbl 1143.68340
Chernoy, Viacheslav; Shalom, Mordechai; Zaks, Shmuel
2
2008
Deciding 1-solvability of distributed task is \(NP\)-hard. Zbl 0768.68032
Biran, Ofer; Moran, Shlomo; Zaks, Shmuel
2
1992
Scheduling in synchronous networks and the greedy algorithm. Zbl 0916.68064
Lui, King-Shan; Zaks, Shmuel
2
1999
Graphs of edge-intersecting and non-splitting paths. Zbl 1339.05410
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai; Zaks, Shmuel
2
2016
Flexible bandwidth assignment with application to optical networks (extended abstract). Zbl 1426.90135
Shachnai, Hadas; Voloshin, Ariella; Zaks, Shmuel
2
2014
Online regenerator placement. Zbl 1372.90034
Mertzios, George B.; Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
2
2017
Online optimization of busy time on parallel machines. Zbl 1304.90102
Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Yung, Fencol C. C.; Zaks, Shmuel
2
2014
A complete characterization of the path layout construction problem for ATM networks with given hop count and load. Zbl 1401.68243
Eilam, Tamar; Flammini, Michele; Zaks, Shmuel
2
1997
Optimal on-line colorings for minimizing the number of ADMs in optical networks. Zbl 1186.90120
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
2
2010
On the performance of Dijkstra’s third self-stabilizing algorithm for mutual exclusion and related algorithms. Zbl 1231.68295
Chernoy, Viacheslav; Shalom, Mordechai; Zaks, Shmuel
2
2010
Optimal layouts on a chain ATM network (extended abstract). Zbl 1512.68221
Gerstel, Ornan; Wool, Avishai; Zaks, Shmuel
2
1995
Synchronizing asynchronous bounded delay networks. Zbl 0646.68026
Chou, Ching-Tsun; Cidon, Israel; Gopal, Inder S.; Zaks, Shmuel
1
1988
Patterns in trees. Zbl 0547.05027
Dershowitz, Nachum; Zaks, Shmuel
1
1984
Traffic grooming: combinatorial results and practical resolutions. Zbl 1187.68027
Cinkler, Tibor; Coudert, David; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Muñoz, Xavier; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel
1
2010
On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology. Zbl 1274.68692
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
1
2010
Selfishness, collusion and power of local search for the ADMs minimization problem. Zbl 1154.68324
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2008
On the intersection of tolerance and cocomparability graphs. Zbl 1311.05195
Mertzios, George B.; Zaks, Shmuel
1
2010
Approximating the traffic grooming problem in tree and star networks. (Extended abstract). Zbl 1167.68332
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2006
Optimal on-line colorings for minimizing the number of ADMs in optical networks. (Extended abstract). Zbl 1145.68335
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
1
2007
On the complexity of the regenerator location problem – treewidth and other parameters (extended abstract). Zbl 1394.68181
Hartstein, Itamar; Shalom, Mordechai; Zaks, Shmuel
1
2013
Approximation algorithms for survivable optical networks (Extended abstract). Zbl 0987.68653
Eilam, Tamar; Moran, Shlomo; Zaks, Shmuel
1
2000
On the total\(_k\)-diameter of connection networks. Zbl 0949.68008
Dinitz, Y.; Eilam, T.; Moran, S.; Zaks, S.
1
2000
The recognition of tolerance and bounded tolerance graphs. Zbl 1230.68095
Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel
1
2010
Flexible bandwidth assignment with application to optical networks. Zbl 1406.90047
Shachnai, Hadas; Voloshin, Ariella; Zaks, Shmuel
1
2018
Optimizing bandwidth allocation in elastic optical networks with application to scheduling. Zbl 1423.90046
Shachnai, Hadas; Voloshin, Ariella; Zaks, Shmuel
1
2017
On the intersection of tolerance and cocomparability graphs. Zbl 1326.05097
Mertzios, George B.; Zaks, Shmuel
1
2016
On minimizing the number of ADMs in a general topology optical network. Zbl 1211.05172
Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel
1
2009
Structural information and communication complexity. 14th international colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5–8, 2007. Proceedings. Zbl 1118.68006
1
2007
Approximating the traffic grooming problem. Zbl 1160.90342
Flammini, Michele; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2008
Minimum dominating sets of intervals on lines. Zbl 0896.68105
Cheng, S.-W.; Kaminski, M.; Zaks, S.
1
1998
A new characterization of tree medians with applications to distributed algorithms. Zbl 0791.05085
Gerstel, O.; Zaks, S.
1
1993
Hierarchical \(b\)-matching. Zbl 1492.05127
Emek, Yuval; Kutten, Shay; Shalom, Mordechai; Zaks, Shmuel
1
2021
On the complexity of the regenerator cost problem in general networks with traffic grooming. Zbl 1360.68507
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2014
On the online coalition structure generation problem. Zbl 1522.68606
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2021
Hierarchical \(b\)-matching. Zbl 1492.05127
Emek, Yuval; Kutten, Shay; Shalom, Mordechai; Zaks, Shmuel
1
2021
On the online coalition structure generation problem. Zbl 1522.68606
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2021
Flexible bandwidth assignment with application to optical networks. Zbl 1406.90047
Shachnai, Hadas; Voloshin, Ariella; Zaks, Shmuel
1
2018
Online regenerator placement. Zbl 1372.90034
Mertzios, George B.; Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
2
2017
Optimizing bandwidth allocation in elastic optical networks with application to scheduling. Zbl 1423.90046
Shachnai, Hadas; Voloshin, Ariella; Zaks, Shmuel
1
2017
Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Zbl 1335.05172
Gözüpek, Didem; Shachnai, Hadas; Shalom, Mordechai; Zaks, Shmuel
7
2016
Graphs of edge-intersecting and non-splitting paths. Zbl 1339.05410
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai; Zaks, Shmuel
2
2016
On the intersection of tolerance and cocomparability graphs. Zbl 1326.05097
Mertzios, George B.; Zaks, Shmuel
1
2016
Optimizing busy time on parallel machines. Zbl 1303.90050
Mertzios, George B.; Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Zaks, Shmuel
6
2015
On the complexity of constructing minimum changeover cost arborescences. Zbl 1360.68479
Gözüpek, Didem; Shalom, Mordechai; Voloshin, Ariella; Zaks, Shmuel
7
2014
Flexible bandwidth assignment with application to optical networks (extended abstract). Zbl 1426.90135
Shachnai, Hadas; Voloshin, Ariella; Zaks, Shmuel
2
2014
Online optimization of busy time on parallel machines. Zbl 1304.90102
Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Yung, Fencol C. C.; Zaks, Shmuel
2
2014
On the complexity of the regenerator cost problem in general networks with traffic grooming. Zbl 1360.68507
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2014
Profit maximization in flex-grid all-optical networks. Zbl 1406.68005
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
6
2013
Graphs of edge-intersecting non-splitting paths in a tree: towards hole representations (extended abstract). Zbl 1400.05163
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai; Zaks, Shmuel
2
2013
On the complexity of the regenerator location problem – treewidth and other parameters (extended abstract). Zbl 1394.68181
Hartstein, Itamar; Shalom, Mordechai; Zaks, Shmuel
1
2013
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Zbl 1284.68070
Fernández Anta, Antonio; Milani, Alessia; Mosteiro, Miguel A.; Zaks, Shmuel
5
2012
Online optimization of busy time on parallel machines. (Extended abstract). Zbl 1354.90053
Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Yung, Fencol C. C.; Zaks, Shmuel
4
2012
Opportunistic information dissemination in mobile ad-hoc networks: adaptiveness vs. obliviousness and randomization vs. determinism. Zbl 1353.68009
Farach-Colton, Martín; Fernández Anta, Antonio; Milani, Alessia; Mosteiro, Miguel A.; Zaks, Shmuel
3
2012
The recognition of tolerance and bounded tolerance graphs. Zbl 1235.05098
Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel
9
2011
Optimizing regenerator cost in traffic grooming. Zbl 1229.90032
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
5
2011
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Zbl 1290.68014
Fernández Anta, Antonio; Milani, Alessia; Mosteiro, Miguel A.; Zaks, Shmuel
34
2010
Minimizing total busy time in parallel scheduling with application to optical networks. Zbl 1207.68110
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shachnai, Hadas; Shalom, Mordechai; Tamir, Tami; Zaks, Shmuel
17
2010
Placing regenerators in optical networks to satisfy multiple sets of requests. Zbl 1288.68014
Mertzios, George B.; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel
5
2010
Optimal on-line colorings for minimizing the number of ADMs in optical networks. Zbl 1186.90120
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
2
2010
On the performance of Dijkstra’s third self-stabilizing algorithm for mutual exclusion and related algorithms. Zbl 1231.68295
Chernoy, Viacheslav; Shalom, Mordechai; Zaks, Shmuel
2
2010
Traffic grooming: combinatorial results and practical resolutions. Zbl 1187.68027
Cinkler, Tibor; Coudert, David; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Muñoz, Xavier; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel
1
2010
On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology. Zbl 1274.68692
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
1
2010
On the intersection of tolerance and cocomparability graphs. Zbl 1311.05195
Mertzios, George B.; Zaks, Shmuel
1
2010
The recognition of tolerance and bounded tolerance graphs. Zbl 1230.68095
Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel
1
2010
A new intersection model and improved algorithms for tolerance graphs. Zbl 1207.05132
Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel
5
2009
More patterns in trees: up and down, young and old, odd and even. Zbl 1242.05125
Dershowitz, Nachum; Zaks, Shmuel
3
2009
On minimizing the number of ADMs in a general topology optical network. Zbl 1211.05172
Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel
1
2009
Approximating the traffic grooming problem in tree and star networks. Zbl 1243.68028
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
4
2008
A self-stabilizing algorithm with tight bounds for mutual exclusion on a ring. (Extended abstract). Zbl 1161.68863
Chernoy, Viacheslav; Shalom, Mordechai; Zaks, Shmuel
2
2008
Intersection representations of matrices by subtrees and unicycles on graphs. Zbl 1146.05033
Gavril, Fanica; Pinter, Ron Y.; Zaks, Shmuel
2
2008
On the performance of Beauquier and Debas’ self-stabilizing algorithm for mutual exclusion. Zbl 1143.68340
Chernoy, Viacheslav; Shalom, Mordechai; Zaks, Shmuel
2
2008
Selfishness, collusion and power of local search for the ADMs minimization problem. Zbl 1154.68324
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2008
Approximating the traffic grooming problem. Zbl 1160.90342
Flammini, Michele; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2008
On the complexity of the traffic grooming problem in optical networks. Zbl 1201.68021
Shalom, Mordechai; Unger, Walter; Zaks, Shmuel
4
2007
On minimizing the number of ADMs in a general topology optical network. Zbl 1155.68312
Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel
2
2007
On minimizing the number of ADMs–tight bounds for an algorithm without preprocessing. Zbl 1115.68017
Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel
2
2007
Optimal on-line colorings for minimizing the number of ADMs in optical networks. (Extended abstract). Zbl 1145.68335
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
1
2007
Structural information and communication complexity. 14th international colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5–8, 2007. Proceedings. Zbl 1118.68006
1
2007
Approximating the traffic grooming problem in tree and star networks. (Extended abstract). Zbl 1167.68332
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2006
Approximating the traffic grooming problem. (Extended abstract). Zbl 1175.90089
Flammini, Michele; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
5
2005
The complexity of the characterization of networks supporting shortest-path interval routing. Zbl 1061.68009
Eilam, T.; Moran, S.; Zaks, S.
10
2002
Approximation algorithms for survivable optical networks (Extended abstract). Zbl 0987.68653
Eilam, Tamar; Moran, Shlomo; Zaks, Shmuel
1
2000
On the total\(_k\)-diameter of connection networks. Zbl 0949.68008
Dinitz, Y.; Eilam, T.; Moran, S.; Zaks, S.
1
2000
Lower bounds for linear interval routing. Zbl 0959.90007
Eilam, T.; Moran, S.; Zaks, S.
5
1999
Path layout in ATM networks – A survey. Zbl 0929.68007
Zaks, Shmuel
4
1999
Scheduling in synchronous networks and the greedy algorithm. Zbl 0916.68064
Lui, King-Shan; Zaks, Shmuel
2
1999
Optimal layouts on a chain ATM network. Zbl 0907.90135
Gerstel, Ornan; Wool, Avishai; Zaks, Shmuel
6
1998
Labelled trees and pairs of input–output permutations in priority queues. Zbl 0917.68048
Golin, M.; Zaks, S.
3
1998
Minimum dominating sets of intervals on lines. Zbl 0896.68105
Cheng, S.-W.; Kaminski, M.; Zaks, S.
1
1998
The bit complexity of distributed sorting. Zbl 0879.68027
Gerstel, O.; Zaks, S.
2
1997
On optimal graphs embedded into paths and rings, with analysis using \(l_ 1\)-spheres. Zbl 0890.68092
Dinitz, Yefim; Feighelstein, Marcelo; Zaks, Shmuel
2
1997
A complete characterization of the path layout construction problem for ATM networks with given hop count and load. Zbl 1401.68243
Eilam, Tamar; Flammini, Michele; Zaks, Shmuel
2
1997
Optimal virtual path layout in ATM networks with shared routing tables switches. Zbl 0924.68003
Gerstel, Ornan; Cidon, Israel; Zaks, Shmuel
3
1996
Tight bounds on the round complexity of distributed 1-solvable tasks. Zbl 0874.68144
Biran, Ofer; Moran, Shlomo; Zaks, Shmuel
2
1995
Optimal layouts on a chain ATM network (extended abstract). Zbl 1512.68221
Gerstel, Ornan; Wool, Avishai; Zaks, Shmuel
2
1995
The virtual path layout problem in fast networks (extended abstract). Zbl 1373.68046
Gerstel, Ornan; Zaks, Shmuel
10
1994
Optimal bounds for the change-making problem. Zbl 0801.68079
Kozen, Dexter; Zaks, Shmuel
6
1994
A new characterization of tree medians with applications to distributed sorting. Zbl 0799.90073
Gerstel, O.; Zaks, S.
5
1994
A lower bound on the period length of a distributed scheduler. Zbl 0786.68039
Malka, Yossi; Moran, Shlomo; Zaks, Shmuel
3
1993
Optimal linear broadcast. Zbl 0774.68014
Bitan, Sara; Zaks, Shmuel
2
1993
A new characterization of tree medians with applications to distributed algorithms. Zbl 0791.05085
Gerstel, O.; Zaks, S.
1
1993
Deciding 1-solvability of distributed task is \(NP\)-hard. Zbl 0768.68032
Biran, Ofer; Moran, Shlomo; Zaks, Shmuel
2
1992
The cycle lemma and some applications. Zbl 0715.05004
Dershowitz, Nachum; Zaks, Shmuel
32
1990
A combinatorial characterization of the distributed 1-solvable tasks. Zbl 0705.68018
Biran, Ofer; Moran, Shlomo; Zaks, Shmuel
25
1990
Optimal lower bounds for some distributed algorithms for a complete network of processors. Zbl 0681.68067
Korach, E.; Moran, S.; Zaks, S.
17
1989
Efficient elections in chordal ring networks. Zbl 0685.68039
Attiya, Hagit; van Leeuwen, Jan; Santoro, Nicola; Zaks, Shmuel
15
1989
Patterns in trees. Zbl 0725.05034
Dershowitz, Nachum; Zaks, Shmuel
9
1989
Synchronizing asynchronous bounded delay networks. Zbl 0646.68026
Chou, Ching-Tsun; Cidon, Israel; Gopal, Inder S.; Zaks, Shmuel
1
1988
The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors. Zbl 0632.68065
Korach, E.; Moran, S.; Zaks, S.
13
1987
Guessing games and distributed computations in synchronous networks. Zbl 0643.68020
van Leeuwen, Jan; Santoro, Nicola; Urrutia, Jorge; Zaks, Shmuel
4
1987
Making distributed spanning tree algorithms fault-resilient. Zbl 0612.68028
Bar-Yehuda, Reuven; Kutten, Shay; Wolfstahl, Yaron; Zaks, Shmuel
3
1987
On the bit complexity of distributed computations in a ring with a leader. Zbl 0636.68038
Mansour, Y.; Zaks, S.
3
1987
Ordered trees and non-crossing partitions. Zbl 0646.05004
Dershowitz, Nachum; Zaks, Shmuel
15
1986
Optimal distributed algorithms for sorting and ranking. Zbl 0556.68026
Zaks, Shmuel
6
1985
A new algorithm for generation of permutations. Zbl 0542.68054
Zaks, Shmuel
18
1984
Patterns in trees. Zbl 0547.05027
Dershowitz, Nachum; Zaks, Shmuel
1
1984
On sets of Boolean \(n\)-vectors with all \(k\)-projections surjective. Zbl 0519.94017
Chandra, Ashok K.; Kou, Lawrence T.; Markowsky, George; Zaks, Shmuel
8
1983
On the complexity of edge labelings for trees. Zbl 0478.68069
Perl, Y.; Zaks, S.
4
1982
Golden ratios in a pairs covering problem. Zbl 0489.05021
Shiloach, Y.; Vishkin, U.; Zaks, S.
4
1982
Fair derivations in context-free grammars. Zbl 0535.68038
Porat, Sara; Francez, Nissim; Moran, Shlomo; Zaks, Shmuel
2
1982
Applied tree enumerations. Zbl 0462.68038
Dershowitz, Nachum; Zaks, Shmuel
8
1981
Deficient generalized Fibonacci maximum path graphs. Zbl 0451.05028
Perl, Y.; Zaks, S.
5
1981
Lexicographic generation of ordered trees. Zbl 0422.05026
Zaks, S.
49
1980
Enumerations of ordered trees. Zbl 0443.05049
Dershowitz, Nachum; Zaks, Shmuel
40
1980
An NP-complete matching problem. Zbl 0489.68064
Plaisted, David A.; Zaks, Shmuel
4
1980
Generating trees and other combinatorial objects lexicographically. Zbl 0406.05026
Zaks, S.; Richards, D.
27
1979
Decomposition of graphs into trees. Zbl 0402.05052
Zaks, S.; Liu, C. L.
10
1977
all top 5

Cited by 626 Authors

39 Zaks, Shmuel
29 Shalom, Mordechai
17 Rajsbaum, Sergio
9 Flammini, Michele
9 Mertzios, George B.
9 Pandurangan, Gopal
9 Sau, Ignasi
9 Wong, Prudence Wai-Ha
8 Gözüpek, Didem
7 Nowzari-Dalini, Abbas
7 Peleg, David
7 Raynal, Michel
7 Santoro, Nicola
6 Chang, Jou-Ming
6 Flocchini, Paola
6 Herlihy, Maurice P.
6 Moran, Shlomo
6 Moscardelli, Luca
6 Pérennes, Stéphane
6 Ruskey, Frank
6 Shachnai, Hadas
6 Voloshin, Ariella
6 Wu, Ro-Yu
5 Dershowitz, Nachum
5 Kowalski, Dariusz R.
5 Monaco, Gianpiero
5 Mosteiro, Miguel A.
5 Williams, Aaron Michael
4 Alonso, Laurent
4 Bermond, Jean-Claude
4 Chen, William Yong-Chuan
4 Colbourn, Charles J.
4 Er, Mingcheng
4 Gavoille, Cyril
4 Gilbert, Seth
4 Paul, Christophe
4 Robinson, Peter
4 Sawada, Joe
4 Tamir, Tami
3 Asinowski, Andrei
3 Baste, Julien
3 Boyacı, Arman
3 Censor-Hillel, Keren
3 Chernoy, Viacheslav
3 Delporte-Gallet, Carole
3 Ekim, Tınaz
3 Fauconnier, Hugues
3 Furedi, Zoltan
3 Gafni, Eli M.
3 Gerstel, Ornan
3 Goubault, Eric
3 Guerraoui, Rachid
3 Konstantinova, Elena V.
3 Kuhn, Fabian
3 Kutten, Shay
3 Ledent, Jérémy
3 Mans, Bernard
3 Olariu, Stephan
3 Ozkan, Sibel
3 Pai, Kung-Jui
3 Roelants van Baronaigien, Dominique
3 Schieber, Baruch
3 Schott, René
3 Taubenfeld, Gadi
3 Thilikos, Dimitrios M.
3 Trehan, Amitabh
2 Abed, Fidaa
2 Afek, Yehuda
2 Akl, Selim G.
2 Amani, Mahdi
2 Amini, Omid
2 Bacher, Axel
2 Banderier, Cyril
2 Bhagavathi, D.
2 Bokka, V.
2 Cameron, Ben
2 Chang, Shun-Chieh
2 Chen, Lin
2 Chepoi, Victor D.
2 Conflitti, Alessandro
2 Coudert, David
2 De Bonis, Annalisa
2 Denise, Alain
2 Deutsch, Emeric
2 Disser, Yann
2 Dulucq, Serge
2 Dziemiańczuk, Maciej
2 Ehrenfeucht, Andrzej
2 Epstein, Leah
2 Eu, Sen-Peng
2 Germain, Christian
2 Gittenberger, Bernhard
2 Golab, Wojciech
2 Greenlaw, Raymond
2 Groß, Martin
2 Gurla, Himabindu
2 Gyárfás, András
2 Kemp, Rainer
2 Khan, Maleq
2 Köbler, Johannes
...and 526 more Authors
all top 5

Cited in 96 Serials

54 Theoretical Computer Science
30 Discrete Applied Mathematics
29 Discrete Mathematics
24 Information Processing Letters
18 International Journal of Computer Mathematics
14 Distributed Computing
13 Algorithmica
10 European Journal of Combinatorics
9 Theory of Computing Systems
8 Journal of Discrete Algorithms
6 Journal of Combinatorial Theory. Series A
5 Networks
5 Information and Computation
4 Acta Informatica
4 Advances in Applied Mathematics
4 Journal of Information & Optimization Sciences
4 SIAM Journal on Discrete Mathematics
4 International Journal of Foundations of Computer Science
3 BIT
3 Graphs and Combinatorics
3 Journal of Combinatorial Optimization
3 Journal of Scheduling
3 Annals of Combinatorics
2 Applied Mathematics and Computation
2 Computing
2 Information Sciences
2 Journal of Computer and System Sciences
2 Journal of Graph Theory
2 Journal of Statistical Planning and Inference
2 Annals of Operations Research
2 RAIRO. Informatique Théorique et Applications
2 Combinatorics, Probability and Computing
2 Parallel Algorithms and Applications
2 Discrete Mathematics and Theoretical Computer Science. DMTCS
2 Journal of Discrete Mathematical Sciences & Cryptography
2 Journal of Applied and Computational Topology
1 Indian Journal of Pure & Applied Mathematics
1 Journal of Computational Physics
1 Journal of the Franklin Institute
1 Journal of Mathematical Biology
1 Mathematics of Computation
1 Bulletin of Mathematical Biology
1 The Mathematical Intelligencer
1 Advances in Mathematics
1 Bulletin of the London Mathematical Society
1 International Journal of Game Theory
1 Journal of Combinatorial Theory. Series B
1 Journal of Computational and Applied Mathematics
1 Journal of Soviet Mathematics
1 Memoirs of the American Mathematical Society
1 Proceedings of the American Mathematical Society
1 SIAM Journal on Computing
1 Insurance Mathematics & Economics
1 SIAM Journal on Algebraic and Discrete Methods
1 Operations Research Letters
1 Combinatorica
1 Bulletin of the Iranian Mathematical Society
1 Journal of Classification
1 Journal of Symbolic Computation
1 Journal of Complexity
1 International Journal of Parallel Programming
1 International Journal of Approximate Reasoning
1 Journal of Theoretical Probability
1 Journal of the American Mathematical Society
1 Mathematical and Computer Modelling
1 Journal of Parallel and Distributed Computing
1 Random Structures & Algorithms
1 European Journal of Operational Research
1 Linear Algebra and its Applications
1 Mathematical Programming. Series A. Series B
1 Cybernetics and Systems Analysis
1 Journal of Algebraic Combinatorics
1 Computational Optimization and Applications
1 The Electronic Journal of Combinatorics
1 Discussiones Mathematicae. Graph Theory
1 INFORMS Journal on Computing
1 Journal of the ACM
1 Journal of Integer Sequences
1 Journal of Mathematical Study
1 Optimization and Engineering
1 Integers
1 Miscelánea Matemática
1 Journal of Applied Mathematics and Computing
1 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 BIT. Nordisk Tidskrift for Informationsbehandling
1 Mathematics in Computer Science
1 Optimization Letters
1 Logical Methods in Computer Science
1 Discrete Mathematics, Algorithms and Applications
1 Games
1 Computer Science Review
1 Journal of Mathematical Modelling and Algorithms in Operations Research
1 Journal of Logical and Algebraic Methods in Programming
1 Japanese Journal of Statistics and Data Science
1 Algebraic Statistics
1 Trends in Computational and Applied Mathematics

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.