Search the dblp DataBase
Richard F. Bonner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts
Probabilities to Accept Languages by Quantum Finite Automata. [Citation Graph (0, 0)][DBLP]
COCOON, 1999, pp:174-183 [Conf] - Aija Berzina, Richard F. Bonner
Ambainis-Freivalds' Algorithm for Measure-Once Automata. [Citation Graph (0, 0)][DBLP]
FCT, 2001, pp:83-93 [Conf] - Louis Sanzogni, Richard F. Bonner, Ringo Chan
Perceptrons with Polynomial Post-Processing. [Citation Graph (0, 0)][DBLP]
ICTAI, 1996, pp:472-474 [Conf] - Richard F. Bonner, Rusins Freivalds, Janis Lapins, Antra Lukjanska
Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages. [Citation Graph (0, 0)][DBLP]
MFCS, 1998, pp:213-219 [Conf] - Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Marats Golovkins, Marek Karpinski
Quantum Finite Multitape Automata. [Citation Graph (0, 0)][DBLP]
SOFSEM, 1999, pp:340-348 [Conf] - Richard F. Bonner, Rusins Freivalds, Maksim Kravtsev
Quantum versus Probabilistic One-Way Finite Automata with Counter. [Citation Graph (0, 0)][DBLP]
SOFSEM, 2001, pp:181-190 [Conf] - Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts
Probabilities to accept languages by quantum finite automata [Citation Graph (0, 0)][DBLP]
CoRR, 1999, v:0, n:, pp:- [Journal] - Louis Sanzogni, Ringo Chan, Richard F. Bonner
Perceptrons with polynomial post-processing. [Citation Graph (0, 0)][DBLP]
J. Exp. Theor. Artif. Intell., 2000, v:12, n:1, pp:57-68 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002