| G-Model: A Novel Approach to Privacy-Preserving 1:M Microdata Publication | 0 | 0.34 | 2020 |
| Phase Transitions in Possible Dynamics of Cellular and Graph Automata Models of Sparsely Interconnected Multi-Agent Systems. | 0 | 0.34 | 2017 |
| Reputation-Based Distributed Coordination for Heterogeneous Autonomous Agents | 0 | 0.34 | 2016 |
| On Simple Models Of Associative Memory: Network Density Is Not Required For Provably Complex Behavior | 1 | 0.35 | 2016 |
| On Learning And Co-Learning Effective Strategies In Iterated Travelers' Dilemma | 0 | 0.34 | 2016 |
| Graph Patterns, Reinforcement Learning and Models of Reputation for Improving Coalition Formation in Collaborative Multi-agent Systems. | 0 | 0.34 | 2015 |
| Efficiently repairing and measuring replica consistency in distributed databases. | 1 | 0.35 | 2013 |
| Strategies for Challenging Two-player Games - Some Lessons from Iterated Traveler's Dilemma. | 0 | 0.34 | 2012 |
| On Finding and Learning Effective Strategies for Complex Non-zero-sum Repeated Games | 0 | 0.34 | 2012 |
| Fast PCA computation in a DBMS with aggregate UDFs and LAPACK | 3 | 0.46 | 2012 |
| How to playwell in non-zero sum games: some lessons from generalized traveler's dilemma | 0 | 0.34 | 2011 |
| MCDCF: A Fully Distributed Algorithm for Coalition Formation in Collaborative Multi-Agent Systems | 1 | 0.37 | 2010 |
| Cellular Automata Communication Models: Comparative Analysis of Parallel, Sequential and Asynchronous CA with Simple Threshold Update Rules | 2 | 0.39 | 2010 |
| On the complexity of enumerating possible dynamics of sparsely connected Boolean network automata with simple update rules. | 0 | 0.34 | 2010 |
| Some Challenges in Studying Resource-Bounded Autonomous Agents in Complex Multi-Agent Environments | 0 | 0.34 | 2010 |
| Some Models for Autonomous Agents' Action Selection in Complex Partially Observable Environments | 0 | 0.34 | 2010 |
| On The Complexity Of Counting Fixed Points And Gardens Of Eden In Sequential Dynamical Systems On Planar Bipartite Graphs | 8 | 0.58 | 2006 |
| Computational Complexity of Some Enumeration Problems About Uniformly Sparse Boolean Network Automata | 0 | 0.34 | 2006 |
| Counting Fixed Points and Gardens of Eden of Sequential Dynamical Systems on Planar Bipartite Graphs | 2 | 0.39 | 2005 |
| On Counting Fixed Point Configurations in Star Networks | 3 | 0.42 | 2005 |
| On Complexity of Counting Fixed Points in Certain Classes of Graph Automata | 0 | 0.34 | 2005 |
| Computational Complexity of Predicting Some Properties of Large-Scale Agent Ensembles' Dynamical Evolution | 0 | 0.34 | 2005 |
| Towards A Hierarchical Taxonomy Of Autonomous Agents | 4 | 0.40 | 2004 |
| A perspective on the future of massively parallel computing: fine-grain vs. coarse-grain parallel models comparison & contrast | 2 | 0.39 | 2004 |
| Concurrency vs. Sequential Interleavings in 1-D Threshold Cellular Automata | 6 | 0.47 | 2004 |
| Gardens of Eden and Fixed Points in Sequential Dynamical Systems | 24 | 1.05 | 2001 |
