default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessandro Panconesi
Person information
- affiliation: Sapienza University of Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j51]Luca Scofano
, Alessio Sampieri, Giuseppe Re, Matteo Almanza, Alessandro Panconesi, Fabio Galasso:
About Latent Roles in Forecasting Players in Team Sports. Neural Process. Lett. 56(2): 66 (2024)- [j50]Gabriele Etta, Matteo Cinelli, Niccolò Di Marco, Michele Avalle, Alessandro Panconesi, Walter Quattrociocchi:
A Topology-Based Approach for Predicting Toxic Outcomes on Twitter and YouTube. IEEE Trans. Netw. Sci. Eng. 11(5): 4875-4885 (2024) - [c72]Alessandro Panconesi, Pietro Maria Posta, Mirko Giacchini:
Coordinating "7 Billion Humans" Is Hard. FUN 2024: 26:1-26:16 - [i12]Alessandro Panconesi, Pietro Maria Posta, Mirko Giacchini:
Coordinating "7 Billion Humans" is hard. CoRR abs/2407.07246 (2024) - 2023
- [j49]Antonio Norelli, Alessandro Panconesi:
Olivaw: Mastering Othello Without Human Knowledge, nor a Fortune. IEEE Trans. Games 15(2): 285-291 (2023) - [c71]Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Alessandro Panconesi, Andrew Tomkins:
Approximating a RUM from Distributions on k-Slates. AISTATS 2023: 4757-4767 - [c70]Béatrice Biancardi, Enrico Lauletta, Antonio Norelli, Alessandro Panconesi, Maurizio Mancini:
Errare humanum est, perseverare autem diabolicum: A Follow-Up Study on the Human-Likeness of an AI Othello Player. IVA 2023: 36:1-36:3 - [i11]Luca Scofano, Alessio Sampieri, Giuseppe Re, Matteo Almanza, Alessandro Panconesi, Fabio Galasso:
About latent roles in forecasting players in team sports. CoRR abs/2304.08272 (2023) - [i10]Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Alessandro Panconesi, Andrew Tomkins:
Approximating a RUM from Distributions on k-Slates. CoRR abs/2305.13283 (2023) - 2022
- [c69]Flavio Chierichetti, Alessandro Panconesi, Giuseppe Re, Luca Trevisan:
Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models. AISTATS 2022: 10852-10880 - [c68]Matteo Almanza, Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, Andrew Tomkins:
RUMs from Head-to-Head Contests. ICML 2022: 452-467 - [c67]Enrico Lauletta, Béatrice Biancardi, Antonio Norelli, Maurizio Mancini, Alessandro Panconesi:
Errare humanum est?: a pilot study to evaluate the human-likeness of a AI othello playing agent. IVA 2022: 27:1-27:3 - [c66]Marcos Aguiliera, Andréa W. Richa, Alexander A. Schwarzmann, Alessandro Panconesi, Christian Scheideler, Philipp Woelfel:
2022 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2022: 1 - [c65]Matteo Almanza, Alessandro Epasto, Alessandro Panconesi, Giuseppe Re:
k-Clustering with Fair Outliers. WSDM 2022: 5-15 - 2021
- [j48]Marco Bressan, Stefano Leucci, Alessandro Panconesi:
Faster Motif Counting via Succinct Color Coding and Adaptive Sampling. ACM Trans. Knowl. Discov. Data 15(6): 96:1-96:27 (2021) - [c64]Matteo Almanza, Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi, Giuseppe Re:
Online Facility Location with Multiple Advice. NeurIPS 2021: 4661-4673 - [c63]Marcos K. Aguilera, Hagit Attiya, Christian Cachin, Alessandro Panconesi:
2021 Principles of Distributed Computing Doctoral Dissertation Award. PODC 2021: 3 - [c62]Matteo Almanza, Silvio Lattanzi, Alessandro Panconesi, Giuseppe Re:
Twin Peaks, a Model for Recurring Cascades. WWW 2021: 681-692 - [i9]Antonio Norelli, Alessandro Panconesi:
OLIVAW: Mastering Othello with neither Humans nor a Penny. CoRR abs/2103.17228 (2021) - [i8]Flavio Chierichetti, Alessandro Panconesi, Giuseppe Re, Luca Trevisan:
Correlation Clustering Reconstruction in Semi-Adversarial Models. CoRR abs/2108.04729 (2021) - 2020
- [j47]Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Tracks from hell - When finding a proof may be easier than checking it. Theor. Comput. Sci. 839: 21-29 (2020) - [i7]Marco Bressan, Stefano Leucci, Alessandro Panconesi:
Faster motif counting via succinct color coding and adaptive sampling. CoRR abs/2009.03052 (2020)
2010 – 2019
- 2019
- [j46]Marco Bressan, Stefano Leucci, Alessandro Panconesi:
Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling. Proc. VLDB Endow. 12(11): 1651-1663 (2019) - [j45]Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, Erisa Terolli:
On the Distortion of Locality Sensitive Hashing. SIAM J. Comput. 48(2): 350-372 (2019) - [i6]Marco Bressan, Stefano Leucci, Alessandro Panconesi:
Motivo: fast motif counting via succinct color coding and adaptive sampling. CoRR abs/1906.01599 (2019) - 2018
- [j44]Flavio Chierichetti, George Giakkoupis, Silvio Lattanzi, Alessandro Panconesi:
Rumor Spreading and Conductance. J. ACM 65(4): 17:1-17:21 (2018) - [j43]Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Trainyard is NP-Hard. Theor. Comput. Sci. 748: 66-76 (2018) - [j42]Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi:
Motif Counting Beyond Five Nodes. ACM Trans. Knowl. Discov. Data 12(4): 48:1-48:25 (2018) - [c61]Marzia Antenore, Giovanna Leone, Alessandro Panconesi, Erisa Terolli:
Together We Buy, Alone I Quit: Some Experimental Studies of Online Persuaders. DTUC 2018: 2:1-2:4 - [c60]Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Tracks from hell - when finding a proof may be easier than checking it. FUN 2018: 4:1-4:13 - [c59]Marzia Antenore, Alessandro Panconesi, Erisa Terolli:
Songs of a Future Past - An Experimental Study of Online Persuaders. ICWSM 2018: 12-21 - [c58]Matteo Almanza, Flavio Chierichetti, Alessandro Panconesi, Andrea Vattani:
A Reduction for Efficient LDA Topic Reconstruction. NeurIPS 2018: 7880-7890 - [p2]Devdatt P. Dubhashi, Fabrizio Grandoni, Alessandro Panconesi:
Distributed Approximation Algorithms via LP-Duality and Randomization. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 203-224 - 2017
- [c57]Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, Erisa Terolli:
The Distortion of Locality Sensitive Hashing. ITCS 2017: 54:1-54:18 - [c56]Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi:
Counting Graphlets: Space vs Time. WSDM 2017: 557-566 - 2016
- [c55]Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Trainyard is NP-hard. FUN 2016: 2:1-2:14 - [c54]Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli:
The Limits of Popularity-Based Recommendations, and the Role of Social Ties. KDD 2016: 745-754 - [i5]Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Trainyard is NP-Hard. CoRR abs/1603.00928 (2016) - [i4]Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli:
The Limits of Popularity-Based Recommendations, and the Role of Social Ties. CoRR abs/1607.04263 (2016) - 2015
- [j41]Alessandro Panconesi:
Special issue with selected papers from PODC 2012. Distributed Comput. 28(1): 1 (2015) - [e5]Aldo Gangemi, Stefano Leonardi, Alessandro Panconesi:
Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18-22, 2015. ACM 2015, ISBN 978-1-4503-3469-3 [contents] - [e4]Aldo Gangemi, Stefano Leonardi, Alessandro Panconesi:
Proceedings of the 24th International Conference on World Wide Web Companion, WWW 2015, Florence, Italy, May 18-22, 2015 - Companion Volume. ACM 2015, ISBN 978-1-4503-3473-0 [contents] - 2014
- [j40]Lorenzo Alvisi, Allen Clement, Alessandro Epasto, Silvio Lattanzi, Alessandro Panconesi:
Communities, Random Walks, and Social Sybil Defense. Internet Math. 10(3-4): 360-420 (2014) - [j39]Flavio Chierichetti, Jon M. Kleinberg, Alessandro Panconesi:
How to Schedule a Cascade in an Arbitrary Graph. SIAM J. Comput. 43(6): 1906-1920 (2014) - [c53]Pawel Brach, Alessandro Epasto, Alessandro Panconesi, Piotr Sankowski:
Spreading rumours without the network. COSN 2014: 107-118 - 2013
- [j38]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan:
Models for the Compressible Web. SIAM J. Comput. 42(5): 1777-1802 (2013) - [c52]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. ESA 2013: 325-336 - [c51]Bruno D. Abrahao, Flavio Chierichetti, Robert Kleinberg, Alessandro Panconesi:
Trace complexity of network inference. KDD 2013: 491-499 - [c50]Lorenzo Alvisi, Allen Clement, Alessandro Epasto, Silvio Lattanzi, Alessandro Panconesi:
SoK: The Evolution of Sybil Defense via Social Networks. IEEE Symposium on Security and Privacy 2013: 382-396 - [p1]Alessandro Panconesi:
The One Million Dollars Problem. The Power of Algorithms 2013: 59-81 - [e3]Stefano Leonardi, Alessandro Panconesi, Paolo Ferragina, Aristides Gionis:
Sixth ACM International Conference on Web Search and Data Mining, WSDM 2013, Rome, Italy, February 4-8, 2013. ACM 2013, ISBN 978-1-4503-1869-3 [contents] - [i3]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. CoRR abs/1302.3828 (2013) - [i2]Bruno D. Abrahao, Flavio Chierichetti, Robert Kleinberg, Alessandro Panconesi:
Trace Complexity of Network Inference. CoRR abs/1308.2954 (2013) - 2012
- [j37]Marcos K. Aguilera, Dahlia Malkhi, Keith Marzullo, Alessandro Panconesi, Andrzej Pelc, Roger Wattenhofer:
Announcing the 2012 Edsger W. Dijkstra prize in distributed computing. SIGARCH Comput. Archit. News 40(4): 1-2 (2012) - [j36]Alessandro Panconesi, Jaikumar Radhakrishnan:
Expansion properties of (secure) wireless networks. ACM Trans. Algorithms 8(3): 21:1-21:9 (2012) - [c49]Flavio Chierichetti, Jon M. Kleinberg, Alessandro Panconesi:
How to schedule a cascade in an arbitrary graph. EC 2012: 355-368 - [e2]Darek Kowalski, Alessandro Panconesi:
ACM Symposium on Principles of Distributed Computing, PODC '12, Funchal, Madeira, Portugal, July 16-18, 2012. ACM 2012, ISBN 978-1-4503-1450-3 [contents] - 2011
- [j35]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Rumor spreading in social networks. Theor. Comput. Sci. 412(24): 2602-2610 (2011) - [c48]Silvio Lattanzi, Alessandro Panconesi, D. Sivakumar:
Milgram-routing in social networks. WWW 2011: 725-734 - 2010
- [j34]Alessandro Panconesi, Mauro Sozio:
Fast primal-dual distributed algorithms for scheduling and matching problems. Distributed Comput. 22(4): 269-283 (2010) - [c47]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Rumour Spreading and Graph Conductance. SODA 2010: 1657-1663 - [c46]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Almost tight bounds for rumour spreading with conductance. STOC 2010: 399-408
2000 – 2009
- 2009
- [b2]Devdatt P. Dubhashi, Alessandro Panconesi:
Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press 2009, ISBN 978-0-521-88427-3, pp. I-XIV, 1-196 - [c45]Stefan Dziembowski, Alessandro Mei, Alessandro Panconesi:
On Active Attacks on Sensor Network Key Distribution Schemes. ALGOSENSORS 2009: 52-63 - [c44]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan:
Models for the Compressible Web. FOCS 2009: 331-340 - [c43]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Rumor Spreading in Social Networks. ICALP (2) 2009: 375-386 - [c42]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan:
On compressing social networks. KDD 2009: 219-228 - 2008
- [j33]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio:
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover. SIAM J. Comput. 38(3): 825-840 (2008) - [j32]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi:
Distributed weighted vertex cover via maximal matchings. ACM Trans. Algorithms 5(1): 6:1-6:12 (2008) - [j31]Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan:
Redoubtable Sensor Networks. ACM Trans. Inf. Syst. Secur. 11(3): 13:1-13:22 (2008) - [c41]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Gossiping (via mobile?) in social networks. DIALM-POMC 2008: 27-28 - [c40]Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan:
Unassailable sensor networks. SecureComm 2008: 26 - [c39]Alessandro Panconesi, Mauro Sozio:
Fast distributed scheduling via primal-dual. SPAA 2008: 229-235 - [c38]Flavio Chierichetti, Silvio Lattanzi, Federico Mari, Alessandro Panconesi:
On placing skips optimally in expectation. WSDM 2008: 15-24 - [e1]Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi:
Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings. Lecture Notes in Computer Science 5035, Springer 2008, ISBN 978-3-540-68886-0 [contents] - 2007
- [j30]Alessandro Panconesi:
Foreword. Algorithmica 47(3): 215 (2007) - [j29]Devdatt P. Dubhashi, Olle Häggström, Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti:
Localized Techniques for Broadcasting in Wireless Sensor Networks. Algorithmica 49(4): 412-446 (2007) - [j28]Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic:
Cuts and Disjoint Paths in the Valley-Free Model. Internet Math. 3(3): 333-359 (2007) - [j27]Devdatt P. Dubhashi, Olle Häggström, Gabriele Mambrini, Alessandro Panconesi, Chiara Petrioli:
Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks. Wirel. Networks 13(1): 107-125 (2007) - [c37]Emilio De Santis, Fabrizio Grandoni, Alessandro Panconesi:
Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation. ESA 2007: 206-217 - [c36]Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal:
Finding near neighbors through cluster pruning. PODS 2007: 103-112 - [c35]Alessandro Panconesi:
Fast Distributed Algorithms Via Primal-Dual (Extended Abstract). SIROCCO 2007: 1-6 - [r1]Alessandro Panconesi, Fabrizio Grandoni, Devdatt P. Dubhashi:
Distributed Approximation Algorithms via LP-Duality and Randomization. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j26]Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi:
On the importance of having an identity or, is consensus really universal?. Distributed Comput. 18(3): 167-176 (2006) - [j25]Stefano Basagni, Michele Mastrogiovanni, Alessandro Panconesi, Chiara Petrioli:
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison. IEEE Trans. Parallel Distributed Syst. 17(4): 292-306 (2006) - [c34]Thomas Erlebach, Alexander Hall, Linda S. Moonen, Alessandro Panconesi, Frits C. R. Spieksma, Danica Vukadinovic:
Robustness of the Internet at the Topology and Routing Level. Research Results of the DICS Program 2006: 260-274 - [c33]Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan:
Sensor Networks that Are Provably Resilient. SecureComm 2006: 1-10 - [c32]Carlos Castillo, Alberto Nelli, Alessandro Panconesi:
A Memory-Efficient Strategy for Exploring the Web. Web Intelligence 2006: 680-686 - 2005
- [j24]Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri:
An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. Algorithmica 41(1): 1-23 (2005) - [j23]Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan:
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J. Comput. Syst. Sci. 71(4): 467-479 (2005) - [c31]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi:
Distributed Weighted Vertex Cover via Maximal Matchings. COCOON 2005: 839-848 - [c30]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio:
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. PODC 2005: 118-125 - [c29]Devdatt P. Dubhashi, C. Johansson, Olle Häggström, Alessandro Panconesi, Mauro Sozio:
Irrigating ad hoc networks in constant time. SPAA 2005: 106-115 - 2004
- [j22]Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham:
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. J. Bioinform. Comput. Biol. 2(2): 257-272 (2004) - [j21]Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr.:
An experimental study of a simple, distributed edge-coloring algorithm. ACM J. Exp. Algorithmics 9 (2004) - [j20]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi:
Packing cuts in undirected graphs. Networks 44(1): 1-11 (2004) - [c28]Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic:
Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. CAAN 2004: 49-62 - [c27]Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti:
Localized techniques for broadcasting in wireless sensor networks. DIALM-POMC 2004: 41-51 - [c26]Fabrizio Ferraguto, Gabriele Mambrini, Alessandro Panconesi, Chiara Petrioli:
A New Approach to Device Discovery and Scatternet Formation in Bluetooth Networks. IPDPS 2004 - [c25]Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan:
Connectivity properties of secure wireless sensor networks. SASN 2004: 53-58 - [c24]Alessandro Panconesi, Jaikumar Radhakrishnan:
Expansion properties of (secure) wireless networks. SPAA 2004: 281-285 - [c23]Alessandro Panconesi, Mauro Sozio:
Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction. WABI 2004: 266-277 - 2003
- [j19]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi:
Packing cycles in undirected graphs. J. Algorithms 48(1): 239-256 (2003) - [c22]Devdatt P. Dubhashi, Luigi Laura, Alessandro Panconesi:
Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract. FSTTCS 2003: 168-182 - [c21]Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan:
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. SODA 2003: 717-724 - [c20]Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham:
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. WABI 2003: 202-215 - 2002
- [j18]Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan:
Wavelength rerouting in optical networks, or the Venetian Routing problem. J. Algorithms 45(2): 93-125 (2002) - [j17]Tibor Jordán, Alessandro Panconesi:
Preface. Random Struct. Algorithms 20(3): 261 (2002) - [c19]Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri:
Experimental analysis of simple, distributed vertex coloring algorithms. SODA 2002: 606-615 - [i1]Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi:
On the Importance of Having an Identity or, is Consensus really Universal? CoRR cs.DC/0201006 (2002) - 2001
- [j16]Alessandro Panconesi, Romeo Rizzi:
Some simple distributed algorithms for sparse networks. Distributed Comput. 14(2): 97-100 (2001) - [j15]Michal Hanckowiak, Michal Karonski, Alessandro Panconesi:
On the Distributed Complexity of Computing Maximal Matchings. SIAM J. Discret. Math. 15(1): 41-57 (2001) - [c18]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi:
Packing Cycles and Cuts in Undirected Graphs. ESA 2001: 512-523 - 2000
- [j14]David A. Grable, Alessandro Panconesi:
Fast Distributed Algorithms for Brooks-Vizing Colorings. J. Algorithms 37(1): 85-120 (2000) - [c17]Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan:
Wavelength rerouting in optical networks, or the Venetian routing problem. APPROX 2000: 72-83 - [c16]Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr.:
An experimental study of a simple, distributed edge coloring algorithm. SPAA 2000: 166-175 - [c15]Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi:
On the Importance of Having an Identity or is Consensus Really Universal? DISC 2000: 134-148
1990 – 1999
- 1999
- [c14]Michal Hanckowiak, Michal Karonski, Alessandro Panconesi:
A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically. PODC 1999: 219-228 - 1998
- [j13]Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi:
Randomized Naming Using Wait-Free Shared Variables. Distributed Comput. 11(3): 113-124 (1998) - [j12]Viggo Kann, Jens Lagergren, Alessandro Panconesi:
Approximate Max k-Cut with Subgraph Guarantee. Inf. Process. Lett. 65(3): 145-150 (1998) - [j11]Devdatt P. Dubhashi, David A. Grable, Alessandro Panconesi:
Near-Optimal, Distributed Edge Colouring via the Nibble Method. Theor. Comput. Sci. 203(2): 225-251 (1998) - [j10]Ewa Malesinska, Alessandro Panconesi:
On the Hardness of Allocating Frequences for Hybrid Networks. Theor. Comput. Sci. 209(1-2): 347-363 (1998) - [c13]Michal Hanckowiak, Michal Karonski, Alessandro Panconesi:
On the Distributed Complexity of Computing Maximal Matchings. SODA 1998: 219-225 - [c12]David A. Grable, Alessandro Panconesi:
Fast Distributed Algorithms for {Brooks-Vizing} Colourings. SODA 1998: 473-480 - 1997
- [j9]Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi:
On the Hardness of Approximating Max k-Cut and its Dual. Chic. J. Theor. Comput. Sci. 1997 (1997) - [j8]David A. Grable, Alessandro Panconesi:
Nearly optimal distributed edge coloring in O(log log n) rounds. Random Struct. Algorithms 10(3): 385-405 (1997) - [j7]Alessandro Panconesi, Aravind Srinivasan:
Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds. SIAM J. Comput. 26(2): 350-368 (1997) - [c11]David A. Grable, Alessandro Panconesi:
Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds. SODA 1997: 278-285 - 1996
- [j6]Viggo Kann, Jens Lagergren, Alessandro Panconesi:
Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems. Inf. Process. Lett. 58(3): 105-110 (1996) - [j5]Alessandro Panconesi, Aravind Srinivasan:
On the Complexity of Distributed Network Decomposition. J. Algorithms 20(2): 356-374 (1996) - [c10]Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi:
On the Hardness of Approximating Max k-Cut and Its Dual. ISTCS 1996: 61-67 - [c9]Ewa Malesinska, Alessandro Panconesi:
On the Hardness of Allocating Frequencies for Hybrid Networks. WG 1996: 308-322 - 1995
- [j4]Alessandro Panconesi, Aravind Srinivasan:
The Local Natur of Delta-Coloring and its Algorithmic Applications. Comb. 15(2): 255-280 (1995) - [c8]Devdatt P. Dubhashi, Alessandro Panconesi:
Near-Optimal Distributed Edge Coloring. ESA 1995: 448-459 - 1994
- [c7]Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi:
Randomized Wait-Free Naming. ISAAC 1994: 83-91 - 1993
- [b1]Alessandro Panconesi:
Locality in distributed computing. Cornell University, USA, 1993 - [j3]Alessandro Panconesi, Desh Ranjan:
Quantifiers and Approximation. Theor. Comput. Sci. 107(1): 145-163 (1993) - 1992
- [c6]Alessandro Panconesi, Aravind Srinivasan:
Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract). PODC 1992: 251-262 - [c5]Alessandro Panconesi, Aravind Srinivasan:
Improved Distributed Algorithms for Coloring and Network Decomposition Problems. STOC 1992: 581-592 - 1991
- [j2]Pierluigi Crescenzi, Alessandro Panconesi:
Completeness in Approximation Classes. Inf. Comput. 93(2): 241-262 (1991) - 1990
- [j1]Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi:
Predicting deadlock in store-and-forward networks. Networks 20(7): 861-881 (1990) - [c4]Alessandro Panconesi, Desh Ranjan:
Quantifiers and Approximation (Abstract). SCT 1990: 244 - [c3]Alessandro Panconesi, Desh Ranjan:
Quantifiers and Approximation (Extended Abstract). STOC 1990: 446-456
1980 – 1989
- 1989
- [c2]Pierluigi Crescenzi, Alessandro Panconesi:
Completeness in Approximation Classes. FCT 1989: 116-126 - 1988
- [c1]Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi:
Predicting deadlock in Store-and-Forward Networks. FSTTCS 1988: 123-142
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
