{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:28:58Z","timestamp":1725553738984},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343837"},{"type":"electronic","value":"9783540343844"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758532_38","type":"book-chapter","created":{"date-parts":[[2006,5,9]],"date-time":"2006-05-09T18:53:17Z","timestamp":1147200797000},"page":"272-280","source":"Crossref","is-referenced-by-count":4,"title":["On Modeling and Analyzing Sparsely Networked Large-Scale Multi-agent Systems with Cellular and Graph Automata"],"prefix":"10.1007","author":[{"given":"Predrag T.","family":"To\u0161i\u0107","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"Barrett, C., Hunt III, H.B., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. Los Alamos National Laboratory Report, LA-UR-01-668 (2001)"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Barrett, C.L., Hunt, H.B., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E., Tosic, P.T.: Gardens of Eden and Fixed Points in Sequential Dynamical Systems. In: Proc. AA DM-CCG, Discrete Math. & Theoretical Comp. Sci., pp. 95\u2013110 (2001)","DOI":"10.46298\/dmtcs.2294"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0096-3003(98)10114-5","volume":"107\/2-3","author":"C. Barrett","year":"2000","unstructured":"Barrett, C., Mortveit, H., Reidys, C.: Elements of a theory of simulation II: sequential dynamical systems. Appl. Math. & Comput.\u00a0107\/2-3, 121\u2013136 (2000)","journal-title":"Appl. Math. & Comput."},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0096-3003(00)00042-4","volume":"122","author":"C. Barrett","year":"2001","unstructured":"Barrett, C., Mortveit, H., Reidys, C.: Elements of a theory of computer simulation III: equivalence of SDS. Appl. Math. & Comput.\u00a0122, 325\u2013340 (2001)","journal-title":"Appl. Math. & Comput."},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0096-3003(97)10166-7","volume":"98","author":"C. Barrett","year":"1999","unstructured":"Barrett, C., Reidys, C.: Elements of a theory of computer simulation I: sequential CA over random graphs. Applied Math. & Comput.\u00a098, 241\u2013259 (1999)","journal-title":"Applied Math. & Comput."},{"key":"38_CR6","unstructured":"Beckman, R.J., et al.: TRANSIMS: Case Study. Dallas Ft-Worth. Los Alamos National Laboratory, LA UR 97-4502 (1999)"},{"key":"38_CR7","first-page":"577","volume":"3","author":"P. Floreen","year":"1989","unstructured":"Floreen, P., Orponen, P.: On the Computational Complexity of Analyzing Hopfield Nets. Complex Systems\u00a03, 577\u2013587 (1989)","journal-title":"Complex Systems"},{"key":"38_CR8","unstructured":"Floreen, P., Orponen, P.: Complexity Issues in Discrete Hopfield Networks. NeuroCOLT Technical Report Series, NC-TR-94-009 (October 1994)"},{"key":"38_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Co., San Francisco (1979)"},{"key":"38_CR10","series-title":"Math. and Its Applications series","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-0529-0","volume-title":"Neural and Automata Networks: Dynamical Behavior and Applications","author":"E. Goles","year":"1990","unstructured":"Goles, E., Martinez, S.: Neural and Automata Networks: Dynamical Behavior and Applications. Math. and Its Applications series, vol.\u00a058. Kluwer, Dordrecht (1990)"},{"key":"38_CR11","series-title":"Nonlinear Phenomena and Complex Systems series","volume-title":"Cellular Automata and Complex Systems","year":"1999","unstructured":"Goles, E., Martinez, S. (eds.): Cellular Automata and Complex Systems. Nonlinear Phenomena and Complex Systems series. Kluwer, Dordrecht (1999)"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/PL00001601","volume":"9","author":"C. Greenhill","year":"2000","unstructured":"Greenhill, C.: The Complexity of Counting Colourings and Independent Sets in Sparse Graphs and Hypergraphs. Comput. Complexity\u00a09, 52\u201372 (2000)","journal-title":"Comput. Complexity"},{"volume-title":"Cellular Automata: Theory and Experiment","year":"1989","key":"38_CR13","unstructured":"Gutowitz, H. (ed.): Cellular Automata: Theory and Experiment. N. Holland, Amsterdam (1989)"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"J.J. Hopfield","year":"1982","unstructured":"Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proc. Nat\u2019l Academy Sci (USA)\u00a079, 2554\u20132558 (1982)","journal-title":"Proc. Nat\u2019l Academy Sci. (USA)"},{"issue":"1-2","key":"38_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-2789(84)90249-5","volume":"10","author":"T.E. Ingerson","year":"1984","unstructured":"Ingerson, T.E., Buvel, R.L.: Structure in asynchronous cellular automata. Physica D: Nonlinear Phenomena\u00a010(1-2), 59\u201368 (1984)","journal-title":"Physica D: Nonlinear Phenomena"},{"key":"38_CR16","unstructured":"Laubenbacher, R., Pareigis, B.: Finite Dynamical Systems. Technical report, Dept. of Mathematical Sciences, N. Mexico State Univ., Las Cruces (2000)"},{"issue":"1-3","key":"38_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0012-365X(00)00115-1","volume":"226","author":"H. Mortveit","year":"2001","unstructured":"Mortveit, H., Reidys, C.: Discrete sequential dynamical systems. Discrete Mathematics\u00a0226(1-3), 281\u2013295 (2001)","journal-title":"Discrete Mathematics"},{"key":"38_CR18","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D. Roth","year":"1996","unstructured":"Roth, D.: On the Hardness of Approximate Reasoning. Artificial Intelligence\u00a082, 273\u2013302 (1996)","journal-title":"Artificial Intelligence"},{"key":"#cr-split#-38_CR19.1","doi-asserted-by":"crossref","unstructured":"Tosic, P.: On Counting Fixed Point Configurations in Star Networks. In: APDCM Workshop within The 19th IEEE Int\u2019l Parallel & Distributed Processing Symp. 2005 (2005);","DOI":"10.1109\/IPDPS.2005.303"},{"key":"#cr-split#-38_CR19.2","unstructured":"Proc. IEEE-IPDPS 2005 (CD-Rom)"},{"key":"38_CR20","unstructured":"Tosic, P.: On Complexity of Counting Fixed Point Configurations in Certain Classes of Graph Automata. Electronic Colloquium on Computational Complexity, ECCC-TR05-051 (revision 2) (April 2005)"},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"Tosic, P.: Counting Fixed Point and Gardens of Eden of Sequential Dynamical Systems on Planar Bipartite Graphs. Electronic Colloquium on Computational Complexity, ECCC-TR05-091 (August. 2005)","DOI":"10.1142\/S0129054106004339"},{"key":"38_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1007\/978-3-540-30479-1_89","volume-title":"Cellular Automata","author":"P. Tosic","year":"2004","unstructured":"Tosic, P., Agha, G.: Characterizing Configuration Spaces of Simple Threshold Cellular Automata. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol.\u00a03305, pp. 861\u2013870. Springer, Heidelberg (2004)"},{"key":"38_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11560319_18","volume-title":"Unconventional Computation","author":"P. Tosic","year":"2005","unstructured":"Tosic, P., Agha, G.: On computational complexity of counting fixed points in certain classes of graph automata. In: Calude, C.S., Dinneen, M.J., P\u0103un, G., Jes\u00fas P\u00e9rez-J\u00edmenez, M., Rozenberg, G. (eds.) UC 2005. LNCS, vol.\u00a03699, pp. 191\u2013205. Springer, Heidelberg (2005)"},{"key":"38_CR24","unstructured":"Tosic, P., Agha, G.: Parallel vs. Sequential Threshold Cellular Automata: Comparison and Contrast, session Complex Systems Methods 1. In: Proc. European Conference on Complex Systems (ECCS 2005), Euro. Complex Systems Society (2005)"},{"key":"38_CR25","unstructured":"Tosic, P., Agha, G.: On Computational Complexity of Predicting Dynamical Evolution of Large Agent Ensembles. In: Proc. of the 3rd European Workshop on Multiagent Systems (EUMAS 2005). Flemish Academy of Sciences, pp. 415\u2013426 (2005)"},{"issue":"2","key":"38_CR26","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"S. Vadhan","year":"2001","unstructured":"Vadhan, S.: The Complexity of Counting in Sparse, Regular and Planar Graphs. SIAM J. Computing\u00a031(2), 398\u2013427 (2001)","journal-title":"SIAM J. Computing"},{"key":"38_CR27","series-title":"Teubner Series Comp. Sci","volume-title":"\u201cThe Complexity of Boolean Functions\u201d","author":"I. Wegener","year":"1987","unstructured":"Wegener, I.: \u201cThe Complexity of Boolean Functions\u201d. Teubner Series Comp. Sci. Wiley, Chichester (1987)"},{"volume-title":"Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence","year":"1999","key":"38_CR28","unstructured":"Weiss, G. (ed.): Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence. The MIT Press, Cambridge (1999)"},{"key":"38_CR29","volume-title":"Theory and applications of cellular automata","author":"S. Wolfram","year":"1986","unstructured":"Wolfram, S.: Theory and applications of cellular automata. World Scientific, Singapore (1986)"},{"volume-title":"Cellular Automata and Complexity (collected papers)","year":"1994","key":"38_CR30","unstructured":"Wolfram, S. (ed.): Cellular Automata and Complexity (collected papers). Addison-Wesley, Reading (1994)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758532_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T11:10:23Z","timestamp":1683457823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758532_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343837","9783540343844"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11758532_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}