Joel Friedman

Orcid: 0000-0003-2309-6722

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Generalized Riemann Functions, Their Weights, and the Complete Graph.
Electron. J. Comb., 2023

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

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

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

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

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

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

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

2014
The Relativized Second Eigenvalue Conjecture of Alon.
CoRR, 2014

2007
Linear Transformations in Boolean Complexity Theory.
Proceedings of the Computation and Logic in the Real World, 2007

2006
Spectral estimates for Abelian Cayley graphs.
J. Comb. Theory B, 2006

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

A formal mathematical framework for modeling probabilistic hybrid systems.
Ann. Math. Artif. Intell., 2006

2005
Generalized Alon--Boppana Theorems and Error-Correcting Codes.
SIAM J. Discret. Math., 2005

Recognizing More Unsatisfiable Random k-SAT Instances Efficiently.
SIAM J. Comput., 2005

Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity
CoRR, 2005

2004
Calculus on Graphs
CoRR, 2004

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

2003
Design of wavelength converting switches for optical burst switching.
IEEE J. Sel. Areas Commun., 2003

A proof of Alon's second eigenvalue conjecture.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2001
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
On Cayley Graphs on the Symmetric Group Generated by Tranpositions.
Comb., 2000

1998
The action of a few permutations on r-tuples is quickly transitive.
Random Struct. Algorithms, 1998

Computing Betti Numbers via Combinatiorial Laplacians.
Algorithmica, 1998

1996
Computing Betti Numbers via Combinatorial Laplacians.
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.
Proceedings of the STACS 96, 1996

1995
On the Second Eigenvalue of Hypergraphs.
Comb., 1995

Some Graphs with Small Second Eigenvalue.
Comb., 1995

1994
Point Location Among Hyperplanes and Unidirectional Ray-shooting.
Comput. Geom., 1994

1993
A Note on Poset Geometries.
SIAM J. Comput., 1993

On Convex Body Chasing.
Discret. Comput. Geom., 1993

A note on matrix rigidity.
Comb., 1993

1992
On the Bit Extraction Problem
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
The Spectra of Infinite Hypertrees.
SIAM J. Comput., 1991

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

1990
Random Polynomials and Approximate Zeros of Newton's Method.
SIAM J. Comput., 1990

A Density Theorem for Purely Iterative Zero Finding Methods.
SIAM J. Comput., 1990

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

1989
On the convergence of newton's method.
J. Complex., 1989

On the Second Eigenvalue in Random Regular Graphs
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988
Wide-Sense Nonblocking Networks.
SIAM J. Discret. Math., 1988

A lower bound on strictly non-block networks.
Comb., 1988

1987
Expanding graphs contain all small trees.
Comb., 1987

1986
State splitting for variable-length graphs.
IEEE Trans. Inf. Theory, 1986

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

Non-Blocking Networks (Preliminary Version)
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

On Newton's Method for Polynomials
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985
The Bit Extraction Problem of t-Resilient Functions (Preliminary Version)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985


  Loading...