default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoel Friedman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j26]Nicolas Folinsbee, Joel Friedman
:
Generalized Riemann Functions, Their Weights, and the Complete Graph. Electron. J. Comb. 30(2) (2023)- 2022
- [i12]Joel Friedman, Amir Tootooni:
Coordination and Discoordination in Linear Algebra, Linear Information Theory, and Coded Caching. CoRR abs/2204.11802 (2022)
2010 – 2019
- 2019
- [i11]Joel Friedman, David Kohler:
On the Relativized Alon Second Eigenvalue Conjecture I: Main Theorems, Examples, and Outline of Proof. CoRR abs/1911.05688 (2019) - [i10]Joel Friedman, David Kohler:
On the Relativized Alon Eigenvalue Conjecture II: Asymptotic Expansion Theorems for Walks. CoRR abs/1911.05705 (2019) - [i9]Joel Friedman, David Kohler:
On the Relativized Alon Second Eigenvalue Conjecture III: Asymptotic Expansions for Tangle-Free Hashimoto Traces. CoRR abs/1911.05710 (2019) - [i8]Joel Friedman, David Kohler:
A Relativized Alon Second Eigenvalue Conjecture for Regular Base Graphs IV: An Improved Sidestepping Theorem. CoRR abs/1911.05721 (2019) - [i7]Joel Friedman, David Kohler:
On the Relativized Alon Second Eigenvalue Conjecture VI: Sharp Bounds for Ramanujan Base Graphs. CoRR abs/1911.05775 (2019) - [i6]Joel Friedman, David Kohler:
On the Relativized Alon Second Eigenvalue Conjecture V: Proof of the Relativized Alon Conjecture for Regular Base Graphs. CoRR abs/1911.06620 (2019) - 2014
- [i5]Joel Friedman, David-Emmanuel Kohler:
The Relativized Second Eigenvalue Conjecture of Alon. CoRR abs/1403.3462 (2014)
2000 – 2009
- 2007
- [c12]Joel Friedman:
Linear Transformations in Boolean Complexity Theory. CiE 2007: 307-315 - 2006
- [j25]Robert St-Aubin, Joel Friedman, Alan K. Mackworth:
A formal mathematical framework for modeling probabilistic hybrid systems. Ann. Math. Artif. Intell. 47(3-4): 397-425 (2006) - [j24]Joel Friedman, Ram Murty, Jean-Pierre Tillich:
Spectral estimates for Abelian Cayley graphs. J. Comb. Theory B 96(1): 111-121 (2006) - [c11]Robert St-Aubin, Joel Friedman, Alan K. Mackworth:
A Formal Mathematical Framework for Modeling Probabilistic Hybrid Systems. AI&M 2006 - [i4]Joel Friedman:
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example. CoRR abs/cs/0604024 (2006) - 2005
- [j23]Joel Friedman, Andreas Goerdt, Michael Krivelevich:
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. SIAM J. Comput. 35(2): 408-430 (2005) - [j22]Joel Friedman, Jean-Pierre Tillich:
Generalized Alon--Boppana Theorems and Error-Correcting Codes. SIAM J. Discret. Math. 19(3): 700-718 (2005) - [i3]Joel Friedman:
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity. CoRR abs/cs/0512008 (2005) - 2004
- [i2]Joel Friedman:
A proof of Alon's second eigenvalue conjecture and related problems. CoRR cs.DM/0405020 (2004) - [i1]Joel Friedman, Jean-Pierre Tillich:
Calculus on Graphs. CoRR cs.DM/0408028 (2004) - 2003
- [j21]Jeyashankher Ramamirtham, Jonathan S. Turner, Joel Friedman:
Design of wavelength converting switches for optical burst switching. IEEE J. Sel. Areas Commun. 21(7): 1122-1132 (2003) - [c10]Joel Friedman:
A proof of Alon's second eigenvalue conjecture. STOC 2003: 720-724 - 2001
- [c9]Joel Friedman, Andreas Goerdt:
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently. ICALP 2001: 310-321 - 2000
- [j20]Joel Friedman:
On Cayley Graphs on the Symmetric Group Generated by Tranpositions. Comb. 20(4): 505-519 (2000)
1990 – 1999
- 1998
- [j19]Joel Friedman:
Computing Betti Numbers via Combinatiorial Laplacians. Algorithmica 21(4): 331-346 (1998) - [j18]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): 335-350 (1998) - 1996
- [c8]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: 375-386 - [c7]Joel Friedman:
Computing Betti Numbers via Combinatorial Laplacians. STOC 1996: 386-391 - 1995
- [j17]Joel Friedman:
Some Graphs with Small Second Eigenvalue. Comb. 15(1): 31-42 (1995) - [j16]Joel Friedman, Avi Wigderson:
On the Second Eigenvalue of Hypergraphs. Comb. 15(1): 43-65 (1995) - 1994
- [j15]Bernard Chazelle, Joel Friedman:
Point Location Among Hyperplanes and Unidirectional Ray-shooting. Comput. Geom. 4: 53-62 (1994) - 1993
- [j14]Joel Friedman:
A note on matrix rigidity. Comb. 13(2): 235-239 (1993) - [j13]Joel Friedman, Nathan Linial:
On Convex Body Chasing. Discret. Comput. Geom. 9: 293-321 (1993) - [j12]Joel Friedman:
A Note on Poset Geometries. SIAM J. Comput. 22(1): 72-78 (1993) - [e1]Joel Friedman:
Expanding Graphs, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 11-14, 1992. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 10, DIMACS/AMS 1993, ISBN 978-0-8218-6602-3 [contents] - 1992
- [c6]Joel Friedman:
On the Bit Extraction Problem. FOCS 1992: 314-319 - 1991
- [j11]Joel Friedman:
On the second eigenvalue and random walks n random d-regular graphs. Comb. 11(4): 331-362 (1991) - [j10]Joel Friedman:
The Spectra of Infinite Hypertrees. SIAM J. Comput. 20(5): 951-961 (1991) - 1990
- [j9]Bernard Chazelle, Joel Friedman:
A deterministic view of random sampling and its use in geometry. Comb. 10(3): 229-249 (1990) - [j8]Joel Friedman:
A Density Theorem for Purely Iterative Zero Finding Methods. SIAM J. Comput. 19(1): 124-132 (1990) - [j7]Joel Friedman:
Random Polynomials and Approximate Zeros of Newton's Method. SIAM J. Comput. 19(6): 1068-1099 (1990)
1980 – 1989
- 1989
- [j6]Joel Friedman:
On the convergence of newton's method. J. Complex. 5(1): 12-33 (1989) - [c5]Joel Friedman, Jeff Kahn, Endre Szemerédi:
On the Second Eigenvalue in Random Regular Graphs. STOC 1989: 587-598 - 1988
- [j5]Joel Friedman:
A lower bound on strictly non-block networks. Comb. 8(2): 185-188 (1988) - [j4]Paul Feldman, Joel Friedman, Nicholas Pippenger:
Wide-Sense Nonblocking Networks. SIAM J. Discret. Math. 1(2): 158-173 (1988) - [c4]Bernard Chazelle, Joel Friedman:
A Deterministic View of Random Sampling and its Use in Geometry. FOCS 1988: 539-549 - 1987
- [j3]Joel Friedman, Nicholas Pippenger:
Expanding graphs contain all small trees. Comb. 7(1): 71-76 (1987) - 1986
- [j2]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): 641-654 (1986) - [j1]Roy L. Adler, Joel Friedman, Bruce Kitchens, Brian H. Marcus:
State splitting for variable-length graphs. IEEE Trans. Inf. Theory 32(1): 108-113 (1986) - [c3]Joel Friedman:
On Newton's Method for Polynomials. FOCS 1986: 153-161 - [c2]Paul Feldman, Joel Friedman, Nicholas Pippenger:
Non-Blocking Networks (Preliminary Version). STOC 1986: 247-254 - 1985
- [c1]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: 396-407
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
