Dan Benanav (Selection)

Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

2		Dan Benanav, Deepak Kapur, Paliath Narendran: Complexity of Matching Problems. J. Symb. Comput. 3(1/2): 203-216 (1987)
1		Dan Benanav, Deepak Kapur, Paliath Narendran: Complexity of Matching Problems. RTA 1985: 417-429

Selection of 2 from 6 records - Dan Benanav has 4 coauthors