k+ decision trees – (extended abstract)

[1]  Richard J. Lipton,et al.  Multidimensional Searching Problems , 1976, SIAM J. Comput..

[2]  Noam Nisan.  CREW PRAMs and Decision Trees , 1991, SIAM J. Comput..

[3]  Nancy A. Lynch,et al.  Consensus and collision detectors in radio networks , 2008, Distributed Computing.

[4]  H. Buhrman,et al.  Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..

[5]  Andreas Terzis,et al.  Wireless ACK Collisions Not Considered Harmful , 2008, HotNets.

[6]  Eyal Kushilevitz,et al.  Learning Decision Trees Using the Fourier Spectrum , 1993, SIAM J. Comput..

[7]  David Haussler,et al.  Learning decision trees from random examples , 1988, COLT '88.

[8]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[9]  Yosi Ben-Asher,et al.  Decision Trees with Boolean Threshold Queries , 1995, J. Comput. Syst. Sci..

[10]  Murat Demirbas,et al.  A Singlehop Collaborative Feedback Primitive for Wireless Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[11]  Miroslaw Kutylowski,et al.  Energy-Efficient Size Approximation of Radio Networks with No Collision Detection , 2002, COCOON.

[12]  Andrew Chi-Chih Yao.  Monotone Bipartite Graph Properties are Evasive , 1988, SIAM J. Comput..

[13]  Vinayak S. Naik,et al.  A line in the sand: a wireless sensor network for target detection, classification, and tracking , 2004, Comput. Networks.

[14]  K. Hamza.  The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions , 1995 .

[15]  Nader H. Bshouty.  A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries , 1996, Inf. Process. Lett..

[16]  Arnold L. Rosenberg.  On the time required to recognize properties of graphs: a problem , 1973, SIGA.

[17]  Michael T. Goodrich,et al.  Efficient parallel algorithms for dead sensor diagnosis and multiple access channels , 2006, SPAA '06.

[18]  Shlomo Moran,et al.  Applications of Ramsey's theorem to decision tree complexity , 1985, JACM.

[19]  Michael Ben-Or,et al.  Lower bounds for algebraic computation trees , 1983, STOC.

[20]  Ramamohan Paturi,et al.  On the degree of polynomials that approximate symmetric Boolean functions (preliminary version) , 1992, STOC '92.