Combining HTM and RCU to Implement Highly Efficient Balanced Binary Search Trees. Siakavaras, D., Nikas, K., Goumas, G. I., & Koziris, N. In 12th ACM SIGPLAN Workshop on Transactional Computing (TRANSACT 2017), 2017. Paper bibtex @inproceedings{transact17RCU,
author = {Dimitrios Siakavaras and
Konstantinos Nikas and
Georgios I. Goumas and
Nectarios Koziris},
title = {Combining HTM and RCU to Implement Highly Efficient Balanced Binary Search Trees},
booktitle = {12th ACM SIGPLAN Workshop on Transactional Computing ({TRANSACT} 2017)},
year = {2017},
url_Paper = {papers/2017-transact-RCU.pdf}
}
Downloads: 0
{"_id":"hvGoxcXd83DqRePub","bibbaseid":"siakavaras-nikas-goumas-koziris-combininghtmandrcutoimplementhighlyefficientbalancedbinarysearchtrees-2017","author_short":["Siakavaras, D.","Nikas, K.","Goumas, G. I.","Koziris, N."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Dimitrios"],"propositions":[],"lastnames":["Siakavaras"],"suffixes":[]},{"firstnames":["Konstantinos"],"propositions":[],"lastnames":["Nikas"],"suffixes":[]},{"firstnames":["Georgios","I."],"propositions":[],"lastnames":["Goumas"],"suffixes":[]},{"firstnames":["Nectarios"],"propositions":[],"lastnames":["Koziris"],"suffixes":[]}],"title":"Combining HTM and RCU to Implement Highly Efficient Balanced Binary Search Trees","booktitle":"12th ACM SIGPLAN Workshop on Transactional Computing (TRANSACT 2017)","year":"2017","url_paper":"papers/2017-transact-RCU.pdf","bibtex":"@inproceedings{transact17RCU,\n author = {Dimitrios Siakavaras and\n Konstantinos Nikas and\n Georgios I. Goumas and\n Nectarios Koziris},\n title = {Combining HTM and RCU to Implement Highly Efficient Balanced Binary Search Trees},\n booktitle = {12th ACM SIGPLAN Workshop on Transactional Computing ({TRANSACT} 2017)},\n year = {2017},\n url_Paper = {papers/2017-transact-RCU.pdf}\n}\n\n","author_short":["Siakavaras, D.","Nikas, K.","Goumas, G. I.","Koziris, N."],"key":"transact17RCU","id":"transact17RCU","bibbaseid":"siakavaras-nikas-goumas-koziris-combininghtmandrcutoimplementhighlyefficientbalancedbinarysearchtrees-2017","role":"author","urls":{" paper":"http://www.cslab.ece.ntua.gr/~knikas/files/papers/2017-transact-RCU.pdf"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://www.cslab.ece.ntua.gr/~knikas/files/knikas.bib","dataSources":["r4YQEjyH64S7pdQi6"],"keywords":[],"search_terms":["combining","htm","rcu","implement","highly","efficient","balanced","binary","search","trees","siakavaras","nikas","goumas","koziris"],"title":"Combining HTM and RCU to Implement Highly Efficient Balanced Binary Search Trees","year":2017}