default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuca Zanetti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Andrea Sereni, Maria Paola Sforza Fogliani, Luca Zanetti
:
For Better and for Worse. Abstractionism, Good Company, and Pluralism. Rev. Symb. Log. 16(1): 268-297 (2023)- [j5]Luca Zanetti, Daniele Chiffi, Lorenza Petrini:
Epistemic and Non-epistemic Values in Earthquake Engineering. Sci. Eng. Ethics 29(3): 18 (2023) - 2022
- [c9]Sam Olesker-Taylor, Luca Zanetti:
Geometric Bounds on the Fastest Mixing Markov Chain. ITCS 2022: 109:1-109:1 - 2021
- [j4]Luca Zanetti:
Grounding and auto-abstraction. Synth. 198(11): 10187-10205 (2021) - [i7]Sam Olesker-Taylor, Luca Zanetti:
Geometric Bounds on the Fastest Mixing Markov Chain. CoRR abs/2111.05816 (2021) - 2020
- [c8]Mihai Cucuringu, Huan Li, He Sun, Luca Zanetti:
Hermitian matrices for clustering directed graphs: insights and applications. AISTATS 2020: i - [c7]Leran Cai, Thomas Sauerwald, Luca Zanetti:
Random Walks on Randomly Evolving Graphs. SIROCCO 2020: 111-128 - [i6]Leran Cai, Thomas Sauerwald, Luca Zanetti:
Random walks on randomly evolving graphs. CoRR abs/2006.10589 (2020)
2010 – 2019
- 2019
- [j3]He Sun, Luca Zanetti:
Distributed Graph Clustering and Sparsification. ACM Trans. Parallel Comput. 6(3): 17:1-17:23 (2019) - [c6]Huan Li, He Sun, Luca Zanetti:
Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem. ESA 2019: 71:1-71:14 - [c5]Thomas Sauerwald, Luca Zanetti:
Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities. ICALP 2019: 93:1-93:15 - [i5]Thomas Sauerwald, Luca Zanetti:
Random Walks on Dynamic Graphs: Mixing Times, HittingTimes, and Return Probabilities. CoRR abs/1903.01342 (2019) - [i4]Mihai Cucuringu, Huan Li, He Sun, Luca Zanetti:
Hermitian matrices for clustering directed graphs: insights and applications. CoRR abs/1908.02096 (2019) - 2018
- [b1]Luca Zanetti:
Algorithms for partitioning well-clustered graphs. University of Bristol, UK, 2018 - [i3]Huan Li, He Sun, Luca Zanetti:
Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem. CoRR abs/1811.10909 (2018) - 2017
- [j2]Richard Peng, He Sun, Luca Zanetti:
Partitioning Well-Clustered Graphs: Spectral Clustering Works! SIAM J. Comput. 46(2): 710-743 (2017) - [c4]He Sun, Luca Zanetti:
Distributed Graph Clustering by Load Balancing. SPAA 2017: 163-171 - [i2]He Sun, Luca Zanetti:
Distributed Graph Clustering and Sparsification. CoRR abs/1711.01262 (2017) - 2015
- [c3]Richard Peng, He Sun, Luca Zanetti:
Partitioning Well-Clustered Graphs: Spectral Clustering Works! COLT 2015: 1423-1455 - 2014
- [i1]Richard Peng, He Sun, Luca Zanetti:
Partitioning Well-Clustered Graphs with k-Means and Heat Kernel. CoRR abs/1411.2021 (2014) - 2013
- [c2]Alessandro Armando, Roberto Carbone, Luca Zanetti:
Formal Modeling and Automatic Security Analysis of Two-Factor and Two-Channel Authentication Protocols. NSS 2013: 728-734 - 2011
- [j1]Michele Barletta, Alberto Calvi, Silvio Ranise, Luca Viganò, Luca Zanetti:
Workflow and Access Control Reloaded: a Declarative Specification Framework for the Automated Analysis of Web Services. Scalable Comput. Pract. Exp. 12(1) (2011) - 2010
- [c1]Michele Barletta, Alberto Calvi, Silvio Ranise, Luca Viganò, Luca Zanetti:
WSSMT: Towards the Automated Analysis of Security-Sensitive Services and Applications. SYNASC 2010: 417-424
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-10-07 21:25 CEST 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:
