The communication complexity of the Exact-N Problem revisited. - William I. Gasarch; James Glenn; Andrey Utis (Algebraic Methods in Computational Complexity, 2004)

Hardness of String Similarity Search and Other Indexing Problems. - Süleyman Cenk Sahinalp; Andrey Utis (ICALP, 2004)

Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance - Andris Ambainis; William I. Gasarch; Aravind Srinivasan; Andrey Utis (CoRR, 2004)

Lower bounds on the Deterministic and Quantum Communication Complexity of HAMna - Andris Ambainis; William I. Gasarch; Aravind Srinivasan; Andrey Utis (Electron. Colloquium Comput. Complex., 2004)

Use of Classification Regression Tree in Predicting Oral Absorption in Humans. - Jane P. F. Bai; Andrey Utis; Gordon M. Crippen; Han-Dan He; Volker Fischer; Robert Tullman; He-Qun Yin; Cheng-Pang Hsu; Lan Jiang; Kin-Kai Hwang (J. Chem. Inf. Model., 2004)

Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. - Andris Ambainis; William I. Gasarch; Aravind Srinivasan; Andrey Utis (ISAAC, 2006)

Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems. - Andris Ambainis; William I. Gasarch; Aravind Srinivasan; Andrey Utis (ACM Trans. Comput. Theory, 2015)