Stasys Jukna
Bull. EATCS · 2001–2012
A researcher in the Science corpus: 2 papers; trusts 1 researcher and is trusted by 1 researcher here, as inferred from the citation graph.
Whom Stasys Jukna trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Stasys Jukna overall
Papers from Stasys Jukna's perspective
Ordered by how strongly the researchers Stasys Jukna trusts endorse each paper. Same corpus, a different order for every researcher.
- Probabilistic checking of proofs: a new characterization of NP
- Proof verification and hardness of approximation problems
- Computational limitations of small-depth circuits
- Almost optimal lower bounds for small depth circuits
- A threshold of ln n for approximating set cover (preliminary version)
- Protocols for secure computations
- A theory of the learnable
- Efficient noise-tolerant learning from statistical queries
- On the efficiency of local decoding procedures for error-correcting codes (Symposium on the Theory of Computing)
- Checking computations in polylogarithmic time
Their papers
- Boolean Function Complexity Advances and Frontiers (2012) — 480 citations
- Extremal Combinatorics: With Applications in Computer Science (2001) — 403 citations