Probabilistic inductive inference : a surveyAMBAINIS, Andris.Theoretical computer science. 2001, Vol 264, Num 1, pp 155-167, issn 0304-3975Article

QUANTUM WALK ALGORITHM FOR ELEMENT DISTINCTNESSAMBAINIS, Andris.SIAM journal on computing (Print). 2008, Vol 37, Num 1, pp 210-239, issn 0097-5397, 30 p.Article

On learning formulas in the limit and with assuranceAMBAINIS, Andris.Information processing letters. 2001, Vol 77, Num 1, pp 9-11, issn 0020-0190Article

Quantum walk algorithm for element distinctnessAMBAINIS, Andris.Annual Symposium on Foundations of Computer Science. 2004, pp 22-31, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

Improved constructions of quantum automataAMBAINIS, Andris; NAHIMOVS, Nikolajs.Theoretical computer science. 2009, Vol 410, Num 20, pp 1916-1922, issn 0304-3975, 7 p.Article

A Quantum Lovasz Local LemmaAMBAINIS, Andris; KEMPE, Julia; SATTATH, O. R et al.Journal of the Association for Computing Machinery. 2012, Vol 59, Num 5, issn 0004-5411, 24.1-24.24Article

Nonmalleable encryption of quantum informationAMBAINIS, Andris; BOUDA, Jan; WINTER, Andreas et al.Journal of mathematical physics. 2009, Vol 50, Num 4, issn 0022-2488, 042105.1-042108.8Article

Quantum algorithms for matching and network flowsAMBAINIS, Andris; SPALEK, Robert.Lecture notes in computer science. 2006, pp 172-183, issn 0302-9743, isbn 3-540-32301-5, 1Vol, 12 p.Conference Paper

Improved algorithms for quantum identification of Boolean oraclesAMBAINIS, Andris; IWAMA, Kazuo; KAWACHI, Akinori et al.Theoretical computer science. 2007, Vol 378, Num 1, pp 41-53, issn 0304-3975, 13 p.Article

Exact results for accepting probabilities of quantum automataAMBAINIS, Andris; KIKUSTS, Arnolds.Lecture notes in computer science. 2001, pp 135-147, issn 0302-9743, isbn 3-540-42496-2Conference Paper

On the class of languages recognizable by 1-way quantum finite automataAMBAINIS, Andris; KIKUSTS, Arnolds; VALDATS, Maris et al.Lecture notes in computer science. 2001, pp 75-86, issn 0302-9743, isbn 3-540-41695-1Conference Paper

A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space TradeoffsAMBAINIS, Andris; SPALEK, Robert; DE WOLF, Ronald et al.Algorithmica. 2009, Vol 55, Num 3, pp 422-461, issn 0178-4617, 40 p.Article

Small pseudo-random families of matrices: Derandomizing approximate quantum encryptionAMBAINIS, Andris; SMITH, Adam.Lecture notes in computer science. 2004, pp 249-260, issn 0302-9743, isbn 3-540-22894-2, 12 p.Conference Paper

The quantum communication complexity of samplingAMBAINIS, Andris; SCHULMAN, Leonard J; TA-SHMA, Amnon et al.SIAM journal on computing (Print). 2003, Vol 32, Num 6, pp 1570-1585, issn 0097-5397, 16 p.Article

Algebraic results on Quantum automataAMBAINIS, Andris; BEAUDRY, Martin; GOLOVKINS, Marats et al.Lecture notes in computer science. 2004, pp 93-104, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper

Multiparty quantum coin flippingAMBAINIS, Andris; BUHRMAN, Harry; DODIS, Yevgeniy et al.IEEE Conference on Computational Complexity. 2004, pp 250-259, isbn 0-7695-2120-7, 1Vol, 10 p.Conference Paper