Akmal, Shyan; Jin, Ce Near-optimal quantum algorithms for string problems. (English) Zbl 07729244 Algorithmica 85, No. 8, 2260-2317 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{S. Akmal} and \textit{C. Jin}, Algorithmica 85, No. 8, 2260--2317 (2023; Zbl 07729244) Full Text: DOI arXiv
Le Gall, François; Seddighin, Saeed Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems. (English) Zbl 07680776 Algorithmica 85, No. 5, 1251-1286 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{F. Le Gall} and \textit{S. Seddighin}, Algorithmica 85, No. 5, 1251--1286 (2023; Zbl 07680776) Full Text: DOI arXiv
Li, Qian; Sun, Xiaoming; Zhang, Jialin On the optimality of tape merge of two lists with similar size. (English) Zbl 1442.68044 Algorithmica 82, No. 7, 2107-2132 (2020). MSC: 68P10 68Q17 PDFBibTeX XMLCite \textit{Q. Li} et al., Algorithmica 82, No. 7, 2107--2132 (2020; Zbl 1442.68044) Full Text: DOI Link
Carette, Titouan; Laurière, Mathieu; Magniez, Frédéric Extended learning graphs for triangle finding. (English) Zbl 1435.68227 Algorithmica 82, No. 4, 980-1005 (2020). MSC: 68R10 05C42 05C85 68Q12 PDFBibTeX XMLCite \textit{T. Carette} et al., Algorithmica 82, No. 4, 980--1005 (2020; Zbl 1435.68227) Full Text: DOI arXiv
Austrin, Per; Chung, Kai-Min; Mahmoody, Mohammad; Pass, Rafael; Seth, Karn On the impossibility of cryptography with tamperable randomness. (English) Zbl 1405.94041 Algorithmica 79, No. 4, 1052-1101 (2017). MSC: 94A60 PDFBibTeX XMLCite \textit{P. Austrin} et al., Algorithmica 79, No. 4, 1052--1101 (2017; Zbl 1405.94041) Full Text: DOI
Le Gall, François; Nakajima, Shogo Quantum algorithm for triangle finding in sparse graphs. (English) Zbl 1380.68188 Algorithmica 79, No. 3, 941-959 (2017). MSC: 68Q12 PDFBibTeX XMLCite \textit{F. Le Gall} and \textit{S. Nakajima}, Algorithmica 79, No. 3, 941--959 (2017; Zbl 1380.68188) Full Text: DOI arXiv
Jeffery, Stacey; Magniez, Frederic; de Wolf, Ronald Optimal parallel quantum query algorithms. (English) Zbl 1372.68107 Algorithmica 79, No. 2, 509-529 (2017). MSC: 68Q12 68W10 PDFBibTeX XMLCite \textit{S. Jeffery} et al., Algorithmica 79, No. 2, 509--529 (2017; Zbl 1372.68107) Full Text: DOI arXiv
Montanaro, Ashley Quantum pattern matching fast on average. (English) Zbl 1359.68093 Algorithmica 77, No. 1, 16-39 (2017). MSC: 68Q12 PDFBibTeX XMLCite \textit{A. Montanaro}, Algorithmica 77, No. 1, 16--39 (2017; Zbl 1359.68093) Full Text: DOI arXiv
Deligkas, Argyrios; Fearnley, John; Savani, Rahul; Spirakis, Paul Computing approximate Nash equilibria in polymatrix games. (English) Zbl 1358.91007 Algorithmica 77, No. 2, 487-514 (2017). MSC: 91A06 91A10 91A15 PDFBibTeX XMLCite \textit{A. Deligkas} et al., Algorithmica 77, No. 2, 487--514 (2017; Zbl 1358.91007) Full Text: DOI
Lee, Troy; Magniez, Frédéric; Santha, Miklos Improved quantum query algorithms for triangle detection and associativity testing. (English) Zbl 1359.68091 Algorithmica 77, No. 2, 459-486 (2017). MSC: 68Q12 PDFBibTeX XMLCite \textit{T. Lee} et al., Algorithmica 77, No. 2, 459--486 (2017; Zbl 1359.68091) Full Text: DOI
Göös, Mika; Pitassi, Toniann; Watson, Thomas Zero-information protocols and unambiguity in Arthur-Merlin communication. (English) Zbl 1352.94004 Algorithmica 76, No. 3, 684-719 (2016). MSC: 94A05 68Q15 68Q17 68M12 PDFBibTeX XMLCite \textit{M. Göös} et al., Algorithmica 76, No. 3, 684--719 (2016; Zbl 1352.94004) Full Text: DOI
Jeffery, Stacey; Kothari, Robin; Le Gall, François; Magniez, Frédéric Improving quantum query complexity of Boolean matrix multiplication using graph collision. (English) Zbl 1353.68096 Algorithmica 76, No. 1, 1-16 (2016). MSC: 68Q12 PDFBibTeX XMLCite \textit{S. Jeffery} et al., Algorithmica 76, No. 1, 1--16 (2016; Zbl 1353.68096) Full Text: DOI arXiv
Krovi, Hari; Magniez, Frédéric; Ozols, Maris; Roland, Jérémie Quantum walks can find a marked element on any graph. (English) Zbl 1336.68083 Algorithmica 74, No. 2, 851-907 (2016). MSC: 68Q12 68R10 81P68 PDFBibTeX XMLCite \textit{H. Krovi} et al., Algorithmica 74, No. 2, 851--907 (2016; Zbl 1336.68083) Full Text: DOI arXiv Link
Johannsen, Daniel; Kurur, Piyush P.; Lengler, Johannes Evolutionary algorithms for quantum computers. (English) Zbl 1286.68152 Algorithmica 68, No. 1, 152-189 (2014). MSC: 68Q12 68T20 68P10 68Q10 68Q87 PDFBibTeX XMLCite \textit{D. Johannsen} et al., Algorithmica 68, No. 1, 152--189 (2014; Zbl 1286.68152) Full Text: DOI Link
Magniez, Frédéric; Nayak, Ashwin; Richter, Peter C.; Santha, Miklos On the hitting times of quantum versus random walks. (English) Zbl 1236.68072 Algorithmica 63, No. 1-2, 91-116 (2012). MSC: 68Q12 81P68 60G50 60J20 PDFBibTeX XMLCite \textit{F. Magniez} et al., Algorithmica 63, No. 1--2, 91--116 (2012; Zbl 1236.68072) Full Text: DOI arXiv
Ivanyos, Gábor; Sanselme, Luc; Santha, Miklos An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups. (English) Zbl 1236.68071 Algorithmica 62, No. 1-2, 480-498 (2012). MSC: 68Q12 20D15 81P68 PDFBibTeX XMLCite \textit{G. Ivanyos} et al., Algorithmica 62, No. 1--2, 480--498 (2012; Zbl 1236.68071) Full Text: DOI arXiv
Inui, Yoshifumi; Le Gall, François Quantum property testing of group solvability. (English) Zbl 1206.68126 Algorithmica 59, No. 1, 35-47 (2011). MSC: 68Q12 20D10 PDFBibTeX XMLCite \textit{Y. Inui} and \textit{F. Le Gall}, Algorithmica 59, No. 1, 35--47 (2011; Zbl 1206.68126) Full Text: DOI arXiv
Chen, Xi; Sun, Xiaoming; Teng, Shang-Hua Quantum separation of local search and fixed point computation. (English) Zbl 1187.68179 Algorithmica 56, No. 3, 364-382 (2010). MSC: 68P10 68Q17 PDFBibTeX XMLCite \textit{X. Chen} et al., Algorithmica 56, No. 3, 364--382 (2010; Zbl 1187.68179) Full Text: DOI
Sun, Xiaoming; Yao, Andrew Chi-Chih On the quantum query complexity of local search in two and three dimensions. (English) Zbl 1192.68283 Algorithmica 55, No. 3, 576-600 (2009). MSC: 68Q10 81P68 68Q17 PDFBibTeX XMLCite \textit{X. Sun} and \textit{A. C. C. Yao}, Algorithmica 55, No. 3, 576--600 (2009; Zbl 1192.68283) Full Text: DOI
Santha, Miklos; Szegedy, Mario Quantum and classical query complexities of local search are polynomially related. (English) Zbl 1191.68310 Algorithmica 55, No. 3, 557-575 (2009). MSC: 68Q05 68Q10 68Q25 81P68 PDFBibTeX XMLCite \textit{M. Santha} and \textit{M. Szegedy}, Algorithmica 55, No. 3, 557--575 (2009; Zbl 1191.68310) Full Text: DOI
Ambainis, Andris; Špalek, Robert; de Wolf, Ronald A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs. (English) Zbl 1191.68314 Algorithmica 55, No. 3, 422-461 (2009). MSC: 68Q10 68Q05 81P68 68W05 PDFBibTeX XMLCite \textit{A. Ambainis} et al., Algorithmica 55, No. 3, 422--461 (2009; Zbl 1191.68314) Full Text: DOI arXiv
Chen, Xi; Deng, Xiaotie A simplicial approach for discrete fixed point theorems. (English) Zbl 1176.58003 Algorithmica 53, No. 2, 250-262 (2009). Reviewer: Nicoleta Negoescu (Iaşi) MSC: 58C30 PDFBibTeX XMLCite \textit{X. Chen} and \textit{X. Deng}, Algorithmica 53, No. 2, 250--262 (2009; Zbl 1176.58003) Full Text: DOI
Bang-Jensen, J.; El Haddad, M.; Manoussakis, Y.; Przytycka, T. M. Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs. (English) Zbl 0864.68049 Algorithmica 17, No. 1, 67-87 (1997). MSC: 68W15 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Algorithmica 17, No. 1, 67--87 (1997; Zbl 0864.68049) Full Text: DOI
Zuckerman, D. Simulating BPP using a general weak random source. (English) Zbl 0857.68121 Algorithmica 16, No. 4-5, 367-391 (1996). MSC: 68U20 68R10 PDFBibTeX XMLCite \textit{D. Zuckerman}, Algorithmica 16, No. 4--5, 367--391 (1996; Zbl 0857.68121) Full Text: DOI