Author of the publication

Lower Bounds on Learning Decision Lists and Trees (Extended Abstract).

, , , and . STACS, volume 900 of Lecture Notes in Computer Science, page 527-538. Springer, (1995)

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

Cuckoo Cycle: a memory-hard proof-of-work system.. IACR Cryptology ePrint Archive, (2014)Mutual Search (Extended Abstract)., , , , , and . SODA, page 481-489. ACM/SIAM, (1998)On the Complexity of Several Haplotyping Problems., , , and . WABI, volume 3692 of Lecture Notes in Computer Science, page 128-139. Springer, (2005)How to Construct an Atomic Variable (Extended Abstract).. WDAG, volume 392 of Lecture Notes in Computer Science, page 292-302. Springer, (1989)Small Weight Bases for Hamming Codes., , and . COCOON, volume 959 of Lecture Notes in Computer Science, page 235-243. Springer, (1995)Randomized Two-Process Wait-Free Test-and-Set, and . CoRR, (2001)Sharpening Occam's razor., , and . Inf. Process. Lett., 85 (5): 267-274 (2003)Small Weight Bases for Hamming Codes., , and . Theor. Comput. Sci., 181 (2): 337-345 (1997)Lower Bounds on Learning Decision Lists and Trees., , , and . Inf. Comput., 126 (2): 114-122 (1996)Ladders Are PSPACE-Complete., and . Computers and Games, volume 2063 of Lecture Notes in Computer Science, page 241-249. Springer, (2000)