Author of the publication

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.

, , , , , and . FSTTCS, volume 2245 of Lecture Notes in Computer Science, page 171-182. Springer, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity.. CCC, page 100-106. IEEE Computer Society, (2001)Relative Expected Instantaneous Loss Bounds., and . COLT, page 90-99. Morgan Kaufmann, (2000)CAD-System für die vibroakustische Diagnostik.. Chemnitz University of Technology, Germany, (1986)Relative Loss Bounds for Temporal-Difference Learning., and . ICML, page 295-302. Morgan Kaufmann, (2000)Learning Multiplicity Automata from Smallest Counterexamples.. EuroCOLT, volume 1572 of Lecture Notes in Computer Science, page 79-90. Springer, (1999)On Relative Loss Bounds in Generalized Linear Regression.. FCT, volume 1684 of Lecture Notes in Computer Science, page 269-280. Springer, (1999)On the definiteness of quadrature formulae of Clenshaw-Curtis type., and . Computing, 33 (3-4): 363-366 (1984)