default search action
Predrag T. Tosic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c33]Khalid Albulayhi, Predrag T. Tosic, Frederick T. Sheldon:
G-Model: A Novel Approach to Privacy-Preserving 1: M Microdata Publication. CSCloud/EdgeCom 2020: 88-99
2010 – 2019
- 2018
- [c32]Carlos Ordonez, Predrag T. Tosic:
Time Complexity and Parallel Speedup of Relational Queries to Solve Graph Problems. DEXA (2) 2018: 339-349 - [c31]Mohammad Ashrafuzzaman, Yacine Chakhchoukh, Ananth A. Jillepalli, Predrag T. Tosic, Daniel Conte de Leon, Frederick T. Sheldon, Brian K. Johnson:
Detecting Stealthy False Data Injection Attacks in Power Grids Using Deep Learning. IWCMC 2018: 219-225 - [c30]Ananth A. Jillepalli, Daniel Conte de Leon, Mohammad Ashrafuzzaman, Yacine Chakhchoukh, Brian K. Johnson, Frederick T. Sheldon, Jim Alves-Foss, Predrag T. Tosic, Michael A. Haney:
HESTIA: Adversarial Modeling and Risk Assessment for CPCS. IWCMC 2018: 226-231 - 2017
- [c29]Predrag T. Tosic:
Phase Transitions in Possible Dynamics of Cellular and Graph Automata Models of Sparsely Interconnected Multi-Agent Systems. AAMAS 2017: 474-483 - [c28]Predrag T. Tosic, Carlos Ordonez:
Boolean Network Models of Collective Dynamics of Open and Closed Large-Scale Multi-agent Systems. HoloMAS 2017: 95-110 - 2016
- [c27]Predrag T. Tosic:
On Simple Models of Associative Memory: Network Density Is Not Required for Provably Complex Behavior. BIH 2016: 61-71 - [c26]Predrag T. Tosic:
Reputation-Based Distributed Coordination for Heterogeneous Autonomous Agents. WI Workshops 2016: 72-75 - [c25]Predrag T. Tosic:
On Learning and Co-learning Effective Strategies in Iterated Travelers' Dilemma. WI 2016: 674-677 - 2015
- [c24]Predrag T. Tosic:
Graph Patterns, Reinforcement Learning and Models of Reputation for Improving Coalition Formation in Collaborative Multi-agent Systems. EUMAS/AT 2015: 74-81 - 2013
- [j3]Javier García-García, Carlos Ordonez, Predrag T. Tosic:
Efficiently repairing and measuring replica consistency in distributed databases. Distributed Parallel Databases 31(3): 377-411 (2013) - 2012
- [c23]Predrag T. Tosic, Carlos Ordonez:
Distributed Protocols for Multi-Agent Coalition Formation: A Negotiation Perspective. AMT 2012: 93-102 - [c22]Carlos Ordonez, Naveen Mohanam, Carlos Garcia-Alvarado, Predrag T. Tosic, Edgar Martinez:
Fast PCA computation in a DBMS with aggregate UDFs and LAPACK. CIKM 2012: 2219-2223 - [c21]Predrag T. Tosic, Philip Dasler, Carlos Ordonez:
On Finding and Learning Effective Strategies for Complex Non-zero-sum Repeated Games. IAT 2012: 395-400 - [c20]Predrag T. Tosic, Philip Dasler:
Strategies for Challenging Two-player Games - Some Lessons from Iterated Traveler's Dilemma. ICAART (2) 2012: 72-82 - 2011
- [c19]Predrag T. Tosic, Philip Dasler:
How to Play Well in Non-zero Sum Games: Some Lessons from Generalized Traveler's Dilemma. AMT 2011: 300-311 - 2010
- [j2]Predrag T. Tosic:
Cellular Automata Communication Models: Comparative Analysis of Parallel, Sequential and Asynchronous CA with Simple Threshold Update Rules. Int. J. Nat. Comput. Res. 1(3): 66-84 (2010) - [c18]Predrag T. Tosic, Naveen K. R. Ginne:
Some Optimizations in Maximal Clique Based Distributed Coalition Formation for Collaborative Multi-Agent Systems. AMT 2010: 353-360 - [c17]Predrag T. Tosic:
On the complexity of enumerating possible dynamics of sparsely connected Boolean network automata with simple update rules. Automata 2010: 125-144 - [c16]Predrag T. Tosic, Ricardo Vilalta:
Learning and Meta-Learning for Coordination of Autonomous Unmanned Vehicles - A Preliminary Analysis. ECAI 2010: 163-168 - [c15]Predrag T. Tosic, Naveen K. R. Ginne:
MCDCF: A Fully Distributed Algorithm for Coalition Formation in Collaborative Multi-Agent Systems. IC-AI 2010: 957-963 - [c14]Predrag T. Tosic:
Some Challenges in Studying Resource-Bounded Autonomous Agents in Complex Multi-Agent Environments. IKE 2010: 438-444 - [c13]Predrag T. Tosic:
Some Models for Autonomous Agents' Action Selection in Complex Partially Observable Environments. IKE 2010: 452-458 - [c12]Predrag T. Tosic, Ricardo Vilalta:
A unified framework for reinforcement learning, co-learning and meta-learning how to coordinate in collaborative multi-agent systems. ICCS 2010: 2217-2226
2000 – 2009
- 2006
- [b1]Predrag T. Tosic:
Modeling and Analysis of the Collective Dynamics of Large-Scale Multi-Agent Systems. University of Illinois Urbana-Champaign, USA, 2006 - [j1]Predrag T. Tosic:
On the Complexity of Counting Fixed Points and Gardens of Eden in Sequential Dynamical Systems on Planar Bipartite Graphs. Int. J. Found. Comput. Sci. 17(5): 1179-1204 (2006) - [c11]Predrag T. Tosic:
On Modeling and Analyzing Sparsely Networked Large-Scale Multi-agent Systems with Cellular and Graph Automata. International Conference on Computational Science (3) 2006: 272-280 - [i3]Predrag T. Tosic:
Computational Complexity of Some Enumeration Problems About Uniformly Sparse Boolean Network Automata. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c10]Predrag T. Tosic, Gul A. Agha:
Computational Complexity of Predicting Some Properties of Large-Scale Agent Ensembles' Dynamical Evolution. EUMAS 2005: 415-426 - [c9]Predrag T. Tosic:
On Counting Fixed Point Configurations in Star Networks. IPDPS 2005 - [c8]Predrag T. Tosic:
Cellular automata for distributed computing: models of agent interaction and their implications. SMC 2005: 3204-3209 - [c7]Predrag T. Tosic, Gul A. Agha:
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata. UC 2005: 191-205 - [i2]Predrag T. Tosic:
On Complexity of Counting Fixed Points in Certain Classes of Graph Automata. Electron. Colloquium Comput. Complex. TR05 (2005) - [i1]Predrag T. Tosic:
Counting Fixed Points and Gardens of Eden of Sequential Dynamical Systems on Planar Bipartite Graphs. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c6]Predrag T. Tosic, Gul Agha:
Characterizing Configuration Spaces of Simple Threshold Cellular Automata. ACRI 2004: 861-870 - [c5]Predrag T. Tosic:
A perspective on the future of massively parallel computing: fine-grain vs. coarse-grain parallel models comparison & contrast. Conf. Computing Frontiers 2004: 488-502 - [c4]Predrag T. Tosic, Gul Agha:
Concurrency vs. Sequential Interleavings in 1-D Threshold Cellular Automata. IPDPS 2004 - [c3]Predrag T. Tosic, Gul A. Agha:
Maximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems. MMAS 2004: 104-120 - [c2]Predrag T. Tosic, Gul A. Agha:
Towards a hierarchical taxonomy of autonomous agents. SMC (4) 2004: 3421-3426 - 2001
- [c1]Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Predrag T. Tosic:
Gardens of Eden and Fixed Points in Sequential Dynamical Systems. DM-CCG 2001: 95-110
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint