The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tomoyuki Yamakami: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tomoyuki Yamakami
    Nearly Bounded Error Probabilistic Sets. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:213-226 [Conf]
  2. Lance Fortnow, Tomoyuki Yamakami
    Generic Separations. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:139-145 [Conf]
  3. Jeffrey C. Jackson, Christino Tamon, Tomoyuki Yamakami
    Quantum DNF Learnability Revisited. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:595-604 [Conf]
  4. Rainer Schuler, Tomoyuki Yamakami
    Sets Computable in Polynomial Time on Average. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:400-409 [Conf]
  5. Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami
    Computational Indistinguishability Between Quantum States and Its Cryptographic Application. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:268-284 [Conf]
  6. Tomoyuki Yamakami
    Collapsing Recursive Oracles for Relativized Polynomial Hierarchies. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:149-160 [Conf]
  7. Rainer Schuler, Tomoyuki Yamakami
    Structural Average Case Complexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:128-139 [Conf]
  8. Tomoyuki Yamakami
    Analysis of Quantum Functions (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:407-419 [Conf]
  9. Akinori Kawachi, Tomoyuki Yamakami
    Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:216-227 [Conf]
  10. Toshio Suzuki, Tomoyuki Yamakami
    Resource Bounded Immunity and Simplicity. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:81-96 [Conf]
  11. Tomoyuki Yamakami
    Quantum NP and Quantum Hierarchy. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:323-336 [Conf]
  12. Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
    Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:189-198 [Conf]
  13. Tomoyuki Yamakami
    Computational Complexity Measures of Multipartite Quantum Entanglement. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:117-128 [Conf]
  14. Harumichi Nishimura, Tomoyuki Yamakami
    An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:827-838 [Conf]
  15. Tomoyuki Yamakami
    Polynomial Time Samplable Distributions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:566-578 [Conf]
  16. Tomoyuki Yamakami
    A Foundation of Programming a Multi-tape Quantum Turing Machine. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:430-441 [Conf]
  17. Kohtaro Tadaki, Tomoyuki Yamakami, Jack C. H. Lin
    Theory of One Tape Linear Time Turing Machines. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2004, pp:335-348 [Conf]
  18. Christino Tamon, Tomoyuki Yamakami
    Quantum Computation Relative to Oracles. [Citation Graph (0, 0)][DBLP]
    UMC, 2000, pp:273-288 [Conf]
  19. Tomoyuki Yamakami
    Quantum Optimization Problems. [Citation Graph (0, 0)][DBLP]
    UMC, 2002, pp:300-314 [Conf]
  20. Harumichi Nishimura, Tomoyuki Yamakami
    An Application of Quantum Finite Automata to Interactive Proof Systems. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:225-236 [Conf]
  21. Tomoyuki Yamakami
    Polynomial Games and Determinacy. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:80, n:1, pp:1-16 [Journal]
  22. Kohtaro Tadaki, Tomoyuki Yamakami, Jack C. H. Lin
    Theory of One Tape Linear Time Turing Machines [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  23. Tomoyuki Yamakami, Toshio Suzuki
    Resource Bounded Immunity and Simplicity [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  24. Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
    Quantum Certificate Verification: Single versus Multiple Quantum Certificates [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  25. Harumichi Nishimura, Tomoyuki Yamakami
    Polynomial time quantum computation with advice [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  26. Tomoyuki Yamakami
    Computational Complexity Measures of Multipartite Quantum Entanglement [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  27. Harumichi Nishimura, Tomoyuki Yamakami
    An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  28. Harumichi Nishimura, Tomoyuki Yamakami
    An Application of Quantum Finite Automata to Interactive Proof Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  29. Tomoyuki Yamakami, Andrew Chi-Chih Yao
    NQPC = co-C=P [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  30. Tomoyuki Yamakami
    A Foundation of Programming a Multi-Tape Quantum Turing machine [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  31. Tomoyuki Yamakami
    Analysis of Quantum Functions [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  32. Harumichi Nishimura, Tomoyuki Yamakami
    Polynomial time quantum computation with advice [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:059, pp:- [Journal]
  33. Tomoyuki Yamakami, Toshio Suzuki
    Resource Bounded Immunity and Simplicity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:066, pp:- [Journal]
  34. Tomoyuki Yamakami, Harumichi Nishimura
    An Application of Quantum Finite Automata to Interactive Proof Systems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:110, pp:- [Journal]
  35. Tomoyuki Yamakami
    Polynomial Time Samplable Distributions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:39, pp:- [Journal]
  36. Tomoyuki Yamakami, Andrew Chi-Chih Yao
    NQP = co-C=P [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:73, pp:- [Journal]
  37. Stephen A. Cook, Russell Impagliazzo, Tomoyuki Yamakami
    A Tight Relationship Between Generic Oracles and Type-2 Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:137, n:2, pp:159-170 [Journal]
  38. Tomoyuki Yamakami
    Feasible Computability and Resource Bounded Topology [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:116, n:2, pp:214-230 [Journal]
  39. Tomoyuki Yamakami
    Analysis Of Quantum Functions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:5, pp:815-852 [Journal]
  40. Harumichi Nishimura, Tomoyuki Yamakami
    Polynomial time quantum computation with advice. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:4, pp:195-204 [Journal]
  41. Tomoyuki Yamakami, Andrew Chi-Chih Yao
    NQPC = co-C=P. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:2, pp:63-69 [Journal]
  42. Tomoyuki Yamakami
    Polynomial Time Samplable Distributions. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1999, v:15, n:4, pp:557-574 [Journal]
  43. Lance Fortnow, Tomoyuki Yamakami
    Generic Separations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:1, pp:191-197 [Journal]
  44. Rainer Schuler, Tomoyuki Yamakami
    Structural Average Case Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:2, pp:308-348 [Journal]
  45. Tomoyuki Yamakami
    Structural Properties for Feasibly Computable Classes of Type Two. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1992, v:25, n:3, pp:177-201 [Journal]
  46. Tomoyuki Yamakami, Toshio Suzuki
    Resource bounded immunity and simplicity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:1-2, pp:90-129 [Journal]
  47. Akinori Kawachi, Tomoyuki Yamakami
    Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  48. Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate. [Citation Graph (, )][DBLP]


  49. The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract). [Citation Graph (, )][DBLP]


  50. Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks [Citation Graph (, )][DBLP]


  51. Swapping Lemmas for Regular and Context-Free Languages with Advice [Citation Graph (, )][DBLP]


  52. Immunity and Pseudorandomness of Context-Free Languages [Citation Graph (, )][DBLP]


  53. Pseudorandom Generators against CFL/n [Citation Graph (, )][DBLP]


  54. Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems [Citation Graph (, )][DBLP]


  55. The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata [Citation Graph (, )][DBLP]


  56. A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs [Citation Graph (, )][DBLP]


  57. Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
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