Follow
Eric Ruppert
Eric Ruppert
Verified email at cse.yorku.ca - Homepage
Title
Cited by
Cited by
Year
The computational power of population protocols
D Angluin, J Aspnes, D Eisenstat, E Ruppert
Distributed Computing 20 (4), 279-304, 2007
3282007
An introduction to population protocols
J Aspnes, E Ruppert
Middleware for Network Eccentric and Mobile Applications, 97-120, 2009
2862009
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
2302010
Lock-free linked lists and skip lists
M Fomitchev, E Ruppert
Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004
2032004
Hundreds of impossibility results for distributed computing
F Fich, E Ruppert
Distributed computing 16 (2), 121-163, 2003
1732003
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
1282014
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
1072006
Names trump malice: Tiny mobile agents can tolerate byzantine failures
R Guerraoui, E Ruppert
International Colloquium on Automata, Languages, and Programming, 484-495, 2009
782009
Anonymous and fault-tolerant shared-memory computing
R Guerraoui, E Ruppert
Distributed Computing 20 (3), 165-177, 2007
732007
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
462013
What can be implemented anonymously?
R Guerraoui, E Ruppert
International Symposium on Distributed Computing, 244-259, 2005
442005
Determining consensus numbers
E Ruppert
SIAM Journal on Computing 30 (4), 1156-1168, 2000
432000
Byzantine agreement with homonyms
C Delporte-Gallet, H Fauconnier, R Guerraoui, AM Kermarrec, E Ruppert
Distributed computing 26 (5), 321-340, 2013
422013
Partial snapshot objects
H Attiya, R Guerraoui, E Ruppert
Proceedings of the twentieth annual symposium on Parallelism in algorithms …, 2008
422008
Even small birds are unique: Population protocols with identifiers
R Guerraoui, E Ruppert
422007
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
402014
On the power of anonymous one-way communication
D Angluin, J Aspnes, D Eisenstat, E Ruppert
International Conference On Principles Of Distributed Systems, 396-411, 2005
372005
Secretive birds: Privacy in population protocols
C Delporte-Gallet, H Fauconnier, R Guerraoui, E Ruppert
International Conference On Principles Of Distributed Systems, 329-342, 2007
352007
Relationships between broadcast and shared memory in reliable anonymous distributed systems
J Aspnes, FE Fich, E Ruppert
Distributed Computing 18 (3), 209-219, 2006
342006
Finding the k shortest paths in parallel
E Ruppert
Algorithmica 28 (2), 242-254, 2000
342000
The system can't perform the operation now. Try again later.
Articles 1–20