The following pages link to Varsha Dani (Q1641018):
Displaying 12 items.
- Interactive communication with unknown noise rate (Q1641020) (← links)
- Scalable mechanisms for rational secret sharing (Q2355325) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- The Power of Choice for Random Satisfiability (Q2851879) (← links)
- Scalable rational secret sharing (Q2943397) (← links)
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem (Q2953697) (← links)
- Independent Sets in Random Graphs from the Weighted Second Moment Method (Q3088119) (← links)
- Tight Bounds on the Threshold for Permuted k-Colorability (Q3167422) (← links)
- Phase transitions in the<i>q</i>-coloring of random hypergraphs (Q4602761) (← links)
- (Q6083382) (← links)
- On the Power of Choice for k-Colorability of Random Graphs. (Q6090917) (← links)
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks (Q6096038) (← links)
