{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:37:20Z","timestamp":1648597040528},"reference-count":35,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,9,1]],"date-time":"1983-09-01T00:00:00Z","timestamp":431222400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1983,9]]},"DOI":"10.1016\/0196-6774(83)90028-7","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"286-300","source":"Crossref","is-referenced-by-count":4,"title":["The NP-completeness column: An ongoing guide"],"prefix":"10.1016","volume":"4","author":[{"given":"David S","family":"Johnson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(83)90028-7_BIB1","series-title":"Proceedings 2nd IBM Symp. on Mathematical Foundations of Computer Science","first-page":"229","article-title":"Complexity of the deadlock avoidance problem","author":"Araki","year":"1977"},{"key":"10.1016\/0196-6774(83)90028-7_BIB2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1145\/320141.320146","article-title":"Parallelism and recovery in databases","volume":"5","author":"Bayer","year":"1980","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/0196-6774(83)90028-7_BIB3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/356842.356846","article-title":"Concurrency control in distributed database systems","volume":"13","author":"Bernstein","year":"1981","journal-title":"Comput. Surveys"},{"key":"10.1016\/0196-6774(83)90028-7_BIB4","series-title":"Proceedings 1st ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing","first-page":"209","article-title":"Concurrency control algorithms for multiversion database systems","author":"Bernstein","year":"1982"},{"key":"10.1016\/0196-6774(83)90028-7_BIB5","article-title":"On serializability","author":"Ekanadham","year":"1981"},{"key":"10.1016\/0196-6774(83)90028-7_BIB6","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1145\/360363.360369","article-title":"The notions of consistency and predicate locks in a database system","volume":"19","author":"Eswaran","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(83)90028-7_BIB7","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1137\/0207027","article-title":"Deadlock prediction: Easy and hard cases","volume":"7","author":"Gold","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(83)90028-7_BIB8","series-title":"Proceedings Int. Conf. on Very Large Data Bases","first-page":"428","article-title":"Granularity of locks in a shared data base","author":"Gray","year":"1975"},{"key":"10.1016\/0196-6774(83)90028-7_BIB9","unstructured":"D. S. Johnson, Exercise for the reader (1983)."},{"key":"10.1016\/0196-6774(83)90028-7_BIB10","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/322186.322192","article-title":"Testing deadlock-freedom of computer systems","volume":"27","author":"Kameda","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(83)90028-7_BIB11","series-title":"Proceedings 22nd Ann. Symp. on Foundations of Computer Science","first-page":"185","article-title":"The complexity of distributed concurrency control","author":"Kanellakis","year":"1981"},{"key":"10.1016\/0196-6774(83)90028-7_BIB12","series-title":"Proceedings 1st ACM SIGACT-SIGMOD Symp. on Principles of Database Systems","first-page":"98","article-title":"Is distributed locking harder?","author":"Kanellakis","year":"1982"},{"key":"10.1016\/0196-6774(83)90028-7_BIB13","series-title":"Proceedings 20th Ann. Symp. on Foundations of Computer Science","first-page":"274","article-title":"Controlling concurrency using locking protocols","author":"Kedem","year":"1979"},{"key":"10.1016\/0196-6774(83)90028-7_BIB14","series-title":"Proceedings 1st ACM SIGACT-SIGMOD Symp. on Principles of Database Systems","first-page":"293","article-title":"Theory of serializability for a parallel model of transactions","author":"Krishnamurthy","year":"1982"},{"key":"10.1016\/0196-6774(83)90028-7_BIB15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/356842.356845","article-title":"A survey of techniques for synchronization and recovery in decentralized computer systems","volume":"13","author":"Kohler","year":"1981","journal-title":"Comput. Surveys"},{"key":"10.1016\/0196-6774(83)90028-7_BIB16","series-title":"Technical Report","article-title":"Serializability problems of interleaved database transactions","author":"Lausen","year":"1981"},{"key":"10.1016\/0196-6774(83)90028-7_BIB17","series-title":"Complexity of optimal deadlock recovery","author":"Leung","year":"1983"},{"key":"10.1016\/0196-6774(83)90028-7_BIB18","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1109\/TC.1979.1675435","article-title":"On minimal cost recovery from system deadlock","author":"Leung","year":"1979","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0196-6774(83)90028-7_BIB19","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0196-6774(81)90023-7","article-title":"A fast algorithm for testing safety and detecting deadlocks in locked transaction systems","volume":"2","author":"Lipski","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(83)90028-7_BIB20","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1145\/322344.322351","article-title":"Deadlock avoidance revisited","volume":"29","author":"Minoura","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(83)90028-7_BIB21","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/322154.322158","article-title":"The serializability of concurrent database updates","volume":"26","author":"Papadimitriou","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(83)90028-7_BIB22","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1137\/0212013","article-title":"Concurrency control by locking","volume":"12","author":"Papadimitriou","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(83)90028-7_BIB23","series-title":"Proceedings Conf. on Theoretical Computer Science","first-page":"275","article-title":"Computational problems related to database concurrency control","author":"Papadimitriou","year":"1977"},{"key":"10.1016\/0196-6774(83)90028-7_BIB24","series-title":"Proceedings 1st ACM SIGACT-SIGMOD Symp. on Principles of Database Systems","first-page":"76","article-title":"On concurrency control by multiple versions","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0196-6774(83)90028-7_BIB25","series-title":"Proceedings 22nd Ann. Symp. on Foundations of Computer Science","first-page":"175","article-title":"A model of concurrent database transactions","author":"Sethi","year":"1981"},{"key":"10.1016\/0196-6774(83)90028-7_BIB26","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/322307.322314","article-title":"Useless actions make a difference: Strict serializability of database updates","volume":"29","author":"Sethi","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(83)90028-7_BIB27","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1145\/322169.322176","article-title":"Consistency in hierarchical database systems","volume":"27","author":"Silberschatz","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(83)90028-7_BIB28","series-title":"Proceedings 1st ACM SIGACT-SIGMOD Symp. on Principles of Database Systems","first-page":"108","article-title":"An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems","author":"Soisalon-Soininen","year":"1982"},{"key":"10.1016\/0196-6774(83)90028-7_BIB29","series-title":"Proceedings 17th Ann. Symp. on Foundations of Computer Science","first-page":"19","article-title":"Concurrency control for database systems","author":"Stearns","year":"1976"},{"key":"10.1016\/0196-6774(83)90028-7_BIB30","series-title":"Proceedings ACM-SIGMOD 1981 Int. Conf. on Management of Data","first-page":"74","article-title":"Distributed database concurrency controls using before values","author":"Stearns","year":"1981"},{"key":"10.1016\/0196-6774(83)90028-7_BIB31","first-page":"251","article-title":"Complexity of the deadlock avoidance problem","author":"Sugiyama","year":"1977","journal-title":"Trans. IECE Japan"},{"key":"10.1016\/0196-6774(83)90028-7_BIB32","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/322326.322333","article-title":"A theory of safe locking policies in database systems","volume":"29","author":"Yannakakis","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(83)90028-7_BIB33","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/0211031","article-title":"Freedom from deadlock of safe locking policies","volume":"11","author":"Yannakakis","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(83)90028-7_BIB34","series-title":"Serializability by locking","author":"Yannakakis","year":"1982"},{"key":"10.1016\/0196-6774(83)90028-7_BIB35","series-title":"Proceedings 20th Ann. Symp. on Foundations of Computer Science","first-page":"286","article-title":"Locking policies: Safety and freedom from deadlock","author":"Yannakakis","year":"1979"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677483900287?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677483900287?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:51:03Z","timestamp":1548744663000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677483900287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,9]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,9]]}},"alternative-id":["0196677483900287"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(83)90028-7","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1983,9]]}}}