Eitan Farchi Papers on DiSC'03 Automatic query wefinement using lexical affinities with maximal information gain Publications Note: Links lead to the DBLP on the Web. Eitan Farchi 11 Eitan Farchi, Yarden Nir , Shmuel Ur : Concurrent Bug Patterns and How to Test Them. IPDPS 2003 : 286 10 Yosi Ben-Asher , Eitan Farchi, Yaniv Eytani : Heuristics for Finding Concurrent Bug. IPDPS 2003 : 288 9 Marina Biberstein , Eitan Farchi, Shmuel Ur : Choosing among Alternative Pasts. IPDPS 2003 : 289 8 Orit Edelstein , Eitan Farchi, Evgeny Goldin , Yarden Nir , Gil Ratsaby , Shmuel Ur : Framework for testing multi-threaded Java programs. Concurrency and Computation: Practice and Experience 15 (3-5): 485-499 (2003) 7 David Carmel , Eitan Farchi, Yael Petruschka , Aya Soffer : Automatic query refinement using lexical affinities with maximal information gain. SIGIR 2002 : 283-290 6 Orit Edelstein , Eitan Farchi, Yarden Nir , Gil Ratsaby , Shmuel Ur : Multithreaded Java program test generation. IBM Systems Journal 41 (1): 111-125 (2002) 5 Eitan Farchi, Alan Hartman , Shlomit S. Pinter : Using a model-based test generator to test for standard conformance. IBM Systems Journal 41 (1): 89-110 (2002) 4 Orit Edelstein , Eitan Farchi, Yarden Nir , Gil Ratsaby , Shmuel Ur : Multithreaded Java program test generation. Java Grande 2001 : 181 3 Aya Soffer , David Carmel , Doron Cohen , Ronald Fagin , Eitan Farchi, Michael Herscovici , Yoëlle S. Maarek : Static Index Pruning for Information Retrieval Systems. SIGIR 2001 : 43-50 2 Yosi Ben-Asher , Eitan Farchi, Ilan Newman : Optimal Search in Trees. SIAM J. Comput. 28 (6): 2090-2102 (1999) 1 Yosi Ben-Asher , Eitan Farchi, Ilan Newman : Optimal Search in Trees: Extended Abstract + Appendix. SODA 1997 : 739-746 DiSC'03 © 2003 Association for Computing Machinery