The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joel Friedman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bernard Chazelle, Joel Friedman
    A Deterministic View of Random Sampling and its Use in Geometry [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:539-549 [Conf]
  2. Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, Roman Smolensky
    The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:396-407 [Conf]
  3. Joel Friedman
    On Newton's Method for Polynomials [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:153-161 [Conf]
  4. Joel Friedman
    On the Bit Extraction Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:314-319 [Conf]
  5. Joel Friedman, Andreas Goerdt
    Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:310-321 [Conf]
  6. Joel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich
    The Action of a Few Random Permutations on r-Tuples and an Application to Cryptography. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:375-386 [Conf]
  7. Paul Feldman, Joel Friedman, Nicholas Pippenger
    Non-Blocking Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:247-254 [Conf]
  8. Joel Friedman
    A proof of Alon's second eigenvalue conjecture. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:720-724 [Conf]
  9. Joel Friedman
    Computing Betti Numbers via Combinatorial Laplacians. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:386-391 [Conf]
  10. Joel Friedman, Jeff Kahn, Endre Szemerédi
    On the Second Eigenvalue in Random Regular Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:587-598 [Conf]
  11. Bernard Chazelle, Joel Friedman
    A deterministic view of random sampling and its use in geometry. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:3, pp:229-249 [Journal]
  12. Joel Friedman
    On Cayley Graphs on the Symmetric Group Generated by Tranpositions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:4, pp:505-519 [Journal]
  13. Joel Friedman
    A lower bound on strictly non-block networks. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:2, pp:185-188 [Journal]
  14. Joel Friedman
    On the second eigenvalue and random walks n random d-regular graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:4, pp:331-362 [Journal]
  15. Joel Friedman
    A note on matrix rigidity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:2, pp:235-239 [Journal]
  16. Joel Friedman
    Some Graphs with Small Second Eigenvalue. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:1, pp:31-42 [Journal]
  17. Joel Friedman, Nicholas Pippenger
    Expanding graphs contain all small trees. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:1, pp:71-76 [Journal]
  18. Joel Friedman, Avi Wigderson
    On the Second Eigenvalue of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:1, pp:43-65 [Journal]
  19. Bernard Chazelle, Joel Friedman
    Point Location Among Hyperplanes and Unidirectional Ray-shooting. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1994, v:4, n:, pp:53-62 [Journal]
  20. Joel Friedman
    A proof of Alon's second eigenvalue conjecture and related problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  21. Joel Friedman, Jean-Pierre Tillich
    Calculus on Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  22. Joel Friedman, Nathan Linial
    On Convex Body Chasing. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:293-321 [Journal]
  23. Joel Friedman
    On the convergence of newton's method. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1989, v:5, n:1, pp:12-33 [Journal]
  24. Joel Friedman, Ram Murty, Jean-Pierre Tillich
    Spectral estimates for Abelian Cayley graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:1, pp:111-121 [Journal]
  25. Joel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich
    The action of a few permutations on r-tuples is quickly transitive. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:4, pp:335-350 [Journal]
  26. Joel Friedman
    Constructing O(n log n) Size Monotone Formulae for the k-th Threshold Function of n Boolean Variables. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:641-654 [Journal]
  27. Joel Friedman
    A Density Theorem for Purely Iterative Zero Finding Methods. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:1, pp:124-132 [Journal]
  28. Joel Friedman
    Random Polynomials and Approximate Zeros of Newton's Method. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:6, pp:1068-1099 [Journal]
  29. Joel Friedman
    The Spectra of Infinite Hypertrees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:5, pp:951-961 [Journal]
  30. Joel Friedman
    A Note on Poset Geometries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:72-78 [Journal]
  31. Joel Friedman, Andreas Goerdt, Michael Krivelevich
    Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:408-430 [Journal]
  32. Paul Feldman, Joel Friedman, Nicholas Pippenger
    Wide-Sense Nonblocking Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:2, pp:158-173 [Journal]
  33. Joel Friedman, Jean-Pierre Tillich
    Generalized Alon--Boppana Theorems and Error-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:3, pp:700-718 [Journal]
  34. Roy L. Adler, Joel Friedman, Bruce Kitchens, Brian H. Marcus
    State splitting for variable-length graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:1, pp:108-0 [Journal]
  35. Joel Friedman
    Linear Transformations in Boolean Complexity Theory. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:307-315 [Conf]
  36. Robert St-Aubin, Joel Friedman, Alan K. Mackworth
    A formal mathematical framework for modeling probabilistic hybrid systems. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2006, v:47, n:3-4, pp:397-425 [Journal]
  37. Joel Friedman
    Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  38. Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
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