Alessandro Panconesi

Christian Scheideler

Philipp Woelfel

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Errare humanum est?: a pilot study to evaluate the human-likeness of a AI othello playing agent.

[BibT_eX]

[DOI]

Proceedings of the IVA '22: ACM International Conference on Intelligent Virtual Agents, Faro, Portugal, September 6, 2022

RUMs from Head-to-Head Contests.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Faster Motif Counting via Succinct Color Coding and Adaptive Sampling.

[BibT_eX]

[DOI]

Marco Bressan

ACM Trans. Knowl. Discov. Data, 2021

Correlation Clustering Reconstruction in Semi-Adversarial Models.

[BibT_eX]

[DOI]

CoRR, 2021

OLIVAW: Mastering Othello with neither Humans nor a Penny.

[BibT_eX]

[DOI]

Antonio Norelli

CoRR, 2021

Twin Peaks, a Model for Recurring Cascades.

[BibT_eX]

[DOI]

Proceedings of the WWW '21: The Web Conference 2021, 2021

2021 Principles of Distributed Computing Doctoral Dissertation Award.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Online Facility Location with Multiple Advice.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Tracks from hell - When finding a proof may be easier than checking it.

[BibT_eX]

[DOI]

Matteo Almanza

Theor. Comput. Sci., 2020

2019

On the Distortion of Locality Sensitive Hashing.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling.

[BibT_eX]

[DOI]

Marco Bressan

Proc. VLDB Endow., 2019

2018

Motif Counting Beyond Five Nodes.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2018

Trainyard is NP-Hard.

[BibT_eX]

[DOI]

Matteo Almanza

Theor. Comput. Sci., 2018

Rumor Spreading and Conductance.

[BibT_eX]

[DOI]

J. ACM, 2018

A Reduction for Efficient LDA Topic Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Songs of a Future Past - An Experimental Study of Online Persuaders.

[BibT_eX]

[DOI]

Marzia Antenore

Erisa Terolli

Proceedings of the Twelfth International Conference on Web and Social Media, 2018

Together We Buy, Alone I Quit: Some Experimental Studies of Online Persuaders.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Digital Tools & Uses Congress, 2018

Distributed Approximation Algorithms via LP-Duality and Randomization.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Counting Graphlets: Space vs Time.

[BibT_eX]

[DOI]

Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017

2016

The Limits of Popularity-Based Recommendations, and the Role of Social Ties.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

2015

Special issue with selected papers from PODC 2012.

[BibT_eX]

[DOI]

Distributed Comput., 2015

2014

How to Schedule a Cascade in an Arbitrary Graph.

[BibT_eX]

[DOI]

Jon M. Kleinberg

SIAM J. Comput., 2014

Communities, Random Walks, and Social Sybil Defense.

[BibT_eX]

[DOI]

Internet Math., 2014

Spreading rumours without the network.

[BibT_eX]

[DOI]

Proceedings of the second ACM conference on Online social networks, 2014

2013

Models for the Compressible Web.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

SoK: The Evolution of Sybil Defense via Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Symposium on Security and Privacy, 2013

Trace complexity of network inference.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

Rumor Spreading in Random Evolving Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

The One Million Dollars Problem.

[BibT_eX]

[DOI]

Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012

Expansion properties of (secure) wireless networks.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Announcing the 2012 Edsger W. Dijkstra prize in distributed computing.

[BibT_eX]

[DOI]

SIGARCH Comput. Archit. News, 2012

2011

Rumor spreading in social networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Milgram-routing in social networks.

[BibT_eX]

[DOI]

D. Sivakumar

Proceedings of the 20th International Conference on World Wide Web, 2011

2010

Fast primal-dual distributed algorithms for scheduling and matching problems.

[BibT_eX]

[DOI]

Mauro Sozio

Distributed Comput., 2010

Almost tight bounds for rumour spreading with conductance.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Rumour Spreading and Graph Conductance.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

On compressing social networks.

[BibT_eX]

[DOI]

Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

On Active Attacks on Sensor Network Key Distribution Schemes.

[BibT_eX]

[DOI]

Stefan Dziembowski

Alessandro Mei

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

Concentration of Measure for the Analysis of Randomized Algorithms.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 978-0-521-88427-3, 2009

2008

Redoubtable Sensor Networks.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst. Secur., 2008

Distributed weighted vertex cover via maximal matchings.

[BibT_eX]

[DOI]

Jochen Könemann

ACM Trans. Algorithms, 2008

A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

On placing skips optimally in expectation.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Web Search and Web Data Mining, 2008

Fast distributed scheduling via primal-dual.

[BibT_eX]

[DOI]

Mauro Sozio

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Unassailable sensor networks.

[BibT_eX]

[DOI]

Alessandro Mei

Proceedings of the 4th International ICST Conference on Security and Privacy in Communication Networks, 2008

Gossiping (via mobile?) in social networks.

[BibT_eX]

[DOI]

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2008

2007

Distributed Approximation Algorithms via LP-Duality and Randomization.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2007

Cuts and Disjoint Paths in the Valley-Free Model.

[BibT_eX]

[DOI]

Internet Math., 2007

Foreword.

[BibT_eX]

[DOI]

Algorithmica, 2007

Localized Techniques for Broadcasting in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Algorithmica, 2007

Fast Distributed Algorithms Via Primal-Dual (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2007

Finding near neighbors through cluster pruning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation.

[BibT_eX]

[DOI]

Emilio De Santis

Proceedings of the Algorithms, 2007

2006

Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison.

[BibT_eX]

[DOI]

Stefano Basagni

Michele Mastrogiovanni

Chiara Petrioli

IEEE Trans. Parallel Distributed Syst., 2006

On the importance of having an identity or, is consensus really universal?.

[BibT_eX]

[DOI]

Distributed Comput., 2006

A Memory-Efficient Strategy for Exploring the Web.

[BibT_eX]

[DOI]

Carlos Castillo

Alberto Nelli

Proceedings of the 2006 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2006), 2006

Sensor Networks that Are Provably Resilient.

[BibT_eX]

[DOI]

Proceedings of the Second International Conference on Security and Privacy in Communication Networks and the Workshops, 2006

Robustness of the Internet at the Topology and Routing Level.

[BibT_eX]

[DOI]

Proceedings of the Dependable Systems: Software, Computing, Networks, 2006

2005

Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons.

[BibT_eX]

[DOI]

Alessandro Mei

J. Comput. Syst. Sci., 2005

An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms.

[BibT_eX]

[DOI]

Irene Finocchi

Riccardo Silvestri

Algorithmica, 2005

Irrigating ad hoc networks in constant time.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Primal-dual based distributed algorithms for vertex cover with semi-hard capacities.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

2004

Packing cuts in undirected graphs.

[BibT_eX]

[DOI]

Alberto Caprara

Networks, 2004

An experimental study of a simple, distributed edge-coloring algorithm.

[BibT_eX]

[DOI]

Madhav V. Marathe

Larry D. Risinger Jr.

ACM J. Exp. Algorithmics, 2004

Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2004

Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction.

[BibT_eX]

[DOI]

Mauro Sozio

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Connectivity properties of secure wireless sensor networks.

[BibT_eX]

[DOI]

Proceedings of the 2nd ACM Workshop on Security of ad hoc and Sensor Networks, 2004

A New Approach to Device Discovery and Scatternet Formation in Bluetooth Networks.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Localized techniques for broadcasting in wireless sensor networks.

[BibT_eX]

[DOI]

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2004

Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003

Packing cycles in undirected graphs.

[BibT_eX]

[DOI]

Alberto Caprara

J. Algorithms, 2003

Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract.

[BibT_eX]

[DOI]

Luigi Laura

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

Preface.

[BibT_eX]

[DOI]

Tibor Jordán

Random Struct. Algorithms, 2002

Wavelength rerouting in optical networks, or the Venetian Routing problem.

[BibT_eX]

[DOI]

J. Algorithms, 2002

Experimental analysis of simple, distributed vertex coloring algorithms.

[BibT_eX]

[DOI]

Irene Finocchi

Riccardo Silvestri

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

On the Distributed Complexity of Computing Maximal Matchings.

[BibT_eX]

[DOI]

Michal Hanckowiak

Michal Karonski

SIAM J. Discret. Math., 2001

Some simple distributed algorithms for sparse networks.

[BibT_eX]

[DOI]

Distributed Comput., 2001

Packing Cycles and Cuts in Undirected Graphs.

[BibT_eX]

[DOI]

Alberto Caprara

Proceedings of the Algorithms, 2001

2000

Fast Distributed Algorithms for Brooks-Vizing Colorings.

[BibT_eX]

[DOI]

J. Algorithms, 2000

1999

A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically.

[BibT_eX]

[DOI]

Michal Hanckowiak

Michal Karonski

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998

On the Hardness of Allocating Frequences for Hybrid Networks.

[BibT_eX]

[DOI]

Ewa Malesinska

Theor. Comput. Sci., 1998

Near-Optimal, Distributed Edge Colouring via the Nibble Method.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Approximate Max <i>k</i>-Cut with Subgraph Guarantee.

[BibT_eX]

[DOI]

Viggo Kann

Jens Lagergren

Inf. Process. Lett., 1998

Randomized Naming Using Wait-Free Shared Variables.

[BibT_eX]

[DOI]

Marina Papatriantafilou

Philippas Tsigas

Paul M. B. Vitányi

Distributed Comput., 1998

Fast Distributed Algorithms for {Brooks-Vizing} Colourings.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

Nearly optimal distributed edge coloring in O(log log n) rounds.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

On the Hardness of Approximating Max k-Cut and its Dual.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 1997

Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

On the Complexity of Distributed Network Decomposition.

[BibT_eX]

[DOI]

J. Algorithms, 1996

Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems.

[BibT_eX]

[DOI]

Viggo Kann

Jens Lagergren

Inf. Process. Lett., 1996

On the Hardness of Allocating Frequencies for Hybrid Networks.

[BibT_eX]

[DOI]

Ewa Malesinska

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

1995

The Local Natur of Delta-Coloring and its Algorithmic Applications.

[BibT_eX]

[DOI]

Comb., 1995

Near-Optimal Distributed Edge Coloring.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

Randomized Wait-Free Naming.

[BibT_eX]

[DOI]

Marina Papatriantafilou

Philippas Tsigas

Paul M. B. Vitányi

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

Locality in distributed computing.

[BibT_eX]

PhD thesis, 1993

Quantifiers and Approximation.

[BibT_eX]

[DOI]

Desh Ranjan

Theor. Comput. Sci., 1993

1992

Improved Distributed Algorithms for Coloring and Network Decomposition Problems

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991

Completeness in Approximation Classes

[BibT_eX]

[DOI]

Pierluigi Crescenzi

Inf. Comput., August, 1991

1990

Predicting deadlock in store-and-forward networks.

[BibT_eX]

[DOI]

Claudio Arbib

Giuseppe F. Italiano

Networks, 1990

Quantifiers and Approximation (Extended Abstract)

[BibT_eX]

[DOI]

Desh Ranjan

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Quantifiers and Approximation (Abstract).

[BibT_eX]

[DOI]