| Publication | Date of Publication | Type |
|---|
The minority dynamics and the power of synchronicity
| 2024-11-28 | Paper |
Bond percolation in small-world graphs with power-law distribution
Theoretical Computer Science | 2024-08-21 | Paper |
Biased opinion dynamics: when the devil is in the details
Information Sciences | 2024-02-05 | Paper |
Expansion and flooding in dynamic random networks with node churn
Random Structures & Algorithms | 2023-10-12 | Paper |
Percolation and epidemic processes in one-dimensional small-world networks (extended abstract)
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Step-By-Step Community Detection in Volume-Regular Graphs
| 2023-02-03 | Paper |
Bond Percolation in Small-World Graphs with Power-Law Distribution
| 2022-05-18 | Paper |
Average whenever you meet: opportunistic protocols for community detection
| 2021-08-04 | Paper |
Finding a bounded-degree expander inside a dense one
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Step-by-step community detection in volume-regular graphs
Theoretical Computer Science | 2020-11-06 | Paper |
Find Your Place: Simple Distributed Algorithms for Community Detection
SIAM Journal on Computing | 2020-08-18 | Paper |
Oblivious dimension reduction for \(k\)-means: beyond subspaces and the Johnson-Lindenstrauss lemma
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Tour recommendation for groups
Data Mining and Knowledge Discovery | 2019-05-03 | Paper |
Self-stabilizing repeated balls-into-bins
Distributed Computing | 2019-03-21 | Paper |
Stabilizing Consensus with Many Opinions
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Find your place: simple distributed algorithms for community detection
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Plurality consensus in the gossip model
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Simple dynamics for plurality consensus
Distributed Computing | 2017-09-04 | Paper |
Inefficiency of games with social context
Theory of Computing Systems | 2016-01-13 | Paper |
Sharing the cost more efficiently
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Latency-constrained aggregation in sensor networks
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Streaming techniques and data aggregation in networks of tiny artefacts
Computer Science Review | 2014-10-24 | Paper |
Sharing the cost more efficiently, improved approximation for multicommodity rent-or-buy
| 2014-10-13 | Paper |
Inefficiency of games with social context
Algorithmic Game Theory | 2013-10-23 | Paper |
Physarum can compute shortest paths: convergence proofs and complexity bounds
Automata, Languages, and Programming | 2013-08-07 | Paper |
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Journal of the ACM | 2011-02-01 | Paper |
scientific article; zbMATH DE number 5823943 (Why is no real title available?)
| 2010-12-08 | Paper |
Semi-clairvoyant scheduling
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Competitive Analysis of Aggregate Max in Windowed Streaming
Automata, Languages and Programming | 2009-07-14 | Paper |
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
Mathematics of Operations Research | 2008-05-27 | Paper |
Latency Constrained Aggregation in Sensor Networks
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Approximating call-scheduling makespan in all-optical networks
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Online weighted flow time and deadline scheduling
Journal of Discrete Algorithms | 2006-10-31 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Semi-clairvoyant scheduling
Theoretical Computer Science | 2004-11-23 | Paper |
Approximation algorithms for routing and call scheduling in all-optical chains and rings.
Theoretical Computer Science | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1833400 (Why is no real title available?)
| 2002-11-21 | Paper |
scientific article; zbMATH DE number 1696518 (Why is no real title available?)
| 2002-08-11 | Paper |
On the design of efficient ATM routing schemes
Theoretical Computer Science | 2002-03-03 | Paper |
scientific article; zbMATH DE number 1500650 (Why is no real title available?)
| 2000-09-04 | Paper |
