| Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents L Anderegg, S Eidenbenz Proceedings of the 9th annual international conference on Mobile computing …, 2003 | 744 | 2003 |
| Containment of misinformation spread in online social networks NP Nguyen, G Yan, MT Thai, S Eidenbenz Proceedings of the 4th Annual ACM Web Science Conference, 213-222, 2012 | 332 | 2012 |
| Quantum algorithm implementations for beginners A Adedoyin, J Ambrosiano, P Anisimov, W Casper, G Chennupati, ... arXiv preprint arXiv:1804.03719, 2018 | 194 | 2018 |
| Inapproximability results for guarding polygons and terrains S Eidenbenz, C Stamm, P Widmayer Algorithmica 31, 79-113, 2001 | 189 | 2001 |
| Equilibria in topology control games for ad hoc networks S Eidenbenz, VSA Kumar, S Zust Proceedings of the 2003 joint workshop on Foundations of mobile computing, 2-11, 2003 | 184 | 2003 |
| Parametric probabilistic sensor network routing CL Barrett, SJ Eidenbenz, L Kroc, M Marathe, JP Smith Proceedings of the 2nd ACM international conference on Wireless sensor …, 2003 | 164 | 2003 |
| Deterministic preparation of Dicke states A Bärtschi, S Eidenbenz International Symposium on Fundamentals of Computation Theory, 126-139, 2019 | 152 | 2019 |
| Malware propagation in online social networks: nature, dynamics, and defense implications G Yan, G Chen, S Eidenbenz, N Li Proceedings of the 6th acm symposium on information, computer and …, 2011 | 151 | 2011 |
| Grover mixers for QAOA: Shifting complexity from mixer design to state preparation A Bärtschi, S Eidenbenz 2020 IEEE International Conference on Quantum Computing and Engineering (QCE …, 2020 | 147 | 2020 |
| Quantum algorithm implementations for beginners PJ Coles, S Eidenbenz, S Pakin, A Adedoyin, J Ambrosiano, P Anisimov, ... arXiv, arXiv: 1804.03719, 2018 | 146 | 2018 |
| Modeling propagation dynamics of bluetooth worms (extended version) G Yan, S Eidenbenz IEEE transactions on mobile computing 8 (3), 353-368, 2008 | 118 | 2008 |
| Commit: A sender-centric truthful and energy-efficient routing protocol for ad hoc networks with selfish nodes S Eidenbenz, G Resta, P Santi 19th IEEE International Parallel and Distributed Processing Symposium, 10 pp., 2005 | 113 | 2005 |
| Link positions matter: A noncommutative routing metric for wireless mesh networks G Jakllari, S Eidenbenz, N Hengartner, SV Krishnamurthy, M Faloutsos IEEE Transactions on Mobile Computing 11 (1), 61-72, 2011 | 112 | 2011 |
| OURS: optimal unicast routing systems in non-cooperative wireless networks W Wang, S Eidenbenz, Y Wang, XY Li Proceedings of the 12th annual international conference on Mobile computing …, 2006 | 106 | 2006 |
| The COMMIT protocol for truthful and cost-efficient routing in ad hoc networks with selfish nodes S Eidenbenz, G Resta, P Santi IEEE transactions on mobile computing 7 (1), 19-33, 2007 | 94 | 2007 |
| The quantum alternating operator ansatz on maximum k-vertex cover J Cook, S Eidenbenz, A Bärtschi 2020 IEEE International Conference on Quantum Computing and Engineering (QCE …, 2020 | 90* | 2020 |
| Bluetooth worm propagation: mobility pattern matters! G Yan, HD Flores, L Cuellar, N Hengartner, S Eidenbenz, V Vu Proceedings of the 2nd ACM symposium on Information, computer and …, 2007 | 90 | 2007 |
| Embedding algorithms for quantum annealers with chimera and pegasus connection topologies S Zbinden, A Bärtschi, H Djidjev, S Eidenbenz International Conference on High Performance Computing, 187-206, 2020 | 84 | 2020 |
| Quantum volume in practice: What users can expect from nisq devices E Pelofske, A Bärtschi, S Eidenbenz IEEE Transactions on Quantum Engineering 3, 1-19, 2022 | 82 | 2022 |
| Approximation algorithms for terrain guarding S Eidenbenz Information Processing Letters 82 (2), 99-105, 2002 | 82 | 2002 |
Nandakishore SanthiStaff Scientist, Los Alamos National Laboratory; Affiliate Graduate Faculty at ECE Dept, NMSUPreverjeni e-poštni naslov na lanl.gov
