Jun Tarui

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Kazuyuki Amano

> Home > Persons > Jun Tarui

Publications

2011
[j11]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/AmanoT11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AmanoT11
Kazuyuki Amano, Jun Tarui:
A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds. Theor. Comput. Sci. 412(18): 1646-1651 (2011)
2008
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/tamc/AmanoT08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tamc/AmanoT08
Kazuyuki Amano, Jun Tarui:
A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type Bounds. TAMC 2008: 342-350
2003
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/AmanoMT03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AmanoMT03
Kazuyuki Amano, Akira Maruoka, Jun Tarui:
On the negation-limited circuit complexity of merging. Discret. Appl. Math. 126(1): 3-8 (2003)
1999
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/AmanoMT99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/AmanoMT99
Kazuyuki Amano, Akira Maruoka, Jun Tarui:
On the Negation-Limited Circuit Complexity of Merging. COCOON 1999: 204-209

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.