The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Howard Barnum: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Howard Barnum, Michael E. Saks, Mario Szegedy
    Quantum query complexity and semi-definite programming. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:179-193 [Conf]
  2. Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, Alain Tapp
    Authentication of Quantum Messages. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:449-458 [Conf]
  3. Howard Barnum, Michael E. Saks
    A lower bound on the quantum query complexity of read-once functions [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  4. Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, Alain Tapp
    Authentication of Quantum Messages [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  5. Howard Barnum, Michael E. Saks
    A lower bound on the quantum query complexity of read-once functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:002, pp:- [Journal]
  6. Xiaoyu Li, Howard Barnum
    Quantum Authentication Using Entangled States. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:4, pp:609-617 [Journal]
  7. Howard Barnum, Michael E. Saks
    A lower bound on the quantum query complexity of read-once functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:2, pp:244-258 [Journal]
  8. Howard Barnum, Emanuel Knill, Michael A. Nielsen
    On quantum fidelities and channel capacities. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1317-1329 [Journal]
  9. Howard Barnum
    Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  10. Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002