default search action
Andrea Vattani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [i4]Pavel Dolin, Luc d'Hauthuille, Andrea Vattani:
FeelsGoodMan: Inferring Semantics of Twitch Neologisms. CoRR abs/2108.08411 (2021)
2010 – 2019
- 2018
- [c12]Matteo Almanza, Flavio Chierichetti, Alessandro Panconesi, Andrea Vattani:
A Reduction for Efficient LDA Topic Reconstruction. NeurIPS 2018: 7880-7890 - 2015
- [j5]Andrea Vattani, Flavio Chierichetti, Keegan Lowenstein:
Optimal Probabilistic Cache Stampede Prevention. Proc. VLDB Endow. 8(8): 886-897 (2015) - [j4]Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, Andrea Vattani:
Fast Greedy Algorithms in MapReduce and Streaming. ACM Trans. Parallel Comput. 2(3): 14:1-14:22 (2015) - 2013
- [c11]Ravi Kumar, Daniel Lokshtanov, Sergei Vassilvitskii, Andrea Vattani:
Near-Optimal Bounds for Cross-Validation via Loss Stability. ICML (1) 2013: 27-35 - [c10]Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, Andrea Vattani:
Fast greedy algorithms in mapreduce and streaming. SPAA 2013: 1-10 - 2012
- [b1]Andrea Vattani:
Algorithmic modeling of decision making over networks. University of California, San Diego, USA, 2012 - [j3]Bahman Bahmani, Benjamin Moseley, Andrea Vattani, Ravi Kumar, Sergei Vassilvitskii:
Scalable K-Means++. Proc. VLDB Endow. 5(7): 622-633 (2012) - [c9]Nuh Aygün Dalkiran
, Moshe Hoffman, Ramamohan Paturi, Daniel Ricketts, Andrea Vattani:
Common Knowledge and State-Dependent Equilibria. SAGT 2012: 84-95 - [c8]Manuel Cebrián
Finding red balloons with split contracts: robustness to individuals' selfishness. STOC 2012: 775-788 - [i3]Bahman Bahmani, Benjamin Moseley, Andrea Vattani, Ravi Kumar, Sergei Vassilvitskii:
Scalable K-Means++. CoRR abs/1203.6402 (2012) - 2011
- [j2]Andrea Vattani:
k-means Requires Exponentially Many Iterations Even in the Plane. Discret. Comput. Geom. 45(4): 596-616 (2011) - [c7]Andrea Vattani, Deepayan Chakrabarti, Maxim Gurevich:
Preserving Personalized Pagerank in Subgraphs. ICML 2011: 793-800 - [c6]Petros Mol, Andrea Vattani, Panagiotis Voulgaris:
The Effects of Diversity in Aggregation Games. ICS 2011: 509-521 - [c5]Ravi Kumar, Silvio Lattanzi, Sergei Vassilvitskii, Andrea Vattani:
Hiring a secretary from a poset. EC 2011: 39-48 - 2010
- [j1]Flavio Chierichetti, Andrea Vattani:
The Local Nature of List Colorings for Graphs of High Girth. SIAM J. Comput. 39(6): 2232-2250 (2010) - [c4]Amos Israeli, Mathew D. McCubbins
Low Memory Distributed Protocols for 2-Coloring. SSS 2010: 303-318 - [c3]Matus Telgarsky, Andrea Vattani:
Hartigan's Method: k-means Clustering without Voronoi. AISTATS 2010: 820-827
2000 – 2009
- 2009
- [c2]Andrea Vattani:
k-means requires exponentially many iterations even in the plane. SCG 2009: 324-332 - [i2]Kamalika Chaudhuri, Sanjoy Dasgupta, Andrea Vattani:
Learning Mixtures of Gaussians using the k-means Algorithm. CoRR abs/0912.0086 (2009) - 2008
- [c1]Flavio Chierichetti, Andrea Vattani:
The Local Nature of List Colorings for Graphs of High Girth. ICALP (1) 2008: 320-332 - [i1]Andrea Vattani:
k-means requires exponentially many iterations even in the plane. CoRR abs/0812.0382 (2008)
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-05-08 21:02 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: