Joel Friedman

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