DBLP: Joel Friedman

	2007
c12		Joel Friedman: Linear Transformations in Boolean Complexity Theory. CiE 2007: 307-315
	2006
j24		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)
j23		Joel Friedman, Ram Murty, Jean-Pierre Tillich: Spectral estimates for Abelian Cayley graphs. J. Comb. Theory, Ser. B 96(1): 111-121 (2006)
c11		Robert St-Aubin, Joel Friedman, Alan K. Mackworth: A Formal Mathematical Framework for Modeling Probabilistic Hybrid Systems. ISAIM 2006
i4		Joel Friedman: Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example. CoRR abs/cs/0604024 (2006)
	2005
j22		Joel Friedman, Andreas Goerdt, Michael Krivelevich: Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. SIAM J. Comput. 35(2): 408-430 (2005)
j21		Joel Friedman, Jean-Pierre Tillich: Generalized Alon--Boppana Theorems and Error-Correcting Codes. SIAM J. Discrete 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
j20		Jeyashankher Ramamirtham, Jonathan S. Turner, Joel Friedman: Design of wavelength converting switches for optical burst switching. IEEE Journal on Selected Areas in Communications 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
j19		Joel Friedman: On Cayley Graphs on the Symmetric Group Generated by Tranpositions. Combinatorica 20(4): 505-519 (2000)
	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. Combinatorica 15(1): 31-42 (1995)
j16		Joel Friedman, Avi Wigderson: On the Second Eigenvalue of Hypergraphs. Combinatorica 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. Combinatorica 13(2): 235-239 (1993)
j13		Joel Friedman, Nathan Linial: On Convex Body Chasing. Discrete & Computational Geometry 9: 293-321 (1993)
j12		Joel Friedman: A Note on Poset Geometries. SIAM J. Comput. 22(1): 72-78 (1993)
	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. Combinatorica 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. Combinatorica 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)
	1989
j6		Joel Friedman: On the convergence of newton's method. J. Complexity 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. Combinatorica 8(2): 185-188 (1988)
j4		Paul Feldman, Joel Friedman, Nicholas Pippenger: Wide-Sense Nonblocking Networks. SIAM J. Discrete 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. Combinatorica 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 Transactions on Information 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

2007

c12

Joel Friedman: Linear Transformations in Boolean Complexity Theory. CiE 2007: 307-315

2006

j24

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)

j23

Joel Friedman, Ram Murty, Jean-Pierre Tillich: Spectral estimates for Abelian Cayley graphs. J. Comb. Theory, Ser. B 96(1): 111-121 (2006)

c11

Robert St-Aubin, Joel Friedman, Alan K. Mackworth: A Formal Mathematical Framework for Modeling Probabilistic Hybrid Systems. ISAIM 2006

Joel Friedman: Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example. CoRR abs/cs/0604024 (2006)

2005

j22

Joel Friedman, Andreas Goerdt, Michael Krivelevich: Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. SIAM J. Comput. 35(2): 408-430 (2005)

j21

Joel Friedman, Jean-Pierre Tillich: Generalized Alon--Boppana Theorems and Error-Correcting Codes. SIAM J. Discrete Math. 19(3): 700-718 (2005)

Joel Friedman: Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity. CoRR abs/cs/0512008 (2005)

2004

Joel Friedman: A proof of Alon's second eigenvalue conjecture and related problems. CoRR cs.DM/0405020 (2004)

Joel Friedman, Jean-Pierre Tillich: Calculus on Graphs. CoRR cs.DM/0408028 (2004)

2003

j20

Jeyashankher Ramamirtham, Jonathan S. Turner, Joel Friedman: Design of wavelength converting switches for optical burst switching. IEEE Journal on Selected Areas in Communications 21(7): 1122-1132 (2003)

c10

Joel Friedman: A proof of Alon's second eigenvalue conjecture. STOC 2003: 720-724

2001

Joel Friedman, Andreas Goerdt: Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently. ICALP 2001: 310-321

2000

j19

Joel Friedman: On Cayley Graphs on the Symmetric Group Generated by Tranpositions. Combinatorica 20(4): 505-519 (2000)

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

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

Joel Friedman: Computing Betti Numbers via Combinatorial Laplacians. STOC 1996: 386-391

1995

j17

Joel Friedman: Some Graphs with Small Second Eigenvalue. Combinatorica 15(1): 31-42 (1995)

j16

Joel Friedman, Avi Wigderson: On the Second Eigenvalue of Hypergraphs. Combinatorica 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. Combinatorica 13(2): 235-239 (1993)

j13

Joel Friedman, Nathan Linial: On Convex Body Chasing. Discrete & Computational Geometry 9: 293-321 (1993)

j12

Joel Friedman: A Note on Poset Geometries. SIAM J. Comput. 22(1): 72-78 (1993)

1992

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. Combinatorica 11(4): 331-362 (1991)

j10

Joel Friedman: The Spectra of Infinite Hypertrees. SIAM J. Comput. 20(5): 951-961 (1991)

1990

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

Joel Friedman: A Density Theorem for Purely Iterative Zero Finding Methods. SIAM J. Comput. 19(1): 124-132 (1990)

Joel Friedman: Random Polynomials and Approximate Zeros of Newton's Method. SIAM J. Comput. 19(6): 1068-1099 (1990)

1989

Joel Friedman: On the convergence of newton's method. J. Complexity 5(1): 12-33 (1989)

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

1988

Joel Friedman: A lower bound on strictly non-block networks. Combinatorica 8(2): 185-188 (1988)

Paul Feldman, Joel Friedman, Nicholas Pippenger: Wide-Sense Nonblocking Networks. SIAM J. Discrete Math. 1(2): 158-173 (1988)

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

1987

Joel Friedman, Nicholas Pippenger: Expanding graphs contain all small trees. Combinatorica 7(1): 71-76 (1987)

1986

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)

Roy L. Adler, Joel Friedman, Bruce Kitchens, Brian H. Marcus: State splitting for variable-length graphs. IEEE Transactions on Information Theory 32(1): 108-113 (1986)

Joel Friedman: On Newton's Method for Polynomials. FOCS 1986: 153-161

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

1985

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

1	Roy L. Adler	[j1]
2	Bernard Chazelle	[j15] [j9] [c4]
3	Benny Chor	[c1]
4	Paul Feldman	[j4] [c2]
5	Andreas Goerdt	[j22] [c9]
6	Oded Goldreich	[c1]
7	Johan Håstad	[c1]
8	Antoine Joux	[j18] [c8]
9	Jeff Kahn	[c5]
10	Bruce Kitchens	[j1]
11	Michael Krivelevich	[j22]
12	Nathan Linial (Nati Linial)	[j13]
13	Alan K. Mackworth	[j24] [c11]
14	Brian H. Marcus	[j1]
15	Ram Murty	[j23]
16	Nicholas Pippenger	[j4] [j3] [c2]
17	Jeyashankher Ramamirtham	[j20]
18	Yuval Roichman	[j18] [c8]
19	Steven Rudich	[c1]
20	Roman Smolensky	[c1]
21	Robert St-Aubin	[j24] [c11]
22	Jacques Stern	[j18] [c8]
23	Endre Szemerédi	[c5]
24	Jean-Pierre Tillich	[j23] [j21] [i1] [j18] [c8]
25	Jonathan S. Turner	[j20]
26	Avi Wigderson	[j16]

Joel Friedman

Coauthor Index