The following pages link to Emanuele G. Fusco (Q259075):
Displaying 23 items.
- Topology recognition with advice (Q259077) (← links)
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- Resilient dynamic programming (Q513272) (← links)
- Trade-offs between the size of advice and broadcasting time in trees (Q547287) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- Acknowledged broadcasting in ad hoc radio networks (Q975548) (← links)
- \(L(h,1,1)\)-labeling of outerplanar graphs (Q1014311) (← links)
- Broadcasting in UDG radio networks with missing and inaccurate information (Q2377136) (← links)
- Communication complexity of consensus in anonymous message passing systems (Q2805428) (← links)
- Clique counting in MapReduce: algorithms and experiments (Q2828209) (← links)
- Dynamic programming in faulty memory hierarchies (cache-obliviously) (Q2911644) (← links)
- Local dependency dynamic programming in the presence of memory faults (Q3113671) (← links)
- Broadcasting in UDG Radio Networks with Missing and Inaccurate Information (Q3540235) (← links)
- Distributed Tree Comparison with Nodes of Limited Memory (Q3569122) (← links)
- How Much Memory Is Needed for Leader Election (Q3588307) (← links)
- A Bijective Code for k-Trees with Linear Time Encoding and Decoding (Q3611931) (← links)
- L(h,1,1)-Labeling of Outerplanar Graphs (Q3613657) (← links)
- Distributed tree comparison with nodes of limited memory (Q5326772) (← links)
- Learning a Ring Cheaply and Fast (Q5327465) (← links)
- On the number of labeled \(k\)-arch graphs (Q5387517) (← links)
- Spanning Trees with Many Leaves in Regular Bipartite Graphs (Q5387825) (← links)
- Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers (Q5425971) (← links)
