| 2012 | ||
|---|---|---|
| j60 | 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 Computing 25(4): 279-296 (2012) | |
| j59 | 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) | |
| c69 | George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks: Optimizing Busy Time on Parallel Machines. IPDPS 2012: 238-248 | |
| c68 | 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 | |
| c67 | 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 | |
| i4 | George B. Mertzios, Shmuel Zaks: On the Intersection of Tolerance and Cocomparability Graphs. CoRR abs/1207.0552 (2012) | |
| 2011 | ||
| j58 | George B. Mertzios, Ignasi Sau, Shmuel Zaks: The Recognition of Tolerance and Bounded Tolerance Graphs. SIAM J. Comput. 40(5): 1234-1257 (2011) | |
| j57 | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Optimizing regenerator cost in traffic grooming. Theor. Comput. Sci. 412(52): 7109-7121 (2011) | |
| j56 | 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) | |
| c66 | George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks: Online Regenerator Placement. OPODIS 2011: 4-17 | |
| c65 | 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 | |
| c64 | 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 . CoRR abs/1105.6151 (2011) | |
| 2010 | ||
| j55 | Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms. Distributed Computing 23(1): 43-60 (2010) | |
| j54 | 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) | |
| j53 | 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) | |
| c63 | 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 | |
| c62 | George B. Mertzios, Shmuel Zaks: On the Intersection of Tolerance and Cocomparability Graphs. ISAAC (1) 2010: 230-240 | |
| c61 | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). OPODIS 2010: 443-458 | |
| c60 | Ignasi Sau, Mordechai Shalom, Shmuel Zaks: Traffic Grooming in Star Networks via Matching Techniques. SIROCCO 2010: 41-56 | |
| c59 | George B. Mertzios, Ignasi Sau, Shmuel Zaks: The Recognition of Tolerance and Bounded Tolerance Graphs. STACS 2010: 585-596 | |
| c58 | 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 | |
| i2 | George B. Mertzios, Ignasi Sau, Shmuel Zaks: The Recognition of Tolerance and Bounded Tolerance Graphs. CoRR abs/1001.3251 (2010) | |
| 2009 | ||
| j52 | Michele Flammini, Mordechai Shalom, Shmuel Zaks: On minimizing the number of ADMs in a general topology optical network. Discrete Applied Mathematics 157(12): 2701-2717 (2009) | |
| j51 | Nachum Dershowitz, Shmuel Zaks: More Patterns in Trees: Up and Down, Young and Old, Odd and Even. SIAM J. Discrete Math. 23(1): 447-465 (2009) | |
| j50 | George B. Mertzios, Ignasi Sau, Shmuel Zaks: A New Intersection Model and Improved Algorithms for Tolerance Graphs. SIAM J. Discrete Math. 23(4): 1800-1813 (2009) | |
| j49 | ||
| c57 | 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 | |
| c56 | 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 | |
| c55 | 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 | |
| c54 | George B. Mertzios, Ignasi Sau, Shmuel Zaks: A New Intersection Model and Improved Algorithms for Tolerance Graphs. WG 2009: 285-295 | |
| 2008 | ||
| j48 | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Selfishness, collusion and power of local search for the ADMs minimization problem. Computer Networks 52(9): 1721-1731 (2008) | |
| j47 | 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) | |
| j46 | Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the traffic grooming problem. J. Discrete Algorithms 6(3): 472-479 (2008) | |
| j45 | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the traffic grooming problem in tree and star networks. J. Parallel Distrib. Comput. 68(7): 939-948 (2008) | |
| c53 | 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 | |
| c52 | Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. SIROCCO 2008: 221-233 | |
| c51 | Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. DISC 2008: 63-77 | |
| 2007 | ||
| j44 | Michele Flammini, Mordechai Shalom, Shmuel Zaks: On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. J. Parallel Distrib. Comput. 67(4): 448-455 (2007) | |
| j43 | 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) | |
| j42 | 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) | |
| c50 | Mordechai Shalom, Walter Unger, Shmuel Zaks: On the Complexity of the Traffic Grooming Problem in Optical Networks. FUN 2007: 262-271 | |
| c49 | Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion. SSS 2007: 114-123 | |
| c48 | 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 | |
| c47 | Michel Raynal, Sam Toueg, Shmuel Zaks: DISC at Its 20th Anniversary (Stockholm, 2006). DISC 2007: 501-503 | |
| c46 | 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 (Eds.): 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 | |
| 2006 | ||
| c45 | Michele Flammini, Mordechai Shalom, Shmuel Zaks: On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. CAAN 2006: 72-85 | |
| c44 | Michele Flammini, Mordechai Shalom, Shmuel Zaks: On Minimizing the Number of ADMs in a General Topology Optical Network. DISC 2006: 459-473 | |
| c43 | 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 | ||
| c42 | Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the Traffic Grooming Problem. ISAAC 2005: 915-924 | |
| c41 | Mordechai Shalom, Shmuel Zaks: Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. SIROCCO 2005: 277-291 | |
| 2004 | ||
| c40 | Mordechai Shalom, Shmuel Zaks: A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings. BROADNETS 2004: 254-262 | |
| 2002 | ||
| j41 | 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 | ||
| j40 | Shmuel Zaks: Design Issues in ATM and Optical Networks. Computers and Artificial Intelligence 20(2) (2001) | |
| 2000 | ||
| j39 | Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. Theor. Comput. Sci. 247(1-2): 213-228 (2000) | |
| c39 | ||
| c38 | ||
| c37 | Tamar Eilam, Shlomo Moran, Shmuel Zaks: Approximation Algorithms for Survivable Optical Networks. DISC 2000: 104-118 | |
| 1999 | ||
| j38 | Tamar Eilam, Shlomo Moran, Shmuel Zaks: Lower bounds for linear interval routing. Networks 34(1): 37-46 (1999) | |
| j37 | 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 | ||
| j36 | Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks: Minimum Dominating Sets of Intervals on Lines. Algorithmica 20(3): 294-308 (1998) | |
| j35 | Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks: Optimal layouts on a chain ATM network. Discrete Applied Mathematics 83(1-3): 157-178 (1998) | |
| j34 | 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 Processing Letters 8(2): 207-220 (1998) | |
| j33 | 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) | |
| j32 | 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 | ||
| j31 | Ornan Ori Gerstel, Shmuel Zaks: The Bit Complexity of Distributed Sorting. Algorithmica 18(3): 405-416 (1997) | |
| c36 | Tamar Eilam, Michele Flammini, Shmuel Zaks: A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract). ICALP 1997: 527-537 | |
| c35 | Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. ISTCS 1997: 96-106 | |
| c34 | Tamar Eilam, Shlomo Moran, Shmuel Zaks: The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. SIROCCO 1997: 99-111 | |
| c33 | ||
| c32 | ||
| c31 | Tamar Eilam, Shlomo Moran, Shmuel Zaks: A Simple DFS-Based Algorithm for Linear Interval Routing. WDAG 1997: 37-51 | |
| c30 | King-Shan Lui, Shmuel Zaks: Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract). WDAG 1997: 66-80 | |
| c29 | Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks: On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres. WG 1997: 171-183 | |
| 1996 | ||
| j30 | Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks: Optimal Virtual Path Layout in ATM Networks With Shared Routing Table Switches. Chicago J. Theor. Comput. Sci. 1996 (1996) | |
| j29 | Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks: The layout of virtual paths in ATM networks. IEEE/ACM Trans. Netw. 4(6): 873-884 (1996) | |
| c28 | Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks: Efficient Support for the Client/Server Paradigm over Heterogeneous ATM Networks. INFOCOM 1996: 1294-1301 | |
| c27 | Derek Hing-leung Ngok, Shmuel Zaks: On the Power of Local Information in Scheduling in Synchronous Networks. SIROCCO 1996: 301-312 | |
| c26 | Tamar Eilam, Shlomo Moran, Shmuel Zaks: A Lower Bound for Linear Interval Routing. WDAG 1996: 191-205 | |
| 1995 | ||
| j28 | Ofer Biran, Shlomo Moran, Shmuel Zaks: Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. Theor. Comput. Sci. 145(1&2): 271-290 (1995) | |
| c25 | Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks: Minimum Dominating Sets of Intervals on Lines (Extended Abstract). COCOON 1995: 520-529 | |
| c24 | Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks: Optimal Layouts on a Chain ATM Network (Extended Abstract). ESA 1995: 508-522 | |
| 1994 | ||
| j27 | Ornan Ori Gerstel, Shmuel Zaks: A new characterization of tree medians with applications to distributed sorting. Networks 24(1): 23-29 (1994) | |
| j26 | Dexter Kozen, Shmuel Zaks: Optimal Bounds for the Change-Making Problem. Theor. Comput. Sci. 123(2): 377-388 (1994) | |
| j25 | Gerard Tel, Ephraim Korach, Shmuel Zaks: Synchronizing ABD networks. IEEE/ACM Trans. Netw. 2(1): 66-69 (1994) | |
| c23 | Moshe Molcho, Shmuel Zaks: Robust Asynchronous Algorithms in Networks with a Fault Detection Ring. ISAAC 1994: 101-109 | |
| c22 | Ornan Ori Gerstel, Shmuel Zaks: The Virtual Path Layout Problem in Fast Networks (Extended Abstract). PODC 1994: 235-243 | |
| c21 | ||
| c20 | Israel Cidon, Ornan Ori Gerstel, Shmuel Zaks: A Scalable Approach to Routing in ATM Networks. WDAG 1994: 209-222 | |
| c19 | Mordecai J. Golin, Shmuel Zaks: Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. WG 1994: 282-291 | |
| 1993 | ||
| j24 | Yossi Malka, Shlomo Moran, Shmuel Zaks: A Lower Bound on the Period Length of a Distributed Scheduler. Algorithmica 10(5): 383-398 (1993) | |
| j23 | ||
| c18 | Ornan Ori Gerstel, Shmuel Zaks: The Bit Complexity of Distributed Sorting (Extended Abstract). ESA 1993: 181-191 | |
| c17 | ||
| c16 | Sara Bitan, Shmuel Zaks: Optimal Linear Broadcast Routing with Capacity Limitations. ISAAC 1993: 287-296 | |
| 1992 | ||
| c15 | Ornan Ori Gerstel, Shmuel Zaks: A New Characterization of Tree Medians with Applications to Distributed Algorithms. WG 1992: 135-144 | |
| e1 | Adrian Segall, Shmuel Zaks (Eds.): Distributed Algorithms, 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992, Proceedings. Lecture Notes in Computer Science 647, Springer 1992, isbn 3-540-56188-9 | |
| 1990 | ||
| j22 | Ofer Biran, Shlomo Moran, Shmuel Zaks: A Combinatorial Characterization of the Distributed 1-Solvable Tasks. J. Algorithms 11(3): 420-440 (1990) | |
| j21 | Ching-Tsun Chou, Israel Cidon, Inder S. Gopal, Shmuel Zaks: Synchronizing asynchronous bounded delay networks. IEEE Transactions on Communications 38(2): 144-147 (1990) | |
| j20 | Alon Itai, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks: Optimal Distributed t-Resilient Election in Complete Networks. IEEE Trans. Software Eng. 16(4): 415-420 (1990) | |
| c14 | Sara Bitan, Shmuel Zaks: Optimal Linear Broadcast. SIGAL International Symposium on Algorithms 1990: 368-377 | |
| c13 | Ofer Biran, Shlomo Moran, Shmuel Zaks: Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. WDAG 1990: 373-389 | |
| c12 | Ofer Biran, Shlomo Moran, Shmuel Zaks: Deciding 1-sovability of distributed task is NP-hard. WG 1990: 206-220 | |
| 1989 | ||
| j19 | Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks: Efficient Elections in Chordal Ring Networks. Algorithmica 4(3): 437-446 (1989) | |
| j18 | Nachum Dershowitz, Shmuel Zaks: Patterns in trees. Discrete Applied Mathematics 25(3): 241-255 (1989) | |
| j17 | Ornan Ori Gerstel, Yishay Mansour, Shmuel Zaks: Bit Complexity of Order Statistics on a Distributed Star Network. Inf. Process. Lett. 30(3): 127-132 (1989) | |
| j16 | Ephraim Korach, Shlomo Moran, Shmuel Zaks: Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors. Theor. Comput. Sci. 64(1): 125-132 (1989) | |
| 1988 | ||
| j15 | Paul Erdös, Israel Koren, Shlomo Moran, Gabriel M. Silberman, Shmuel Zaks: Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays. Mathematical Systems Theory 21(2): 85-98 (1988) | |
| c11 | Yossi Malka, Shlomo Moran, Shmuel Zaks: Analysis of a Distributed Scheduler for Communication Networks. AWOC 1988: 351-360 | |
| c10 | Ephraim Korach, Gerard Tel, Shmuel Zaks: Optimal Synchronization of ABD Networks. Concurrency 1988: 353-367 | |
| c9 | Ofer Biran, Shlomo Moran, Shmuel Zaks: A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor. PODC 1988: 263-275 | |
| 1987 | ||
| j14 | Yishay Mansour, Shmuel Zaks: On the Bit Complexity of Distributed Computations in a Ring with a Leader. Inf. Comput. 75(2): 162-177 (1987) | |
| j13 | Ephraim Korach, Shlomo Moran, Shmuel Zaks: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors. SIAM J. Comput. 16(2): 231-236 (1987) | |
| c8 | Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks: Guessing Games and Distributed Computations in Synchronous Networks. ICALP 1987: 347-356 | |
| c7 | Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks: Making Distributed Spanning Tree Algorithms Fault-Resilient. STACS 1987: 432-444 | |
| c6 | Ching-Tsun Chou, Israel Cidon, Inder S. Gopal, Shmuel Zaks: Synchronizing Aysnchronous Bounded Delay Networks. WDAG 1987: 212-218 | |
| 1986 | ||
| j12 | Nachum Dershowitz, Shmuel Zaks: Ordered trees and non-crossing partitions. Discrete Mathematics 62(2): 215-218 (1986) | |
| c5 | Yishay Mansour, Shmuel Zaks: On the Bit Complexity of Distributed Computations in a Ring with a Leader. PODC 1986: 151-160 | |
| 1985 | ||
| j11 | Shmuel Zaks: Optimal Distributed Algorithms for Sorting and Ranking. IEEE Trans. Computers 34(4): 376-379 (1985) | |
| c4 | Ephraim Korach, Shlomo Moran, Shmuel Zaks: The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors. PODC 1985: 277-286 | |
| 1984 | ||
| j10 | ||
| c3 | ||
| c2 | Ephraim Korach, Shlomo Moran, Shmuel Zaks: Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors. PODC 1984: 199-207 | |
| 1983 | ||
| j9 | Ashok K. Chandra, Lawrence T. Kou, George Markowsky, Shmuel Zaks: On Sets of Boolean n -Projections Surjective. Acta Inf. 20: 103-111 (1983) | |
| 1982 | ||
| j8 | Yossi Shiloach, Uzi Vishkin, Shmuel Zaks: Golden ratios in a pairs covering problem. Discrete Mathematics 41(1): 57-65 (1982) | |
| j7 | Sara Porat, Nissim Francez, Shlomo Moran, Shmuel Zaks: Fair Deriviations in Context-Free Grammars. Information and Control 55(1-3): 108-116 (1982) | |
| j6 | ||
| j5 | Yehoshua Perl, Shmuel Zaks: On the Complexity of Edge Labelings for Trees. Theor. Comput. Sci. 19: 1-16 (1982) | |
| 1981 | ||
| j4 | Yehoshua Perl, Shmuel Zaks: Deficient generalized Fibonacci maximum path graphs. Discrete Mathematics 34(2): 153-164 (1981) | |
| c1 | ||
| 1980 | ||
| j3 | Nachum Dershowitz, Shmuel Zaks: Enumerations of ordered trees. Discrete Mathematics 31(1): 9-28 (1980) | |
| j2 | ||
| 1979 | ||
| j1 | Shmuel Zaks, D. Richards: Generating Trees and Other Combinatorial Objects Lexicographically. SIAM J. Comput. 8(1): 73-81 (1979) | |
Data released under the ODC-BY 1.0 license — See also our legal information page