| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
Optimizing regenerator cost in traffic grooming. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks |
Opportunistic Information |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
The Recognition of Tolerance and Bounded Tolerance Graphs. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks |
Online Regenerator Placement. |
OPODIS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
The Recognition of Tolerance and Bounded Tolerance Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks |
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms. |
Distributed Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks |
Optimal on-line colorings for minimizing the number of ADMs in optical networks. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks |
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
The Recognition of Tolerance and Bounded Tolerance Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). |
OPODIS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ignasi Sau, Mordechai Shalom, Shmuel Zaks |
Traffic Grooming in Star Networks via Matching Techniques. |
SIROCCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Shmuel Zaks |
On the Intersection of Tolerance and Cocomparability Graphs. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe Prencipe, Shmuel Zaks |
Preface. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
A New Intersection Model and Improved Algorithms for Tolerance Graphs. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nachum Dershowitz, Shmuel Zaks |
More Patterns in Trees: Up and Down, Young and Old, Odd and Even. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Flammini, Mordechai Shalom, Shmuel Zaks |
On minimizing the number of ADMs in a general topology optical network. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
A New Intersection Model and Improved Algorithms for Tolerance Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks |
On the complexity of the regenerator placement problem in optical networks. |
SPAA |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, complexity, optical networks, wavelength division multiplexing (wdm), regenerators |
| 1 | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
Approximating the traffic grooming problem in tree and star networks. |
J. Parallel Distrib. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
Selfishness, collusion and power of local search for the ADMs minimization problem. |
Computer Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fanica Gavril, Ron Y. Pinter, Shmuel Zaks |
Intersection representations of matrices by subtrees and unicycles on graphs. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
Approximating the traffic grooming problem. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. |
Euro-Par |
2008 |
DBLP DOI BibTeX RDF |
Optical Add-Drop Multiplexer(OADM), Path and Ring Networks, Optical Networks, Traffic Grooming, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM) |
| 1 | Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks |
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. |
SIROCCO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks |
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. |
DISC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Flammini, Mordechai Shalom, Shmuel Zaks |
On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. |
J. Parallel Distrib. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordechai Shalom, Shmuel Zaks |
A 10/7 + epsilon approximation for minimizing the number of ADMs in SONET rings. |
IEEE/ACM Trans. Netw. |
2007 |
DBLP DOI BibTeX RDF |
optical networks, wavelength division multiplexing (WDM), wavelength assignment, add-drop multiplexer (ADM) |
| 1 | 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 |
DBLP DOI BibTeX RDF |
Price of Collusion, Game Theory, Optical Networks, Price of Anarchy, Wavelength Division Multiplexing (WDM), Nash Equilibria, Add-Drop Multiplexer (ADM) |
| 1 | Giuseppe Prencipe, Shmuel Zaks (eds.) |
Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings |
SIROCCO |
2007 |
DBLP BibTeX RDF |
|
| 1 | Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks |
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks. |
DISC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Raynal, Sam Toueg, Shmuel Zaks |
DISC at Its 20th Anniversary (Stockholm, 2006). |
DISC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordechai Shalom, Walter Unger, Shmuel Zaks |
On the Complexity of the Traffic Grooming Problem in Optical Networks. |
FUN |
2007 |
DBLP DOI BibTeX RDF |
Optical Networks, Wavelength Assignment, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM) |
| 1 | Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks |
On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion. |
SSS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
Approximating the Traffic Grooming Problem in Tree and Star Networks. |
WG |
2006 |
DBLP DOI BibTeX RDF |
Optical Networks, Tree Networks, Traffic Grooming, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM) |
| 1 | Michele Flammini, Mordechai Shalom, Shmuel Zaks |
On Minimizing the Number of ADMs in a General Topology Optical Network. |
DISC |
2006 |
DBLP DOI BibTeX RDF |
Optical Networks, Wavelength Assignment, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM) |
| 1 | Michele Flammini, Mordechai Shalom, Shmuel Zaks |
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. |
CAAN |
2006 |
DBLP DOI BibTeX RDF |
Optical Networks, Wavelength Assignment, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM) |
| 1 | Mordechai Shalom, Shmuel Zaks |
Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. |
SIROCCO |
2005 |
DBLP DOI BibTeX RDF |
Optical Networks, Wavelength Assignment, Add-Drop Multiplexer(ADM), SONET, Wavelength Division Multiplexing(WDM) |
| 1 | Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
Approximating the Traffic Grooming Problem. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
Optical Networks, Wavelength Assignment, Traffic Grooming, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM) |
| 1 | Mordechai Shalom, Shmuel Zaks |
A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings. |
BROADNETS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamar Eilam, Shlomo Moran, Shmuel Zaks |
The complexity of the characterization of networks supporting shortest-path interval routing. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Zaks |
Design Issues in ATM and Optical Networks. |
Computers and Artificial Intelligence |
2001 |
DBLP BibTeX RDF |
|
| 1 | Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks |
On the totalk-diameter of connection networks. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Zaks |
On the Use of Duality and Geometry in Layouts for ATM Networks. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamar Eilam, Shlomo Moran, Shmuel Zaks |
Approximation Algorithms for Survivable Optical Networks. |
DISC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Zaks |
Duality in ATM Layout Problems. |
CIAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | King-Shan Lui, Shmuel Zaks |
Scheduling in Synchronous Networks and the Greedy Algorithm. |
Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamar Eilam, Shlomo Moran, Shmuel Zaks |
Lower bounds for linear interval routing. |
Networks |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan K. Pachl, Shmuel Zaks |
Computation in an algebra of test selection criteria |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Mordecai J. Golin, Shmuel Zaks |
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks |
Minimum Dominating Sets of Intervals on Lines. |
Algorithmica |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks |
Efficient support for client/server applications over heterogeneous ATM network. |
IEEE/ACM Trans. Netw. |
1998 |
DBLP DOI BibTeX RDF |
client/server paradigm, virtual path design, virtual path routing, network design, ATM network |
| 1 | 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 |
1998 |
DBLP BibTeX RDF |
|
| 1 | Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks |
Optimal layouts on a chain ATM network. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ornan Ori Gerstel, Shmuel Zaks |
The Bit Complexity of Distributed Sorting. |
Algorithmica |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks |
On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres. |
WG |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo Feighelstein, Shmuel Zaks |
Duality in Chain ATM Virtual Path Layouts. |
SIROCCO |
1997 |
DBLP BibTeX RDF |
|
| 1 | Tamar Eilam, Shlomo Moran, Shmuel Zaks |
The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. |
SIROCCO |
1997 |
DBLP BibTeX RDF |
|
| 1 | King-Shan Lui, Shmuel Zaks |
Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract). |
WDAG |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamar Eilam, Shlomo Moran, Shmuel Zaks |
A Simple DFS-Based Algorithm for Linear Interval Routing. |
WDAG |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks |
On the totalk-diameter of connection networks. (PDF / PS) |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
k edge-disjoint paths, minimal sum of lengths, fault-tolerant routing problems, k-connected simple graph, total/sub k/-diameter, graph theory, lower bound, ATM networks, upper bound, nodes, compact routing, connection network |
| 1 | Shmuel Zaks |
Path Layout in ATM Networks. |
SOFSEM |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks |
The layout of virtual paths in ATM networks. |
IEEE/ACM Trans. Netw. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek Hing-leung Ngok, Shmuel Zaks |
On the Power of Local Information in Scheduling in Synchronous Networks. |
SIROCCO |
1996 |
DBLP BibTeX RDF |
|
| 1 | Tamar Eilam, Shlomo Moran, Shmuel Zaks |
A Lower Bound for Linear Interval Routing. |
WDAG |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks |
Efficient Support for the Client/Server Paradigm over Heterogeneous ATM Networks. |
INFOCOM |
1996 |
DBLP BibTeX RDF |
|
| 1 | Ofer Biran, Shlomo Moran, Shmuel Zaks |
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks |
Optimal Layouts on a Chain ATM Network (Extended Abstract). |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks |
Minimum Dominating Sets of Intervals on Lines (Extended Abstract). |
COCOON |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Dexter Kozen, Shmuel Zaks |
Optimal Bounds for the Change-Making Problem. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard Tel, Ephraim Korach, Shmuel Zaks |
Synchronizing ABD networks. |
IEEE/ACM Trans. Netw. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Shmuel Zaks |
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. |
WG |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ornan Ori Gerstel, Shmuel Zaks |
Path Layout in ATM Networks. |
SIROCCO |
1994 |
DBLP BibTeX RDF |
|
| 1 | Israel Cidon, Ornan Ori Gerstel, Shmuel Zaks |
A Scalable Approach to Routing in ATM Networks. |
WDAG |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ornan Ori Gerstel, Shmuel Zaks |
The Virtual Path Layout Problem in Fast Networks (Extended Abstract). |
PODC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Molcho, Shmuel Zaks |
Robust Asynchronous Algorithms in Networks with a Fault Detection Ring. |
ISAAC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Malka, Shlomo Moran, Shmuel Zaks |
A Lower Bound on the Period Length of a Distributed Scheduler. |
Algorithmica |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Bitan, Shmuel Zaks |
Optimal Linear Broadcast. |
J. Algorithms |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ornan Ori Gerstel, Shmuel Zaks |
The Bit Complexity of Distributed Sorting (Extended Abstract). |
ESA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Dexter Kozen, Shmuel Zaks |
Optimal Bounds for the Change-Making Problem. |
ICALP |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Bitan, Shmuel Zaks |
Optimal Linear Broadcast Routing with Capacity Limitations. |
ISAAC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ornan Ori Gerstel, Shmuel Zaks |
A New Characterization of Tree Medians with Applications to Distributed Algorithms. |
WG |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Segall, Shmuel Zaks (eds.) |
Distributed Algorithms, 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992, Proceedings |
WDAG |
1992 |
DBLP BibTeX RDF |
|
| 1 | Alon Itai, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks |
Optimal Distributed t-Resilient Election in Complete Networks. |
IEEE Trans. Software Eng. |
1990 |
DBLP DOI BibTeX RDF |
optimal distributed t-resilient election, distributed leader election, election algorithm, fault-free network, software engineering, fault tolerant computing, distributed processing, computer networks, message complexity, complete networks |
| 1 | Ofer Biran, Shlomo Moran, Shmuel Zaks |
A Combinatorial Characterization of the Distributed 1-Solvable Tasks. |
J. Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Ofer Biran, Shlomo Moran, Shmuel Zaks |
Deciding 1-sovability of distributed task is NP-hard. |
WG |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Bitan, Shmuel Zaks |
Optimal Linear Broadcast. |
SIGAL International Symposium on Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Ofer Biran, Shlomo Moran, Shmuel Zaks |
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. |
WDAG |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Ornan Ori Gerstel, Yishay Mansour, Shmuel Zaks |
Bit Complexity of Order Statistics on a Distributed Star Network. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")