{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:49Z","timestamp":1763468209701,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":95,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612673","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"154-165","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Executing dynamic data-graph computations deterministically using chromatic scheduling"],"prefix":"10.1145","author":[{"given":"Tim","family":"Kaler","sequence":"first","affiliation":[{"name":"MIT CSAIL, Cambridge, MA, USA"}]},{"given":"William","family":"Hasenplaugh","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA, USA"}]},{"given":"Tao B.","family":"Schardl","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA, USA"}]},{"given":"Charles E.","family":"Leiserson","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ICPP","author":"Adams L.","year":"1982","unstructured":"L. Adams and J. Ortega . A multi-color SOR method for parallel computation . In ICPP , 1982 . L. Adams and J. Ortega. A multi-color SOR method for parallel computation. In ICPP, 1982."},{"key":"e_1_3_2_1_2_1","volume-title":"The Fortress Language Specification Version 1.0. Sun Microsystems","author":"Allen E.","year":"2008","unstructured":"E. Allen , D. Chase , J. Hallett , V. Luchangco , J.-W. Maessen , S. Ryu , G. L. Steele Jr ., and S. Tobin-Hochstadt . The Fortress Language Specification Version 1.0. Sun Microsystems , Inc ., 2008 . E. Allen, D. Chase, J. Hallett, V. Luchangco, J.-W. Maessen, S. Ryu, G. L. Steele Jr., and S. Tobin-Hochstadt. The Fortress Language Specification Version 1.0. Sun Microsystems, Inc., 2008."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536432"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639950.1639989"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1736020.1736029"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640096"},{"key":"e_1_3_2_1_9_1","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas D. P.","year":"1989","unstructured":"D. P. Bertsekas and J. N. Tsitsiklis . Parallel and Distributed Computation: Numerical Methods . Prentice-Hall, Inc. , 1989 . D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Inc., 1989."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454128"},{"key":"e_1_3_2_1_11_1","volume-title":"Technical Report Carnegie Mellon University-CS-90-190, School of Computer Science","author":"Blelloch G. E.","year":"1990","unstructured":"G. E. Blelloch . Prefix sums and their applications. Technical Report Carnegie Mellon University-CS-90-190, School of Computer Science , Carnegie Mellon University , 1990 . G. E. Blelloch. Prefix sums and their applications. Technical Report Carnegie Mellon University-CS-90-190, School of Computer Science, Carnegie Mellon University, 1990."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145840"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/113379.113380"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793259471"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855591.1855595"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_3_2_1_22_1","series-title":"LNCS","volume-title":"Algorithms and Data Structures","author":"Brodnik A.","year":"1999","unstructured":"A. Brodnik , S. Carlsson , E. Demaine , J. Ian Munro , and R. Sedgewick . Resizable arrays in optimal time and space . In Algorithms and Data Structures , volume 1663 of LNCS . Springer Berlin Heidelberg , 1999 . A. Brodnik, S. Carlsson, E. Demaine, J. Ian Munro, and R. Sedgewick. Resizable arrays in optimal time and space. In Algorithms and Data Structures, volume 1663 of LNCS. Springer Berlin Heidelberg, 1999."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/800223.806778"},{"key":"e_1_3_2_1_24_1","author":"Cav\u00e9 V.","year":"2011","unstructured":"V. Cav\u00e9 , J. Zhao , J. Shirako , and V. Sarkar . Habanero-Java: the new adventures of old x10. In PPPJ. ACM , 2011 . V. Cav\u00e9, J. Zhao, J. Shirako, and V. Sarkar. Habanero-Java: the new adventures of old x10. In PPPJ. ACM, 2011.","journal-title":"Habanero-Java: the new adventures of old x10. In PPPJ. ACM"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.842947"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094852"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12151"},{"key":"e_1_3_2_1_28_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . The MIT Press and McGraw-Hill , second edition, 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press and McGraw-Hill, second edition, 2001."},{"key":"e_1_3_2_1_29_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . The MIT Press , third edition, 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, third edition, 2009."},{"key":"e_1_3_2_1_30_1","volume-title":"Iterated greedy graph coloring and the difficulty landscape. Technical report","author":"Culberson J. C.","year":"1992","unstructured":"J. C. Culberson . Iterated greedy graph coloring and the difficulty landscape. Technical report , University of Alberta , 1992 . J. C. Culberson. Iterated greedy graph coloring and the difficulty landscape. Technical report, University of Alberta, 1992."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0723047"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508255"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950376"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.21127"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/258492.258493"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000120"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584017"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277725"},{"key":"e_1_3_2_1_40_1","volume-title":"Theoretical Computer Science","author":"Garey M.","year":"1976","unstructured":"M. Garey , D. Johnson , and L. Stockmeyer . Some simplified NP-complete graph problems . Theoretical Computer Science , 1976 . M. Garey, D. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1976."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1990.10476213"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1984.4767596"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/72935.72953"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/0613024"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/0401044"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218029"},{"key":"e_1_3_2_1_47_1","series-title":"SIAM Numer. Anal","volume-title":"Calculating the singular values and pseudo-inverse of a matrix. J","author":"Golub G. H.","year":"1965","unstructured":"G. H. Golub and W. Kahan . Calculating the singular values and pseudo-inverse of a matrix. J . SIAM Numer. Anal ., 1965 . G. H. Golub and W. Kahan. Calculating the singular values and pseudo-inverse of a matrix. J. SIAM Numer. Anal., 1965."},{"key":"e_1_3_2_1_48_1","volume-title":"OSDI","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . PowerGraph: distributed graph-parallel computation on natural graphs . In OSDI , 2012 . J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. PowerGraph: distributed graph-parallel computation on natural graphs. In OSDI, 2012."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/800055.802017"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/4472.4478"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612697"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810509"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1002\/sapm192761164"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/2014698.2014870"},{"key":"e_1_3_2_1_56_1","volume-title":"Intel Cilk Plus Language Specification","author":"Intel Corporation","year":"2010","unstructured":"Intel Corporation . Intel Cilk Plus Language Specification , 2010 . Available from http:\/\/software.intel.com\/sites\/products\/cilk-plus\/cilk_plus_language_s%pecification.pdf. Intel Corporation. Intel Cilk Plus Language Specification, 2010. Available from http:\/\/software.intel.com\/sites\/products\/cilk-plus\/cilk_plus_language_s%pecification.pdf."},{"key":"e_1_3_2_1_57_1","unstructured":"Intel Corporation. Intel(R) Threading Building Blocks 2012. Available from http:\/\/software.intel.com\/sites\/products\/documentation\/doclib\/tbb_sa\/he%lp\/index.htm.  Intel Corporation. Intel(R) Threading Building Blocks 2012. Available from http:\/\/software.intel.com\/sites\/products\/documentation\/doclib\/tbb_sa\/he%lp\/index.htm."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"crossref","unstructured":"K. E. Iverson. A Programming Language. John Wiley & Sons 1962.   K. E. Iverson. A Programming Language. John Wiley & Sons 1962.","DOI":"10.1145\/1460833.1460872"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1137\/0914041"},{"key":"e_1_3_2_1_60_1","volume-title":"The High Performance Fortran Handbook","author":"Koelbel C. H.","year":"1994","unstructured":"C. H. Koelbel , D. B. Loveman , R. S. Schreiber , G. L. Steele Jr ., and M. E. Zosel . The High Performance Fortran Handbook . The MIT Press , 1994 . C. H. Koelbel, D. B. Loveman, R. S. Schreiber, G. L. Steele Jr., and M. E. Zosel. The High Performance Fortran Handbook. The MIT Press, 1994."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584032"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146387"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2009.4919639"},{"key":"e_1_3_2_1_64_1","volume-title":"OSDI. USENIX","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. Blelloch , and C. Guestrin . GraphChi: large-scale graph computation on just a PC . In OSDI. USENIX , 2012 . A. Kyrola, G. Blelloch, and C. Guestrin. GraphChi: large-scale graph computation on just a PC. In OSDI. USENIX, 2012."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/337449.337465"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2006.180"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312056"},{"key":"e_1_3_2_1_69_1","volume-title":"MSDN Magazine","author":"Leijen D.","year":"2007","unstructured":"D. Leijen and J. Hall . Optimize managed code for multi-core machines . MSDN Magazine , 2007 . Available from http:\/\/msdn.microsoft.com\/magazine\/. D. Leijen and J. Hall. Optimize managed code for multi-core machines. MSDN Magazine, 2007. Available from http:\/\/msdn.microsoft.com\/magazine\/."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-010-0405-3"},{"key":"e_1_3_2_1_71_1","volume-title":"Stanford network analysis platform. Available from http:\/\/snap.stanford.edu\/data\/index.html","author":"Leskovec J.","year":"2013","unstructured":"J. Leskovec . SNAP : Stanford network analysis platform. Available from http:\/\/snap.stanford.edu\/data\/index.html , 2013 . J. Leskovec. SNAP: Stanford network analysis platform. Available from http:\/\/snap.stanford.edu\/data\/index.html, 2013."},{"key":"e_1_3_2_1_72_1","volume-title":"CoRR","author":"Leskovec J.","year":"2008","unstructured":"J. Leskovec , K. J. Lang , A. Dasgupta , and M. W. Mahoney . Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters . CoRR , 2008 . J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. CoRR, 2008."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_75_1","volume-title":"UAI","author":"Low Y.","year":"2010","unstructured":"Y. Low , J. Gonzalez , A. Kyrola , D. Bickson , C. Guestrin , and J. M. Hellerstein . GraphLab: A new parallel framework for machine learning . In UAI , 2010 . Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. GraphLab: A new parallel framework for machine learning. In UAI, 2010."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/185675.306789"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_79_1","unstructured":"A. McCallum. Cora data set. Available from http:\/\/people.cs.umass.edu\/mccallum\/data.html.  A. McCallum. Cora data set. Available from http:\/\/people.cs.umass.edu\/mccallum\/data.html."},{"key":"e_1_3_2_1_80_1","volume-title":"Sept.","author":"McCrady D.","year":"2008","unstructured":"D. McCrady . Avoiding contention using combinable objects. Microsoft Developer Network blog post , Sept. 2008 . D. McCrady. Avoiding contention using combinable objects. Microsoft Developer Network blog post, Sept. 2008."},{"key":"e_1_3_2_1_81_1","volume-title":"Available from http:\/\/www.cs.cmu.edu\/tom\/10709_fall09\/NPIC500.pdf","author":"Mitchell T.","year":"2009","unstructured":"T. Mitchell . NPIC500 data set. Available from http:\/\/www.cs.cmu.edu\/tom\/10709_fall09\/NPIC500.pdf , 2009 . T. Mitchell. NPIC500 data set. Available from http:\/\/www.cs.cmu.edu\/tom\/10709_fall09\/NPIC500.pdf, 2009."},{"key":"e_1_3_2_1_82_1","volume-title":"UAI","author":"Murphy K. P.","year":"1999","unstructured":"K. P. Murphy , Y. Weiss , and M. I. Jordan . Loopy belief propagation for approximate inference: An empirical study . In UAI , 1999 . K. P. Murphy, Y. Weiss, and M. I. Jordan. Loopy belief propagation for approximate inference: An empirical study. In UAI, 1999."},{"key":"e_1_3_2_1_83_1","author":"Netzer R. H. B.","year":"1992","unstructured":"R. H. B. Netzer and B. P. Miller . What are race conditions? ACM Letters on Programming Languages and Systems , 1992 . R. H. B. Netzer and B. P. Miller. What are race conditions? ACM Letters on Programming Languages and Systems, 1992.","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/354756.354805"},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508256"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/1344551.1344561"},{"key":"e_1_3_2_1_87_1","volume-title":"Morgan Kaufmann","author":"Pearl J.","year":"1988","unstructured":"J. Pearl . Probabilistic Reasoning in Intelligent Systems : Networks of Plausible Inference . Morgan Kaufmann , 1988 . J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988."},{"key":"e_1_3_2_1_88_1","volume-title":"Intel Threading Building Blocks: Outfitting C++ for Multi-core Processor Parallelism","author":"Reinders J.","year":"2007","unstructured":"J. Reinders . Intel Threading Building Blocks: Outfitting C++ for Multi-core Processor Parallelism . O'Reilly Media, Inc. , 2007 . J. Reinders. Intel Threading Building Blocks: Outfitting C++ for Multi-core Processor Parallelism. O'Reilly Media, Inc., 2007."},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486189"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312018"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.65"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96731"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21738-3"},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167156"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1093\/qjmam\/1.1.287"},{"key":"e_1_3_2_1_96_1","author":"Welsh D. J. A.","year":"1967","unstructured":"D. J. A. Welsh and M. B. Powell . An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal , 1967 . D. J. A. Welsh and M. B. Powell. An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal, 1967.","journal-title":"The Computer Journal"},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555754.1555796"},{"key":"e_1_3_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/125826.126164"}],"event":{"name":"SPAA '14: 26th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Prague Czech Republic","acronym":"SPAA '14"},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612673","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612673","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:34Z","timestamp":1750230094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612673"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":95,"alternative-id":["10.1145\/2612669.2612673","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612673","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}