Sciweavers

277 search results - page 21 / 56
» Israel
Sort
View
IPPS
1998
IEEE
13 years 12 months ago
Measuring the Vulnerability of Interconnection Networks in Embedded Systems
Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for des...
Vijay Lakamraju, Zahava Koren, Israel Koren, C. Ma...
WDAG
1998
Springer
123views Algorithms» more  WDAG 1998»
13 years 12 months ago
Propagation and Leader Election in a Multihop Broadcast Environment
The paper addresses the problemof solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader El...
Israel Cidon, Osnat Mokryn
FIWAC
1993
152views Cryptology» more  FIWAC 1993»
13 years 11 months ago
Disjoint Systems (Extended Abstract)
Systems (Extended Abstract) Noga Alon ∗ Benny Sudakov Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel A dis...
Noga Alon, Benny Sudakov
DGCI
2006
Springer
13 years 11 months ago
On Minimal Perimeter Polyminoes
This paper explores proofs of the isoperimetric inequality for 4-connected shapes on the integer grid Z2 , and its geometric meaning. Pictorially, we discuss ways to place a maxima...
Yaniv Altshuler, Vladimir Yanovski, Daniel Vainsen...
FOCS
1991
IEEE
13 years 11 months ago
A parallel algorithmic version of the Local Lemma
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
Noga Alon