The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Shmuel Zaks: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ornan Ori Gerstel, Shmuel Zaks
    A New Characterization of Tree Medians with Applications to Distributed Algorithms. [Citation Graph (1, 0)][DBLP]
    WG, 1992, pp:135-144 [Conf]
  2. Yossi Malka, Shlomo Moran, Shmuel Zaks
    Analysis of a Distributed Scheduler for Communication Networks. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:351-360 [Conf]
  3. Mordechai Shalom, Shmuel Zaks
    A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings. [Citation Graph (0, 0)][DBLP]
    BROADNETS, 2004, pp:254-262 [Conf]
  4. Michele Flammini, Mordechai Shalom, Shmuel Zaks
    On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. [Citation Graph (0, 0)][DBLP]
    CAAN, 2006, pp:72-85 [Conf]
  5. Nachum Dershowitz, Shmuel Zaks
    Patterns in Trees. [Citation Graph (0, 0)][DBLP]
    CAAP, 1984, pp:93-102 [Conf]
  6. Nachum Dershowitz, Shmuel Zaks
    Applied Tree Enumerations. [Citation Graph (0, 0)][DBLP]
    CAAP, 1981, pp:180-193 [Conf]
  7. Shmuel Zaks
    Duality in ATM Layout Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:44-58 [Conf]
  8. Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks
    Minimum Dominating Sets of Intervals on Lines (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:520-529 [Conf]
  9. Ephraim Korach, Gerard Tel, Shmuel Zaks
    Optimal Synchronization of ABD Networks. [Citation Graph (0, 0)][DBLP]
    Concurrency, 1988, pp:353-367 [Conf]
  10. Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks
    Optimal Layouts on a Chain ATM Network (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:508-522 [Conf]
  11. Ornan Ori Gerstel, Shmuel Zaks
    The Bit Complexity of Distributed Sorting (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:181-191 [Conf]
  12. 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). [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:527-537 [Conf]
  13. Dexter Kozen, Shmuel Zaks
    Optimal Bounds for the Change-Making Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:150-161 [Conf]
  14. Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks
    Guessing Games and Distributed Computations in Synchronous Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:347-356 [Conf]
  15. Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks
    Efficient Support for the Client/Server Paradigm over Heterogeneous ATM Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1996, pp:1294-1301 [Conf]
  16. Sara Bitan, Shmuel Zaks
    Optimal Linear Broadcast Routing with Capacity Limitations. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:287-296 [Conf]
  17. Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
    Approximating the Traffic Grooming Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:915-924 [Conf]
  18. Moshe Molcho, Shmuel Zaks
    Robust Asynchronous Algorithms in Networks with a Fault Detection Ring. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:101-109 [Conf]
  19. Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
    On the totalk-diameter of connection networks. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:96-106 [Conf]
  20. Shmuel Zaks
    On the Use of Duality and Geometry in Layouts for ATM Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:114-131 [Conf]
  21. Ofer Biran, Shlomo Moran, Shmuel Zaks
    A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor. [Citation Graph (0, 0)][DBLP]
    PODC, 1988, pp:263-275 [Conf]
  22. Ornan Ori Gerstel, Shmuel Zaks
    The Virtual Path Layout Problem in Fast Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1994, pp:235-243 [Conf]
  23. Ephraim Korach, Shlomo Moran, Shmuel Zaks
    Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors. [Citation Graph (0, 0)][DBLP]
    PODC, 1984, pp:199-207 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:277-286 [Conf]
  25. Yishay Mansour, Shmuel Zaks
    On the Bit Complexity of Distributed Computations in a Ring with a Leader. [Citation Graph (0, 0)][DBLP]
    PODC, 1986, pp:151-160 [Conf]
  26. Sara Bitan, Shmuel Zaks
    Optimal Linear Broadcast. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:368-377 [Conf]
  27. Tamar Eilam, Shlomo Moran, Shmuel Zaks
    The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:99-111 [Conf]
  28. Marcelo Feighelstein, Shmuel Zaks
    Duality in Chain ATM Virtual Path Layouts. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:228-239 [Conf]
  29. Ornan Ori Gerstel, Shmuel Zaks
    Path Layout in ATM Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1994, pp:151-166 [Conf]
  30. Derek Hing-leung Ngok, Shmuel Zaks
    On the Power of Local Information in Scheduling in Synchronous Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:301-312 [Conf]
  31. Mordechai Shalom, Shmuel Zaks
    Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:277-291 [Conf]
  32. Shmuel Zaks
    Path Layout in ATM Networks. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1997, pp:144-160 [Conf]
  33. Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks
    Making Distributed Spanning Tree Algorithms Fault-Resilient. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:432-444 [Conf]
  34. Ofer Biran, Shlomo Moran, Shmuel Zaks
    Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. [Citation Graph (0, 0)][DBLP]
    WDAG, 1990, pp:373-389 [Conf]
  35. Ching-Tsun Chou, Israel Cidon, Inder S. Gopal, Shmuel Zaks
    Synchronizing Aysnchronous Bounded Delay Networks. [Citation Graph (0, 0)][DBLP]
    WDAG, 1987, pp:212-218 [Conf]
  36. Israel Cidon, Ornan Ori Gerstel, Shmuel Zaks
    A Scalable Approach to Routing in ATM Networks. [Citation Graph (0, 0)][DBLP]
    WDAG, 1994, pp:209-222 [Conf]
  37. Tamar Eilam, Shlomo Moran, Shmuel Zaks
    Approximation Algorithms for Survivable Optical Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:104-118 [Conf]
  38. Tamar Eilam, Shlomo Moran, Shmuel Zaks
    A Lower Bound for Linear Interval Routing. [Citation Graph (0, 0)][DBLP]
    WDAG, 1996, pp:191-205 [Conf]
  39. Tamar Eilam, Shlomo Moran, Shmuel Zaks
    A Simple DFS-Based Algorithm for Linear Interval Routing. [Citation Graph (0, 0)][DBLP]
    WDAG, 1997, pp:37-51 [Conf]
  40. King-Shan Lui, Shmuel Zaks
    Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1997, pp:66-80 [Conf]
  41. Michele Flammini, Mordechai Shalom, Shmuel Zaks
    On Minimizing the Number of ADMs in a General Topology Optical Network. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:459-473 [Conf]
  42. Ofer Biran, Shlomo Moran, Shmuel Zaks
    Deciding 1-sovability of distributed task is NP-hard. [Citation Graph (0, 0)][DBLP]
    WG, 1990, pp:206-220 [Conf]
  43. Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks
    On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:171-183 [Conf]
  44. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
    Approximating the Traffic Grooming Problem in Tree and Star Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:147-158 [Conf]
  45. Mordecai J. Golin, Shmuel Zaks
    Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:282-291 [Conf]
  46. Ashok K. Chandra, Lawrence T. Kou, George Markowsky, Shmuel Zaks
    On Sets of Boolean n -Projections Surjective. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:20, n:, pp:103-111 [Journal]
  47. Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks
    Efficient Elections in Chordal Ring Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:3, pp:437-446 [Journal]
  48. Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks
    Minimum Dominating Sets of Intervals on Lines. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:3, pp:294-308 [Journal]
  49. Ornan Ori Gerstel, Shmuel Zaks
    The Bit Complexity of Distributed Sorting. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:3, pp:405-416 [Journal]
  50. Yossi Malka, Shlomo Moran, Shmuel Zaks
    A Lower Bound on the Period Length of a Distributed Scheduler. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:5, pp:383-398 [Journal]
  51. Shmuel Zaks
    A New Algorithm for Generation of Permutations. [Citation Graph (0, 0)][DBLP]
    BIT, 1984, v:24, n:2, pp:196-204 [Journal]
  52. Shmuel Zaks
    Design Issues in ATM and Optical Networks. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2001, v:20, n:2, pp:- [Journal]
  53. Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks
    Optimal Virtual Path Layout in ATM Networks With Shared Routing Table Switches. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1996, v:1996, n:, pp:- [Journal]
  54. Jan K. Pachl, Shmuel Zaks
    Computation in an algebra of test selection criteria [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  55. Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks
    Optimal layouts on a chain ATM network. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:157-178 [Journal]
  56. Yishay Mansour, Shmuel Zaks
    On the Bit Complexity of Distributed Computations in a Ring with a Leader [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:75, n:2, pp:162-177 [Journal]
  57. Sara Porat, Nissim Francez, Shlomo Moran, Shmuel Zaks
    Fair Deriviations in Context-Free Grammars [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:55, n:1-3, pp:108-116 [Journal]
  58. Ornan Ori Gerstel, Yishay Mansour, Shmuel Zaks
    Bit Complexity of Order Statistics on a Distributed Star Network. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:3, pp:127-132 [Journal]
  59. Shmuel Zaks
    Generation and Ranking of k-ary Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:1, pp:44-48 [Journal]
  60. Ofer Biran, Shlomo Moran, Shmuel Zaks
    A Combinatorial Characterization of the Distributed 1-Solvable Tasks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:3, pp:420-440 [Journal]
  61. Sara Bitan, Shmuel Zaks
    Optimal Linear Broadcast. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:2, pp:288-315 [Journal]
  62. Paul Erdös, Israel Koren, Shlomo Moran, Gabriel M. Silberman, Shmuel Zaks
    Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1988, v:21, n:2, pp:85-98 [Journal]
  63. Tamar Eilam, Shlomo Moran, Shmuel Zaks
    Lower bounds for linear interval routing. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:1, pp:37-46 [Journal]
  64. Tamar Eilam, Michele Flammini, Shmuel Zaks
    A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:2, pp:207-220 [Journal]
  65. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:2, pp:231-236 [Journal]
  66. Shmuel Zaks, D. Richards
    Generating Trees and Other Combinatorial Objects Lexicographically. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:1, pp:73-81 [Journal]
  67. Shmuel Zaks
    Optimal Distributed Algorithms for Sorting and Ranking. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1985, v:34, n:4, pp:376-379 [Journal]
  68. Ofer Biran, Shlomo Moran, Shmuel Zaks
    Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:145, n:1&2, pp:271-290 [Journal]
  69. Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
    On the totalk-diameter of connection networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:247, n:1-2, pp:213-228 [Journal]
  70. Tamar Eilam, Shlomo Moran, Shmuel Zaks
    The complexity of the characterization of networks supporting shortest-path interval routing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:85-104 [Journal]
  71. Mordecai J. Golin, Shmuel Zaks
    Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:99-114 [Journal]
  72. Ephraim Korach, Shlomo Moran, Shmuel Zaks
    Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:64, n:1, pp:125-132 [Journal]
  73. Dexter Kozen, Shmuel Zaks
    Optimal Bounds for the Change-Making Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:123, n:2, pp:377-388 [Journal]
  74. King-Shan Lui, Shmuel Zaks
    Scheduling in Synchronous Networks and the Greedy Algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:220, n:1, pp:157-183 [Journal]
  75. Yehoshua Perl, Shmuel Zaks
    On the Complexity of Edge Labelings for Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:1-16 [Journal]
  76. Shmuel Zaks
    Lexicographic Generation of Ordered Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:10, n:, pp:63-82 [Journal]
  77. Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks
    The layout of virtual paths in ATM networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1996, v:4, n:6, pp:873-884 [Journal]
  78. Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks
    Efficient support for client/server applications over heterogeneous ATM network. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1998, v:6, n:4, pp:432-446 [Journal]
  79. Gerard Tel, Ephraim Korach, Shmuel Zaks
    Synchronizing ABD networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1994, v:2, n:1, pp:66-69 [Journal]
  80. Alon Itai, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks
    Optimal Distributed t-Resilient Election in Complete Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1990, v:16, n:4, pp:415-420 [Journal]
  81. Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
    On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
    SSS, 2007, pp:114-123 [Conf]
  82. Michel Raynal, Sam Toueg, Shmuel Zaks
    DISC at Its 20th Anniversary (Stockholm, 2006). [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:501-503 [Conf]
  83. Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
    Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:435-449 [Conf]
  84. Mordechai Shalom, Walter Unger, Shmuel Zaks
    On the Complexity of the Traffic Grooming Problem in Optical Networks. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:262-271 [Conf]
  85. Nachum Dershowitz, Shmuel Zaks
    Enumerations of ordered trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:31, n:1, pp:9-28 [Journal]
  86. Yehoshua Perl, Shmuel Zaks
    Deficient generalized Fibonacci maximum path graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:2, pp:153-164 [Journal]
  87. Yossi Shiloach, Uzi Vishkin, Shmuel Zaks
    Golden ratios in a pairs covering problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:57-65 [Journal]
  88. Nachum Dershowitz, Shmuel Zaks
    Ordered trees and non-crossing partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:2, pp:215-218 [Journal]
  89. Michele Flammini, Mordechai Shalom, Shmuel Zaks
    On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:4, pp:448-455 [Journal]
  90. Mordechai Shalom, Shmuel Zaks
    Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:2-3, pp:250-262 [Journal]

  91. Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. [Citation Graph (, )][DBLP]


  92. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. [Citation Graph (, )][DBLP]


  93. Minimizing total busy time in parallel scheduling with application to optical networks. [Citation Graph (, )][DBLP]


  94. On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. [Citation Graph (, )][DBLP]


  95. On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology. [Citation Graph (, )][DBLP]


  96. Traffic Grooming in Star Networks via Matching Techniques. [Citation Graph (, )][DBLP]


  97. On the complexity of the regenerator placement problem in optical networks. [Citation Graph (, )][DBLP]


  98. The Recognition of Tolerance and Bounded Tolerance Graphs. [Citation Graph (, )][DBLP]


  99. A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. [Citation Graph (, )][DBLP]


  100. Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony. [Citation Graph (, )][DBLP]


  101. A New Intersection Model and Improved Algorithms for Tolerance Graphs. [Citation Graph (, )][DBLP]


  102. Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. [Citation Graph (, )][DBLP]


  103. Selfishness, collusion and power of local search for the ADMs minimization problem. [Citation Graph (, )][DBLP]


  104. The Recognition of Tolerance and Bounded Tolerance Graphs [Citation Graph (, )][DBLP]


  105. Patterns in trees. [Citation Graph (, )][DBLP]


  106. On minimizing the number of ADMs in a general topology optical network. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002