Alessandro Panconesi

From MaRDI portal
Revision as of 14:14, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:293219

Available identifiers

zbMath Open panconesi.alessandroMaRDI QIDQ293219

List of research outcomes

PublicationDate of PublicationType
Near-optimal distributed edge coloring2023-05-08Paper
Communities, Random Walks, and Social Sybil Defense2021-04-23Paper
Some simple distributed algorithms for sparse networks2020-12-03Paper
https://portal.mardi4nfdi.de/entity/Q51373522020-12-02Paper
Tracks from hell -- when finding a proof may be easier than checking it2020-09-03Paper
https://portal.mardi4nfdi.de/entity/Q33057222020-08-11Paper
How to Schedule a Cascade in an Arbitrary Graph2020-05-31Paper
On the Distortion of Locality Sensitive Hashing2019-05-07Paper
Rumor Spreading and Conductance2018-12-06Paper
Trainyard is NP-hard2018-11-23Paper
Distributed weighted vertex cover via maximal matchings2018-11-05Paper
https://portal.mardi4nfdi.de/entity/Q46381092018-05-03Paper
Fast randomized algorithms for distributed edge coloring2017-08-21Paper
https://portal.mardi4nfdi.de/entity/Q52827992017-07-17Paper
Approximate Max \(k\)-Cut with subgraph guarantee2016-06-09Paper
A faster distributed algorithm for computing maximal matchings deterministically2015-09-11Paper
https://portal.mardi4nfdi.de/entity/Q55018052015-08-14Paper
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities2015-03-10Paper
Expansion properties of (secure) wireless networks2014-09-09Paper
Almost tight bounds for rumour spreading with conductance2014-08-13Paper
Models for the Compressible Web2014-07-25Paper
https://portal.mardi4nfdi.de/entity/Q54177392014-05-22Paper
Models for the Compressible Web2014-02-04Paper
Rumor Spreading in Random Evolving Graphs2013-09-17Paper
Fast primal-dual distributed algorithms for scheduling and matching problems2013-06-28Paper
On the importance of having an identity or, is consensus really universal?2013-06-07Paper
Concentration of Measure for the Analysis of Randomized Algorithms2012-06-26Paper
Rumor spreading in social networks2011-06-07Paper
Low degree connectivity of ad-hoc networks via percolation2010-07-13Paper
On Active Attacks on Sensor Network Key Distribution Schemes2010-01-05Paper
Concentration of Measure for the Analysis of Randomized Algorithms2009-09-01Paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science2009-08-06Paper
Rumor Spreading in Social Networks2009-07-14Paper
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover2009-06-22Paper
Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation2008-09-25Paper
Cuts and Disjoint Paths in the Valley-Free Path Model2008-04-29Paper
Localized techniques for broadcasting in wireless sensor networks2008-02-18Paper
Fast Distributed Algorithms Via Primal-Dual (Extended Abstract)2007-11-15Paper
Computing and Combinatorics2006-01-11Paper
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons2005-12-07Paper
An experimental study of a simple, distributed edge-coloring algorithm2005-08-04Paper
An experimental analysis of simple, distributed vertex coloring algorithms2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q48289892004-11-29Paper
Packing cuts in undirected graphs2004-08-20Paper
https://portal.mardi4nfdi.de/entity/Q44713622004-07-28Paper
Packing cycles in undirected graphs2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q47961992003-03-02Paper
On the Distributed Complexity of Computing Maximal Matchings2002-04-23Paper
https://portal.mardi4nfdi.de/entity/Q27668682002-01-28Paper
https://portal.mardi4nfdi.de/entity/Q45256872001-01-24Paper
Fast Distributed Algorithms for Brooks–Vizing Colorings2000-11-05Paper
https://portal.mardi4nfdi.de/entity/Q42502152000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42599871999-09-08Paper
https://portal.mardi4nfdi.de/entity/Q42501851999-06-17Paper
Near-optimal, distributed edge colouring via the nibble method1999-01-12Paper
On the hardness of allocating frequencies for hybrid networks1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q43983591998-07-19Paper
https://portal.mardi4nfdi.de/entity/Q43442281997-07-15Paper
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds1997-05-26Paper
Approximability of maximum splitting of k-sets and some other Apx-complete problems1997-02-27Paper
On the Complexity of Distributed Network Decomposition1996-05-06Paper
The local nature of \(\Delta\)-coloring and its algorithmic applications1996-04-16Paper
Quantifiers and approximation1993-05-16Paper
Completeness in approximation classes1991-01-01Paper
Predicting deadlock in store‐and‐forward networks1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38176071988-01-01Paper
Inclusion relationships among permutation problems1987-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Alessandro Panconesi