Kaspars Balodis

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Vladislavs Klevickis

> Home > Persons > Kaspars Balodis

Publications

2023
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/qip/AmbainisBIKKPSSV23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/qip/AmbainisBIKKPSSV23
Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs:
Quantum bounds for 2D-grid and Dyck language. Quantum Inf. Process. 22(5): 194 (2023)
2020
[c14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/mfcs/AmbainisBIKKPSS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/AmbainisBIKKPSS20
Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs:
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. MFCS 2020: 8:1-8:14
[i10]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2007-03402
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2007-03402
Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs:
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. CoRR abs/2007.03402 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.