default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJamie Tucker-Foltz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Jamie Tucker-Foltz:
Inapproximability of Unique Games in Fixed-Point Logic with Counting. Log. Methods Comput. Sci. 20(2) (2024)- [c14]José Correa, Paul Gölz, Ulrike Schmidt-Kraepelin
, Jamie Tucker-Foltz, Victor Verdugo:
Monotone Randomized Apportionment. EC 2024: 71 - [c13]Daniel Halpern, Safwan Hossain, Jamie Tucker-Foltz:
Computing Voting Rules with Elicited Incomplete Votes. EC 2024: 941-963 - [c12]Ariel D. Procaccia, Isaac Robinson, Jamie Tucker-Foltz:
School Redistricting: Wiping Unfairness Off the Map. SODA 2024: 2704-2724 - [c11]Sarah Cannon, Wesley Pegden, Jamie Tucker-Foltz:
Sampling Balanced Forests of Grids in Polynomial Time. STOC 2024: 1676-1687 - [i17]Daniel Halpern, Safwan Hossain, Jamie Tucker-Foltz:
Computing Voting Rules with Elicited Incomplete Votes. CoRR abs/2402.11104 (2024) - [i16]José Correa, Paul Gölz, Ulrike Schmidt-Kraepelin, Jamie Tucker-Foltz, Victor Verdugo:
Monotone Randomized Apportionment. CoRR abs/2405.03687 (2024) - [i15]Eric Babson, Moon Duchin, Annina Iseli, Pietro Poggi-Corradini, Dylan Thurston, Jamie Tucker-Foltz:
Models of random spanning trees. CoRR abs/2407.20226 (2024) - 2023
- [j1]Jamie Tucker-Foltz:
Thou shalt covet the average of thy neighbors' cakes. Inf. Process. Lett. 180: 106341 (2023) - [c10]Daniel Halpern, Gregory Kehne, Ariel D. Procaccia, Jamie Tucker-Foltz, Manuel Wüthrich:
Representation with Incomplete Votes. AAAI 2023: 5657-5664 - [c9]Jack Stade, Jamie Tucker-Foltz:
Topological Universality of the Art Gallery Problem. SoCG 2023: 58:1-58:13 - [c8]Jan Dreier, Jamie Tucker-Foltz:
Pseudorandom Finite Models. LICS 2023: 1-13 - [c7]Gerdus Benade, Ariel D. Procaccia, Jamie Tucker-Foltz:
You Can Have Your Cake and Redistrict It Too. EC 2023: 270 - [c6]Jamie Tucker-Foltz, Richard J. Zeckhauser:
Playing Divide-and-Choose Given Uncertain Preferences. EC 2023: 1127 - [i14]Jan Dreier, Jamie Tucker-Foltz:
Pseudorandom Finite Models. CoRR abs/2304.12109 (2023) - [i13]Gerdus Benadè, Ariel D. Procaccia, Jamie Tucker-Foltz:
You Can Have Your Cake and Redistrict It Too. CoRR abs/2305.12079 (2023) - [i12]Jamie Tucker-Foltz:
Locked Polyomino Tilings. CoRR abs/2307.15996 (2023) - [i11]Sarah Cannon, Wesley Pegden, Jamie Tucker-Foltz:
Sampling Balanced Forests of Grids in Polynomial Time. CoRR abs/2310.15152 (2023) - 2022
- [c5]Daniel Halpern, Gregory Kehne, Jamie Tucker-Foltz:
Can Buyers Reveal for a Better Deal? IJCAI 2022: 314-320 - [c4]Ariel D. Procaccia, Jamie Tucker-Foltz:
Compact Redistricting Plans Have Many Spanning Trees. SODA 2022: 3754-3771 - [i10]Jack Stade, Jamie Tucker-Foltz:
Topological Universality of the Art Gallery Problem. CoRR abs/2202.11076 (2022) - [i9]Jamie Tucker-Foltz, Richard Zeckhauser:
Playing Divide-and-Choose Given Uncertain Preferences. CoRR abs/2207.03076 (2022) - [i8]Daniel Halpern, Gregory Kehne, Ariel D. Procaccia, Jamie Tucker-Foltz, Manuel Wüthrich:
Representation with Incomplete Votes. CoRR abs/2211.15608 (2022) - 2021
- [c3]Jamie Tucker-Foltz:
Inapproximability of Unique Games in Fixed-Point Logic with Counting. LICS 2021: 1-13 - [i7]Jamie Tucker-Foltz:
Inapproximability of Unique Games in Fixed-Point Logic with Counting. CoRR abs/2104.04566 (2021) - [i6]Jamie Tucker-Foltz:
Thou Shalt Covet The Average Of Thy Neighbors' Cakes. CoRR abs/2106.11178 (2021) - [i5]Daniel Halpern, Gregory Kehne, Jamie Tucker-Foltz:
Can Buyers Reveal for a Better Deal? CoRR abs/2106.13882 (2021) - [i4]Ariel D. Procaccia, Jamie Tucker-Foltz:
Compact Redistricting Plans Have Many Spanning Trees. CoRR abs/2109.13394 (2021) - 2020
- [c2]Tal Alon, Magdalen Dobson, Ariel D. Procaccia, Inbal Talgam-Cohen, Jamie Tucker-Foltz:
Multiagent Evaluation Mechanisms. AAAI 2020: 1774-1781 - [i3]Jamie Tucker-Foltz:
Approximating Constraint Satisfaction Problems Symmetrically. CoRR abs/2008.03115 (2020)
2010 – 2019
- 2018
- [c1]Joshua A. Grochow, Jamie Tucker-Foltz:
Computational Topology and the Unique Games Conjecture. SoCG 2018: 43:1-43:16 - [i2]Jamie Tucker-Foltz:
A Cut-And-Choose Mechanism to Prevent Gerrymandering. CoRR abs/1802.08351 (2018) - [i1]Joshua A. Grochow, Jamie Tucker-Foltz:
Computational topology and the Unique Games Conjecture. CoRR abs/1803.06800 (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-12-23 20:28 CET 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:
