( en | de | ru )

 

Disambiguation of "Tarui, Jun"

Author of the publication

copydeleteadd this publication to your clipboard
Depth-First Search Using O(n) Bits.

, , , , , , , , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 553-564. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jun Jun Lu

Meta Jun

Jun Yamamoto

Jun Yang

Jun Yang

 

Other publications of authors with the same name

A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries., , and . RANDOM-APPROX, volume 2764 of Lecture Notes in Computer Science, page 396-408. Springer, (2003)Negation-Limited Complexity of Parity and Inverters., , and . ISAAC, volume 4288 of Lecture Notes in Computer Science, page 223-232. Springer, (2006)Learning Boolean Functions in AC0 on Attribute and Classification Noise., , and . ALT, volume 3244 of Lecture Notes in Computer Science, page 142-155. Springer, (2004)A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds., and . Theor. Comput. Sci., 412 (18): 1646-1651 (2011)Degree Compexity of Boolean Functions and Its Applications to Realivized Separations.. SCT, page 382-390. IEEE Computer Society, (1991)Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy.. STACS, volume 480 of Lecture Notes in Computer Science, page 238-250. Springer, (1991)Negation-Limited Complexity of Parity and Inverters., , and . Algorithmica, 54 (2): 256-267 (2009)Linear-size log-depth negation-limited inverter for k-tonic binary sequences., and . Theor. Comput. Sci., 410 (11): 1054-1060 (2009)The Asymptotic Complexity of Merging Networks, , and . FOCS, page 236-246. IEEE Computer Society, (1992)Depth-First Search Using O(n) Bits., , , , , , , , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 553-564. Springer, (2014)