![]() |
@article{DBLP:journals/rsa/LinialS09,
author = {Nati Linial and
Adi Shraibman},
title = {Lower bounds in communication complexity based on factorization
norms},
journal = {Random Struct. Algorithms},
volume = {34},
number = {3},
year = {2009},
pages = {368-394},
ee = {http://dx.doi.org/10.1002/rsa.20232},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2009-05-08 by Michael Ley (ley@uni-trier.de)