Immediate Impact
1 standout
Citing Papers
Quantum algorithms: an overview
2016 Standout
Works of Nikos Leonardos being referenced
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
2010
Author Peers
| Author | Last Decade | Papers | Cites | |||
|---|---|---|---|---|---|---|
| Nikos Leonardos | 19 | 11 | 12 | 9 | 29 | |
| Grigory Fedyukovich | 16 | 11 | 11 | 12 | 36 | |
| Yitzhak Mandelbaum | 14 | 12 | 9 | 8 | 31 | |
| Yohan Boichut | 27 | 16 | 14 | 10 | 32 | |
| Bow-Yaw Wang | 27 | 6 | 12 | 10 | 36 | |
| Hong-Sheng Zhou | 28 | 9 | 7 | 8 | 31 | |
| Pascal Giorgi | 20 | 7 | 13 | 9 | 42 | |
| Elette Boyle | 27 | 9 | 9 | 13 | 32 | |
| Dan Hirsch | 16 | 7 | 9 | 8 | 25 | |
| Nicholas Kidd | 13 | 6 | 8 | 9 | 34 | |
| John Plaice | 12 | 13 | 9 | 12 | 33 |
All Works
Login with ORCID to disown or claim papers
Loading papers...