Aleksandrs Belovs Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Aleksandrs Belovs, Robert Spalek: Adversary lower bound for the k-sum problem. ITCS 2013: 323-328
2012
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Aleksandrs Belovs, Ben W. Reichardt: Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection. ESA 2012: 193-204
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Aleksandrs Belovs: Learning-Graph-Based Quantum Algorithm for k-Distinctness. FOCS 2012: 207-216
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Aleksandrs Belovs: Span programs for functions with constant-sized 1-certificates: extended abstract. STOC 2012: 77-84
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Aleksandrs Belovs: Adversary Lower Bound for Element Distinctness. CoRR abs/1204.5074 (2012)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Aleksandrs Belovs, Robert Spalek: Adversary Lower Bound for the k-sum Problem. CoRR abs/1206.6528 (2012)
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Aleksandrs Belovs: On the Power of Non-Adaptive Learning Graphs. CoRR abs/1210.3279 (2012)
2011
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Aleksandrs Belovs: Span-program-based quantum algorithm for the rank problem. CoRR abs/1103.0842 (2011)
2008
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Aleksandrs Belovs: Some Algebraic Properties of Machine Poset of Infinite Words. ITA 42(3): 451-466 (2008)
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Aleksandrs Belovs, Juris Smotrovs: A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases. MMICS 2008: 50-69
2007
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs: Multi-letter Reversible and Quantum Finite Automata. Developments in Language Theory 2007: 60-71
2006
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Aleksandrs Belovs: Non-intersecting Complexity. SOFSEM 2006: 158-165
2003
c1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andris Ambainis, Uldis Barbans, Agnese Belousova, Aleksandrs Belovs, Ilze Dzelme, Girts Folkmanis, Rusins Freivalds, Peteris Ledins, Rihards Opmanis, Agnis Skuskovniks: Size of Quantum Versus Deterministic Finite Automata. VLSI 2003: 303-308

Coauthor Index

1Andris Ambainis
[c1]
2Uldis Barbans
[c1]
3Agnese Belousova
[c1]
4Ilze Dzelme
[c1]
5Girts Folkmanis
[c1]
6Rusins Freivalds
[c1]
7Peteris Ledins
[c1]
8Rihards Opmanis
[c1]
9Ben Reichardt (Ben W. Reichardt)
[c7]
10Ansis Rosmanis
[c3]
11Agnis Skuskovniks
[c1]
12Juris Smotrovs
[c4] [c3]
13Robert Spalek
[c8] [i3]
Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Thu May 23 08:00:34 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page