The following pages link to Luisa Gargano (Q392207):
Displaying 50 items.
- (Q2766680) (← links)
- Evangelism in Social Networks (Q2819494) (← links)
- Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
- Multi-level dynamo and opinion spreading (Q2971065) (← links)
- (Q3033705) (← links)
- Optimizing Spread of Influence in Social Networks via Partial Incentives (Q3460711) (← links)
- A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks (Q3467846) (← links)
- An efficient algorithm for testing immutability of variable-length codes (Q3472051) (← links)
- (Q3491466) (← links)
- Gathering with Minimum Delay in Tree Sensor Networks (Q3511404) (← links)
- A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes (Q3548066) (← links)
- F-Chord: Improved uniform routing on Chord (Q3548733) (← links)
- On the characterization of statistically synchronizable variable-length codes (Q3804619) (← links)
- On the construction of minimal broadcast networks (Q3832298) (← links)
- Encoding, synchronization and randomization of source messages (Q3985385) (← links)
- On the construction of statistically synchronizable codes (Q3990775) (← links)
- Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults (Q4012443) (← links)
- Tighter time bounds on fault-tolerant broadcasting and gossiping (Q4014613) (← links)
- (Q4035710) (← links)
- Fast Gossiping by Short Messages (Q4210076) (← links)
- (Q4218414) (← links)
- Fast collective communication by packets in the postal model (Q4260013) (← links)
- (Q4318691) (← links)
- (Q4348003) (← links)
- (Q4449221) (← links)
- Coloring all directed paths in a symmetric tree, with an application to optical networks (Q4539866) (← links)
- Bounds on the Entropy of a Function of a Random Variable and Their Applications (Q4569176) (← links)
- Colouring paths in directed symmetric trees with applications to WDM routing (Q4571981) (← links)
- Evangelism in social networks: Algorithms and complexity (Q4584867) (← links)
- Fast gossiping by short messages (Q4645173) (← links)
- (Q4694740) (← links)
- Efficient generation of fair dice with few biased coins (Q4701418) (← links)
- (Q4737170) (← links)
- (Q4818867) (← links)
- (Q4858441) (← links)
- (Q4858451) (← links)
- Strong Conflict-Free Coloring for Intervals (Q4909516) (← links)
- (Q4946041) (← links)
- (Q4950446) (← links)
- (Q4954414) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- Space-Optimal Proportion Consensus with Population Protocols (Q5045452) (← links)
- Communication complexity of gossiping by packets (Q5054816) (← links)
- Concurrent multicast in weighted networks (Q5054855) (← links)
- Minimum Weight Dynamo and Fast Opinion Spreading (Q5200512) (← links)
- Minimum-Entropy Couplings and Their Applications (Q5224007) (← links)
- Fault—tolerant hypercube broadcasting via information dispersal (Q5289370) (← links)
- Structural Information and Communication Complexity (Q5315245) (← links)
- Latency-Bounded Target Set Selection in Social Networks (Q5326360) (← links)
- Brief Announcement (Q5361967) (← links)
