Alessandro Panconesi

According to our database1, Alessandro Panconesi authored at least 94 papers between 1988 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Motif Counting Beyond Five Nodes.
TKDD, 2018

Rumor Spreading and Conductance.
J. ACM, 2018

A Reduction for Efficient LDA Topic Reconstruction.
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.
Proceedings of the Twelfth International Conference on Web and Social Media, 2018

Tracks from hell - when finding a proof may be easier than checking it.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017
Counting Graphlets: Space vs Time.
Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017

The Distortion of Locality Sensitive Hashing.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
The Limits of Popularity-Based Recommendations, and the Role of Social Ties.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

Trainyard is NP-hard.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Special issue with selected papers from PODC 2012.
Distributed Computing, 2015

2014
Communities, Random Walks, and Social Sybil Defense.
Internet Mathematics, 2014

Spreading rumours without the network.
Proceedings of the second ACM conference on Online social networks, 2014

2013
SoK: The Evolution of Sybil Defense via Social Networks.
Proceedings of the 2013 IEEE Symposium on Security and Privacy, 2013

Trace complexity of network inference.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

Rumor Spreading in Random Evolving Graphs.
Proceedings of the Algorithms - ESA 2013, 2013

The One Million Dollars Problem.
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012
Announcing the 2012 Edsger W. Dijkstra prize in distributed computing.
SIGARCH Computer Architecture News, 2012

How to schedule a cascade in an arbitrary graph.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2011
Milgram-routing in social networks.
Proceedings of the 20th International Conference on World Wide Web, 2011

2010
Fast primal-dual distributed algorithms for scheduling and matching problems.
Distributed Computing, 2010

Almost tight bounds for rumour spreading with conductance.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Rumour Spreading and Graph Conductance.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

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

Rumor Spreading in Social Networks.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Models for the Compressible Web.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

On Active Attacks on Sensor Network Key Distribution Schemes.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

Concentration of Measure for the Analysis of Randomized Algorithms.
Cambridge University Press, ISBN: 978-0-521-88427-3, 2009

2008
Redoubtable Sensor Networks.
ACM Trans. Inf. Syst. Secur., 2008

A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover.
SIAM J. Comput., 2008

On placing skips optimally in expectation.
Proceedings of the International Conference on Web Search and Web Data Mining, 2008

Fast distributed scheduling via primal-dual.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

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

Gossiping (via mobile?) in social networks.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2008

2007
Distributed Approximation Algorithms via LP-Duality and Randomization.
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.
Wireless Networks, 2007

Cuts and Disjoint Paths in the Valley-Free Model.
Internet Mathematics, 2007

Foreword.
Algorithmica, 2007

Localized Techniques for Broadcasting in Wireless Sensor Networks.
Algorithmica, 2007

Fast Distributed Algorithms Via Primal-Dual (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2007

Finding near neighbors through cluster pruning.
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.
Proceedings of the Algorithms, 2007

2006
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison.
IEEE Trans. Parallel Distrib. Syst., 2006

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

A Memory-Efficient Strategy for Exploring the Web.
Proceedings of the 2006 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2006), 2006

Sensor Networks that Are Provably Resilient.
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.
Proceedings of the Dependable Systems: Software, Computing, Networks, 2006

2005
An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms.
Algorithmica, 2005

Irrigating ad hoc networks in constant time.
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.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Distributed Weighted Vertex Cover via Maximal Matchings.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Packing cuts in undirected graphs.
Networks, 2004

Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Expansion properties of (secure) wireless networks.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Connectivity properties of secure wireless sensor networks.
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.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Localized techniques for broadcasting in wireless sensor networks.
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.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003
Packing cycles in undirected graphs.
J. Algorithms, 2003

Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002
Preface.
Random Struct. Algorithms, 2002

Experimental analysis of simple, distributed vertex coloring algorithms.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Some simple distributed algorithms for sparse networks.
Distributed Computing, 2001

Packing Cycles and Cuts in Undirected Graphs.
Proceedings of the Algorithms, 2001

2000
Fast Distributed Algorithms for Brooks-Vizing Colorings.
J. Algorithms, 2000

On the Importance of Having an Identity or is Consensus Really Universal?
Proceedings of the Distributed Computing, 14th International Conference, 2000

An experimental study of a simple, distributed edge coloring algorithm.
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

Wavelength rerouting in optical networks, or the Venetian routing problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998
On the Hardness of Allocating Frequences for Hybrid Networks.
Theor. Comput. Sci., 1998

Near-Optimal, Distributed Edge Colouring via the Nibble Method.
Theor. Comput. Sci., 1998

Approximate Max k-Cut with Subgraph Guarantee.
Inf. Process. Lett., 1998

Randomized Naming Using Wait-Free Shared Variables.
Distributed Computing, 1998

On the Distributed Complexity of Computing Maximal Matchings.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Fast Distributed Algorithms for {Brooks-Vizing} Colourings.
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.
SIAM J. Comput., 1997

Nearly optimal distributed edge coloring in O(log log n) rounds.
Random Struct. Algorithms, 1997

Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
On the Complexity of Distributed Network Decomposition.
J. Algorithms, 1996

Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems.
Inf. Process. Lett., 1996

On the Hardness of Allocating Frequencies for Hybrid Networks.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

On the Hardness of Approximating Max k-Cut and Its Dual.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

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

Near-Optimal Distributed Edge Coloring.
Proceedings of the Algorithms, 1995

1994
Randomized Wait-Free Naming.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
Quantifiers and Approximation.
Theor. Comput. Sci., 1993

1992
Improved Distributed Algorithms for Coloring and Network Decomposition Problems
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract).
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991
Completeness in Approximation Classes
Inf. Comput., August, 1991

1990
Quantifiers and Approximation (Extended Abstract)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Quantifiers and Approximation (Abstract).
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1989
Completeness in Approximation Classes.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
Predicting deadlock in Store-and-Forward Networks.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988


  Loading...