( en | de | ru )

 

Disambiguation of "Tosic, Predrag T."

Author of the publication

copydeleteadd this publication to your clipboard
Gardens of Eden and Fixed Points in Sequential Dynamical Systems.

, , , , , , and . DM-CCG, volume AA of DMTCS Proceedings, page 95-110. (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Oliver Tosic

Predrag Maksimovic

Predrag Ili

Predrag Gruji

Predrag Vlaji

 

Other publications of authors with the same name

On Modeling and Analyzing Sparsely Networked Large-Scale Multi-agent Systems with Cellular and Graph Automata.. International Conference on Computational Science (3), volume 3993 of Lecture Notes in Computer Science, page 272-280. Springer, (2006)Maximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems., and . MMAS, volume 3446 of Lecture Notes in Computer Science, page 104-120. Springer, (2004)Computational Complexity of Some Enumeration Problems About Uniformly Sparse Boolean Network Automata.. Electron. Colloquium Comput. Complex., (2006)Counting Fixed Points and Gardens of Eden of Sequential Dynamical Systems on Planar Bipartite Graphs.. Electron. Colloquium Comput. Complex., (2005)Maximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems, and . Massively Multi-Agent Systems I, volume 3446 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2005)Cellular Automata Communication Models: Comparative Analysis of Parallel, Sequential and Asynchronous CA with Simple Threshold Update Rules.. IJNCR, 1 (3): 66-84 (2010)Strategies for Challenging Two-player Games - Some Lessons from Iterated Traveler's Dilemma., and . ICAART (2), page 72-82. SciTePress, (2012)On Counting Fixed Point Configurations in Star Networks.. IPDPS, IEEE Computer Society, (2005)On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata., and . UC, volume 3699 of Lecture Notes in Computer Science, page 191-205. Springer, (2005)Efficiently repairing and measuring replica consistency in distributed databases., , and . Distributed Parallel Databases, 31 (3): 377-411 (2013)