The SCEAS System
Navigation Menu

Search the dblp DataBase


Jun Tarui: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Guijarro, Jun Tarui, Tatsuie Tsukiji
    Finding Relevant Variables in PAC Model with Membership Queries. [Citation Graph (0, 0)][DBLP]
    ATL, 1999, pp:313-0 [Conf]
  2. Akinobu Miyata, Jun Tarui, Etsuji Tomita
    Learning Boolean Functions in AC0 on Attribute and Classification Noise. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:142-155 [Conf]
  3. Jun Tarui
    Degree Compexity of Boolean Functions and Its Applications to Realivized Separations. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:382-390 [Conf]
  4. Jun Tarui, Tatsuie Tsukiji
    Learning DNF by Approximating Inclusion-Exclusion Formulae. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:215-0 [Conf]
  5. Kazuyuki Amano, Akira Maruoka, Jun Tarui
    On the Negation-Limited Circuit Complexity of Merging. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:204-209 [Conf]
  6. Jun Tarui, Seinosuke Toda
    Some Observations on the Computational Complexity of Graph Accessibility Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:18-30 [Conf]
  7. Richard Beigel, Jun Tarui
    On ACC [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:783-792 [Conf]
  8. Peter Bro Miltersen, Mike Paterson, Jun Tarui
    The Asymptotic Complexity of Merging Networks [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:236-246 [Conf]
  9. Richard Beigel, Jun Tarui, Seinosuke Toda
    On Probabilistic ACC Circuits with an Exact-Threshold Output Gate. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:420-429 [Conf]
  10. Kazuo Iwama, Hiroki Morizumi, Jun Tarui
    Negation-Limited Complexity of Parity and Inverters. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:223-232 [Conf]
  11. Jun Tarui, Toshiya Itoh, Yoshinori Takei
    A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:396-408 [Conf]
  12. Toshiya Itoh, Yoshinori Takei, Jun Tarui
    On permutations with limited independence. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:137-146 [Conf]
  13. Jun Tarui
    Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:238-250 [Conf]
  14. Zhi-Li Zhang, David A. Mix Barrington, Jun Tarui
    Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY Gate. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:535-544 [Conf]
  15. Toshiya Itoh, Yoshinori Takei, Jun Tarui
    On the sample size of k-restricted min-wise independent permutations and other k-wise distributions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:710-719 [Conf]
  16. Richard Beigel, Jun Tarui
    On ACC. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:350-366 [Journal]
  17. Kazuyuki Amano, Akira Maruoka, Jun Tarui
    On the negation-limited circuit complexity of merging. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:1, pp:3-8 [Journal]
  18. Peter Bro Miltersen, Mike Paterson, Jun Tarui
    The Asymptotic Complexity of Merging Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:1, pp:147-165 [Journal]
  19. Jun Tarui
    Probablistic Polynomials, AC0 Functions, and the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:113, n:1, pp:167-183 [Journal]
  20. Hiroki Morizumi, Jun Tarui
    Linear-Size Log-Depth Negation-Limited Inverter for k -Tonic Binary Sequences. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:605-615 [Conf]
  21. Jun Tarui
    Finding a Duplicate and a Missing Item in a Stream. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:128-135 [Conf]

  22. Smallest Formulas for Parity of 2k. [Citation Graph (, )][DBLP]

  23. A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type Bounds. [Citation Graph (, )][DBLP]

  24. Negation-Limited Complexity of Parity and Inverters. [Citation Graph (, )][DBLP]

  25. On the minimum number of completely 3-scrambling permutations. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002