| The computational power of population protocols D Angluin, J Aspnes, D Eisenstat, E Ruppert Distributed Computing 20, 279-304, 2007 | 358 | 2007 |
| An introduction to population protocols J Aspnes, E Ruppert Middleware for Network Eccentric and Mobile Applications, 97-120, 2009 | 308 | 2009 |
| Non-blocking binary search trees F Ellen, P Fatourou, E Ruppert, F van Breugel Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010 | 247 | 2010 |
| Lock-free linked lists and skip lists M Fomitchev, E Ruppert Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004 | 212 | 2004 |
| Hundreds of impossibility results for distributed computing F Fich, E Ruppert Distributed computing 16, 121-163, 2003 | 173 | 2003 |
| A general technique for non-blocking trees T Brown, F Ellen, E Ruppert Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of …, 2014 | 139 | 2014 |
| When birds die: Making population protocols fault-tolerant C Delporte-Gallet, H Fauconnier, R Guerraoui, E Ruppert International Conference on Distributed Computing in Sensor Systems, 51-66, 2006 | 112 | 2006 |
| Names trump malice: Tiny mobile agents can tolerate byzantine failures R Guerraoui, E Ruppert International Colloquium on Automata, Languages, and Programming, 484-495, 2009 | 82 | 2009 |
| Anonymous and fault-tolerant shared-memory computing R Guerraoui, E Ruppert Distributed Computing 20, 165-177, 2007 | 74 | 2007 |
| Pragmatic primitives for non-blocking data structures T Brown, F Ellen, E Ruppert Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013 | 51 | 2013 |
| What can be implemented anonymously? R Guerraoui, E Ruppert Distributed Computing: 19th International Conference, DISC 2005, Cracow …, 2005 | 45 | 2005 |
| Determining consensus numbers E Ruppert Proceedings of the sixteenth annual ACM symposium on Principles of …, 1997 | 45 | 1997 |
| Even small birds are unique: Population protocols with identifiers R Guerraoui, E Ruppert | 44 | 2007 |
| The amortized complexity of non-blocking binary search trees F Ellen, P Fatourou, J Helga, E Ruppert Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014 | 42 | 2014 |
| Byzantine agreement with homonyms C Delporte-Gallet, H Fauconnier, R Guerraoui, AM Kermarrec, E Ruppert, ... Distributed computing 26, 321-340, 2013 | 42 | 2013 |
| Partial snapshot objects H Attiya, R Guerraoui, E Ruppert Proceedings of the twentieth annual symposium on Parallelism in algorithms …, 2008 | 42 | 2008 |
| On the power of anonymous one-way communication D Angluin, J Aspnes, D Eisenstat, E Ruppert Principles of Distributed Systems: 9th International Conference, OPODIS 2005 …, 2006 | 39 | 2006 |
| Secretive birds: Privacy in population protocols C Delporte-Gallet, H Fauconnier, R Guerraoui, E Ruppert Principles of Distributed Systems: 11th International Conference, OPODIS …, 2007 | 36 | 2007 |
| Finding the k Shortest Paths in Parallel E Ruppert Algorithmica 28, 242-254, 2000 | 36 | 2000 |
| Relationships between broadcast and shared memory in reliable anonymous distributed systems J Aspnes, FE Fich, E Ruppert Distributed Computing 18, 209-219, 2006 | 34 | 2006 |
Panagiota FatourouProfessor, Department of Computer Science, University of CreteVerified email at csd.uoc.gr
