{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T11:03:56Z","timestamp":1757588636260},"reference-count":16,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1984,1]]},"DOI":"10.1109\/tc.1984.5009318","type":"journal-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T20:36:47Z","timestamp":1243975007000},"page":"99-104","source":"Crossref","is-referenced-by-count":11,"title":["A Systolic Design for Connectivity Problems"],"prefix":"10.1109","volume":"C-33","author":[{"given":"Carla","family":"Savage","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802482"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1981.13","article-title":"census functions: an approach to vlsi upper bounds (preliminary version)","author":"lipton","year":"1981","journal-title":"Proc 22nd Annu IEEE Symp Foundations Comput Sci"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1676104"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321884"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804401"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1109\/TC.1980.1675627","article-title":"the parallel recognition of classes of graphs","volume":"c 29","author":"van scoy","year":"1980","journal-title":"IEEE Trans Comput"},{"key":"ref4","article-title":"systolic stacks, queues, and counters","author":"guibas","year":"1982","journal-title":"Proc 1982 Conf Advanced Research VLSI"},{"key":"ref3","article-title":"direct vlsi implementation of combinatorial algorithms","author":"guibas","year":"1979","journal-title":"Proc Caltech Conf VLSI"},{"key":"ref6","author":"ja'ja'","year":"1981","journal-title":"The VLSI complexity of graph problems"},{"key":"ref5","author":"hambrusch","year":"1981","journal-title":"VLSI algorithms for the connected component problem"},{"key":"ref8","author":"kung","year":"1979","journal-title":"Sparse Matrix Proc 1978"},{"key":"ref7","author":"kung","year":"1979","journal-title":"Systolic (VLSI) arrays for relational database operations"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1980.1653338"},{"key":"ref1","author":"aho","year":"1976","journal-title":"The Design and Analysis of Computer Algorithms"},{"key":"ref9","article-title":"systolic priority queues","author":"leiserson","year":"1979","journal-title":"Proc Caltech Conf VLSI"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/5009305\/05009318.pdf?arnumber=5009318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:40:11Z","timestamp":1638218411000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5009318\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,1]]},"references-count":16,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tc.1984.5009318","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1984,1]]}}}