Igor L. Markov

Artificial Intelligence · 2000–2014

A researcher in the Science corpus: 9 papers; trusts 35 researchers and is trusted by 29 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 34 citations into it; #9,452 of 35,345 by trust here, #12,244 by citations
• Atomic and Molecular Physics, and Optics — 25 citations into it
• Electrical and Electronic Engineering — 21 citations into it; #2,619 of 16,539 by trust here, #7,892 by citations
• Computational Theory and Mathematics — 11 citations into it; #2,558 of 12,182 by trust here, #2,104 by citations
• Hardware and Architecture — 10 citations into it; #252 of 1,551 by trust here, #494 by citations
• Computer Networks and Communications — 6 citations into it
• ML Systems & Hardware — 5 citations into it

Whom Igor L. Markov trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Daniel A. Spielman
2. Marjan Mernik
3. V. Almeida
4. Guifré Vidal
5. Yazhen Wang
6. Shang-Hua Teng
7. Yaoyun Shi
8. Luiz André Barroso
9. Eric A. Brewer
10. Lance Fortnow

Who trusts Igor L. Markov overall

1. Vicky Siu-Ngan Choi
2. Aram Wettroth Harrow
3. Richard Jozsa
4. Ashley Montanaro
5. John M. Shalf
6. David A. B. Miller
7. Hans J. Briegel
8. Jeyavijayan Rajendran
9. Akimasa Miyake
10. Ivan H. Deutsch

Papers from Igor L. Markov's perspective

Ordered by how strongly the researchers Igor L. Markov trusts endorse each paper. Same corpus, a different order for every researcher.

1. Quantum Computation and Quantum Information: Bibliography
2. Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions
3. The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines
4. Persistent entanglement in arrays of interacting particles. (Physical Review Letters)
5. Efficient classical simulation of slightly entangled quantum computations.
6. A transformation based algorithm for reversible logic synthesis (Proceedings - Design Automation Conference)
7. Experimental one-way quantum computing (Nature)
8. AND T
9. Γ and B
10. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (Symposium on the Theory of Computing)

Their papers

• Synthesis of quantum-logic circuits (2004) — 851 citations
• Simulating Quantum Computation by Contracting Tensor Networks (2005) — 533 citations
• Synthesis and optimization of reversible circuits—a survey (2011) — 318 citations
• EPIC: Ending Piracy of Integrated Circuits (2008) — 697 citations
• Synthesis of reversible logic circuits (2003) — 564 citations
• Limits on fundamental limits to computation (2014) — 484 citations
• Ending Piracy of Integrated Circuits (2010) — 300 citations
• Can recursive bisection alone produce routable, placements? (2000) — 384 citations
• Fixed-outline floorplanning: enabling hierarchical design (2003) — 416 citations