Joel Friedman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 37 from 37

2023

Generalized Riemann Functions, Their Weights, and the Complete GraphNicolas Folinsbee, Joel Friedman. combinatorics, 30(2), 2023. [doi]

2007

Linear Transformations in Boolean Complexity TheoryJoel Friedman. cie 2007: 307-315 [doi]

2006

Spectral estimates for Abelian Cayley graphsJoel Friedman, Ram Murty, Jean-Pierre Tillich. JCT, 96(1):111-121, 2006. [doi]

A formal mathematical framework for modeling probabilistic hybrid systemsRobert St-Aubin, Joel Friedman, Alan K. Mackworth. AMAI, 47(3-4):397-425, 2006. [doi]

A Formal Mathematical Framework for Modeling Probabilistic Hybrid SystemsRobert St-Aubin, Joel Friedman, Alan K. Mackworth. isaim 2006: [doi]

2005

Generalized Alon--Boppana Theorems and Error-Correcting CodesJoel Friedman, Jean-Pierre Tillich. siamdm, 19(3):700-718, 2005. [doi]

Recognizing More Unsatisfiable Random k-SAT Instances EfficientlyJoel Friedman, Andreas Goerdt, Michael Krivelevich. SICOMP, 35(2):408-430, 2005. [doi]

2003

A proof of Alon s second eigenvalue conjectureJoel Friedman. stoc 2003: 720-724 [doi]

Design of wavelength converting switches for optical burst switchingJeyashankher Ramamirtham, Jonathan S. Turner, Joel Friedman. jsac, 21(7):1122-1132, 2003. [doi]

2001

Recognizing More Unsatisfiable Random 3-SAT Instances EfficientlyJoel Friedman, Andreas Goerdt. icalp 2001: 310-321 [doi]

2000

On Cayley Graphs on the Symmetric Group Generated by TranpositionsJoel Friedman. combinatorica, 20(4):505-519, 2000. [doi]

1998

The action of a few permutations on r-tuples is quickly transitiveJoel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich. rsa, 12(4):335-350, 1998.

1996

Computing Betti Numbers via Combinatorial LaplaciansJoel Friedman. stoc 1996: 386-391 [doi]

The Action of a Few Random Permutations on r-Tuples and an Application to CryptographyJoel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich. STACS 1996: 375-386

1995

Some Graphs with Small Second EigenvalueJoel Friedman. combinatorica, 15(1):31-42, 1995.

On the Second Eigenvalue of HypergraphsJoel Friedman, Avi Wigderson. combinatorica, 15(1):43-65, 1995.

1994

Point Location Among Hyperplanes and Unidirectional Ray-shootingBernard Chazelle, Joel Friedman. comgeo, 4:53-62, 1994.

1993

A Note on Poset GeometriesJoel Friedman. SICOMP, 22(1):72-78, 1993.

On Convex Body ChasingJoel Friedman, Nathan Linial. dcg, 9:293-321, 1993.

A note on matrix rigidityJoel Friedman. combinatorica, 13(2):235-239, 1993.

1992

On the Bit Extraction ProblemJoel Friedman. focs 1992: 314-319

1991

The Spectra of Infinite HypertreesJoel Friedman. SICOMP, 20(5):951-961, 1991.

On the second eigenvalue and random walks n random d-regular graphsJoel Friedman. combinatorica, 11(4):331-362, 1991.

1990

A deterministic view of random sampling and its use in geometryBernard Chazelle, Joel Friedman. combinatorica, 10(3):229-249, 1990.

Random Polynomials and Approximate Zeros of Newton s MethodJoel Friedman. SICOMP, 19(6):1068-1099, 1990.

A Density Theorem for Purely Iterative Zero Finding MethodsJoel Friedman. SICOMP, 19(1):124-132, 1990.

1989

On the Second Eigenvalue in Random Regular GraphsJoel Friedman, Jeff Kahn, Endre Szemerédi. stoc 1989: 587-598

On the convergence of newton s methodJoel Friedman. jc, 5(1):12-33, 1989. [doi]

1988

A Deterministic View of Random Sampling and its Use in GeometryBernard Chazelle, Joel Friedman. focs 1988: 539-549

Wide-Sense Nonblocking NetworksPaul Feldman, Joel Friedman, Nicholas Pippenger. siamdm, 1(2):158-173, 1988.

A lower bound on strictly non-block networksJoel Friedman. combinatorica, 8(2):185-188, 1988.

1987

Expanding graphs contain all small treesJoel Friedman, Nicholas Pippenger. combinatorica, 7(1):71-76, 1987.

1986

State splitting for variable-length graphsRoy L. Adler, Joel Friedman, Bruce Kitchens, Brian H. Marcus. TIT, 32(1):108, 1986.

Non-Blocking Networks (Preliminary Version)Paul Feldman, Joel Friedman, Nicholas Pippenger. stoc 1986: 247-254

On Newton s Method for PolynomialsJoel Friedman. focs 1986: 153-161

Constructing O(n log n) Size Monotone Formulae for the k-th Threshold Function of n Boolean VariablesJoel Friedman. SICOMP, 15(3):641-654, 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. focs 1985: 396-407

Sign in or sign up to see more results.

runs on WebDSL