Jun Tarui

From MaRDI portal
Person:638532

Available identifiers

zbMath Open tarui.junMaRDI QIDQ638532

List of research outcomes





PublicationDate of PublicationType
Space-Efficient Algorithms for Longest Increasing Subsequence2020-08-05Paper
Space-efficient algorithms for longest increasing subsequence2020-04-15Paper
Depth-First Search Using $$O(n)$$ Bits2015-09-11Paper
Learning Boolean functions in \(AC^0\)on attribute and classification noise -- estimating an upper bound on attribute and classification noise2011-09-12Paper
A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds2011-04-05Paper
On the sample size of k -restricted min-wise independent permutations and other k -wise distributions2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35766512010-07-30Paper
https://portal.mardi4nfdi.de/entity/Q35767172010-07-30Paper
Smallest formulas for the parity of \(2^k\) variables are essentially unique2010-06-07Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques2010-05-26Paper
Negation-limited complexity of parity and inverters2009-06-22Paper
Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences2009-03-20Paper
Reductions for monotone Boolean circuits2008-12-12Paper
Smallest Formulas for Parity of 2 k Variables Are Essentially Unique2008-07-10Paper
A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds2008-05-27Paper
Negation-Limited Complexity of Parity and Inverters2008-04-24Paper
On the minimum number of completely 3-scrambling permutations2008-03-18Paper
Linear-Size Log-Depth Negation-Limited Inverter for k-Tonic Binary Sequences2007-11-13Paper
Finding a Duplicate and a Missing Item in a Stream2007-11-13Paper
Algorithmic Learning Theory2005-08-18Paper
On the negation-limited circuit complexity of merging2003-03-09Paper
https://portal.mardi4nfdi.de/entity/Q42303452002-01-17Paper
https://portal.mardi4nfdi.de/entity/Q49526102001-01-29Paper
https://portal.mardi4nfdi.de/entity/Q45053822000-09-27Paper
https://portal.mardi4nfdi.de/entity/Q49553212000-07-24Paper
https://portal.mardi4nfdi.de/entity/Q49386562000-07-20Paper
https://portal.mardi4nfdi.de/entity/Q49386662000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q47034651999-12-15Paper
https://portal.mardi4nfdi.de/entity/Q42467331999-06-15Paper
The asymptotic complexity of merging networks1998-01-19Paper
On ACC1995-04-06Paper
https://portal.mardi4nfdi.de/entity/Q42815561994-03-10Paper
Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy1993-10-17Paper
https://portal.mardi4nfdi.de/entity/Q40356731993-05-18Paper

Research outcomes over time

This page was built for person: Jun Tarui