default search action
Ehud Friedgut
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j23]Noga Alon, Ehud Friedgut, Gil Kalai, Guy Kindler
:
The Success Probability in Levine's Hat Problem, and Independent Sets in Graphs. SIAM J. Discret. Math. 37(4): 2717-2729 (2023)
2010 – 2019
- 2018
- [j22]Ehud Friedgut, Jeff Kahn, Gil Kalai, Nathan Keller
Chvátal's conjecture and correlation inequalities. J. Comb. Theory A 156: 22-43 (2018) - 2016
- [j21]Itai Benjamini, David Ellis, Ehud Friedgut, Nathan Keller, Arnab Sen:
Juntas in the ℓ1-grid and Lipschitz maps between discrete tori. Random Struct. Algorithms 49(2): 253-279 (2016) - 2015
- [j20]David Ellis
A quasi-stability result for dictatorships in S n. Comb. 35(5): 573-618 (2015) - [j19]Ehud Friedgut, Jeff Kahn, Clara Shikhelman:
Thresholds and Expectation-Thresholds of Monotone Properties with Small Minterms. Electron. J. Comb. 22(2): 2 (2015) - [j18]David Ellis, Yuval Filmus, Ehud Friedgut:
A stability result for balanced dictatorships in Sn. Random Struct. Algorithms 46(3): 494-530 (2015) - [i4]David Ellis, Ehud Friedgut, Guy Kindler, Amir Yehudayoff:
Geometric stability via information theory. CoRR abs/1510.00258 (2015) - 2013
- [j17]Yannai A. Gonczarowski, Ehud Friedgut:
Sisterhood in the Gale-Shapley Matching Algorithm. Electron. J. Comb. 20(2): 12 (2013) - 2012
- [i3]Dvir Falik, Ehud Friedgut:
Between Arrow and Gibbard-Satterthwaite; A representation theoretic approach. CoRR abs/1203.3368 (2012) - 2011
- [j16]Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan:
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. SIAM J. Comput. 40(3): 934-952 (2011) - [c5]Dvir Falik, Ehud Friedgut:
An Algebraic Proof of a Robust Social Choice Impossibility Theorem. FOCS 2011: 413-422 - [i2]Yannai A. Gonczarowski, Ehud Friedgut:
On Sisterhood in the Gale-Shapley Matching Algorithm. CoRR abs/1104.2217 (2011) - [i1]Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan:
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. CoRR abs/1105.5129 (2011) - 2010
- [j15]Ehud Friedgut, Vojtech Rödl, Mathias Schacht
Ramsey properties of random discrete structures. Random Struct. Algorithms 37(4): 407-436 (2010)
2000 – 2009
- 2009
- [j14]Irit Dinur
Intersecting Families are Essentially Contained in Juntas. Comb. Probab. Comput. 18(1-2): 107-122 (2009) - 2008
- [j13]Ehud Friedgut:
On the measure of intersecting families, uniqueness and stability. Comb. 28(5): 503-528 (2008) - [c4]Ehud Friedgut, Gil Kalai, Noam Nisan
Elections Can be Manipulated Often. FOCS 2008: 243-249 - 2006
- [b1]Ehud Friedgut, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali:
A sharp threshold for random graphs with a monochromatic triangle in every edge coloring. Memoirs of the American Mathematical Society 845, American Mathematical Society 2006, ISBN 978-0-8218-3825-9, pp. 1-66 - [j12]Irit Dinur
Proof of an Intersection Theorem via Graph Homomorphisms. Electron. J. Comb. 13(1) (2006) - [j11]Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi:
Büchi Complementation Made Tighter. Int. J. Found. Comput. Sci. 17(4): 851-868 (2006) - [c3]Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell:
On the fourier tails of bounded functions over the discrete cube. STOC 2006: 437-446 - 2005
- [j10]Ehud Friedgut:
A Katona-type proof of an Erdos-Ko-Rado-type theorem. J. Comb. Theory A 111(2): 239-244 (2005) - [j9]Ehud Friedgut:
Hunting for sharp thresholds. Random Struct. Algorithms 26(1-2): 37-51 (2005) - 2004
- [j8]Ehud Friedgut:
Influences in Product Spaces: KKL and BKKKL Revisited. Comb. Probab. Comput. 13(1): 17-29 (2004) - [j7]Ehud Friedgut:
Hypergraphs, Entropy, and Inequalities. Am. Math. Mon. 111(9): 749-760 (2004) - [c2]Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi:
Büchi Complementation Made Tighter. ATVA 2004: 64-78 - 2003
- [j6]Ehud Friedgut, Yoshiharu Kohayakawa
Ramsey Games Against a One-Armed Bandit. Comb. Probab. Comput. 12(5-6): 515-545 (2003) - 2002
- [j5]Ehud Friedgut, Gil Kalai, Assaf Naor:
Boolean functions whose Fourier transform is concentrated on the first two levels. Adv. Appl. Math. 29(3): 427-437 (2002) - [c1]Ehud Friedgut, Jeff Kahn, Avi Wigderson:
Computing Graph Properties by Randomized Subcube Partitions. RANDOM 2002: 105-113 - 2000
- [j4]Noga Alon, Ehud Friedgut:
On the Number of Permutations Avoiding a Given Pattern. J. Comb. Theory A 89(1): 133-140 (2000) - [j3]Ehud Friedgut, Michael Krivelevich:
Sharp thresholds for certain Ramsey properties of random graphs. Random Struct. Algorithms 17(1): 1-19 (2000)
1990 – 1999
- 1999
- [j2]Dimitris Achlioptas, Ehud Friedgut:
A Sharp Threshold for k-Colorability. Random Struct. Algorithms 14(1): 63-70 (1999) - 1998
- [j1]Ehud Friedgut:
Boolean Functions With Low Average Sensitivity Depend On Few Coordinates. Comb. 18(1): 27-35 (1998)
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-06-10 20:29 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: