Jun Tarui

Tatsuie Tsukiji, Jun Tarui, 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

On the Negation-Limited Circuit Complexity of Merging

Jun Tarui, Akira Maruoka, Kazuyuki Amano, 1999, COCOON.

Smallest formulas for the parity of 2k variables are essentially unique

Jun Tarui, J. Tarui, 2010, Theor. Comput. Sci..

A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds

Jun Tarui, Kazuyuki Amano, 2011, Theor. Comput. Sci..

Space-Efficient Algorithms for Longest Increasing Subsequence

Yota Otachi, Masashi Kiyomi, Hirotaka Ono, 2018, STACS.

Finding Relevant Variables in PAC Model with Membership Queries

Tatsuie Tsukiji, Jun Tarui, David Guijarro, 1999, ALT.

On ACC (circuit complexity)

Richard Beigel, Jun Tarui, R. Beigel, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

Learning Boolean Functions in AC0 on Attribute and Classification Noise

Etsuji Tomita, Jun Tarui, Akinobu Miyata, 2004, ALT.

Space-Efficient Algorithms for Longest Increasing Subsequence

Yota Otachi, Masashi Kiyomi, Hirotaka Ono, 2017, Theory of Computing Systems.

Theory and Applications of Models of Computation 2011

Mitsunori Ogihara, Jun Tarui, 2013, Theor. Comput. Sci..

Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy

Jun Tarui, 1991, STACS.

Linear-Size Log-Depth Negation-Limited Inverter for k -Tonic Binary Sequences

Hiroki Morizumi, Jun Tarui, Hiroki Morizumi, 2007, Theory and Applications of Models of Computation.

Reductions for monotone Boolean circuits

Kazuo Iwama, Hiroki Morizumi, Jun Tarui, 2008, Theor. Comput. Sci..

A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries

Yoshinori Takei, Toshiya Itoh, Jun Tarui, 2003, RANDOM-APPROX.

Negation-Limited Complexity of Parity and Inverters

Kazuo Iwama, Hiroki Morizumi, Jun Tarui, 2006, ISAAC.

Some Observations on the Computational Complexity of Graph Accessibility Problem

Seinosuke Toda, Jun Tarui, 1999, COCOON.

On the minimum number of completely 3-scrambling permutations

Jun Tarui, 2008, Discret. Math..

On Probabilistic ACC Circuits with an Exact-Threshold Output Gate

Richard Beigel, Seinosuke Toda, Jun Tarui, 1992, ISAAC.

Smallest Formulas for Parity of 2k

Jun Tarui, 2008, COCOON.

Finding a Duplicate and a Missing Item in a Stream

Jun Tarui, J. Tarui, 2007, TAMC.

The asymptotic complexity of merging networks

Peter Bro Miltersen, Mike Paterson, Jun Tarui, 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

On the negation-limited circuit complexity of merging

Jun Tarui, Akira Maruoka, Kazuyuki Amano, 2003, Discret. Appl. Math..

On Complexity of Computing the Permanent of a Rectangular Matrix (Special Section on Discrete Mathematics and Its Applications)

Tsutomu Kawabata, Jun Tarui, 1999 .