( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Space-Efficient Algorithms for Longest Increasing Subsequence.

, , , , и . STACS, том 96 из LIPIcs, стр. 44:1-44:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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.

Jun Jun Lu

Meta Jun

Jun Yamamoto

Jun Li

Jun Yang

 

Другие публикации лиц с тем же именем

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