Result 1 to 20 of 58 total
Braess’s paradox in expanders. (English)
Random Struct. Algorithms 41, No. 4, 451-468 (2012).
1
Tight products and graph expansion. (English)
J. Graph Theory 69, No. 3-4, 426-440 (2012).
2
Expanders and property A. (English)
Algebr. Geom. Topol. 12, No. 1, 37-47 (2012).
3
Expansion in $SL_d(\cal{O}_K/I), I$ square-free. (English)
J. Eur. Math. Soc. (JEMS) 14, No. 1, 273-305 (2012).
4
Boolean function complexity. Advances and frontiers. (English)
Algorithms and Combinatorics 27. Berlin: Springer (ISBN 978-3-642-24507-7/hbk; 978-3-642-24508-4/ebook). xv, 617~p. EUR~64.95/net; SFR~86.50; \sterling~58.99; \$~84.95 (2012).
5
Suzuki groups as expanders. (English)
Groups Geom. Dyn. 5, No. 2, 281-299 (2011).
6
Spectra of lifted Ramanujan graphs. (English)
Adv. Math. 227, No. 4, 1612-1645 (2011).
7
Quantum expanders: motivation and construction. (English)
Theory Comput. 6, Paper No. 3, 47-79, electronic only (2010).
8
Minimal selectors and fault tolerant networks. (English)
Networks 55, No. 4, 326-340 (2010).
9
Balanced hashing, color coding and approximate counting. (English)
Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10‒11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 1-16 (2009).
10
On construction of almost-Ramanujan graphs. (English)
Discrete Math. Algorithms Appl. 1, No. 2, 193-203 (2009).
11
Expansion properties of a random regular graph after random vertex deletions. (English)
Eur. J. Comb. 29, No. 5, 1139-1150 (2008).
12
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales. (English)
Random Struct. Algorithms 32, No. 1, 88-100 (2008).
13
A probabilistic study on combinatorial expanders and hashing. (English)
SIAM J. Comput. 37, No. 1, 83-111 (2007).
14
Symmetric groups and expander graphs. (English)
Invent. Math. 170, No. 2, 327-354 (2007).
15
Iterative construction of Cayley expander graphs. (English)
Theory Comput. 2, Paper No. 5, 91-120, electronic only (2006).
16
Hardness amplification via space-efficient direct products. (English)
Correa, José R. (ed.) et al., LATIN 2006: Theoretical informatics. 7th Latin American symposium, Valdivia, Chile, March 20‒24, 2006. Proceedings. Berlin: Springer (ISBN 3-540-32755-X/pbk). Lecture Notes in Computer Science 3887, 556-568 (2006).
17
Finite simple groups as expanders. (English)
Proc. Natl. Acad. Sci. USA 103, No. 16, 6116-6119 (2006).
18
Expansion of product replacement graphs. (English)
Combinatorica 26, No. 4, 411-429 (2006).
19
Extractors from Reed-Muller codes. (English)
J. Comput. Syst. Sci. 72, No. 5, 786-812 (2006).
20
Result 1 to 20 of 58 total
Start
Contact
Print
General Help
