Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="{\c{K}}ikusts, Arnolds"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algebraic results on quantum automata
Andris Ambainis
,
Martin Beaudry
,
Marats Golovkins
,
Arnolds Ķikusts
,
Mark Mercer
,
Denis Thérien
Theory of Computing Systems
39
(1), 2006, pp. 165-188
Algebraic results on quantum automata
Andris Ambainis
,
Martin Beaudry
,
Marats Golovkins
,
Arnolds Ķikusts
,
Mark Mercer
,
Denis Thérien
Lecture Notes in Computer Science
2996
, 2004, pp. 93-104
Exact results for accepting probabilities of quantum automata
Andris Ambainis
,
Arnolds Ķikusts
Theoretical Computer Science
295
(1-3), 2003, pp. 3-25
On the class of languages recognizable by 1-way quantum finite automata
Andris Ambainis
,
Arnolds Ķikusts
,
Māris Valdats
Lecture Notes in Computer Science
2010
, 2001, pp. 75-86
Exact results for accepting probabilities of quantum automata
Andris Ambainis
,
Arnolds Ķikusts
Lecture Notes in Computer Science
2136
, 2001, pp. 135-147
Probabilities to accept languages by quantum finite automata
Andris Ambainis
,
Richard Bonner
,
Rūsiņs̑ Freivalds
,
Arnolds Ķikusts
Lecture Notes in Computer Science
1627
, 1999, pp. 174-183