zaks shmuel

Citada per

	Totes	Des de 2020
Citacions	3493	444
Índex h	31	12
Índex i10	81	16

140

105

198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520 52 52 71 48 52 41 45 91 87 86 103 103 73 88 101 65 95 52 92 94 101 83 103 138 99 98 115 93 108 131 120 105 91 90 95 68 80 87 24

Accés públic

Mostra-ho tot

7 articles

0 articles

disponibles

no disponibles

Es basa en els requisits de les agències que proporcionen el finançament

Coautors

Mordechai ShalomTel Hai Academic CollegeCorreu electrònic verificat a telhai.ac.il
Ori GerstelCTO, Sedona SystemsCorreu electrònic verificat a ieee.org
Luca MoscardelliAssociate Professor, University of Chieti-Pescara, ItalyCorreu electrònic verificat a unich.it
Israel CidonJacobs Technion-Cornell Institute at Cornell TechCorreu electrònic verificat a cornell.edu
Prudence W.H. WongDepartment of Computer Science, University of LiverpoolCorreu electrònic verificat a liverpool.ac.uk
George B. MertziosAssociate Professor, Durham UniversityCorreu electrònic verificat a durham.ac.uk
Nicola SantoroDistingushed Research Professor, Carleton UniversityCorreu electrònic verificat a scs.carleton.ca
Shay KuttenProfessor, TechnionCorreu electrònic verificat a technion.ac.il
Hagit AttiyaDepartment of Computer Science, TechnionCorreu electrònic verificat a cs.technion.ac.il
Antonio Fernández AntaIMDEA Networks Institute, Madrid, SpainCorreu electrònic verificat a imdea.org
Jorge UrrutiaInstituto de Matematicas, Universidad Nacional Autonoma de MexicoCorreu electrònic verificat a matem.unam.mx
m raynalProfessor of InformaticsCorreu electrònic verificat a irisa.fr
Ching-Tsun ChouIntel CorporationCorreu electrònic verificat a intel.com
Avishai WoolProfessor of Computer Engineering, Tel Aviv UniversityCorreu electrònic verificat a eng.tau.ac.il
Tami TamirSchool of Computer Science, Reichman University (IDC Herzliya)Correu electrònic verificat a idc.ac.il
King-Shan LuiUniversity of Hong KongCorreu electrònic verificat a eee.hku.hk
Martin Farach-ColtonShustek Professor of Computer Science, New York UniversityCorreu electrònic verificat a nyu.edu
Elio SalvadoriFondazione Bruno KesslerCorreu electrònic verificat a fbk.eu
Siu-Wing ChengProfessor, Department of Computer Science and Engineering, HKUSTCorreu electrònic verificat a cse.ust.hk
Paul ErdősMathematics

Segueix

zaks shmuel

Professor, Department of Computer Science, Technion, Haifa, Israel

Correu electrònic verificat a cs.technion.ac.il

Networking Distributed Computing Discrete Mathematics Theoreticl Computer Science


Títol Ordena per cites Ordena per any Ordena per títol	Citada per Citada per	Any
Lexicographic generation of ordered trees S Zaks Theoretical Computer Science 10 (1), 63-82, 1980	272	1980
Tight lower and upper bounds for some distributed algorithms for a complete network of processors E Korach, S Moran, S Zaks Proceedings of the third annual ACM symposium on Principles of distributed …, 1984	169	1984
Enumerations of ordered trees. N Dershowitz, S Zaks Discret. Math. 31 (1), 9-28, 1980	139	1980
A combinatorial characterization of the distributed 1-solvable tasks O Biran, S Moran, S Zaks Journal of algorithms 11 (3), 420-440, 1990	117	1990
On the complexity of the regenerator placement problem in optical networks M Flammini, A Marchetti-Spaccamela, G Monaco, L Moscardelli, S Zaks IEEE/ACM Transactions on Networking (TON) 19 (2), 498-511, 2011	95	2011
The cycle lemma and some applications N Dershowitz, S Zaks Europ. J. Comb 11, 35-40, 1990	93	1990
A COMBINATORIAL CHARACTERIZATION OF THE DISTRIBUTED TASKS O Biran, S Moran, S Zaks Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed …, 1988	91*	1988
Minimizing total busy time in parallel scheduling with application to optical networks M Flammini, G Monaco, L Moscardelli, H Shachnai, M Shalom, T Tamir, ... Theoretical Computer Science 411 (40-42), 3553-3562, 2010	86	2010
A new algorithm for generation of permutations S Zaks BIT Numerical Mathematics 24 (2), 196-204, 1984	75	1984
The layout of virtual paths in ATM networks O Gerstel, I Cidon, S Zaks IEEE/ACM transactions on networking 4 (6), 873-884, 1996	73	1996
Optimal distributed algorithms for sorting and ranking S Zaks IEEE Transactions on computers 100 (4), 376-379, 1985	73	1985
The virtual path layout problem in fast networks O Gerstel, S Zaks Proceedings of the Thirteenth Annual ACM Symposium on Principles of …, 1994	70	1994
Generating trees and other combinatorial objects lexicographically S Zaks, D Richards SIAM Journal on Computing 8, 73, 1979	62	1979
Efficient elections in chordal ring networks H Attiya, J van Leeuwen, N Santoro, S Zaks Algorithmica 4 (1), 437-446, 1989	61	1989
On sets of Boolean n-vectors with all k-projections surjective AK Chandra, LT Kou, G Markowsky, S Zaks Acta Informatica 20 (1), 103-111, 1983	60	1983
Synchronizing asynchronous bounded delay networks CT Chou, I Cidon, IS Gopal, S Zaks IEEE Transactions on communications 38 (2), 144-147, 1990	59	1990
Optimal lower bounds for some distributed algorithms for a complete network of processors E Korach, S Moran, S Zaks Theoretical Computer Science 64 (1), 125-132, 1989	56	1989
Ordered trees and non-crossing partitions N Dershowitz, S Zaks Discrete mathematics 62 (2), 215-218, 1986	54	1986
The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors E Korach, S Moran, S Zaks Proceedings of the fourth annual ACM symposium on Principles of distributed …, 1985	53	1985
Optimizing busy time on parallel machines GB Mertzios, M Shalom, A Voloshin, PWH Wong, S Zaks IPDPS, 2012	52	2012

En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.

Articles 1–20

Cites per any

Cites duplicades

Cites combinades

Addició de coautorsCoautors

Segueix

Citada per

Coautors