default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteven Heilman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Steven Heilman
, Alex Tarter:
Dimension-Free Noninteractive Simulation From Gaussian Sources. IEEE Trans. Inf. Theory 70(8): 5516-5532 (2024)- 2023
- [i16]Steven Heilman:
Three Candidate Plurality is Stablest for Correlations at most 1/11. CoRR abs/2306.03312 (2023) - [i15]Steven Heilman:
Optimizing Sphere Valued Gaussian Noise Stability. CoRR abs/2306.03912 (2023) - 2022
- [j3]Steven Heilman:
Tree/Endofunction Bijections and Concentration Inequalities. Electron. J. Comb. 29(2) (2022) - [i14]Steven Heilman, Alex Tarter:
Dimension-Free Noninteractive Simulation from Gaussian Sources. CoRR abs/2202.09309 (2022) - [i13]Steven Heilman:
Noise Stability of Ranked Choice Voting. CoRR abs/2209.11183 (2022) - [i12]Steven Heilman:
Hyperstable Sets with Voting and Algorithmic Hardness Applications. CoRR abs/2209.11216 (2022) - 2020
- [j2]Steven Heilman:
A periodic isoperimetric problem related to the unique games conjecture. Random Struct. Algorithms 56(1): 154-168 (2020) - [i11]Steven Heilman:
Independent Sets of Random Trees and of Sparse Random Graphs. CoRR abs/2006.04756 (2020) - [i10]Steven Heilman:
Designing Stable Elections: A Survey. CoRR abs/2006.05460 (2020) - [i9]Steven Heilman, Alex Tarter:
Three Candidate Plurality is Stablest for Small Correlations. CoRR abs/2011.05583 (2020)
2010 – 2019
- 2017
- [i8]Steven Heilman:
Symmetric Convex Sets with Minimal Gaussian Surface Area. CoRR abs/1705.06643 (2017) - [i7]Steven Heilman:
A Periodic Isoperimetric Problem Related to the Unique Games Conjecture. CoRR abs/1708.00917 (2017) - 2016
- [i6]Steven Heilman, Thomas Vidick:
A Moment Majorization principle for random matrix ensembles with applications to hardness of the noncommutative Grothendieck problem. CoRR abs/1603.05620 (2016) - 2015
- [c2]Steven Heilman, Elchanan Mossel, Joe Neeman:
Standard Simplices and Pluralities are Not the Most Noise Stable. ITCS 2015: 255 - [i5]Steven Heilman:
Low Correlation Noise Stability of Symmetric Sets. CoRR abs/1511.00382 (2015) - 2014
- [i4]Steven Heilman, Elchanan Mossel, Joe Neeman:
Standard Simplices and Pluralities are Not the Most Noise Stable. CoRR abs/1403.0885 (2014) - [i3]Steven Heilman, Elchanan Mossel, Krzysztof Oleszkiewicz:
Strong Contraction and Influences in Tail Spaces. CoRR abs/1406.7855 (2014) - 2013
- [j1]Steven Heilman, Aukosh Jagannath, Assaf Naor:
Solution of the Propeller Conjecture in ℝ3. Discret. Comput. Geom. 50(2): 263-305 (2013) - 2012
- [c1]Steven Heilman, Aukosh Jagannath, Assaf Naor:
Solution of the propeller conjecture in R3. STOC 2012: 269-276 - [i2]Steven Heilman:
Euclidean Partitions Optimizing Noise Stability. CoRR abs/1211.7138 (2012) - 2011
- [i1]Steven Heilman, Aukosh Jagannath, Assaf Naor:
Solution of the propeller conjecture in $\R^3$. CoRR abs/1112.2993 (2011)
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-08-03 21:17 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:
