default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGregory Kehne
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Anupam Gupta, Jinqiao Hu, Gregory Kehne, Roie Levin:
Pairwise-Independent Contention Resolution. IPCO 2024: 196-209- [c12]Anupam Gupta, Gregory Kehne, Roie Levin:
Set Covering with Our Eyes Wide Shut. SODA 2024: 4530-4553 - [i10]Shuchi Chawla, Dimitris Christou, Trung Dang, Zhiyi Huang, Gregory Kehne, Rojin Rezvan:
A Multi-Dimensional Online Contention Resolution Scheme for Revenue Maximization. CoRR abs/2404.14679 (2024) - [i9]Anupam Gupta, Jinqiao Hu, Gregory Kehne, Roie Levin:
Pairwise-Independent Contention Resolution. CoRR abs/2406.15876 (2024) - 2023
- [c11]Daniel Halpern, Gregory Kehne, Ariel D. Procaccia, Jamie Tucker-Foltz, Manuel Wüthrich:
Representation with Incomplete Votes. AAAI 2023: 5657-5664 - [c10]Yannai A. Gonczarowski, Gregory Kehne, Ariel D. Procaccia, Ben Schiffer, Shirley Zhang:
The Distortion of Binomial Voting Defies Expectation. NeurIPS 2023 - [i8]Anupam Gupta, Gregory Kehne, Roie Levin:
Set Covering with Our Eyes Wide Shut. CoRR abs/2304.02063 (2023) - [i7]Yannai A. Gonczarowski, Gregory Kehne, Ariel D. Procaccia, Ben Schiffer, Shirley Zhang:
The Distortion of Binomial Voting Defies Expectation. CoRR abs/2306.15657 (2023) - 2022
- [j3]Nicholas Hoernle
, Gregory Kehne, Ariel D. Procaccia, Kobi Gal:
The phantom steering effect in Q&A websites. Knowl. Inf. Syst. 64(2): 475-506 (2022) - [c9]Anson Kahng, Gregory Kehne:
Worst-Case Voting When the Stakes Are High. AAAI 2022: 5100-5107 - [c8]Daniel Halpern, Gregory Kehne, Jamie Tucker-Foltz:
Can Buyers Reveal for a Better Deal? IJCAI 2022: 314-320 - [c7]Soroush Ebadian, Gregory Kehne, Evi Micha, Ariel D. Procaccia, Nisarg Shah:
Is Sortition Both Representative and Fair? NeurIPS 2022 - [c6]Gregory Kehne, Ariel D. Procaccia, Jingyan Wang:
Recruitment Strategies That Take a Chance. NeurIPS 2022 - [i6]Daniel Halpern, Gregory Kehne, Ariel D. Procaccia, Jamie Tucker-Foltz, Manuel Wüthrich:
Representation with Incomplete Votes. CoRR abs/2211.15608 (2022) - 2021
- [j2]D. Ellis Hershkowitz, Gregory Kehne, R. Ravi:
An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph. Inf. Process. Lett. 167: 106067 (2021) - [c5]Daniel Halpern, Gregory Kehne, Dominik Peters, Ariel D. Procaccia, Nisarg Shah, Piotr Skowron:
Aggregating Binary Judgments Ranked by Accuracy. AAAI 2021: 5456-5463 - [c4]Anupam Gupta, Gregory Kehne, Roie Levin:
Random Order Online Set Cover is as Easy as Offline. FOCS 2021: 1253-1264 - [c3]Bailey Flanigan, Gregory Kehne, Ariel D. Procaccia:
Fair Sortition Made Transparent. NeurIPS 2021: 25720-25731 - [i5]Daniel Halpern, Gregory Kehne, Jamie Tucker-Foltz:
Can Buyers Reveal for a Better Deal? CoRR abs/2106.13882 (2021) - [i4]Anupam Gupta, Gregory Kehne, Roie Levin:
Random Order Set Cover is as Easy as Offline. CoRR abs/2111.06842 (2021) - 2020
- [j1]D. Ellis Hershkowitz, Gregory Kehne:
Reverse greedy is bad for k-center. Inf. Process. Lett. 158: 105941 (2020) - [c2]Nicholas Hoernle, Gregory Kehne, Ariel D. Procaccia, Kobi Gal:
The Phantom Steering Effect in Q&A Websites. ICDM 2020: 172-181 - [c1]Anson Kahng, Gregory Kehne, Ariel D. Procaccia:
Strategyproof Mean Estimation from Multiple-Choice Questions. ICML 2020: 5042-5052 - [i3]Nicholas Hoernle, Gregory Kehne, Ariel D. Procaccia, Kobi Gal:
The Goal-Gradient Hypothesis in Stack Overflow. CoRR abs/2002.06160 (2020) - [i2]D. Ellis Hershkowitz, Gregory Kehne, R. Ravi:
An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph. CoRR abs/2011.06108 (2020)
2010 – 2019
- 2018
- [i1]D. Ellis Hershkowitz, Gregory Kehne:
Reverse Greedy is Bad for k-Center. CoRR abs/1810.01834 (2018)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
