The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ehud Friedgut: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi
    Büchi Complementation Made Tighter. [Citation Graph (0, 0)][DBLP]
    ATVA, 2004, pp:64-78 [Conf]
  2. Ehud Friedgut, Jeff Kahn, Avi Wigderson
    Computing Graph Properties by Randomized Subcube Partitions. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:105-113 [Conf]
  3. Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell
    On the fourier tails of bounded functions over the discrete cube. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:437-446 [Conf]
  4. Ehud Friedgut
    Boolean Functions With Low Average Sensitivity Depend On Few Coordinates. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:1, pp:27-35 [Journal]
  5. Ehud Friedgut
    Influences in Product Spaces: KKL and BKKKL Revisited. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:1, pp:17-29 [Journal]
  6. Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali
    Ramsey Games Against a One-Armed Bandit. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:515-545 [Journal]
  7. Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi
    Büchi Complementation Made Tighter. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:4, pp:851-868 [Journal]
  8. Noga Alon, Ehud Friedgut
    On the Number of Permutations Avoiding a Given Pattern. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:89, n:1, pp:133-140 [Journal]
  9. Ehud Friedgut
    A Katona-type proof of an Erdos-Ko-Rado-type theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2005, v:111, n:2, pp:239-244 [Journal]
  10. Dimitris Achlioptas, Ehud Friedgut
    A Sharp Threshold for k-Colorability. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:1, pp:63-70 [Journal]
  11. Ehud Friedgut
    Hunting for sharp thresholds. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:1-2, pp:37-51 [Journal]
  12. Ehud Friedgut, Michael Krivelevich
    Sharp thresholds for certain Ramsey properties of random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:1, pp:1-19 [Journal]

  13. Elections Can be Manipulated Often. [Citation Graph (, )][DBLP]


  14. On the measure of intersecting families, uniqueness and stability. [Citation Graph (, )][DBLP]


  15. Proof of an Intersection Theorem via Graph Homomorphisms. [Citation Graph (, )][DBLP]


  16. Intersecting Families are Essentially Contained in Juntas. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002