The following pages link to Raghuvansh R. Saxena (Q4608023):
Displaying 14 items.
- (Q4608024) (← links)
- Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)
- Interactive error resilience beyond 2/7 (Q5144942) (← links)
- Separating the communication complexity of truthful and non-truthful combinatorial auctions (Q5144993) (← links)
- Interactive Distributed Proofs (Q5197691) (← links)
- Interactive coding over the noisy broadcast channel (Q5230314) (← links)
- Noisy Beeps (Q5855266) (← links)
- Towards multi-pass streaming lower bounds for optimal approximation of \textsf{Max-Cut} (Q6538563) (← links)
- Interactive coding with small memory (Q6538670) (← links)
- Streaming complexity of CSPs with randomly ordered constraints (Q6538690) (← links)
- Noisy radio network lower bounds via noiseless beeping lower bounds (Q6610312) (← links)
- Characterizing the multi-pass streaming complexity for solving Boolean CSPs exactly (Q6610352) (← links)
- An improved lower bound for matroid intersection prophet inequalities (Q6610368) (← links)
- Protecting single-hop radio networks from message drops (Q6638055) (← links)
