Testing Triangle-Freeness in General Graphs, SIAM Journal on Discrete Mathematics, vol.22, issue.2, pp.786-819, 2008. ,
DOI : 10.1137/07067917X
Communication Complexity of Simultaneous Messages, SIAM Journal on Computing, vol.33, issue.1, pp.137-166, 2004. ,
DOI : 10.1137/S0097539700375944
Space-Time Tradeoffs for Graph Properties, Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP), pp.291-300, 1999. ,
DOI : 10.1007/3-540-48523-6_26
Partition Arguments in Multiparty Communication Complexity, Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP), pp.390-402, 2009. ,
DOI : 10.1007/978-3-642-02927-1_33
THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING, Bulletin of the EATCS, vol.75, pp.97-126, 2001. ,
DOI : 10.1142/9789812562494_0014
Property testing and its connection to learning and approximation, Journal of the ACM, vol.45, issue.4, pp.653-750, 1998. ,
DOI : 10.1145/285055.285060
Property testing in bounded degree graphs, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.302-343, 2002. ,
DOI : 10.1145/258533.258627
Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract), Proceedings of 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.154-165, 2009. ,
DOI : 10.1007/978-3-642-11409-0_14
On the number of graphs without 4-cycles, Discrete Mathematics, vol.41, issue.2, pp.167-172, 1982. ,
Lower bound of the Hadwiger number of graphs by their average degree, Combinatorica, vol.4, issue.4, pp.307-316, 1984. ,
What cannot be computed locally!, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.300-309, 2004. ,
DOI : 10.1145/1011767.1011811
Locality in Distributed Graph Algorithms, SIAM Journal on Computing, vol.21, issue.1, pp.193-201, 1992. ,
DOI : 10.1137/0221015
The bit probe complexity measure revisited, Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp.662-671, 1993. ,
DOI : 10.1007/3-540-56503-5_65
On data structures and asymmetric communication complexity, Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC), pp.103-111, 1995. ,
Logarithmic Lower Bounds in the Cell-Probe Model, SIAM Journal on Computing, vol.35, issue.4, pp.932-963, 2006. ,
DOI : 10.1137/S0097539705447256
Distributed computing: a locality-sensitive approach, SIAM Monographs on Discrete Mathematics and Applications, 2000. ,
DOI : 10.1137/1.9780898719772
An extremal function for contractions of graphs, Mathematical Proceedings of the Cambridge Philosophical Society, vol.38, issue.02, pp.261-265, 1984. ,
DOI : 10.1007/BF01350657
The Extremal Function for Complete Minors, Journal of Combinatorial Theory, Series B, vol.81, issue.2, pp.318-338, 2001. ,
DOI : 10.1006/jctb.2000.2013
Lower bounds on communication complexity in distributed computer networks, Journal of the ACM, vol.34, issue.4, pp.921-938, 1987. ,
DOI : 10.1145/31846.32978
Equal sums of like powers, Bull. Amer. Math. Soc, vol.8, pp.755-757, 1948. ,
Some complexity questions related to distributive computing(Preliminary Report), Proceedings of the eleventh annual ACM symposium on Theory of computing , STOC '79, pp.209-213, 1979. ,
DOI : 10.1145/800135.804414
Should Tables Be Sorted?, Journal of the ACM, vol.28, issue.3, pp.615-628, 1981. ,
DOI : 10.1145/322261.322274