Result 1 to 20 of 54 total
On the inherent sequentiality of concurrent objects. (English)
SIAM J. Comput. 41, No. 3, 519-536 (2012).
1
Layered interval codes for TCAM-based classification. (English)
Comput. Netw. 56, No. 13, 3023-3039 (2012).
2
On the impact of serializing contention management on STM performance. (English)
J. Parallel Distrib. Comput. 72, No. 6, 739-750 (2012).
3
Space-efficient TCAM-based classification using gray coding (English)
IEEE Trans. Computers 61, No. 1, 18-30 (2012).
4
A dynamic elimination-combining stack algorithm. (English)
Fernández Anta, Antonio (ed.) et al., Principles of distributed systems. 15th international conference, OPODIS 2011, Toulouse, France, December 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25872-5/pbk). Lecture Notes in Computer Science 7109, 544-561 (2011).
5
Randomized mutual exclusion with sub-logarithmic RMR-complexity. (English)
Distrib. Comput. 24, No. 1, 3-19 (2011).
6
Metric anomaly detection via asymmetric risk minimization. (English)
Pelillo, Marcello (ed.) et al., Similarity-based pattern recognition. First international workshop, SIMBAD 2011, Venice, Italy, September 28‒30, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24470-4/pbk). Lecture Notes in Computer Science 7005, 17-30 (2011).
7
A dynamic elimination-combining stack algorithm. (English)
Comput. Res. Repos. 2011, Article No. 1106.6304 (2011).
8
Metric anomaly detection via asymmetric risk minimization (English)
SIMBAD, 17-30 (2011).
9
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated (English)
POPL, 487-498 (2011).
10
A dynamic elimination-combining stack algorithm (English)
OPODIS, 544-561 (2011).
11
A scalable lock-free stack algorithm. (English)
J. Parallel Distrib. Comput. 70, No. 1, 1-12 (2010).
12
PEDS: A parallel error detection scheme for TCAM devices. (English)
IEEE/ACM Trans. Netw. 18, No. 5, 1665-1675 (2010).
13
An $O(1)$ RMRs leader election algorithm. (English)
SIAM J. Comput. 39, No. 7, 2726-2760 (2010).
14
An adaptive technique for constructing robust and high-throughput shared objects. (English)
Lu, Chenyang (ed.) et al., Principles of distributed systems. 14th international conference, OPODIS 2010, Tozeur, Tunisia, December 14‒17, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17652-4/pbk). Lecture Notes in Computer Science 6490, 318-332 (2010).
15
Scalable flat-combining based synchronous queues. (English)
Lynch, Nancy A. (ed.) et al., Distributed computing. 24th international symposium, DISC 2010, Cambridge, MA, USA, September 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15762-2/pbk). Lecture Notes in Computer Science 6343, 79-93 (2010).
16
Time and space lower bounds for implementations using k-CAS (English)
IEEE Trans. Parallel Distrib. Syst. 21, No. 2, 162-173 (2010).
17
An adaptive technique for constructing robust and high-throughput shared objects (English)
OPODIS, 318-332 (2010).
18
Scalable flat-combining based synchronous queues (English)
DISC, 79-93 (2010).
19
Flat combining and the synchronization-parallelism tradeoff (English)
SPAA, 355-364 (2010).
20
Result 1 to 20 of 54 total
Start
Contact
Print
General Help
