Jun Tarui - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type boundsKazuyuki Amano, Jun Tarui. TCS, 412(18):1646-1651, 2011. [doi]

Learning Boolean functions in AC:::0::: on attribute and classification noise - Estimating an upper bound on attribute and classification noiseAkinobu Miyata, Jun Tarui, Etsuji Tomita. TCS, 412(35):4650-4660, 2011. [doi]

Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. ProceedingsMitsunori Ogihara, Jun Tarui, editors, Volume 6648 of Lecture Notes in Computer Science, Springer, 2011. [doi]

2010

Smallest formulas for the parity of 2:::k::: variables are essentially uniqueJun Tarui. TCS, 411(26-28):2623-2627, 2010. [doi]

2009

Negation-Limited Complexity of Parity and InvertersKazuo Iwama, Hiroki Morizumi, Jun Tarui. algorithmica, 54(2):256-267, 2009. [doi]

Linear-size log-depth negation-limited inverter for k-tonic binary sequencesHiroki Morizumi, Jun Tarui. TCS, 410(11):1054-1060, 2009. [doi]

2008

A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type BoundsKazuyuki Amano, Jun Tarui. tamc 2008: 342-350 [doi]

Reductions for monotone Boolean circuitsKazuo Iwama, Hiroki Morizumi, Jun Tarui. TCS, 408(2-3):208-212, 2008. [doi]

Smallest Formulas for Parity of 2kJun Tarui. cocoon 2008: 92-99 [doi]

On the minimum number of completely 3-scrambling permutationsJun Tarui. DM, 308(8):1350-1354, 2008. [doi]

2007

Linear-Size Log-Depth Negation-Limited Inverter for ::::k:::: -Tonic Binary SequencesHiroki Morizumi, Jun Tarui. tamc 2007: 605-615 [doi]

Finding a Duplicate and a Missing Item in a StreamJun Tarui. tamc 2007: 128-135 [doi]

2006

Negation-Limited Complexity of Parity and InvertersKazuo Iwama, Hiroki Morizumi, Jun Tarui. isaac 2006: 223-232 [doi]

2004

Learning Boolean Functions in AC:::0::: on Attribute and Classification NoiseAkinobu Miyata, Jun Tarui, Etsuji Tomita. alt 2004: 142-155 [doi]

2003

On the negation-limited circuit complexity of mergingKazuyuki Amano, Akira Maruoka, Jun Tarui. DAM, 126(1):3-8, 2003.

On the sample size of k-restricted min-wise independent permutations and other k-wise distributionsToshiya Itoh, Yoshinori Takei, Jun Tarui. stoc 2003: 710-719 [doi]

A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite GeometriesJun Tarui, Toshiya Itoh, Yoshinori Takei. random 2003: 396-408 [doi]

2000

On permutations with limited independenceToshiya Itoh, Yoshinori Takei, Jun Tarui. soda 2000: 137-146 [doi]

1999

1996

The Asymptotic Complexity of Merging NetworksPeter Bro Miltersen, Mike Paterson, Jun Tarui. JACM, 43(1):147-165, 1996. [doi]

1994

On ACCRichard Beigel, Jun Tarui. cc, 4:350-366, 1994.

1993

Probablistic Polynomials, AC0 Functions, and the Polynomial-Time HierarchyJun Tarui. TCS, 113(1):167-183, 1993.

Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY GateZhi-Li Zhang, David A. Mix Barrington, Jun Tarui. STACS 1993: 535-544

1992

On Probabilistic ACC Circuits with an Exact-Threshold Output GateRichard Beigel, Jun Tarui, Seinosuke Toda. isaac 1992: 420-429

The Asymptotic Complexity of Merging NetworksPeter Bro Miltersen, Mike Paterson, Jun Tarui. focs 1992: 236-246

1991

On ACCRichard Beigel, Jun Tarui. focs 1991: 783-792

Randomized Polynomials, Threshold Circuits, and the Polynomial HierarchyJun Tarui. STACS 1991: 238-250

Degree Compexity of Boolean Functions and Its Applications to Realivized SeparationsJun Tarui. cocoon 1991: 382-390