The following pages link to Luisa Gargano (Q392207):
Displaying 50 items.
- (Q198226) (redirect page) (← links)
- Optimal time data gathering in wireless networks with multidirectional antennas (Q392209) (← links)
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- Strong conflict-free coloring for intervals (Q487034) (← links)
- On the information rate of secret sharing schemes (Q672750) (← links)
- Low-weight superimposed codes and their applications (Q777294) (← links)
- Decoders with initial state invariance for multivalued encodings (Q807590) (← links)
- Degree-optimal routing for P2P systems (Q841622) (← links)
- Collision-free path coloring with application to minimum-delay gathering in sensor networks (Q1026148) (← links)
- Navigable small-world networks with few random bits (Q1034617) (← links)
- A note on submodular set cover on matroids (Q1045066) (← links)
- Efficient \(q\)-ary immutable codes (Q1180148) (← links)
- Search problems for two irregular coins with incomplete feedback: The underweight model (Q1192952) (← links)
- An improved algorithm for quantitative group testing (Q1193729) (← links)
- Qualitative independence and Sperner problems for directed graphs (Q1199993) (← links)
- Group testing with unreliable tests (Q1269106) (← links)
- Optimal sequential gossiping by short messages (Q1270817) (← links)
- Liveness in timed and untimed systems (Q1271471) (← links)
- Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- On the size of shares for secret sharing schemes (Q1310452) (← links)
- Different capacities of a digraph (Q1334937) (← links)
- Capacities: From information theory to extremal set theory (Q1337171) (← links)
- Reliable broadcasting (Q1339885) (← links)
- A fast algorithm for the unique decipherability of multivalued encodings (Q1341741) (← links)
- Communication complexity of gossiping by packets (Q1373799) (← links)
- Minimum time broadcast in faulty star networks (Q1392530) (← links)
- Efficient collective communciation in optical networks (Q1575944) (← links)
- Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
- On \(k\)-strong conflict-free multicoloring (Q1708616) (← links)
- Time-bounded influence diffusion with incentives (Q1713919) (← links)
- Active influence spreading in social networks (Q1731507) (← links)
- On searching strategies, parallel questions, and delayed answers (Q1765232) (← links)
- On the capacity of Boolean graph formulæ (Q1805371) (← links)
- Spanning spiders and light-splitting switches (Q1877652) (← links)
- Optimal detection of a counterfeit coin with multi-arms balances (Q1897358) (← links)
- Spider covers and their applications (Q1935978) (← links)
- Dual domination problems in graphs (Q2136849) (← links)
- Parameterized complexity of immunization in the threshold model (Q2154106) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- Whom to befriend to influence people (Q2292915) (← links)
- Fast and frugal targeting with incentives (Q2297851) (← links)
- Dual Domination (Q2301742) (← links)
- Influence diffusion in social networks under time window constraints (Q2345457) (← links)
- Spread of influence in weighted networks under time and budget constraints (Q2347001) (← links)
- Fault tolerant routing in the star and pancake interconnection networks (Q2365821) (← links)
- Sperner capacities (Q2366215) (← links)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- Efficient communication in unknown networks (Q2747804) (← links)
