Generation Mechanisms in Graphical Template Language. - Elina Kalnina; Audris Kalnins; Edgars Celms; Agris Sostaks; Janis Iraids (MDA/MTDD, 2010)

Solving the TTC 2011 Reengineering Case with MOLA and Higher-Order Transformations - Agris Sostaks; Elina Kalnina; Audris Kalnins; Edgars Celms; Janis Iraids (TTC, 2011)

Saying Hello World with MOLA - A Solution to the TTC 2011 Instructive Case - Elina Kalnina; Audris Kalnins; Agris Sostaks; Janis Iraids; Edgars Celms (TTC, 2011)

Advantage of Quantum Strategies in Random Symmetric XOR Games. - Andris Ambainis; Janis Iraids; Dmitry Kravchenko; Madars Virza (MEMICS, 2012)

Tree Based Domain-Specific Mapping Languages. - Elina Kalnina; Audris Kalnins; Agris Sostaks; Edgars Celms; Janis Iraids (SOFSEM, 2012)

Provable Advantage for Quantum Strategies in Random Symmetric XOR Games. - Andris Ambainis; Janis Iraids (TQC, 2013)

Exact Quantum Query Complexity of EXACT and THRESHOLD. - Andris Ambainis; Janis Iraids; Juris Smotrovs (TQC, 2013)

Parameterized Quantum Query Complexity of Graph Collision - Andris Ambainis; Kaspars Balodis; Janis Iraids; Raitis Ozols; Juris Smotrovs (CoRR, 2013)

Integer Complexity: Experimental and Analytical Results II. - Juris Cernenoks; Janis Iraids; Martins Opmanis; Rihards Opmanis; Karlis Podnieks (DCFS, 2015)

Structured Frequency Algorithms. - Kaspars Balodis; Janis Iraids; Rusins Freivalds (TAMC, 2015)

Polynomials, Quantum Query Complexity, and Grothendieck's Inequality. - Scott Aaronson; Andris Ambainis; Janis Iraids; Martins Kokainis; Juris Smotrovs (CCC, 2016)

Optimal One-shot Quantum Algorithm for EQUALITY and AND. - Andris Ambainis; Janis Iraids (Balt. J. Mod. Comput., 2016)

Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection. - Kaspars Balodis; Janis Iraids (Balt. J. Mod. Comput., 2016)

Exact quantum query complexity of EXACTk, ln. - Andris Ambainis; Janis Iraids; Daniel Nagaj (CoRR, 2016)

Exact Quantum Query Complexity of text EXACT_k, l^n. - Andris Ambainis; Janis Iraids; Daniel Nagaj (SOFSEM, 2017)

Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. - Andris Ambainis; Kaspars Balodis; Janis Iraids; Martins Kokainis; Krisjanis Prusis; Jevgenijs Vihrovs (SODA, 2019)

Quantum Lower Bounds for 2D-Grid and Dyck Language. - Andris Ambainis; Kaspars Balodis; Janis Iraids; Krisjanis Prusis; Juris Smotrovs (CoRR, 2019)

Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. - Andris Ambainis; Kaspars Balodis; Janis Iraids; Kamil Khadiev; Vladislavs Klevickis; Krisjanis Prusis; Yixin Shen 001; Juris Smotrovs; Jevgenijs Vihrovs (MFCS, 2020)

A Note About Claw Function with a Small Range. - Andris Ambainis; Kaspars Balodis; Janis Iraids (TQC, 2021)

Representing polynomial of CONNECTIVITY. - Janis Iraids; Juris Smotrovs (CoRR, 2021)

Representing polynomial of ST-CONNECTIVITY. - Janis Iraids; Juris Smotrovs (Discret. Math. Theor. Comput. Sci., 2023)

Quantum bounds for 2D-grid and Dyck language. - Andris Ambainis; Kaspars Balodis; Janis Iraids; Kamil Khadiev; Vladislavs Klevickis; Krisjanis Prusis; Yixin Shen 001; Juris Smotrovs; Jevgenijs Vihrovs (Quantum Inf. Process., 2023)