Yakov Novikov
Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition · 2002
A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 20 researchers here, as inferred from the citation graph.
Whom Yakov Novikov trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Yakov Novikov overall
- Lintao Zhang
- Daniel Jackson
- Martin Gebser
- Sharad Malik
- Kenneth L. McMillan
- Zhaohui Fu
- Emina Torlak
- Benjamin Kaufmann
- Gilles Audemard
- Tian Sang
Papers from Yakov Novikov's perspective
Ordered by how strongly the researchers Yakov Novikov trusts endorse each paper. Same corpus, a different order for every researcher.
- Chaff: engineering an efficient SAT solver (Proceedings - Design Automation Conference)
- GRASP: A Search Algorithm for Propositional Satisfiability
- A machine program for theorem-proving (CACM)
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- A Structure-Preserving Clause Form Translation
- Extending SAT Solvers to Cryptographic Problems (International Conference on Theory and Applications of Satisfiability Testing)
- Speeding up Convolutional Neural Networks with Low Rank Expansions
- Learning both Weights and Connections for Efficient Neural Network
- Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift (International Conference on Machine Learning)
- ImageNet classification with deep convolutional neural networks
Their papers
- BerkMin: A fast and robust SAT-solver (2002) — 920 citations