Quantifiers and Approximation (Abstract). - Alessandro Panconesi; Desh Ranjan (SCT, 1990)

Quantifiers and Approximation (Extended Abstract) - Alessandro Panconesi; Desh Ranjan (STOC, 1990)

Predicting deadlock in store-and-forward networks. - Claudio Arbib; Giuseppe F. Italiano; Alessandro Panconesi (Networks, 1990)

Completeness in Approximation Classes - Pierluigi Crescenzi; Alessandro Panconesi (Inf. Comput., 1991)

Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract). - Alessandro Panconesi; Aravind Srinivasan (PODC, 1992)

Improved Distributed Algorithms for Coloring and Network Decomposition Problems - Alessandro Panconesi; Aravind Srinivasan (STOC, 1992)

Quantifiers and Approximation. - Alessandro Panconesi; Desh Ranjan (Theor. Comput. Sci., 1993)

Locality in distributed computing. - Alessandro Panconesi (1993)

Randomized Wait-Free Naming. - Alessandro Panconesi; Marina Papatriantafilou; Philippas Tsigas; Paul M. B. Vitányi (ISAAC, 1994)

Near-Optimal Distributed Edge Coloring. - Devdatt P. Dubhashi; Alessandro Panconesi (ESA, 1995)

The Local Natur of Delta-Coloring and its Algorithmic Applications. - Alessandro Panconesi; Aravind Srinivasan (Comb., 1995)

On the Hardness of Allocating Frequencies for Hybrid Networks. - Ewa Malesinska; Alessandro Panconesi (WG, 1996)

Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems. - Viggo Kann; Jens Lagergren; Alessandro Panconesi (Inf. Process. Lett., 1996)

On the Complexity of Distributed Network Decomposition. - Alessandro Panconesi; Aravind Srinivasan (J. Algorithms, 1996)

Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds. - David A. Grable; Alessandro Panconesi (SODA, 1997)

On the Hardness of Approximating Max k-Cut and its Dual. - Viggo Kann; Sanjeev Khanna; Jens Lagergren; Alessandro Panconesi (Chic. J. Theor. Comput. Sci., 1997)

Nearly optimal distributed edge coloring in O(log log n) rounds. - David A. Grable; Alessandro Panconesi (Random Struct. Algorithms, 1997)

Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds. - Alessandro Panconesi; Aravind Srinivasan (SIAM J. Comput., 1997)

Fast Distributed Algorithms for {Brooks-Vizing} Colourings. - David A. Grable; Alessandro Panconesi (SODA, 1998)

Randomized Naming Using Wait-Free Shared Variables. - Alessandro Panconesi; Marina Papatriantafilou; Philippas Tsigas; Paul M. B. Vitányi (Distributed Comput., 1998)

Approximate Max k-Cut with Subgraph Guarantee. - Viggo Kann; Jens Lagergren; Alessandro Panconesi (Inf. Process. Lett., 1998)

Near-Optimal, Distributed Edge Colouring via the Nibble Method. - Devdatt P. Dubhashi; David A. Grable; Alessandro Panconesi (Theor. Comput. Sci., 1998)

On the Hardness of Allocating Frequences for Hybrid Networks. - Ewa Malesinska; Alessandro Panconesi (Theor. Comput. Sci., 1998)

A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically. - Michal Hanckowiak; Michal Karonski; Alessandro Panconesi (PODC, 1999)

Fast Distributed Algorithms for Brooks-Vizing Colorings. - David A. Grable; Alessandro Panconesi (J. Algorithms, 2000)

Packing Cycles and Cuts in Undirected Graphs. - Alberto Caprara; Alessandro Panconesi; Romeo Rizzi (ESA, 2001)

Some simple distributed algorithms for sparse networks. - Alessandro Panconesi; Romeo Rizzi (Distributed Comput., 2001)

On the Distributed Complexity of Computing Maximal Matchings. - Michal Hanckowiak; Michal Karonski; Alessandro Panconesi (SIAM J. Discret. Math., 2001)

Experimental analysis of simple, distributed vertex coloring algorithms. - Irene Finocchi; Alessandro Panconesi; Riccardo Silvestri (SODA, 2002)

Wavelength rerouting in optical networks, or the Venetian Routing problem. - Alberto Caprara; Giuseppe F. Italiano; Gurusamy Mohan; Alessandro Panconesi; Aravind Srinivasan (J. Algorithms, 2002)

Preface. - Tibor Jordán; Alessandro Panconesi (Random Struct. Algorithms, 2002)

Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract. - Devdatt P. Dubhashi; Luigi Laura; Alessandro Panconesi (FSTTCS, 2003)

Packing cycles in undirected graphs. - Alberto Caprara; Alessandro Panconesi; Romeo Rizzi (J. Algorithms, 2003)

Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. - Thomas Erlebach; Alexander Hall; Alessandro Panconesi; Danica Vukadinovic (CAAN, 2004)

Localized techniques for broadcasting in wireless sensor networks. - Lorenzo Orecchia; Alessandro Panconesi; Chiara Petrioli; Andrea Vitaletti (DIALM-POMC, 2004)

A New Approach to Device Discovery and Scatternet Formation in Bluetooth Networks. - Fabrizio Ferraguto; Gabriele Mambrini; Alessandro Panconesi; Chiara Petrioli (IPDPS, 2004)

Connectivity properties of secure wireless sensor networks. - Roberto Di Pietro; Luigi V. Mancini; Alessandro Mei; Alessandro Panconesi; Jaikumar Radhakrishnan (SASN, 2004)

Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction. - Alessandro Panconesi; Mauro Sozio (WABI, 2004)

Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. - Louigi Addario-Berry; Benny Chor; Michael T. Hallett; Jens Lagergren; Alessandro Panconesi; Todd Wareham (J. Bioinform. Comput. Biol., 2004)

An experimental study of a simple, distributed edge-coloring algorithm. - Madhav V. Marathe; Alessandro Panconesi; Larry D. Risinger Jr. (ACM J. Exp. Algorithmics, 2004)

Packing cuts in undirected graphs. - Alberto Caprara; Alessandro Panconesi; Romeo Rizzi (Networks, 2004)

Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. - Fabrizio Grandoni 001; Jochen Könemann; Alessandro Panconesi; Mauro Sozio (PODC, 2005)

Irrigating ad hoc networks in constant time. - Devdatt P. Dubhashi; C. Johansson; Olle Häggström; Alessandro Panconesi; Mauro Sozio (SPAA, 2005)

An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. - Irene Finocchi; Alessandro Panconesi; Riccardo Silvestri (Algorithmica, 2005)

Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. - Devdatt P. Dubhashi; Alessandro Mei; Alessandro Panconesi; Jaikumar Radhakrishnan; Aravind Srinivasan (J. Comput. Syst. Sci., 2005)

Robustness of the Internet at the Topology and Routing Level. - Thomas Erlebach; Alexander Hall; Linda S. Moonen; Alessandro Panconesi; Frits C. R. Spieksma; Danica Vukadinovic (Research Results of the DICS Program, 2006)

Sensor Networks that Are Provably Resilient. - Roberto Di Pietro; Luigi V. Mancini; Alessandro Mei; Alessandro Panconesi; Jaikumar Radhakrishnan (SecureComm, 2006)

A Memory-Efficient Strategy for Exploring the Web. - Carlos Castillo 001; Alberto Nelli; Alessandro Panconesi (Web Intelligence, 2006)

On the importance of having an identity or, is consensus really universal?. - Harry Buhrman; Alessandro Panconesi; Riccardo Silvestri; Paul M. B. Vitányi (Distributed Comput., 2006)

Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison. - Stefano Basagni; Michele Mastrogiovanni; Alessandro Panconesi; Chiara Petrioli (IEEE Trans. Parallel Distributed Syst., 2006)

Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation. - Emilio De Santis; Fabrizio Grandoni 001; Alessandro Panconesi (ESA, 2007)

Finding near neighbors through cluster pruning. - Flavio Chierichetti; Alessandro Panconesi; Prabhakar Raghavan; Mauro Sozio; Alessandro Tiberi; Eli Upfal (PODS, 2007)

Fast Distributed Algorithms Via Primal-Dual (Extended Abstract). - Alessandro Panconesi (SIROCCO, 2007)

Localized Techniques for Broadcasting in Wireless Sensor Networks. - Devdatt P. Dubhashi; Olle Häggström; Lorenzo Orecchia; Alessandro Panconesi; Chiara Petrioli; Andrea Vitaletti (Algorithmica, 2007)

Foreword. - Alessandro Panconesi (Algorithmica, 2007)

Cuts and Disjoint Paths in the Valley-Free Model. - Thomas Erlebach; Alexander Hall; Alessandro Panconesi; Danica Vukadinovic (Internet Math., 2007)

Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks. - Devdatt P. Dubhashi; Olle Häggström; Gabriele Mambrini; Alessandro Panconesi; Chiara Petrioli (Wirel. Networks, 2007)

Distributed Approximation Algorithms via LP-Duality and Randomization. - Alessandro Panconesi; Fabrizio Grandoni 001; Devdatt P. Dubhashi (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Gossiping (via mobile?) in social networks. - Flavio Chierichetti; Silvio Lattanzi; Alessandro Panconesi (DIALM-POMC, 2008)

Unassailable sensor networks. - Alessandro Mei; Alessandro Panconesi; Jaikumar Radhakrishnan (SecureComm, 2008)

Fast distributed scheduling via primal-dual. - Alessandro Panconesi; Mauro Sozio (SPAA, 2008)

On placing skips optimally in expectation. - Flavio Chierichetti; Silvio Lattanzi; Federico Mari; Alessandro Panconesi (WSDM, 2008)

A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover. - Fabrizio Grandoni 001; Jochen Könemann; Alessandro Panconesi; Mauro Sozio (SIAM J. Comput., 2008)

Distributed weighted vertex cover via maximal matchings. - Fabrizio Grandoni 001; Jochen Könemann; Alessandro Panconesi (ACM Trans. Algorithms, 2008)

Redoubtable Sensor Networks. - Roberto Di Pietro; Luigi V. Mancini; Alessandro Mei; Alessandro Panconesi; Jaikumar Radhakrishnan (ACM Trans. Inf. Syst. Secur., 2008)

Concentration of Measure for the Analysis of Randomized Algorithms. - Devdatt P. Dubhashi; Alessandro Panconesi (Cambridge University Press, 2009)

On Active Attacks on Sensor Network Key Distribution Schemes. - Stefan Dziembowski; Alessandro Mei; Alessandro Panconesi (ALGOSENSORS, 2009)

On compressing social networks. - Flavio Chierichetti; Ravi Kumar 001; Silvio Lattanzi; Michael Mitzenmacher; Alessandro Panconesi; Prabhakar Raghavan (KDD, 2009)

Rumour Spreading and Graph Conductance. - Flavio Chierichetti; Silvio Lattanzi; Alessandro Panconesi (SODA, 2010)

Almost tight bounds for rumour spreading with conductance. - Flavio Chierichetti; Silvio Lattanzi; Alessandro Panconesi (STOC, 2010)

Fast primal-dual distributed algorithms for scheduling and matching problems. - Alessandro Panconesi; Mauro Sozio (Distributed Comput., 2010)

Milgram-routing in social networks. - Silvio Lattanzi; Alessandro Panconesi; D. Sivakumar 001 (WWW, 2011)

Rumor spreading in social networks. - Flavio Chierichetti; Silvio Lattanzi; Alessandro Panconesi (Theor. Comput. Sci., 2011)

Announcing the 2012 Edsger W. Dijkstra prize in distributed computing. - Marcos K. Aguilera; Dahlia Malkhi; Keith Marzullo; Alessandro Panconesi; Andrzej Pelc; Roger Wattenhofer (SIGARCH Comput. Archit. News, 2012)

Expansion properties of (secure) wireless networks. - Alessandro Panconesi; Jaikumar Radhakrishnan (ACM Trans. Algorithms, 2012)

The One Million Dollars Problem. - Alessandro Panconesi (The Power of Algorithms, 2013)

Rumor Spreading in Random Evolving Graphs. - Andrea Clementi; Pierluigi Crescenzi; Carola Doerr; Pierre Fraigniaud; Marco Isopi; Alessandro Panconesi; Francesco Pasquale; Riccardo Silvestri (ESA, 2013)

Trace complexity of network inference. - Bruno D. Abrahao; Flavio Chierichetti; Robert Kleinberg; Alessandro Panconesi (KDD, 2013)

SoK: The Evolution of Sybil Defense via Social Networks. - Lorenzo Alvisi; Allen Clement; Alessandro Epasto; Silvio Lattanzi; Alessandro Panconesi (IEEE Symposium on Security and Privacy, 2013)

Models for the Compressible Web. - Flavio Chierichetti; Ravi Kumar 001; Silvio Lattanzi; Alessandro Panconesi; Prabhakar Raghavan (SIAM J. Comput., 2013)

Spreading rumours without the network. - Pawel Brach; Alessandro Epasto; Alessandro Panconesi; Piotr Sankowski (COSN, 2014)

Communities, Random Walks, and Social Sybil Defense. - Lorenzo Alvisi; Allen Clement; Alessandro Epasto; Silvio Lattanzi; Alessandro Panconesi (Internet Math., 2014)

How to Schedule a Cascade in an Arbitrary Graph. - Flavio Chierichetti; Jon M. Kleinberg; Alessandro Panconesi (SIAM J. Comput., 2014)

Special issue with selected papers from PODC 2012. - Alessandro Panconesi (Distributed Comput., 2015)

The Limits of Popularity-Based Recommendations, and the Role of Social Ties. - Marco Bressan 002; Stefano Leucci 001; Alessandro Panconesi; Prabhakar Raghavan; Erisa Terolli (KDD, 2016)

Counting Graphlets: Space vs Time. - Marco Bressan 002; Flavio Chierichetti; Ravi Kumar 001; Stefano Leucci 001; Alessandro Panconesi (WSDM, 2017)

Distributed Approximation Algorithms via LP-Duality and Randomization. - Devdatt P. Dubhashi; Fabrizio Grandoni 001; Alessandro Panconesi (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Together We Buy, Alone I Quit: Some Experimental Studies of Online Persuaders. - Marzia Antenore; Giovanna Leone; Alessandro Panconesi; Erisa Terolli (DTUC, 2018)

Songs of a Future Past - An Experimental Study of Online Persuaders. - Marzia Antenore; Alessandro Panconesi; Erisa Terolli (ICWSM, 2018)

A Reduction for Efficient LDA Topic Reconstruction. - Matteo Almanza; Flavio Chierichetti; Alessandro Panconesi; Andrea Vattani (NeurIPS, 2018)

Rumor Spreading and Conductance. - Flavio Chierichetti; George Giakkoupis; Silvio Lattanzi; Alessandro Panconesi (J. ACM, 2018)

Trainyard is NP-Hard. - Matteo Almanza; Stefano Leucci 001; Alessandro Panconesi (Theor. Comput. Sci., 2018)

Motif Counting Beyond Five Nodes. - Marco Bressan 002; Flavio Chierichetti; Ravi Kumar 001; Stefano Leucci 001; Alessandro Panconesi (ACM Trans. Knowl. Discov. Data, 2018)

Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling. - Marco Bressan 002; Stefano Leucci 001; Alessandro Panconesi (Proc. VLDB Endow., 2019)

On the Distortion of Locality Sensitive Hashing. - Flavio Chierichetti; Ravi Kumar 001; Alessandro Panconesi; Erisa Terolli (SIAM J. Comput., 2019)

Tracks from hell - When finding a proof may be easier than checking it. - Matteo Almanza; Stefano Leucci 001; Alessandro Panconesi (Theor. Comput. Sci., 2020)

Online Facility Location with Multiple Advice. - Matteo Almanza; Flavio Chierichetti; Silvio Lattanzi; Alessandro Panconesi; Giuseppe Re (NeurIPS, 2021)

2021 Principles of Distributed Computing Doctoral Dissertation Award. - Marcos K. Aguilera; Hagit Attiya; Christian Cachin; Alessandro Panconesi (PODC, 2021)

Twin Peaks, a Model for Recurring Cascades. - Matteo Almanza; Silvio Lattanzi; Alessandro Panconesi; Giuseppe Re (WWW, 2021)

OLIVAW: Mastering Othello with neither Humans nor a Penny. - Antonio Norelli; Alessandro Panconesi (CoRR, 2021)

Correlation Clustering Reconstruction in Semi-Adversarial Models. - Flavio Chierichetti; Alessandro Panconesi; Giuseppe Re; Luca Trevisan 001 (CoRR, 2021)

Faster Motif Counting via Succinct Color Coding and Adaptive Sampling. - Marco Bressan 002; Stefano Leucci 001; Alessandro Panconesi (ACM Trans. Knowl. Discov. Data, 2021)

Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models. - Flavio Chierichetti; Alessandro Panconesi; Giuseppe Re; Luca Trevisan 001 (AISTATS, 2022)

RUMs from Head-to-Head Contests. - Matteo Almanza; Flavio Chierichetti; Ravi Kumar 001; Alessandro Panconesi; Andrew Tomkins (ICML, 2022)

Errare humanum est?: a pilot study to evaluate the human-likeness of a AI othello playing agent. - Enrico Lauletta; Béatrice Biancardi; Antonio Norelli; Maurizio Mancini; Alessandro Panconesi (IVA, 2022)

2022 Edsger W. Dijkstra Prize in Distributed Computing. - Marcos Aguiliera; Andréa W. Richa; Alexander A. Schwarzmann; Alessandro Panconesi; Christian Scheideler; Philipp Woelfel (PODC, 2022)

k-Clustering with Fair Outliers. - Matteo Almanza; Alessandro Epasto; Alessandro Panconesi; Giuseppe Re (WSDM, 2022)

Approximating a RUM from Distributions on k-Slates. - Flavio Chierichetti; Mirko Giacchini; Ravi Kumar 001; Alessandro Panconesi; Andrew Tomkins (AISTATS, 2023)

Errare humanum est, perseverare autem diabolicum: A Follow-Up Study on the Human-Likeness of an AI Othello Player. - Béatrice Biancardi; Enrico Lauletta; Antonio Norelli; Alessandro Panconesi; Maurizio Mancini (IVA, 2023)

Olivaw: Mastering Othello Without Human Knowledge, nor a Fortune. - Antonio Norelli; Alessandro Panconesi (IEEE Trans. Games, 2023)

Coordinating "7 Billion Humans" Is Hard. - Alessandro Panconesi; Pietro Maria Posta; Mirko Giacchini (FUN, 2024)

Tight Bounds for Learning RUMs from Small Slates. - Flavio Chierichetti; Mirko Giacchini; Ravi Kumar 001; Alessandro Panconesi; Andrew Tomkins (NeurIPS, 2024)

A Topology-Based Approach for Predicting Toxic Outcomes on Twitter and YouTube. - Gabriele Etta; Matteo Cinelli; Niccolò Di Marco; Michele Avalle; Alessandro Panconesi; Walter Quattrociocchi (IEEE Trans. Netw. Sci. Eng., 2024)

About Latent Roles in Forecasting Players in Team Sports. - Luca Scofano; Alessio Sampieri; Giuseppe Re; Matteo Almanza; Alessandro Panconesi; Fabio Galasso (Neural Process. Lett., 2024)

A New Impossibility Result for Online Bipartite Matching Problems. - Flavio Chierichetti; Mirko Giacchini; Alessandro Panconesi; Andrea Vattani (ICALP, 2025)