Shmuel Zaks

	2012
129		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
128		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
	2011
127		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
126		George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks: Online Regenerator Placement. OPODIS 2011: 4-17
125		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
124		Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks: Opportunistic Information CoRR abs/1105.6151: (2011)
123		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)
122		George B. Mertzios, Ignasi Sau, Shmuel Zaks: The Recognition of Tolerance and Bounded Tolerance Graphs. SIAM J. Comput. 40(5): 1234-1257 (2011)
121		Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Optimizing regenerator cost in traffic grooming. Theor. Comput. Sci. 412(52): 7109-7121 (2011)
	2010
120		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
119		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
118		George B. Mertzios, Shmuel Zaks: On the Intersection of Tolerance and Cocomparability Graphs. ISAAC (1) 2010: 230-240
117		Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). OPODIS 2010: 443-458
116		Ignasi Sau, Mordechai Shalom, Shmuel Zaks: Traffic Grooming in Star Networks via Matching Techniques. SIROCCO 2010: 41-56
115		George B. Mertzios, Ignasi Sau, Shmuel Zaks: The Recognition of Tolerance and Bounded Tolerance Graphs. STACS 2010: 585-596
114		George B. Mertzios, Ignasi Sau, Shmuel Zaks: The Recognition of Tolerance and Bounded Tolerance Graphs CoRR abs/1001.3251: (2010)
113		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)
112		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)
111		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)
	2009
110		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
109		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
108		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
107		George B. Mertzios, Ignasi Sau, Shmuel Zaks: A New Intersection Model and Improved Algorithms for Tolerance Graphs. WG 2009: 285-295
106		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)
105		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)
104		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)
103		Giuseppe Prencipe, Shmuel Zaks: Preface. Theor. Comput. Sci. 410(14): 1305-1306 (2009)
	2008
102		Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. DISC 2008: 63-77
101		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
100		Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. SIROCCO 2008: 221-233
99		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)
98		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)
97		Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the traffic grooming problem. J. Discrete Algorithms 6(3): 472-479 (2008)
96		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)
	2007
95		Giuseppe Prencipe, Shmuel Zaks: Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings Springer 2007
94		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
93		Michel Raynal, Sam Toueg, Shmuel Zaks: DISC at Its 20th Anniversary (Stockholm, 2006). DISC 2007: 501-503
92		Mordechai Shalom, Walter Unger, Shmuel Zaks: On the Complexity of the Traffic Grooming Problem in Optical Networks. FUN 2007: 262-271
91		Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion. SSS 2007: 114-123
90		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
89		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)
88		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)
87		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)
	2006
86		Michele Flammini, Mordechai Shalom, Shmuel Zaks: On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. CAAN 2006: 72-85
85		Michele Flammini, Mordechai Shalom, Shmuel Zaks: On Minimizing the Number of ADMs in a General Topology Optical Network. DISC 2006: 459-473
84		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
83		Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the Traffic Grooming Problem. ISAAC 2005: 915-924
82		Mordechai Shalom, Shmuel Zaks: Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. SIROCCO 2005: 277-291
	2004
81		Mordechai Shalom, Shmuel Zaks: A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings. BROADNETS 2004: 254-262
	2002
80		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
79		Shmuel Zaks: Design Issues in ATM and Optical Networks. Computers and Artificial Intelligence 20(2): (2001)
	2000
78		Shmuel Zaks: Duality in ATM Layout Problems. CIAC 2000: 44-58
77		Tamar Eilam, Shlomo Moran, Shmuel Zaks: Approximation Algorithms for Survivable Optical Networks. DISC 2000: 104-118
76		Shmuel Zaks: On the Use of Duality and Geometry in Layouts for ATM Networks. MFCS 2000: 114-131
75		Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. Theor. Comput. Sci. 247(1-2): 213-228 (2000)
	1999
74		Jan K. Pachl, Shmuel Zaks: Computation in an algebra of test selection criteria CoRR cs.SE/9912018: (1999)
73		Tamar Eilam, Shlomo Moran, Shmuel Zaks: Lower bounds for linear interval routing. Networks 34(1): 37-46 (1999)
72		King-Shan Lui, Shmuel Zaks: Scheduling in Synchronous Networks and the Greedy Algorithm. Theor. Comput. Sci. 220(1): 157-183 (1999)
	1998
71		Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks: Minimum Dominating Sets of Intervals on Lines. Algorithmica 20(3): 294-308 (1998)
70		Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks: Optimal layouts on a chain ATM network. Discrete Applied Mathematics 83(1-3): 157-178 (1998)
69		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)
68		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)
67		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)
	1997
66		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
65		Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. ISTCS 1997: 96-106
64		Marcelo Feighelstein, Shmuel Zaks: Duality in Chain ATM Virtual Path Layouts. SIROCCO 1997: 228-239
63		Tamar Eilam, Shlomo Moran, Shmuel Zaks: The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. SIROCCO 1997: 99-111
62		Shmuel Zaks: Path Layout in ATM Networks. SOFSEM 1997: 144-160
61		Tamar Eilam, Shlomo Moran, Shmuel Zaks: A Simple DFS-Based Algorithm for Linear Interval Routing. WDAG 1997: 37-51
60		King-Shan Lui, Shmuel Zaks: Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract). WDAG 1997: 66-80
59		Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks: On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres. WG 1997: 171-183
58		Ornan Ori Gerstel, Shmuel Zaks: The Bit Complexity of Distributed Sorting. Algorithmica 18(3): 405-416 (1997)
	1996
57		Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks: Efficient Support for the Client/Server Paradigm over Heterogeneous ATM Networks. INFOCOM 1996: 1294-1301
56		Derek Hing-leung Ngok, Shmuel Zaks: On the Power of Local Information in Scheduling in Synchronous Networks. SIROCCO 1996: 301-312
55		Tamar Eilam, Shlomo Moran, Shmuel Zaks: A Lower Bound for Linear Interval Routing. WDAG 1996: 191-205
54		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)
53		Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks: The layout of virtual paths in ATM networks. IEEE/ACM Trans. Netw. 4(6): 873-884 (1996)
	1995
52		Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks: Minimum Dominating Sets of Intervals on Lines (Extended Abstract). COCOON 1995: 520-529
51		Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks: Optimal Layouts on a Chain ATM Network (Extended Abstract). ESA 1995: 508-522
50		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)
	1994
49		Moshe Molcho, Shmuel Zaks: Robust Asynchronous Algorithms in Networks with a Fault Detection Ring. ISAAC 1994: 101-109
48		Ornan Ori Gerstel, Shmuel Zaks: The Virtual Path Layout Problem in Fast Networks (Extended Abstract). PODC 1994: 235-243
47		Ornan Ori Gerstel, Shmuel Zaks: Path Layout in ATM Networks. SIROCCO 1994: 151-166
46		Israel Cidon, Ornan Ori Gerstel, Shmuel Zaks: A Scalable Approach to Routing in ATM Networks. WDAG 1994: 209-222
45		Mordecai J. Golin, Shmuel Zaks: Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. WG 1994: 282-291
44		Gerard Tel, Ephraim Korach, Shmuel Zaks: Synchronizing ABD networks. IEEE/ACM Trans. Netw. 2(1): 66-69 (1994)
43		Dexter Kozen, Shmuel Zaks: Optimal Bounds for the Change-Making Problem. Theor. Comput. Sci. 123(2): 377-388 (1994)
	1993
42		Ornan Ori Gerstel, Shmuel Zaks: The Bit Complexity of Distributed Sorting (Extended Abstract). ESA 1993: 181-191
41		Dexter Kozen, Shmuel Zaks: Optimal Bounds for the Change-Making Problem. ICALP 1993: 150-161
40		Sara Bitan, Shmuel Zaks: Optimal Linear Broadcast Routing with Capacity Limitations. ISAAC 1993: 287-296
39		Yossi Malka, Shlomo Moran, Shmuel Zaks: A Lower Bound on the Period Length of a Distributed Scheduler. Algorithmica 10(5): 383-398 (1993)
38		Sara Bitan, Shmuel Zaks: Optimal Linear Broadcast. J. Algorithms 14(2): 288-315 (1993)
	1992
37		Adrian Segall, Shmuel Zaks: Distributed Algorithms, 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992, Proceedings Springer 1992
36		Ornan Ori Gerstel, Shmuel Zaks: A New Characterization of Tree Medians with Applications to Distributed Algorithms. WG 1992: 135-144
	1990
35		Sara Bitan, Shmuel Zaks: Optimal Linear Broadcast. SIGAL International Symposium on Algorithms 1990: 368-377
34		Ofer Biran, Shlomo Moran, Shmuel Zaks: Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. WDAG 1990: 373-389
33		Ofer Biran, Shlomo Moran, Shmuel Zaks: Deciding 1-sovability of distributed task is NP-hard. WG 1990: 206-220
32		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)
31		Ofer Biran, Shlomo Moran, Shmuel Zaks: A Combinatorial Characterization of the Distributed 1-Solvable Tasks. J. Algorithms 11(3): 420-440 (1990)
	1989
30		Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks: Efficient Elections in Chordal Ring Networks. Algorithmica 4(3): 437-446 (1989)
29		Nachum Dershowitz, Shmuel Zaks: Patterns in trees. Discrete Applied Mathematics 25(3): 241-255 (1989)
28		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)
27		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
26		Yossi Malka, Shlomo Moran, Shmuel Zaks: Analysis of a Distributed Scheduler for Communication Networks. AWOC 1988: 351-360
25		Ephraim Korach, Gerard Tel, Shmuel Zaks: Optimal Synchronization of ABD Networks. Concurrency 1988: 353-367
24		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
23		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)
	1987
22		Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks: Guessing Games and Distributed Computations in Synchronous Networks. ICALP 1987: 347-356
21		Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks: Making Distributed Spanning Tree Algorithms Fault-Resilient. STACS 1987: 432-444
20		Ching-Tsun Chou, Israel Cidon, Inder S. Gopal, Shmuel Zaks: Synchronizing Aysnchronous Bounded Delay Networks. WDAG 1987: 212-218
19		Yishay Mansour, Shmuel Zaks: On the Bit Complexity of Distributed Computations in a Ring with a Leader Inf. Comput. 75(2): 162-177 (1987)
18		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)
	1986
17		Yishay Mansour, Shmuel Zaks: On the Bit Complexity of Distributed Computations in a Ring with a Leader. PODC 1986: 151-160
16		Nachum Dershowitz, Shmuel Zaks: Ordered trees and non-crossing partitions. Discrete Mathematics 62(2): 215-218 (1986)
	1985
15		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
14		Shmuel Zaks: Optimal Distributed Algorithms for Sorting and Ranking. IEEE Trans. Computers 34(4): 376-379 (1985)
	1984
13		Nachum Dershowitz, Shmuel Zaks: Patterns in Trees. CAAP 1984: 93-102
12		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
11		Shmuel Zaks: A New Algorithm for Generation of Permutations. BIT 24(2): 196-204 (1984)
	1983
10		Ashok K. Chandra, Lawrence T. Kou, George Markowsky, Shmuel Zaks: On Sets of Boolean n -Projections Surjective. Acta Inf. 20: 103-111 (1983)
	1982
9		Yossi Shiloach, Uzi Vishkin, Shmuel Zaks: Golden ratios in a pairs covering problem. Discrete Mathematics 41(1): 57-65 (1982)
8		Shmuel Zaks: Generation and Ranking of k-ary Trees. Inf. Process. Lett. 14(1): 44-48 (1982)
7		Sara Porat, Nissim Francez, Shlomo Moran, Shmuel Zaks: Fair Deriviations in Context-Free Grammars Information and Control 55(1-3): 108-116 (1982)
6		Yehoshua Perl, Shmuel Zaks: On the Complexity of Edge Labelings for Trees. Theor. Comput. Sci. 19: 1-16 (1982)
	1981
5		Nachum Dershowitz, Shmuel Zaks: Applied Tree Enumerations. CAAP 1981: 180-193
4		Yehoshua Perl, Shmuel Zaks: Deficient generalized Fibonacci maximum path graphs. Discrete Mathematics 34(2): 153-164 (1981)
	1980
3		Nachum Dershowitz, Shmuel Zaks: Enumerations of ordered trees. Discrete Mathematics 31(1): 9-28 (1980)
2		Shmuel Zaks: Lexicographic Generation of Ordered Trees. Theor. Comput. Sci. 10: 63-82 (1980)
	1979
1		Shmuel Zaks, D. Richards: Generating Trees and Other Combinatorial Objects Lexicographically. SIAM J. Comput. 8(1): 73-81 (1979)

Coauthor Index

1	Hagit Attiya (Chagit Attiya)	[30]
2	Reuven Bar-Yehuda	[21]
3	Ofer Biran	[24] [31] [33] [34] [50]
4	Sara Bitan	[35] [38] [40]
5	Ashok K. Chandra	[10]
6	Siu-Wing Cheng	[52] [71]
7	Viacheslav Chernoy	[91] [100] [102] [113]
8	Ching-Tsun Chou	[20]
9	Israel Cidon	[20] [46] [53] [54] [57] [69]
10	Nachum Dershowitz	[3] [5] [13] [16] [29] [105]
11	Yefim Dinitz	[59] [65] [75]
12	Tamar Eilam	[55] [61] [63] [65] [66] [68] [73] [75] [77] [80]
13	Paul Erdös	[23]
14	Martin Farach-Colton (Martin Farach)	[124] [127] [129]
15	Marcelo Feighelstein	[59] [64]
16	Antonio Fernández (Antonio Fernández Anta)	[120] [124] [127] [129]
17	Michele Flammini	[66] [68] [83] [84] [85] [86] [88] [90] [96] [97] [99] [101] [106] [108] [110] [111] [117] [121] [123] [125]
18	Nissim Francez	[7]
19	Fanica Gavril	[98]
20	Ornan Ori Gerstel	[28] [36] [42] [46] [47] [48] [51] [53] [54] [57] [58] [69] [70]
21	Stefania Di Giannantonio	[90]
22	Mordecai J. Golin	[45] [67]
23	Inder S. Gopal	[20]
24	Alon Itai	[32]
25	Michael Kaminski	[52] [71]
26	Ephraim Korach	[12] [15] [18] [25] [27] [44]
27	Israel Koren	[23]
28	Lawrence T. Kou	[10]
29	Dexter Kozen	[41] [43]
30	Shay Kutten	[21] [32]
31	Jan van Leeuwen	[22] [30]
32	King-Shan Lui	[60] [72]
33	Yossi Malka	[26] [39]
34	Yishay Mansour	[17] [19] [28]
35	Alberto Marchetti-Spaccamela	[108] [123]
36	George Markowsky	[10]
37	George B. Mertzios	[104] [107] [114] [115] [118] [119] [122] [126]
38	Alessia Milani	[120] [124] [127] [129]
39	Moshe Molcho	[49]
40	Gianpiero Monaco	[84] [90] [96] [99] [101] [108] [110] [111] [117] [121] [123] [125]
41	Shlomo Moran	[7] [12] [15] [18] [23] [24] [26] [27] [31] [33] [34] [39] [50] [55] [61] [63] [65] [73] [75] [77] [80]
42	Luca Moscardelli	[83] [84] [90] [96] [97] [99] [101] [108] [110] [111] [117] [121] [123] [125]
43	Miguel A. Mosteiro	[120] [124] [127] [129]
44	Derek Hing-leung Ngok	[56]
45	Jan K. Pachl	[74]
46	Yehoshua Perl	[4] [6]
47	Ron Y. Pinter	[98]
48	Sara Porat	[7]
49	Giuseppe Prencipe	[95] [103]
50	Michel Raynal	[93]
51	D. Richards	[1]
52	Nicola Santoro	[22] [30]
53	Ignasi Sau (Ignasi Sau Valls)	[104] [107] [114] [115] [116] [119] [122]
54	Adrian Segall	[37]
55	Hadas Shachnai	[110] [111]
56	Mordechai Shalom	[81] [82] [83] [84] [85] [86] [87] [88] [89] [90] [91] [92] [94] [96] [97] [99] [100] [101] [102] [106] [109] [110] [111] [112] [113] [116] [117] [119] [121] [125] [126] [128]
57	Yossi Shiloach	[9]
58	Gabriel M. Silberman	[23]
59	Tami Tamir	[110] [111]
60	Gerard Tel	[25] [44]
61	Sam Toueg	[93]
62	Walter Unger	[92]
63	Jorge Urrutia	[22]
64	Uzi Vishkin	[9]
65	Ariella Voloshin	[128]
66	Yaron Wolfsthal (Yaron Wolfstahl)	[21] [32]
67	Prudence W. H. Wong	[94] [109] [112] [126] [128]
68	Avishai Wool	[51] [70]
69	Fencol C. C. Yung	[128]

Colors in the list of coauthors

Last update Sat May 26 02:31:23 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page