| On convergence and threshold properties of discrete Lotka-Volterra population protocols | 0 | 0.34 | 2022 |
| How Hard Is It to Detect Surveillance? A Formal Study of Panopticons and Their Detectability Problem | 0 | 0.34 | 2022 |
| A human-centered Web-based tool for the effective real-time motion data collection and annotation from BLE IoT devices | 0 | 0.34 | 2021 |
| On The Distributed Construction Of Stable Networks In Polylogarithmic Parallel Time | 0 | 0.34 | 2021 |
| Elements of the theory of dynamic networks. | 7 | 0.47 | 2018 |
| Fast Approximate Counting and Leader Election in Populations. | 0 | 0.34 | 2018 |
| Brief Announcement: Providing End-to-End Secure Communication in Low-Power Wide Area Networks. | 0 | 0.34 | 2018 |
| The temporal explorer who returns to the base. | 1 | 0.38 | 2018 |
| Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners. | 0 | 0.34 | 2017 |
| Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. | 0 | 0.34 | 2017 |
| The Computational Complexity of Weighted Greedy Matching. | 2 | 0.41 | 2017 |
| Temporal Flows in Temporal Networks. | 0 | 0.34 | 2017 |
| Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs | 5 | 0.55 | 2016 |
| Stably Computing Order Statistics with Arithmetic Population Protocols. | 1 | 0.37 | 2016 |
| EATCS Fellows' Advice to the Young Theoretical Computer Scientist. | 0 | 0.34 | 2016 |
| The Match-Maker: Constant-Space Distributed Majority via Random Walks. | 0 | 0.34 | 2015 |
| NETCS: A New Simulator of Population Protocols and Network Constructors. | 1 | 0.35 | 2015 |
| Designing and Testing Temporally Connected Graphs. | 0 | 0.34 | 2015 |
| Information security for sensors by overwhelming random sequences and permutations | 3 | 0.46 | 2014 |
| Resolving Braess's Paradox in Random Networks. | 1 | 0.36 | 2013 |
| Temporal Network Optimization Subject to Connectivity Constraints. | 25 | 1.01 | 2013 |
| A Framework For Protecting Voters' Privacy In Electronic Voting Procedures | 1 | 0.44 | 2013 |
| Potential Functions in Strategic Games. | 0 | 0.34 | 2013 |
| On the structure of equilibria in basic network formation | 0 | 0.34 | 2013 |
| Brief announcement: naming and counting in anonymous unknown dynamic networks | 11 | 0.66 | 2012 |
| Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings | 92 | 8.18 | 2012 |
| Approximating fixation probabilities in the generalized Moran process | 14 | 1.55 | 2012 |
| Playing a Game to Bound the Chromatic Number. | 1 | 0.36 | 2012 |
| On the hardness of network design for bottleneck routing games | 3 | 0.43 | 2012 |
| Efficient methods for selfish network design | 5 | 0.47 | 2012 |
| Elliptic Curve Based Zero Knowledge Proofs and their Applicability on Resource Constrained Devices | 9 | 0.64 | 2011 |
| Natural models for evolution on networks | 5 | 1.06 | 2011 |
| Mediated population protocols | 15 | 0.75 | 2011 |
| The computational power of simple protocols for self-awareness on graphs | 1 | 0.36 | 2011 |
| Selected combinatorial properties of random intersection graphs | 0 | 0.34 | 2011 |
| Rationality authority for provable rational behavior | 2 | 0.42 | 2011 |
| Computational models for networks of tiny artifacts: A survey | 4 | 0.43 | 2011 |
| Robust and scalable middleware for selfish-computer systems | 1 | 0.37 | 2011 |
| The "Hot Potato" Case: Challenges in Multiplayer Pervasive Games Based on Ad hoc Mobile Sensor Networks and the Experimental Evaluation of a Prototype Game | 6 | 0.51 | 2010 |
| Sharp thresholds for Hamiltonicity in random intersection graphs | 8 | 0.49 | 2010 |
| Exploiting concavity in bimatrix games: new polynomially tractable subclasses | 6 | 0.53 | 2010 |
| Passively Mobile Communicating Logarithmic Space Machines | 5 | 0.52 | 2010 |
| Fun with Games | 0 | 0.34 | 2010 |
| Stably decidable graph languages by mediated population protocols | 7 | 0.53 | 2010 |
| Information Security For Sensors By Overwhelming Random Sequences And Permutations | 0 | 0.34 | 2010 |
| Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings | 27 | 1.83 | 2010 |
| Preface | 0 | 0.34 | 2009 |
| Computing on a partially eponymous ring | 5 | 0.43 | 2009 |
| A note on proofs of existence of Nash equilibria in finite strategic games, of two players | 0 | 0.34 | 2009 |
| Combinatorial properties for efficient communication in distributed networks with local interactions | 3 | 0.43 | 2009 |
