Travelled to:1 × Canada
1 × Greece
1 × Italy
11 × USA
Collaborated with:B.Bahmani A.Meyerson R.Shinde S.Khanna S.Guha S.A.Plotkin S.Cho C.Chekuri L.M.Adleman Q.Cheng M.A.Huang A.Chowdhury M.Kapralov R.Bhattacharjee K.Kollias D.E.Carroll K.Munagala S.Rai B.Krishnamachari P.Lofgren S.Banerjee S.Comandur P.Gupta D.Dutta A.Kumar M.R.Henzinger É.Tardos M.Charikar D.Kempe P.M.d.Espanés P.W.K.Rothemund
Talks about:graph (4) schedul (3) time (3) distribut (2) resourc (2) problem (2) multipl (2) assembl (2) sensit (2) person (2)
Person: Ashish Goel
DBLP: Goel:Ashish
Contributed to:
2014
2012
2010
2010
2010
2009
2006
20062006200420022001200019991998Wrote 16 papers:
- KDD-2014-LofgrenBGC #estimation #graph #named #personalisation #rank #scalability
- FAST-PPR: scaling personalized pagerank estimation for large graphs (PL, SB, AG, SC), pp. 1436–1445.
- CIKM-2012-BahmaniGS #distributed #locality #performance
- Efficient distributed locality sensitive hashing (BB, AG, RS), pp. 2174–2178.
- VLDB-2011-BahmaniCG10 #incremental #performance #personalisation #rank
- Fast Incremental and Personalized PageRank (BB, AC, AG), pp. 173–184.
- SIGMOD-2010-ShindeGGD #locality #similarity #using
- Similarity search and locality sensitive hashing using ternary content addressable memories (RS, AG, PG, DD), pp. 375–386.
- STOC-2010-GoelKK #graph
- Perfect matchings in o(n log n) time in regular bipartite graphs (AG, MK, SK), pp. 39–46.
- RecSys-2009-BhattacharjeeGK #architecture #recommendation #social
- An incentive-based architecture for social recommendations (RB, AG, KK), pp. 229–232.
- ICALP-v1-2006-CarrollGM #bound #graph
- Embedding Bounded Bandwidth Graphs into l1 (DEC, AG, AM), pp. 27–37.
- PODS-2006-GoelGM #modelling #optimisation #using
- Asking the right questions: model-driven optimization using probes (AG, SG, KM), pp. 203–212.
- STOC-2006-ChoG #distributed #multi #resource management
- Pricing for fairness: distributed resource allocation for multiple objectives (SwC, AG), pp. 197–204.
- STOC-2004-ChekuriGKK #multi #scheduling
- Multi-processor scheduling to minimize flow time with epsilon resource augmentation (CC, AG, SK, AK), pp. 363–372.
- STOC-2004-GoelRK #geometry #graph #random
- Sharp thresholds For monotone properties in random geometric graphs (AG, SR, BK), pp. 580–586.
- STOC-2002-AdlemanCGHKER #combinator #optimisation #problem #self
- Combinatorial optimization problems in self-assembly (LMA, QC, AG, MDAH, DK, PMdE, PWKR), pp. 23–32.
- STOC-2001-AdlemanCGH #self
- Running time and program size for self-assembled squares (LMA, QC, AG, MDAH), pp. 740–748.
- STOC-2000-GoelMP #multi #online #throughput
- Combining fairness with throughput: online routing with multiple objectives (AG, AM, SAP), pp. 670–679.
- STOC-1999-GoelHPT #data transfer #network #problem #scheduling #set
- Scheduling Data Transfers in a Network and the Set Scheduling Problem (AG, MRH, SAP, ÉT), pp. 189–197.
- STOC-1998-CharikarCGG #algorithm #approximate
- Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median (MC, CC, AG, SG), pp. 114–123.