Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan Graphs. Combinatorica 8, 261--277 (1988) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
The Number-Theoretical Spin Chain and the Riemann Zeroes - Knauf (1997) (2 citations) (Correct)
No context found.
Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan Graphs. Combinatorica 8, 261--277 (1988)
A Project Report - Submitted In Partial (Correct)
No context found.
A.Lubotzky ,R.Philip ,and P.Sarnak .Ramanujan graphs. Combinatorica 8 (1988) no. 3 ,261-271 55 BIBLIOGRAPHY 56
International Symposium on Information Theory and Its.. - John Laerty School (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak, "Ramanujan graphs," Combinatorica, Vol. 8, No. 3, 1988, pp. 261-- 277.
Eigenvalue Spacings For Quantized Cat Maps - Alex Gamburd John (Correct)
No context found.
A. Lubotzky, R. Phillips, P. Sarnak, Ramanujan Graphs, Combinatorica 8 1988, 261277.
Cryptographic Hash Functions from Expander Graphs - Charles, Goren, Lauter (2006) (Correct)
No context found.
Lubotzky, A.; Phillips, R.; Sarnak, P.; Ramanujan graphs. Combinatorica 8 (1988), no. 3, 261--277.
Information Theory and Communication Networks: An.. - Ephremides, Hajek (1998) (33 citations) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak, "Ramanujan graphs," Combinatroica, vol. 8, no. 3, pp. 261--277, 1988.
Approximating Layout Problems on Random Graphs - Diaz, Petit, Serna, Trevisan (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261--277, 1988.
On Spectral Properties of Graphs, and Their Application to.. - Bilu (2004) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261--277, 1988.
ISIT2001, Washington, DC, June 24-29, 2001 - Constructions Of Regular (2001) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak, \Ramanujan Graphs," Combinatorica, vol. 8, no. 3, pp. 261-277, 1988.
Gossiping to Reach Consensus - Chlebus, Kowalski (2002) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988) 261 - 277.
Bounding Work and Communication in Robust.. - Chlebus, Gasieniec, .. (2002) (1 citation) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988) 261 - 277.
On the Construction of Turbo Code Interleavers Based on Graphs.. - Vontobel (2002) (3 citations) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak, "Ramanujan Graphs," Combinatorica, vol. 8, no. 3, pp. 261--277, 1988.
Irregular Codes from Regular Graphs - Vontobel, Loeliger (2002) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak, "Ramanujan Graphs," Combinatorica, vol. 8, no. 3, pp. 261--277, 1988.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261--277, 1988.
Complexity Measures of Sign Matrices - Linial, Mendelson, al. (2004) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.
Simple, Efficient Routing Schemes for All-Optical Networks - Flammini, Scheideler (1997) (1 citation) (Correct)
No context found.
A. Lubotzky, R. Phillips, R. Sarnak. Ramanujan graphs. Combinatorica 8(3), pp. 261-277, 1988.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261--277, 1988.
Expander Flows, Geometric Embeddings and Graph Partitioning - Arora, Rao, Vazirani (Correct)
No context found.
A. Lubotzky, R. Philips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261-277, 1988.
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume - Biedl, Thiele, Wood (2004) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261-- 277, 1988.
Graph Homomorphisms Through Random Walks - Daneshgar, Hajiabolhassan (2003) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988), 261--277. 37
Approximate Distance Oracles - Mikkel Thorup Uri (2001) (33 citations) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261--277, 1988.
Approximation Hardness of Bounded Degree MIN-CSP and.. - Berman, Karpinski (2001) (Correct)
No context found.
A. Lubotzky, R. Phillips and P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988), 261--277.
List-Decoding Using The XOR Lemma - Luca Trevisan Computer (2003) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261--277, 1988.
On ε-Biased Generators in NC° - Mossel, Shpilka, Trevisan (2003) (1 citation) (Correct)
No context found.
A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261--277, 1988.
On the Implementation of Huge Random Objects - Oded Goldreich Shafi (2003) (1 citation) (Correct)
No context found.
A. Lubotzky, R. Phillips, P. Sarnak, Ramanujan Graphs. Combinatorica, Vol. 8, pages 261--277, 1988.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC