|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 26 occurrences of 23 keywords
|
|
|
|
|
Results
Found 31 publication records. Showing 31 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Kazuyuki Amano, Jun Tarui |
A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds.  |
Theor. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Akinobu Miyata, Jun Tarui, Etsuji Tomita |
Learning Boolean functions in AC0 on attribute and classification noise - Estimating an upper bound on attribute and classification noise. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitsunori Ogihara, Jun Tarui (eds.) |
Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Tarui |
Smallest formulas for the parity of 2k variables are essentially unique. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroki Morizumi, Jun Tarui |
Linear-size log-depth negation-limited inverter for k-tonic binary sequences. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Hiroki Morizumi, Jun Tarui |
Negation-Limited Complexity of Parity and Inverters. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Negation-limited circuit, Parity function, Inversion complexity, Gate elimination, Circuit complexity, Inverter |
| 1 | Kazuo Iwama, Hiroki Morizumi, Jun Tarui |
Reductions for monotone Boolean circuits. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Tarui |
On the minimum number of completely 3-scrambling permutations. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Jun Tarui |
A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type Bounds. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Tarui |
Smallest Formulas for Parity of 2k. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroki Morizumi, Jun Tarui |
Linear-Size Log-Depth Negation-Limited Inverter for k -Tonic Binary Sequences. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
negation-limited circuit, k-tonic, circuit complexity, inverter |
| 1 | Jun Tarui |
Finding a Duplicate and a Missing Item in a Stream. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
finding duplicate, finding missing item, communication complexity, proof complexity, Data stream algorithm, pigeonhole principle |
| 1 | Kazuo Iwama, Hiroki Morizumi, Jun Tarui |
Negation-Limited Complexity of Parity and Inverters. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Akinobu Miyata, Jun Tarui, Etsuji Tomita |
Learning Boolean Functions in AC0 on Attribute and Classification Noise. |
ALT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka, Jun Tarui |
On the negation-limited circuit complexity of merging. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Tarui, Toshiya Itoh, Yoshinori Takei |
A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshiya Itoh, Yoshinori Takei, Jun Tarui |
On the sample size of k-restricted min-wise independent permutations and other k-wise distributions. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
higher incidence matrices, linear algebra methods, min-wise independent permutations, k-wise independence |
| 1 | Toshiya Itoh, Yoshinori Takei, Jun Tarui |
On permutations with limited independence. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | David Guijarro, Jun Tarui, Tatsuie Tsukiji |
Finding Relevant Variables in PAC Model with Membership Queries. |
ATL |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka, Jun Tarui |
On the Negation-Limited Circuit Complexity of Merging. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Tarui, Seinosuke Toda |
Some Observations on the Computational Complexity of Graph Accessibility Problem. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Tarui, Tatsuie Tsukiji |
Learning DNF by Approximating Inclusion-Exclusion Formulae. (PDF / PS) |
IEEE Conference on Computational Complexity |
1999 |
DBLP DOI BibTeX RDF |
Inclusion-exclusion formula, PAC Learning, DNF |
| 1 | Peter Bro Miltersen, Mike Paterson, Jun Tarui |
The Asymptotic Complexity of Merging Networks. |
J. ACM |
1996 |
DBLP DOI BibTeX RDF |
sorting, merging, comparator network |
| 1 | Richard Beigel, Jun Tarui |
On ACC. |
Computational Complexity |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Tarui |
Probablistic Polynomials, AC0 Functions, and the Polynomial-Time Hierarchy. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhi-Li Zhang, David A. Mix Barrington, Jun Tarui |
Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY Gate. |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bro Miltersen, Mike Paterson, Jun Tarui |
The Asymptotic Complexity of Merging Networks |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
merging networks, monotone Boolean circuits, lower bound, permutations, upper bound, switching networks, comparators, comparator network, asymptotic complexity |
| 1 | Richard Beigel, Jun Tarui, Seinosuke Toda |
On Probabilistic ACC Circuits with an Exact-Threshold Output Gate. |
ISAAC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Tarui |
Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy. |
STACS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Beigel, Jun Tarui |
On ACC |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
modulus-amplifying polynomials, ACC, depth-2 probabilistic circuits, symmetric gate, depth-2 deterministic circuits, language, root, fan-in, AND gates, leaves |
| 1 | Jun Tarui |
Degree Compexity of Boolean Functions and Its Applications to Realivized Separations. |
Structure in Complexity Theory Conference |
1991 |
DBLP BibTeX RDF |
|
Displaying result #1 - #31 of 31 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")