Travelled to:
1 × China
1 × France
1 × Greece
1 × Latvia
1 × Portugal
1 × United Kingdom
24 × USA
3 × Canada
Collaborated with:
∅ É.Tardos P.Raghavan L.Backstrom D.Kempe J.Leskovec D.P.Huttenlocher C.H.Papadimitriou D.Gibson A.Tomkins A.Kumar D.P.Williamson I.M.Kloumann S.Oren M.Sandler D.Liben-Nowell R.Kumar G.Kossinets D.J.Watts C.Faloutsos E.Anshelevich A.J.Demers Y.Rabani A.Aggarwal B.Berger F.T.Leighton M.Sudan R.Fagin J.Ugander B.Karrer A.Anderson X.Lan K.Bhawalkar K.Lewi T.Roughgarden A.Sharma S.Amer-Yahia A.Doan N.Koudas M.J.Franklin D.J.Crandall D.Cosley S.Suri A.Gupta R.Rastogi B.Yener A.Borodin M.Charikar V.Guruswami A.Sahai A.R.Karlin S.Rajagopalan R.Rubinfeld
Talks about:
network (18) social (14) problem (8) algorithm (6) inform (5) communiti (4) flow (4) structur (3) disjoint (3) model (3)
Person: Jon M. Kleinberg
DBLP: Kleinberg:Jon_M=
Facilitated 1 volumes:
Contributed to:
Wrote 44 papers:
- CSCW-2014-BackstromK #analysis #facebook #network #social
- Romantic partnerships and the dispersion of social ties: a network analysis of relationship status on facebook (LB, JMK), pp. 831–841.
- KDD-2014-KloumannK #community #identification #set
- Community membership identification from small seed sets (IMK, JMK), pp. 1366–1375.
- ICALP-v2-2013-Kleinberg #algorithm #network #social
- Algorithms, Networks, and Social Phenomena (JMK), pp. 1–3.
- KDD-2013-UganderKBK #clustering #graph #multi #network
- Graph cluster randomization: network exposure to multiple universes (JU, BK, LB, JMK), pp. 329–337.
- ICALP-v2-2012-BhawalkarKLRS #network #problem #social
- Preventing Unraveling in Social Networks: The Anchored k-Core Problem (KB, JMK, KL, TR, AS), pp. 440–451.
- KDD-2012-AndersonHKL #case study #community #process #stack overflow
- Discovering value from community activity on focused question answering sites: a case study of stack overflow (AA, DPH, JMK, JL), pp. 850–858.
- STOC-2011-KleinbergO
- Mechanisms for (mis)allocating scientific credit (JMK, SO), pp. 529–538.
- CHI-2010-LeskovecHK #network #social #social media
- Signed networks in social media (JL, DPH, JMK), pp. 1361–1370.
- SIGMOD-2010-Amer-YahiaDKKF #algorithm #big data
- Crowds, clouds, and algorithms: exploring the human side of “big data” applications (SAY, AD, JMK, NK, MJF), pp. 1259–1260.
- SIGMOD-2010-Kleinberg #network #online
- The flow of on-line information in global networks (JMK), pp. 1–2.
- KDD-2009-BackstromKK #optimisation #problem #scheduling #web
- Optimizing web traffic via the media scheduling problem (LB, JMK, RK), pp. 89–98.
- KDD-2009-LeskovecBK
- Meme-tracking and the dynamics of the news cycle (JL, LB, JMK), pp. 497–506.
- HT-2008-Kleinberg #data flow #process #social
- Link structures, information flow, and social processes (JMK), pp. 3–4.
- KDD-2008-CrandallCHKS #community #feedback #online #similarity #social
- Feedback effects between similarity and social influence in online communities (DJC, DC, DPH, JMK, SS), pp. 160–168.
- KDD-2008-KossinetsKW #communication #network #social
- The structure of information pathways in a social communication network (GK, JMK, DJW), pp. 435–443.
- STOC-2008-KleinbergT #network #social
- Balanced outcomes in social exchange networks (JMK, ÉT), pp. 295–304.
- KDD-2007-Kleinberg #challenge #mining #network #privacy #process #social
- Challenges in mining social network data: processes, privacy, and paradoxes (JMK), pp. 4–5.
- KDD-2006-BackstromHKL #evolution #network #scalability #social
- Group formation in large social networks: membership, growth, and evolution (LB, DPH, JMK, XL), pp. 44–54.
- SIGIR-2006-Kleinberg #network #social
- Social networks, incentives, and search (JMK), pp. 210–211.
- ICALP-2005-KempeKT #network #social
- Influential Nodes in a Diffusion Model for Social Networks (DK, JMK, ÉT), pp. 1127–1138.
- KDD-2005-LeskovecKF #graph
- Graphs over time: densification laws, shrinking diameters and possible explanations (JL, JMK, CF), pp. 177–187.
- STOC-2004-KleinbergS #collaboration #modelling #using
- Using mixture models for collaborative filtering (JMK, MS), pp. 569–578.
- CIKM-2003-Liben-NowellK #network #predict #problem #social
- The link prediction problem for social networks (DLN, JMK), pp. 556–559.
- KDD-2003-KempeKT #network #social
- Maximizing the spread of influence through a social network (DK, JMK, ÉT), pp. 137–146.
- KDD-2002-Kleinberg
- Bursty and hierarchical structure in streams (JMK), pp. 91–101.
- STOC-2002-AnshelevichKK #algorithm
- Stability of load balancing algorithms in dynamic adversarial systems (EA, DK, JMK), pp. 399–406.
- STOC-2001-GuptaKKRY #design #multi #network #problem
- Provisioning a virtual private network: a network design problem for multicommodity flow (AG, JMK, AK, RR, BY), pp. 389–398.
- STOC-2001-KempeKD #protocol
- Spatial gossip and resource location protocols (DK, JMK, AJD), pp. 163–172.
- PODS-2000-KleinbergPR
- Auditing Boolean Attributes (JMK, CHP, PR), pp. 86–91.
- STOC-2000-CharikarFGKRS #query
- Query strategies for priced information (MC, RF, VG, JMK, PR, AS), pp. 582–591.
- STOC-2000-FaginKKRRRST #random
- Random walks with “back buttons” (RF, ARK, JMK, PR, SR, RR, MS, AT), pp. 484–493.
- STOC-2000-KempeKK #network #problem
- Connectivity and inference problems for temporal networks (DK, JMK, AK), pp. 504–513.
- STOC-2000-Kleinberg #algorithm #perspective
- The small-world phenomenon: an algorithmic perspective (JMK), pp. 163–170.
- PODS-1999-KleinbergT #algebra #analysis #hypermedia #information retrieval #linear
- Applications of Linear Algebra in Information Retrieval and Hypertext Analysis (JMK, AT), pp. 185–193.
- HT-1998-GibsonKR #community #web
- Inferring Web Communities from Link Topology (DG, JMK, PR), pp. 225–234.
- STOC-1998-Kleinberg #algorithm #problem
- Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem (JMK), pp. 530–539.
- STOC-1998-KleinbergPR #problem #segmentation
- Segmentation Problems (JMK, CHP, PR), pp. 473–482.
- VLDB-1998-GibsonKR #approach #category theory #clustering
- Clustering Categorical Data: An Approach Based on Dynamical Systems (DG, JMK, PR), pp. 311–322.
- STOC-1997-Kleinberg #algorithm #nearest neighbour
- Two Algorithms for Nearest-Neighbor Search in High Dimensions (JMK), pp. 599–608.
- STOC-1997-KleinbergRT
- Allocating Bandwidth for Bursty Connections (JMK, YR, ÉT), pp. 664–673.
- STOC-1996-AggarwalKW #layout #trade-off
- Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout (AA, JMK, DPW), pp. 585–594.
- STOC-1996-BergerKL #3d #fault
- Reconstructing a Three-Dimensional Model with Arbitrary Errors (BB, JMK, FTL), pp. 449–458.
- STOC-1996-BorodinKRSW
- Adversarial Queueing Theory (AB, JMK, PR, MS, DPW), pp. 376–385.
- STOC-1995-KleinbergT #approximate #network #problem
- Approximations for the disjoint paths problem in high-diameter planar networks (JMK, ÉT), pp. 26–35.