default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShmuel Zaks
Person information
- affiliation: Technion, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j84]Fanica Gavril
, Mordechai Shalom, Shmuel Zaks:
Approximation algorithms for maximum weight k-coverings of graphs by packings. Discret. Math. Algorithms Appl. 14(1): 2150099:1-2150099:14 (2022)- 2021
- [j83]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation. Algorithms 14(5): 151 (2021) - [j82]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Online Coalition Structure Generation Problem. J. Artif. Intell. Res. 72: 1215-1250 (2021) - [c85]Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
Multicast Communications with Varying Bandwidth Constraints. INFOCOM 2021: 1-10 - [c84]Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
Hierarchical b-Matching. SOFSEM 2021: 189-202 - 2020
- [j81]Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Profit Maximization in Flex-Grid All-Optical Networks. Theory Comput. Syst. 64(2): 311-326 (2020)
2010 – 2019
- 2019
- [j80]Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Complexity and online algorithms for minimum skyline coloring of intervals. Theor. Comput. Sci. 788: 66-78 (2019) - [i12]Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
Hierarchical b-Matching. CoRR abs/1904.10210 (2019) - [i11]Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
Maximizing Communication Throughput in Tree Networks. CoRR abs/1904.10215 (2019) - 2018
- [j79]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j78]Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
Flexible bandwidth assignment with application to optical networks. J. Sched. 21(3): 327-336 (2018) - [c83]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Online Coalition Structure Generation in Graph Games. AAMAS 2018: 1353-1361 - 2017
- [j77]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j76]Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
Optimizing bandwidth allocation in elastic optical networks with application to scheduling. J. Discrete Algorithms 45: 1-13 (2017) - [j75]George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Online Regenerator Placement. Theory Comput. Syst. 61(3): 739-754 (2017) - [j74]Kshitiz Verma, Gianluca Rizzo, Antonio Fernández Anta, Rubén Cuevas Rumín, Arturo Azcorra, Shmuel Zaks, Alberto García-Martínez:
Energy-optimal collaborative file distribution in wired networks. Peer-to-Peer Netw. Appl. 10(4): 925-944 (2017) - [c82]Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals. COCOA (2) 2017: 317-332 - 2016
- [j73]George B. Mertzios, Shmuel Zaks:
On the intersection of tolerance and cocomparability graphs. Discret. Appl. Math. 199: 46-88 (2016) - [j72]Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
On-line maximum matching in complete multi-partite graphs with an application to optical networks. Discret. Appl. Math. 199: 123-136 (2016) - [j71]Itamar Hartstein, Mordechai Shalom, Shmuel Zaks:
On the complexity of the regenerator location problem treewidth and other parameters. Discret. Appl. Math. 199: 199-225 (2016) - [j70]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I. Discret. Appl. Math. 215: 47-60 (2016) - [j69]Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks:
Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Theor. Comput. Sci. 621: 22-36 (2016) - [j68]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of edge-intersecting and non-splitting paths. Theor. Comput. Sci. 629: 40-50 (2016) - [j67]Vincenzo Sciancalepore, Vincenzo Mancuso, Albert Banchs, Shmuel Zaks, Antonio Capone:
Enhanced Content Update Dissemination Through D2D in 5G Cellular Networks. IEEE Trans. Wirel. Commun. 15(11): 7517-7530 (2016) - [c81]Kshitiz Verma, Shmuel Zaks, Alberto García-Martínez:
SLEEPWELL: Energy Efficient Network Design for the Developing World Using Green Switches. AINA 2016: 266-273 - 2015
- [j66]George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks:
Optimizing busy time on parallel machines. Theor. Comput. Sci. 562: 524-541 (2015) - [c80]Shmuel Zaks:
Online Lower Bounds and Offline Inapproximability in Optical Networks. ADHOC-NOW 2015: 253-270 - [c79]Shmuel Zaks:
On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks. WG 2015: 31-46 - [i10]Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks:
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. CTW 2015: 201-204 - [i9]Kshitiz Verma, Shmuel Zaks, Alberto García-Martínez:
Designing Low Cost and Energy Efficient Access Network for the Developing World. CoRR abs/1501.04041 (2015) - [i8]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. CoRR abs/1512.06440 (2015) - 2014
- [j65]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. Algorithmica 68(3): 671-691 (2014) - [j64]Didem Gözüpek, Mordechai Shalom, Ariella Voloshin, Shmuel Zaks:
On the complexity of constructing minimum changeover cost arborescences. Theor. Comput. Sci. 540: 40-52 (2014) - [j63]Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks:
Online optimization of busy time on parallel machines. Theor. Comput. Sci. 560: 190-206 (2014) - [c78]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of edge-intersecting and non-splitting paths. ICTCS 2014: 45-58 - [c77]Vincenzo Sciancalepore, Vincenzo Mancuso, Albert Banchs, Shmuel Zaks, Antonio Capone:
Interference coordination strategies for content update dissemination in LTE-A. INFOCOM 2014: 1797-1805 - [c76]Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling. IPDPS 2014: 862-871 - [c75]Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract). MFCS (2) 2014: 613-624 - 2013
- [c74]Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Profit Maximization in Flex-Grid All-Optical Networks. SIROCCO 2013: 249-260 - [c73]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract). WG 2013: 115-126 - [i7]George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Online Regenerator Placement. CoRR abs/1309.0195 (2013) - [i6]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I. CoRR abs/1309.2898 (2013) - [i5]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II. CoRR abs/1309.6471 (2013) - 2012
- [j62]Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Distributed Comput. 25(4): 279-296 (2012) - [j61]George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Placing regenerators in optical networks to satisfy multiple sets of requests. IEEE/ACM Trans. Netw. 20(6): 1870-1879 (2012) - [c72]George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks:
Optimizing Busy Time on Parallel Machines. IPDPS 2012: 238-248 - [c71]Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. LATIN 2012: 303-314 - [c70]Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks:
Online Optimization of Busy Time on Parallel Machines - (Extended Abstract). TAMC 2012: 448-460 - [c69]Itamar Hartstein, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract). WAOA 2012: 42-55 - [i4]George B. Mertzios, Shmuel Zaks:
On the Intersection of Tolerance and Cocomparability Graphs. CoRR abs/1207.0552 (2012) - 2011
- [j60]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
The Recognition of Tolerance and Bounded Tolerance Graphs. SIAM J. Comput. 40(5): 1234-1257 (2011) - [j59]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Optimizing regenerator cost in traffic grooming. Theor. Comput. Sci. 412(52): 7109-7121 (2011) - [j58]Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks:
On the complexity of the regenerator placement problem in optical networks. IEEE/ACM Trans. Netw. 19(2): 498-511 (2011) - [c68]George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Online Regenerator Placement. OPODIS 2011: 4-17 - [c67]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. OPODIS 2011: 96-111 - [c66]Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. DISC 2011: 202-204 - [i3]Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism. CoRR abs/1105.6151 (2011) - 2010
- [j57]Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks:
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms. Distributed Comput. 23(1): 43-60 (2010) - [j56]Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Optimal on-line colorings for minimizing the number of ADMs in optical networks. J. Discrete Algorithms 8(2): 174-188 (2010) - [j55]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks:
Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411(40-42): 3553-3562 (2010) - [c65]George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. ICALP (2) 2010: 333-344 - [c64]George B. Mertzios, Shmuel Zaks:
On the Intersection of Tolerance and Cocomparability Graphs. ISAAC (1) 2010: 230-240 - [c63]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). OPODIS 2010: 443-458 - [c62]Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Traffic Grooming in Star Networks via Matching Techniques. SIROCCO 2010: 41-56 - [c61]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
The Recognition of Tolerance and Bounded Tolerance Graphs. STACS 2010: 585-596 - [c60]Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony. DISC 2010: 374-388 - [p1]Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Traffic Grooming: Combinatorial Results and Practical Resolutions. Graphs and Algorithms in Communication Networks 2010: 63-94 - [i2]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
The Recognition of Tolerance and Bounded Tolerance Graphs. CoRR abs/1001.3251 (2010)
2000 – 2009
- 2009
- [j54]Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On minimizing the number of ADMs in a general topology optical network. Discret. Appl. Math. 157(12): 2701-2717 (2009) - [j53]Nachum Dershowitz, Shmuel Zaks:
More Patterns in Trees: Up and Down, Young and Old, Odd and Even. SIAM J. Discret. Math. 23(1): 447-465 (2009) - [j52]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
A New Intersection Model and Improved Algorithms for Tolerance Graphs. SIAM J. Discret. Math. 23(4): 1800-1813 (2009) - [j51]Giuseppe Prencipe, Shmuel Zaks:
Preface. Theor. Comput. Sci. 410(14): 1305-1306 (2009) - [c59]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks:
Minimizing total busy time in parallel scheduling with application to optical networks. IPDPS 2009: 1-12 - [c58]Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology. SIROCCO 2009: 281-294 - [c57]Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks:
On the complexity of the regenerator placement problem in optical networks. SPAA 2009: 154-162 - [c56]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
A New Intersection Model and Improved Algorithms for Tolerance Graphs. WG 2009: 285-295 - 2008
- [j50]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Selfishness, collusion and power of local search for the ADMs minimization problem. Comput. Networks 52(9): 1721-1731 (2008) - [j49]Fanica Gavril, Ron Y. Pinter, Shmuel Zaks:
Intersection representations of matrices by subtrees and unicycles on graphs. J. Discrete Algorithms 6(2): 216-228 (2008) - [j48]Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the traffic grooming problem. J. Discrete Algorithms 6(3): 472-479 (2008) - [j47]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the traffic grooming problem in tree and star networks. J. Parallel Distributed Comput. 68(7): 939-948 (2008) - [c55]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. Euro-Par 2008: 920-929 - [c54]Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks:
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. SIROCCO 2008: 221-233 - [c53]Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks:
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. DISC 2008: 63-77 - 2007
- [j46]Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. J. Parallel Distributed Comput. 67(4): 448-455 (2007) - [j45]Mordechai Shalom, Shmuel Zaks:
Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem. Theor. Comput. Sci. 384(2-3): 250-262 (2007) - [j44]Mordechai Shalom, Shmuel Zaks:
A 10/7 + epsilon approximation for minimizing the number of ADMs in SONET rings. IEEE/ACM Trans. Netw. 15(6): 1593-1602 (2007) - [c52]Mordechai Shalom, Walter Unger, Shmuel Zaks:
On the Complexity of the Traffic Grooming Problem in Optical Networks. FUN 2007: 262-271 - [c51]Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks:
On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion. SSS 2007: 114-123 - [c50]Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks. DISC 2007: 435-449 - [c49]Michel Raynal, Sam Toueg, Shmuel Zaks:
DISC at Its 20th Anniversary (Stockholm, 2006). DISC 2007: 501-503 - [c48]Stefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. WINE 2007: 404-411 - [e2]Giuseppe Prencipe, Shmuel Zaks:
Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings. Lecture Notes in Computer Science 4474, Springer 2007, ISBN 978-3-540-72918-1 [contents] - 2006
- [c47]Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. CAAN 2006: 72-85 - [c46]Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On Minimizing the Number of ADMs in a General Topology Optical Network. DISC 2006: 459-473 - [c45]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem in Tree and Star Networks. WG 2006: 147-158 - 2005
- [c44]Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem. ISAAC 2005: 915-924 - [c43]Mordechai Shalom, Shmuel Zaks:
Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. SIROCCO 2005: 277-291 - 2004
- [c42]Mordechai Shalom, Shmuel Zaks:
A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings. BROADNETS 2004: 254-262 - 2002
- [j43]Tamar Eilam, Shlomo Moran, Shmuel Zaks:
Lightpath arrangement in survivable rings to minimize the switching cost. IEEE J. Sel. Areas Commun. 20(1): 172-182 (2002) - [j42]Tamar Eilam, Shlomo Moran, Shmuel Zaks:
The complexity of the characterization of networks supporting shortest-path interval routing. Theor. Comput. Sci. 289(1): 85-104 (2002) - 2001
- [j41]Shmuel Zaks:
Design Issues in ATM and Optical Networks. Comput. Artif. Intell. 20(2): 207-224 (2001) - 2000
- [j40]Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks:
On the totalk-diameter of connection networks. Theor. Comput. Sci. 247(1-2): 213-228 (2000) - [c41]Shmuel Zaks:
Duality in ATM Layout Problems. CIAC 2000: 44-58 - [c40]Shmuel Zaks:
On the Use of Duality and Geometry in Layouts for ATM Networks. MFCS 2000: 114-131 - [c39]Tamar Eilam, Shlomo Moran, Shmuel Zaks:
Approximation Algorithms for Survivable Optical Networks. DISC 2000: 104-118
1990 – 1999
- 1999
- [j39]Tamar Eilam, Shlomo Moran, Shmuel Zaks:
Lower bounds for linear interval routing. Networks 34(1): 37-46 (1999) - [j38]King-Shan Lui, Shmuel Zaks:
Scheduling in Synchronous Networks and the Greedy Algorithm. Theor. Comput. Sci. 220(1): 157-183 (1999) - [i1]Jan K. Pachl, Shmuel Zaks:
Computation in an algebra of test selection criteria. CoRR cs.SE/9912018 (1999) - 1998
- [j37]Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks:
Minimum Dominating Sets of Intervals on Lines. Algorithmica 20(3): 294-308 (1998) - [j36]Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks:
Optimal layouts on a chain ATM network. Discret. Appl. Math. 83(1-3): 157-178 (1998) - [j35]Tamar Eilam, Michele Flammini, Shmuel Zaks:
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load. Parallel Process. Lett. 8(2): 207-220 (1998) - [j34]Mordecai J. Golin, Shmuel Zaks:
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. Theor. Comput. Sci. 205(1-2): 99-114 (1998) - [j33]Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks:
Efficient support for client/server applications over heterogeneous ATM network. IEEE/ACM Trans. Netw. 6(4): 432-446 (1998) - 1997
- [j32]Ornan Ori Gerstel, Shmuel Zaks:
The Bit Complexity of Distributed Sorting. Algorithmica 18(3): 405-416 (1997) - [c38]