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