2006 |
6 | EE | Andris Ambainis,
William I. Gasarch,
Aravind Srinivasan,
Andrey Utis:
Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems.
ISAAC 2006: 628-637 |
2004 |
5 | EE | William I. Gasarch,
James Glenn,
Andrey Utis:
The communication complexity of the Exact-N Problem revisited.
Algebraic Methods in Computational Complexity 2004 |
4 | EE | Süleyman Cenk Sahinalp,
Andrey Utis:
Hardness of String Similarity Search and Other Indexing Problems.
ICALP 2004: 1080-1098 |
3 | EE | Andris Ambainis,
William I. Gasarch,
Aravind Srinivasan,
Andrey Utis:
Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance
CoRR cs.CC/0411076: (2004) |
2 | EE | Andris Ambainis,
William I. Gasarch,
Aravind Srinivasan,
Andrey Utis:
Lower bounds on the Deterministic and Quantum Communication Complexity of HAMna
Electronic Colloquium on Computational Complexity (ECCC)(120): (2004) |
1 | EE | 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:
Use of Classification Regression Tree in Predicting Oral Absorption in Humans.
Journal of Chemical Information and Modeling 44(6): 2061-2069 (2004) |