Rishi Saket

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Venkatesan Guruswami

> Home > Persons > Rishi Saket

Publications

2024
[i25]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2403-19401
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2403-19401
Venkatesan Guruswami, Rishi Saket:
Hardness of Learning Boolean Functions from Label Proportions. CoRR abs/2403.19401 (2024)
2023
[c37]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/fsttcs/GuruswamiS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/GuruswamiS23
Venkatesan Guruswami, Rishi Saket:
Hardness of Learning Boolean Functions from Label Proportions. FSTTCS 2023: 37:1-37:15
2017
[c26]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/fsttcs/GuruswamiS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/GuruswamiS17
Venkatesan Guruswami, Rishi Saket:
Hardness of Rainbow Coloring Hypergraphs. FSTTCS 2017: 33:33-33:15
[i15]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/GuruswamiS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/GuruswamiS17
Venkatesan Guruswami, Rishi Saket:
Hardness of Rainbow Coloring Hypergraphs. Electron. Colloquium Comput. Complex. TR17 (2017)
2016
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/talg/GuruswamiRS016
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/GuruswamiRS016
Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu:
Bypassing UGC from Some Optimal Geometric Inapproximability Results. ACM Trans. Algorithms 12(1): 6:1-6:25 (2016)
2015
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/GuruswamiSS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/GuruswamiSS15
Venkatesan Guruswami, Sushant Sachdeva, Rishi Saket:
Inapproximability of Minimum Vertex Cover on k-Uniform k-Partite Hypergraphs. SIAM J. Discret. Math. 29(1): 36-58 (2015)
2013
[i5]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/GuruswamiSS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/GuruswamiSS13
Venkatesan Guruswami, Sushant Sachdeva, Rishi Saket:
Inapproximability of Minimum Vertex Cover on k-uniform k-partite Hypergraphs. Electron. Colloquium Comput. Complex. TR13 (2013)
2012
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/GuruswamiRSW12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/GuruswamiRSW12
Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu:
Bypassing UGC from some optimal geometric inapproximability results. SODA 2012: 699-717
2010
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/GuruswamiS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/GuruswamiS10
Venkatesan Guruswami, Rishi Saket:
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs. ICALP (1) 2010: 360-371
[i2]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/GuruswamiRSW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/GuruswamiRSW10
Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu:
Bypassing UGC from some optimal geometric inapproximability results. Electron. Colloquium Comput. Complex. TR10 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.