{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:36Z","timestamp":1725558636737},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202165"},{"type":"electronic","value":"9783540452089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45208-9_11","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:49:20Z","timestamp":1277700560000},"page":"125-136","source":"Crossref","is-referenced-by-count":0,"title":["A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set"],"prefix":"10.1007","author":[{"given":"Jens","family":"Gustedt","sequence":"first","affiliation":[]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R.P. Brent","year":"1974","unstructured":"Brent, R.P.: The parallel evaluation of generic arithmetic expressions. Journal of the ACM\u00a021(2), 201\u2013206 (1974)","journal-title":"Journal of the ACM"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/BF01206637","volume":"4","author":"A. Condon","year":"1994","unstructured":"Condon, A.: A theory of strict P-completeness. Computational Complexity\u00a04, 220\u2013241 (1994)","journal-title":"Computational Complexity"},{"doi-asserted-by":"crossref","unstructured":"Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K., Santos, E., Subramonian, R., Von Eicken, T.: LogP: Towards a Realistic Model of Parallel Computation. In: Proceeding of 4th ACMSIGPLAN Symp. on Principles and Practises of Parallel Programming, pp. 1\u201312 (1993)","key":"11_CR3","DOI":"10.1145\/155332.155333"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1142\/S0218195996000241","volume":"6","author":"F. Dehne","year":"1996","unstructured":"Dehne, F., Fabri, A., And Rau-Chaplin, A.: Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry\u00a06(3), 379\u2013400 (1996)","journal-title":"International Journal on Computational Geometry"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1142\/S0129626499000384","volume":"9","author":"A. Ferreira","year":"2000","unstructured":"Ferreira, A., And Schabanel, N.: A randomized BSP\/CGMalgorithm for the maximal independent set. Parallel Processing Letters\u00a09(3), 411\u2013422 (2000)","journal-title":"Parallel Processing Letters"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-40064-8_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A.H. Gebremedhin","year":"2000","unstructured":"Gebremedhin, A.H., Gu\u00e9rin Lassous, I., Gustedt, J., Telle, J.: Graph coloring on a coarse grained multiprocessor. In: Brandes, U., Wagner, D. (eds.) WG 2000. LNCS, vol.\u00a01928, pp. 184\u2013195. Springer, Heidelberg (2000)"},{"key":"11_CR7","first-page":"106","volume-title":"16th Annual International Symposiumon High Performance Computing Systems and Applications, The Institute of Electrical and Electronics Engineers","author":"A.H. Gebremedhin","year":"2002","unstructured":"Gebremedhin, A.H., Gu\u00e9rin Lassous, I., Gustedt, J., Telle, J.: PRO: a model for parallel resource-optimal computation. In: 16th Annual International Symposiumon High Performance Computing Systems and Applications, The Institute of Electrical and Electronics Engineers, pp. 106\u2013113. IEEE, Los Alamitos (2002)"},{"key":"11_CR8","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to parallel computation: Pcompleteness theory","author":"R. Greenlaw","year":"1995","unstructured":"Greenlaw, R., Hoover, J., Ruzzo, W.: Limits to parallel computation: Pcompleteness theory. Oxford University Press, Oxford (1995)"},{"key":"11_CR9","series-title":"Algorithms and Complexity","first-page":"869","volume-title":"Handbook of Theoretical Computer Science","author":"R.M. Karp","year":"1990","unstructured":"Karp, R.M., Ramachandran, V.: Parallel Algorithms for Shared-Memory Machines. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Algorithms and Complexity, vol.\u00a0A, pp. 869\u2013941. Elsevier Science Publishers B.V., Amsterdam (1990)"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(90)90192-K","volume":"71","author":"C.P. Kruskal","year":"1990","unstructured":"Kruskal, C.P., Rudolph, L., Snir, M.: A complexity theory of efficient parallel algorithms. Theoretical Computer Science\u00a071(1), 95\u2013132 (1990)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF02088292","volume":"22","author":"S. Miyano","year":"1989","unstructured":"Miyano, S.: The lexicographically first maximal subgraph problems: P-completeness and NC-algorithms. Mathematical Systems Theory\u00a022(1), 47\u201373 (1989)","journal-title":"Mathematical Systems Theory"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1142\/S0129054199000332","volume":"10","author":"R. Uehara","year":"1999","unstructured":"Uehara, R.: A measure for the lexicographically first maximal independent set problem and its limits. International Journal of Foundations of Computer Science\u00a010(4), 473\u2013482 (1999)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"8","key":"11_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L.G. Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Communications of the ACM\u00a033(8), 103\u2013111 (1990)","journal-title":"Communications of the ACM"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1109\/TC.1986.1676783","volume":"35","author":"J.S. Vitter","year":"1986","unstructured":"Vitter, J.S., Simons, R.A.: New classes for parallel comlexity. IEEE Trans. Comput.\u00a035, 403\u2013418 (1986)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45208-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T07:19:47Z","timestamp":1635578387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45208-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202165","9783540452089"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45208-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}