The following pages link to Joshua Brody (Q343853):
Displayed 20 items.
- Towards a reverse Newman's theorem in interactive information complexity (Q343858) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Position-based cryptography and multiparty communication complexity (Q1690188) (← links)
- Space-Efficient Approximation Scheme for Circular Earth Mover Distance (Q2894457) (← links)
- Beyond set disjointness (Q2943615) (← links)
- The Information Complexity Of Hamming Distance (Q2969639) (← links)
- Certifying Equality With Limited Interaction. (Q2969646) (← links)
- Space-bounded communication complexity (Q2986867) (← links)
- Cryptogenography (Q2988864) (← links)
- Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413) (← links)
- Streaming Algorithms with One-Sided Estimation (Q3088116) (← links)
- (Q3467513) (← links)
- Better Gap-Hamming Lower Bounds via Better Round Elimination (Q3588428) (← links)
- Functional Monitoring without Monotonicity (Q3638026) (← links)
- (Q4910715) (← links)
- (Q5091781) (← links)
- (Q5136312) (← links)
- (Q5351925) (← links)
- (Q6138074) (← links)