Superlinear Lower Bounds for Multipass Graph Processing
- Venkatesan Guruswami
- Krzysztof Onak
- 2016
- Algorithmica
Paper
Publications
8 results for Venkatesan Guruswami
Inapproximability of minimum vertex cover on k-uniform k-partite hypergraphs
- Venkatesan Guruswami
- Sushant Sachdeva
- et al.
- 2015
- SIAM Journal on Discrete Mathematics
PaperSuperlinear lower bounds for multipass graph processing
- Venkatesan Guruswami
- Krzysztof Onak
- 2013
- CCC 2013
Conference paperAgnostic learning of monomials by halfspaces is hard
- Vitaly Feldman
- Venkatesan Guruswami
- et al.
- 2012
- SIAM Journal on Computing
PaperAgnostic learning of monomials by halfspaces is hard
- Vitaly Feldman
- Venkatesan Guruswami
- et al.
- 2009
- FOCS 2009
Conference paperQuery strategies for priced information
- Moses Charikar
- Ronald Fagin
- et al.
- 2002
- Journal of Computer and System Sciences
PaperQuery strategies for priced information (extended abstract)
- Moses Charikar
- Ronald Fagin
- et al.
- 2000
- STOC 2000
Conference paperCombinatorial feature selection problems
- Moses Charikar
- Venkatesan Guruswami
- et al.
- 2000
- Annual Symposium on Foundations of Computer Science - Proceedings
Paper