Joel Friedman

According to our database, Joel Friedman authored at least 48 papers between 1985 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Generalized Riemann Functions, Their Weights, and the Complete Graph.

Nicolas Folinsbee, Joel Friedman

Electron. J. Comb., 2023

2022

Coordination and Discoordination in Linear Algebra, Linear Information Theory, and Coded Caching.

Joel Friedman, Amir Tootooni

CoRR, 2022

2019

On the Relativized Alon Second Eigenvalue Conjecture V: Proof of the Relativized Alon Conjecture for Regular Base Graphs.

Joel Friedman, David Kohler

CoRR, 2019

On the Relativized Alon Second Eigenvalue Conjecture VI: Sharp Bounds for Ramanujan Base Graphs.

Joel Friedman, David Kohler

CoRR, 2019

A Relativized Alon Second Eigenvalue Conjecture for Regular Base Graphs IV: An Improved Sidestepping Theorem.

Joel Friedman, David Kohler

CoRR, 2019

On the Relativized Alon Second Eigenvalue Conjecture III: Asymptotic Expansions for Tangle-Free Hashimoto Traces.

Joel Friedman, David Kohler

CoRR, 2019

On the Relativized Alon Eigenvalue Conjecture II: Asymptotic Expansion Theorems for Walks.

Joel Friedman, David Kohler

CoRR, 2019

On the Relativized Alon Second Eigenvalue Conjecture I: Main Theorems, Examples, and Outline of Proof.

Joel Friedman, David Kohler

CoRR, 2019

2014

The Relativized Second Eigenvalue Conjecture of Alon.

Joel Friedman, David-Emmanuel Kohler

CoRR, 2014

2007

Linear Transformations in Boolean Complexity Theory.

Joel Friedman

Proceedings of the Computation and Logic in the Real World, 2007

2006

Spectral estimates for Abelian Cayley graphs.

Joel Friedman, Ram Murty, Jean-Pierre Tillich

J. Comb. Theory, Ser. B, 2006

Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example

Joel Friedman

CoRR, 2006

A formal mathematical framework for modeling probabilistic hybrid systems.

Robert St-Aubin, Joel Friedman, Alan K. Mackworth

Ann. Math. Artif. Intell., 2006

2005

Generalized Alon--Boppana Theorems and Error-Correcting Codes.

Joel Friedman, Jean-Pierre Tillich

SIAM J. Discret. Math., 2005

Recognizing More Unsatisfiable Random k-SAT Instances Efficiently.

Joel Friedman, Andreas Goerdt, Michael Krivelevich

SIAM J. Comput., 2005

Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity

Joel Friedman

CoRR, 2005

2004

Calculus on Graphs

Joel Friedman, Jean-Pierre Tillich

CoRR, 2004

A proof of Alon's second eigenvalue conjecture and related problems

Joel Friedman

CoRR, 2004

2003

Design of wavelength converting switches for optical burst switching.

Jeyashankher Ramamirtham, Jonathan S. Turner, Joel Friedman

IEEE J. Sel. Areas Commun., 2003

A proof of Alon's second eigenvalue conjecture.

Joel Friedman

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2001

Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently.

Joel Friedman, Andreas Goerdt

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

On Cayley Graphs on the Symmetric Group Generated by Tranpositions.

Joel Friedman

Comb., 2000

1998

The action of a few permutations on r-tuples is quickly transitive.

Joel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich

Random Struct. Algorithms, 1998

Computing Betti Numbers via Combinatiorial Laplacians.

Joel Friedman

Algorithmica, 1998

1996

Computing Betti Numbers via Combinatorial Laplacians.

Joel Friedman

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

The Action of a Few Random Permutations on r-Tuples and an Application to Cryptography.

Joel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich

Proceedings of the STACS 96, 1996

1995

On the Second Eigenvalue of Hypergraphs.

Joel Friedman, Avi Wigderson

Comb., 1995

Some Graphs with Small Second Eigenvalue.

Joel Friedman

Comb., 1995

1994

Point Location Among Hyperplanes and Unidirectional Ray-shooting.

Bernard Chazelle, Joel Friedman

Comput. Geom., 1994

1993

A Note on Poset Geometries.

Joel Friedman

SIAM J. Comput., 1993

On Convex Body Chasing.

Joel Friedman, Nathan Linial

Discret. Comput. Geom., 1993

A note on matrix rigidity.

Joel Friedman

Comb., 1993

1992

On the Bit Extraction Problem

Joel Friedman

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

The Spectra of Infinite Hypertrees.

Joel Friedman

SIAM J. Comput., 1991

On the second eigenvalue and random walks n random d-regular graphs.

Joel Friedman

Comb., 1991

1990

Random Polynomials and Approximate Zeros of Newton's Method.

Joel Friedman

SIAM J. Comput., 1990

A Density Theorem for Purely Iterative Zero Finding Methods.

Joel Friedman

SIAM J. Comput., 1990

A deterministic view of random sampling and its use in geometry.

Bernard Chazelle, Joel Friedman

Comb., 1990

1989

On the convergence of newton's method.

Joel Friedman

J. Complex., 1989

On the Second Eigenvalue in Random Regular Graphs

Joel Friedman, Jeff Kahn, Endre Szemerédi

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988

Wide-Sense Nonblocking Networks.

Paul Feldman, Joel Friedman, Nicholas Pippenger

SIAM J. Discret. Math., 1988

A lower bound on strictly non-block networks.

Joel Friedman

Comb., 1988

1987

Expanding graphs contain all small trees.

Joel Friedman, Nicholas Pippenger

Comb., 1987

1986

State splitting for variable-length graphs.

Roy L. Adler, Joel Friedman, Bruce Kitchens, Brian H. Marcus

IEEE Trans. Inf. Theory, 1986

Constructing O(n log n) Size Monotone Formulae for the k-th Threshold Function of n Boolean Variables.

Joel Friedman

SIAM J. Comput., 1986

Non-Blocking Networks (Preliminary Version)

Paul Feldman, Joel Friedman, Nicholas Pippenger

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

On Newton's Method for Polynomials

Joel Friedman

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

The Bit Extraction Problem of t-Resilient Functions (Preliminary Version)

Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, Roman Smolensky

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985