Joel Friedman

Publication Activity (10 Years)

Years Active: 1985-2023
Publications (10 Years): 8

Top Topics

Learning Theory

Conditional Entropy

Top Venues

Publications

Nicolas Folinsbee, Joel Friedman
Generalized Riemann Functions, Their Weights, and the Complete Graph. Electron. J. Comb. 30 (2) (2023)
Joel Friedman, Amir Tootooni
Coordination and Discoordination in Linear Algebra, Linear Information Theory, and Coded Caching. CoRR (2022)
Joel Friedman, David Kohler
On the Relativized Alon Second Eigenvalue Conjecture I: Main Theorems, Examples, and Outline of Proof. CoRR (2019)
Joel Friedman, David Kohler
On the Relativized Alon Second Eigenvalue Conjecture VI: Sharp Bounds for Ramanujan Base Graphs. CoRR (2019)
Joel Friedman, David Kohler
On the Relativized Alon Eigenvalue Conjecture II: Asymptotic Expansion Theorems for Walks. CoRR (2019)
Joel Friedman, David Kohler
A Relativized Alon Second Eigenvalue Conjecture for Regular Base Graphs IV: An Improved Sidestepping Theorem. CoRR (2019)
Joel Friedman, David Kohler
On the Relativized Alon Second Eigenvalue Conjecture III: Asymptotic Expansions for Tangle-Free Hashimoto Traces. CoRR (2019)
Joel Friedman, David Kohler
On the Relativized Alon Second Eigenvalue Conjecture V: Proof of the Relativized Alon Conjecture for Regular Base Graphs. CoRR (2019)
Joel Friedman, David-Emmanuel Kohler
The Relativized Second Eigenvalue Conjecture of Alon. CoRR (2014)
Joel Friedman
Linear Transformations in Boolean Complexity Theory. CiE (2007)
Robert St-Aubin, Joel Friedman, Alan K. Mackworth
A Formal Mathematical Framework for Modeling Probabilistic Hybrid Systems. AI&M (2006)
Robert St-Aubin, Joel Friedman, Alan K. Mackworth
A formal mathematical framework for modeling probabilistic hybrid systems. Ann. Math. Artif. Intell. 47 (3-4) (2006)
Joel Friedman
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example CoRR (2006)
Joel Friedman, Ram Murty, Jean-Pierre Tillich
Spectral estimates for Abelian Cayley graphs. J. Comb. Theory, Ser. B 96 (1) (2006)
Joel Friedman, Andreas Goerdt, Michael Krivelevich
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. SIAM J. Comput. 35 (2) (2005)
Joel Friedman, Jean-Pierre Tillich
Generalized Alon--Boppana Theorems and Error-Correcting Codes. SIAM J. Discret. Math. 19 (3) (2005)
Joel Friedman
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity CoRR (2005)
Joel Friedman, Jean-Pierre Tillich
Calculus on Graphs CoRR (2004)
Joel Friedman
A proof of Alon's second eigenvalue conjecture and related problems CoRR (2004)
Joel Friedman
A proof of Alon's second eigenvalue conjecture. STOC (2003)
Jeyashankher Ramamirtham, Jonathan S. Turner, Joel Friedman
Design of wavelength converting switches for optical burst switching. IEEE J. Sel. Areas Commun. 21 (7) (2003)
Joel Friedman, Andreas Goerdt
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently. ICALP (2001)
Joel Friedman
On Cayley Graphs on the Symmetric Group Generated by Tranpositions. Comb. 20 (4) (2000)
Joel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich
The action of a few permutations on r-tuples is quickly transitive. Random Struct. Algorithms 12 (4) (1998)
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. STACS (1996)
Joel Friedman
Computing Betti Numbers via Combinatorial Laplacians. STOC (1996)
Joel Friedman
Some Graphs with Small Second Eigenvalue. Comb. 15 (1) (1995)
Joel Friedman, Avi Wigderson
On the Second Eigenvalue of Hypergraphs. Comb. 15 (1) (1995)
Bernard Chazelle, Joel Friedman
Point Location Among Hyperplanes and Unidirectional Ray-shooting. Comput. Geom. 4 (1994)
Joel Friedman, Nathan Linial
On Convex Body Chasing. Discret. Comput. Geom. 9 (1993)
Joel Friedman
A note on matrix rigidity. Comb. 13 (2) (1993)
Joel Friedman
A Note on Poset Geometries. SIAM J. Comput. 22 (1) (1993)
Joel Friedman
On the Bit Extraction Problem FOCS (1992)
Joel Friedman
The Spectra of Infinite Hypertrees. SIAM J. Comput. 20 (5) (1991)
Joel Friedman
On the second eigenvalue and random walks n random d-regular graphs. Comb. 11 (4) (1991)
Bernard Chazelle, Joel Friedman
A deterministic view of random sampling and its use in geometry. Comb. 10 (3) (1990)
Joel Friedman
Random Polynomials and Approximate Zeros of Newton's Method. SIAM J. Comput. 19 (6) (1990)
Joel Friedman
A Density Theorem for Purely Iterative Zero Finding Methods. SIAM J. Comput. 19 (1) (1990)
Joel Friedman
On the convergence of newton's method. J. Complex. 5 (1) (1989)
Joel Friedman, Jeff Kahn, Endre Szemerédi
On the Second Eigenvalue in Random Regular Graphs STOC (1989)
Bernard Chazelle, Joel Friedman
A Deterministic View of Random Sampling and its Use in Geometry FOCS (1988)
Joel Friedman
A lower bound on strictly non-block networks. Comb. 8 (2) (1988)
Paul Feldman, Joel Friedman, Nicholas Pippenger
Wide-Sense Nonblocking Networks. SIAM J. Discret. Math. 1 (2) (1988)
Joel Friedman, Nicholas Pippenger
Expanding graphs contain all small trees. Comb. 7 (1) (1987)
Joel Friedman
Constructing O(n log n) Size Monotone Formulae for the k-th Threshold Function of n Boolean Variables. SIAM J. Comput. 15 (3) (1986)
Joel Friedman
On Newton's Method for Polynomials FOCS (1986)
Paul Feldman, Joel Friedman, Nicholas Pippenger
Non-Blocking Networks (Preliminary Version) STOC (1986)
Roy L. Adler, Joel Friedman, Bruce Kitchens, Brian H. Marcus
State splitting for variable-length graphs. IEEE Trans. Inf. Theory 32 (1) (1986)
Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, Roman Smolensky
The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) FOCS (1985)