{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:25Z","timestamp":1759638865331,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s00453-011-9532-3","type":"journal-article","created":{"date-parts":[[2011,6,3]],"date-time":"2011-06-03T15:19:26Z","timestamp":1307114366000},"page":"296-322","source":"Crossref","is-referenced-by-count":14,"title":["A Competitive Analysis for Balanced Transactional Memory Workloads"],"prefix":"10.1007","volume":"63","author":[{"given":"Gokarna","family":"Sharma","sequence":"first","affiliation":[]},{"given":"Costas","family":"Busch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"9532_CR1","first-page":"83","volume-title":"Proceedings of the 8th International Symposium on Parallel and Distributed Computing (ISPDC)","author":"M. Ansari","year":"2009","unstructured":"Ansari, M., Kotselidis, C., Lujan, M., Kirkham, C., Watson, I.: On the performance of contention managers for complex transactional memory benchmarks. In: Proceedings of the 8th International Symposium on Parallel and Distributed Computing (ISPDC), pp. 83\u201390. IEEE Computer Society, Washington (2009). http:\/\/doi.ieeecomputersociety.org\/10.1109\/ISPDC.2009.18"},{"key":"9532_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/978-3-540-92990-1_3","volume-title":"High Performance Embedded Architectures and Compilers","author":"M. Ansari","year":"2009","unstructured":"Ansari, M., Luj\u00e1n, M., Kotselidis, C., Jarvis, K., Kirkham, C., Watson, I.: Steal-on-abort: Improving transactional memory performance through dynamic transaction reordering. In: Seznec, A., Emer, J., O\u2019Boyle, M., Martonosi, M., Ungerer, T. (eds.) High Performance Embedded Architectures and Compilers. Lecture Notes in Computer Science, vol. 5409, pp. 4\u201318. Springer, Berlin (2009). http:\/\/dx.doi.org\/10.1007\/978-3-540-92990-1_3"},{"key":"9532_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1835698.1835699","volume-title":"Proceeding of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)","author":"H. Attiya","year":"2010","unstructured":"Attiya, H.: The inherent complexity of transactional memory and what to do about it. In: Proceeding of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pp.\u00a01\u20135. ACM, New York (2010). http:\/\/doi.acm.org\/10.1145\/1835698.1835699"},{"issue":"1","key":"9532_CR4","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/s00453-008-9195-x","volume":"57","author":"H. Attiya","year":"2010","unstructured":"Attiya, H., Epstein, L., Shachnai, H., Tamir, T.: Transactional contention management as a non-clairvoyant scheduling problem. Algorithmica 57(1), 44\u201361 (2010). http:\/\/dx.doi.org\/10.1007\/s00453-008-9195-x","journal-title":"Algorithmica"},{"key":"9532_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-642-10877-8_3","volume-title":"Principles of Distributed Systems","author":"H. Attiya","year":"2009","unstructured":"Attiya, H., Milani, A.: Transactional scheduling for read-dominated workloads. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) Principles of Distributed Systems. Lecture Notes in Computer Science, vol. 5923, pp. 3\u201317. Springer, Berlin (2009). http:\/\/dx.doi.org\/10.1007\/978-3-642-10877-8_3"},{"issue":"4","key":"9532_CR6","doi-asserted-by":"crossref","first-page":"1397","DOI":"10.1137\/S0097539795285643","volume":"28","author":"H. Attiya","year":"1999","unstructured":"Attiya, H., Shachnai, H., Tamir, T.: Local labeling and resource allocation using preprocessing. SIAM J. Comput. 28(4), 1397\u20131414 (1999). http:\/\/dx.doi.org\/10.1137\/S0097539795285643","journal-title":"SIAM J. Comput."},{"key":"9532_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1109\/FSCS.1990.89525","volume-title":"Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS), vol. I","author":"B. Awerbuch","year":"1990","unstructured":"Awerbuch, B., Saks, M.: A dining philosophers algorithm with polynomial response time. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS), vol. I, pp.\u00a065\u201374. IEEE Computer Society, Washington (1990). doi: 10.1109\/FSCS.1990.89525"},{"issue":"2","key":"9532_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(96)00031-X","volume":"162","author":"B.S. Baker","year":"1996","unstructured":"Baker, B.S., Coffman, E.G. Jr.: Mutual exclusion scheduling. Theor. Comput. Sci. 162(2), 225\u2013243 (1996). http:\/\/dx.doi.org\/10.1016\/0304-3975(96)00031-X","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9532_CR9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(95)00057-4","volume":"148","author":"H.L. Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems, part i. Theor. Comput. Sci. 148(1), 93\u2013109 (1995). http:\/\/dx.doi.org\/10.1016\/0304-3975(95)00057-4","journal-title":"Theor. Comput. Sci."},{"key":"9532_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/IISWC.2008.4636089","volume-title":"Proceedings of The IEEE International Symposium on Workload Characterization (IISWC)","author":"C. Cao Minh","year":"2008","unstructured":"Cao Minh, C., Chung, J., Kozyrakis, C., Olukotun, K.: STAMP: Stanford transactional applications for multi-processing. In: Proceedings of The IEEE International Symposium on Workload Characterization (IISWC), pp. 35\u201346. IEEE, New York (2008). doi: 10.1109\/IISWC.4636089"},{"key":"9532_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/11864219_14","volume-title":"Distributed Computing","author":"D. Dice","year":"2006","unstructured":"Dice, D., Shalev, O., Shavit, N.: Transactional locking ii. In: Dolev, S. (ed.) Distributed Computing. Lecture Notes in Computer Science, vol. 4167, pp. 194\u2013208. Springer, Berlin (2006). http:\/\/dx.doi.org\/10.1007\/11864219_14"},{"key":"9532_CR12","first-page":"125","volume-title":"Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"S. Dolev","year":"2008","unstructured":"Dolev, S., Hendler, D., Suissa, A.: CAR-STM: scheduling-based collision avoidance and resolution for software transactional memory. In: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 125\u2013134. ACM, New York (2008). http:\/\/doi.acm.org\/10.1145\/1400751.1400769"},{"key":"9532_CR13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/1582716.1582725","volume-title":"Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"A. Dragojevi\u0107","year":"2009","unstructured":"Dragojevi\u0107, A., Guerraoui, R., Singh, A.V., Singh, V.: Preventing versus curing: avoiding conflicts in transactional memories. In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 7\u201316. ACM, New York (2009). http:\/\/doi.acm.org\/10.1145\/1582716.1582725"},{"issue":"2","key":"9532_CR14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10951-008-0089-1","volume":"12","author":"G. Even","year":"2009","unstructured":"Even, G., Halld\u00f3rsson, M.M., Kaplan, L., Ron, D.: Scheduling with conflicts: online and offline algorithms. J. Sched. 12(2), 199\u2013224 (2009). http:\/\/dx.doi.org\/10.1007\/s10951-008-0089-1","journal-title":"J. Sched."},{"issue":"2","key":"9532_CR15","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1006\/jcss.1998.1587","volume":"57","author":"U. Feige","year":"1998","unstructured":"Feige, U., Kilian, J.: Zero knowledge and the chromatic number. J. Comput. Syst. Sci. 57(2), 187\u2013199 (1998). doi: 10.1006\/jcss.1998.1587","journal-title":"J. Comput. Syst. Sci."},{"key":"9532_CR16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/1345206.1345241","volume-title":"Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)","author":"P. Felber","year":"2008","unstructured":"Felber, P., Fetzer, C., Riegel, T.: Dynamic performance tuning of word-based software transactional memory. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 237\u2013246. ACM, New York (2008). http:\/\/doi.acm.org\/10.1145\/1345206.1345241"},{"issue":"2","key":"9532_CR17","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0204015","volume":"4","author":"M.R. Garey","year":"1975","unstructured":"Garey, M.R., Grahams, R.L.: Bounds for multiprocessor scheduling with resource constraints. SIAM J. Comput. 4(2), 187\u2013200 (1975). http:\/\/dx.doi.org\/10.1137\/0204015","journal-title":"SIAM J. Comput."},{"key":"9532_CR18","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. Freeman, New York (1990)"},{"key":"9532_CR19","volume-title":"Proceedings of the OOPSLA 2005 Workshop on Synchronization and Concurrency on Object-Oriented Languages (SCOOL)","author":"R. Guerraoui","year":"2005","unstructured":"Guerraoui, R., Herlihy, M., Kapalka, M., Pochon, B.: Robust contention management in software transactional memory. In: Proceedings of the OOPSLA 2005 Workshop on Synchronization and Concurrency on Object-Oriented Languages (SCOOL) (2005). http:\/\/infoscience.epfl.ch\/getfile.py?recid=64479&mode=best"},{"key":"9532_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/11561927_23","volume-title":"Distributed Computing","author":"R. Guerraoui","year":"2005","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: Polymorphic contention management. In: Fraigniaud, P. (ed.) Distributed Computing. Lecture Notes in Computer Science, vol. 3724, pp. 303\u2013323. Springer, Berlin (2005). http:\/\/dx.doi.org\/10.1007\/11561927_23"},{"key":"9532_CR21","first-page":"258","volume-title":"Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"R. Guerraoui","year":"2005","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: Toward a theory of transactional contention managers. In: Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 258\u2013264. ACM, New York (2005). http:\/\/doi.acm.org\/10.1145\/1073814.1073863"},{"issue":"3","key":"9532_CR22","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/1272998.1273029","volume":"41","author":"R. Guerraoui","year":"2007","unstructured":"Guerraoui, R., Kapalka, M., Vitek, J.: Stmbench7: a benchmark for software transactional memory. SIGOPS Oper. Syst. Rev. 41(3), 315\u2013324 (2007). http:\/\/doi.acm.org\/10.1145\/1272998.1273029","journal-title":"SIGOPS Oper. Syst. Rev."},{"issue":"2","key":"9532_CR23","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0890-5401(02)00032-9","volume":"180","author":"M.M. Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Proskurowski, A., Salman, R., Shachnai, H., Telle, J.A.: Multicoloring trees. Inf. Comput. 180(2), 113\u2013129 (2003). http:\/\/dx.doi.org\/10.1016\/S0890-5401(02)00032-9","journal-title":"Inf. Comput."},{"issue":"11","key":"9532_CR24","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1145\/949343.949340","volume":"38","author":"T. Harris","year":"2003","unstructured":"Harris, T., Fraser, K.: Language support for lightweight transactions. ACM SIGPLAN Not. 38(11), 388\u2013402 (2003). http:\/\/doi.acm.org\/10.1145\/949343.949340","journal-title":"ACM SIGPLAN Not."},{"issue":"8","key":"9532_CR25","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/1378704.1378725","volume":"51","author":"T. Harris","year":"2008","unstructured":"Harris, T., Marlow, S., Jones, S.P., Herlihy, M.: Composable memory transactions. Commun. ACM 51(8), 91\u2013100 (2008). http:\/\/doi.acm.org\/10.1145\/1378704.1378725","journal-title":"Commun. ACM"},{"key":"9532_CR26","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1109\/HPCS.2010.5547141","volume-title":"Proceedings of the 2010 International Conference on High Performance Computing and Simulation (HPCS)","author":"D. Hasenfratz","year":"2010","unstructured":"Hasenfratz, D., Schneider, J., Wattenhofer, R.: Transactional memory: how to perform load adaption in a simple and distributed manner. In: Proceedings of the 2010 International Conference on High Performance Computing and Simulation (HPCS), pp. 163\u2013170. IEEE, Washington (2010). doi: 10.1109\/HPCS.5547141 ."},{"key":"9532_CR27","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/ICDCS.2003.1203503","volume-title":"Proceedings of the 23th International Conference on Distributed Computing Systems (ICDCS)","author":"M. Herlihy","year":"2003","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: double-ended queues as an example. In: Proceedings of the 23th International Conference on Distributed Computing Systems (ICDCS), pp. 522\u2013529. IEEE Computer Society, Washington (2003). doi: 10.1109\/ICDCS.2003.1203503"},{"key":"9532_CR28","first-page":"92","volume-title":"Proceedings of the 22th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"M. Herlihy","year":"2003","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer, W.N. III: Software transactional memory for dynamic-sized data structures. In: Proceedings of the 22th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 92\u2013101. ACM, New York (2003). http:\/\/doi.acm.org\/10.1145\/872035.872048"},{"issue":"2","key":"9532_CR29","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/173682.165164","volume":"21","author":"M. Herlihy","year":"1993","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. SIGARCH Comput. Archit. News 21(2), 289\u2013300 (1993). http:\/\/doi.acm.org\/10.1145\/173682.165164","journal-title":"SIGARCH Comput. Archit. News"},{"volume-title":"Approximation Algorithms for Np-Hard Problems","year":"1997","key":"9532_CR30","unstructured":"Hochbaum, D.S. (ed.): Approximation Algorithms for Np-Hard Problems. PWS, Boston (1997)"},{"key":"9532_CR31","first-page":"85","volume-title":"Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"S. Irani","year":"1996","unstructured":"Irani, S., Leung, V.: Scheduling with conflicts, and applications to traffic signal control. In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 85\u201394. Society for Industrial and Applied Mathematics, Philadelphia (1996). http:\/\/doi.acm.org\/10.1145\/313852.313892"},{"key":"9532_CR32","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/SFCS.2001.959936","volume-title":"Proceedings of the 42th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"S. Khot","year":"2001","unstructured":"Khot, S.: Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: Proceedings of the 42th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 600\u2013609. IEEE Computer Society, Washington (2001). doi: 10.1109\/SFCS.2001.959936"},{"key":"9532_CR33","unstructured":"Marathe, V.J., Spear, M.F., Heriot, C., Acharya, A., Eisenstat, D., Scherer, W.N. III, Scott, M.L.: Lowering the overhead of software transactional memory. Tech. rep. TR 893, Computer Science Department, University of Rochester (2006). http:\/\/www.cs.rochester.edu\/u\/scott\/papers\/2006_TR893_RSTM.pdf"},{"issue":"1","key":"9532_CR34","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R. Motwani","year":"1994","unstructured":"Motwani, R., Phillips, S., Torng, E.: Non-clairvoyant scheduling. Theor. Comput. Sci. 130(1), 17\u201347 (1994). doi: 10.1016\/0304-3975(94)90151-1","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9532_CR35","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668\u2013676 (1990). http:\/\/doi.acm.org\/10.1145\/78973.78977","journal-title":"Commun. ACM"},{"issue":"2","key":"9532_CR36","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/1273440.1250675","volume":"35","author":"H.E. Ramadan","year":"2007","unstructured":"Ramadan, H.E., Rossbach, C.J., Porter, D.E., Hofmann, O.S., Bhandari, A., Witchel, E.: Metatm\/txlinux: transactional memory for an operating system. SIGARCH Comput. Archit. News 35(2), 92\u2013103 (2007). http:\/\/doi.acm.org\/10.1145\/1273440.1250675","journal-title":"SIGARCH Comput. Archit. News"},{"key":"9532_CR37","first-page":"240","volume-title":"Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"W.N. Scherer III","year":"2005","unstructured":"Scherer, W.N. III, Scott, M.L.: Advanced contention management for dynamic software transactional memory. In: Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 240\u2013248. ACM, New York (2005). http:\/\/doi.acm.org\/10.1145\/1073814.1073861"},{"key":"9532_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/978-3-642-10631-6_46","volume-title":"Algorithms and Computation","author":"J. Schneider","year":"2009","unstructured":"Schneider, J., Wattenhofer, R.: Bounds on contention management algorithms. In: Dong, Y., Du, D.Z., Ibarra, O. (eds.) Algorithms and Computation. Lecture Notes in Computer Science, vol. 5878, pp.\u00a0441\u2013451. Springer, Berlin (2009). http:\/\/dx.doi.org\/10.1007\/978-3-642-10631-6_46"},{"key":"9532_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/978-3-642-17653-1_26","volume-title":"Principles of Distributed Systems","author":"G. Sharma","year":"2010","unstructured":"Sharma, G., Busch, C.: A competitive analysis for balanced transactional memory workloads. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) Principles of Distributed Systems. Lecture Notes in Computer Science, vol. 6490, pp. 348\u2013363. Springer, Berlin (2010). http:\/\/dx.doi.org\/10.1007\/978-3-642-17653-1_26"},{"key":"9532_CR40","first-page":"554","volume-title":"Proceedings of the 13th IPDPS Workshop on Advances in Parallel and Distributed Computing Models (APDCM)","author":"G. Sharma","year":"2011","unstructured":"Sharma, G., Busch, C.: On the performance of window-based contention managers for transactional memory. In: Proceedings of the 13th IPDPS Workshop on Advances in Parallel and Distributed Computing Models (APDCM), pp. 554\u2013563. IEEE Computer Society, Washington (2011). doi: 10.1109\/IPDPS.2011.207"},{"key":"9532_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/978-3-642-15763-9_7","volume-title":"Distributed Computing","author":"G. Sharma","year":"2010","unstructured":"Sharma, G., Estrade, B., Busch, C.: Window-based greedy contention management for transactional memory. In: Lynch, N., Shvartsman, A. (eds.) Distributed Computing. Lecture Notes in Computer Science, vol. 6343, pp. 64\u201378. Springer, Berlin (2010). http:\/\/dx.doi.org\/10.1007\/978-3-642-15763-9_7"},{"issue":"2","key":"9532_CR42","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s004460050028","volume":"10","author":"N. Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. Distrib. Comput. 10(2), 99\u2013116 (1997). http:\/\/dx.doi.org\/10.1007\/s004460050028","journal-title":"Distrib. Comput."},{"key":"9532_CR43","first-page":"169","volume-title":"Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures (SPAA)","author":"R.M. Yoo","year":"2008","unstructured":"Yoo, R.M., Lee, H.H.S.: Adaptive transaction scheduling for transactional memory systems. In: Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures (SPAA), pp.\u00a0169\u2013178. ACM, New York (2008). http:\/\/doi.acm.org\/10.1145\/1378533.1378564"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9532-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9532-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9532-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T07:53:13Z","timestamp":1560239593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9532-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":43,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9532"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9532-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2011,6,4]]}}}