Jun Tarui
Titolo
Citata da
Citata da
Anno
On acc
R Beigel, J Tarui
Computational Complexity 4 (4), 350-366, 1994
2461994
Probabilistic polynomials, AC0 functions and the polynomial-time hierarchy
J Tarui
Theoretical computer science 113 (1), 167-183, 1993
103*1993
Depth-First Search Using Bits
T Asano, T Izumi, M Kiyomi, M Konagaya, H Ono, Y Otachi, P Schweitzer, ...
International Symposium on Algorithms and Computation, 553-564, 2014
322014
The asymptotic complexity of merging networks
PB Miltersen, M Paterson, J Tarui
Journal of the ACM (JACM) 43 (1), 147-165, 1996
291996
Learning DNF by approximating inclusion-exclusion formulae
J Tarui, T Tsukiji
Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity …, 1999
281999
On permutations with limited independence
T Itoh, Y Takei, J Tarui
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms …, 2000
222000
Finding relevant variables in PAC model with membership queries
D Guijarro, J Tarui, T Tsukiji
International Conference on Algorithmic Learning Theory, 313-322, 1999
221999
Towards optimal two-dimensional indexing for constraint databases
E Bertino, B Catania, B Shidlovsky
Information Processing Letters 64 (1), 1-8, 1997
211997
Degree complexity of Boolean functions and its applications to relativized separations
J Tarui
1991 Proceedings of the Sixth Annual Structure in Complexity Theory …, 1991
211991
On the sample size of k-restricted min-wise independent permutations and other k-wise distributions
T Itoh, Y Takei, J Tarui
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
182003
On the sample size of k-restricted min-wise independent permutations and other k-wise distributions
T Itoh, Y Takei, J Tarui
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
182003
On the negation-limited circuit complexity of merging
K Amano, A Maruoka, J Tarui
Discrete Applied Mathematics 126 (1), 3-8, 2003
172003
On probabilistic ACC circuits with an exact-threshold output gate
R Beigel, J Tarui, S Toda
International Symposium on Algorithms and Computation, 420-429, 1992
171992
Finding a duplicate and a missing item in a stream
J Tarui
International Conference on Theory and Applications of Models of Computation …, 2007
102007
A well-mixed function with circuit complexity 5n: Tightness of the Lachish–Raz-type bounds
K Amano, J Tarui
Theoretical computer science 412 (18), 1646-1651, 2011
92011
On the minimum number of completely 3-scrambling permutations
J Tarui
Discrete mathematics 308 (8), 1350-1354, 2008
92008
On complexity of computing the permanent of a rectangular matrix
T Kawabata, J Tarui
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 1999
91999
Computing symmetric functions with AND/OR circuits and a single MAJORITY gate
ZL Zhang, DAM Barrington, J Tarui
Annual Symposium on Theoretical Aspects of Computer Science, 535-544, 1993
91993
Smallest formulas for the parity of 2k variables are essentially unique
J Tarui
Theoretical computer science 411 (26-28), 2623-2627, 2010
82010
Negation-limited complexity of parity and inverters
K Iwama, H Morizumi, J Tarui
Algorithmica 54 (2), 256-267, 2009
62009
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20