Travelled to:1 × Canada
1 × Finland
1 × Greece
1 × Poland
1 × Portugal
1 × South Korea
3 × USA
Collaborated with:A.Thomo J.Radhakrishnan J.Håstad P.Sen M.Tamashiro B.M.Kapron L.Malka S.Ponzio H.Buhrman P.B.Miltersen C.Chen L.Zheng K.Wu P.Harsha Y.Ishai J.Kilian K.Nissim
Talks about:communic (2) integr (2) model (2) data (2) recommend (1) character (1) bitvector (1) pushdown (1) interact (1) advantag (1)
Person: Srinivasan Venkatesh
DBLP: Venkatesh:Srinivasan
Contributed to:
2014
20082007
20072004
2002200120001999Wrote 9 papers:
- SAC-2014-ChenZTWS #modelling #recommendation
- Comparing the staples in latent factor models for recommender systems (CC, LZ, AT, KW, SV), pp. 91–96.
- CIKM-2008-ThomoV #automaton #integration #xml
- Rewriting of visibly pushdown languages for xml data integration (AT, SV), pp. 521–530.
- CIKM-2007-TamashiroTV #integration #query #towards
- Towards practically feasible answering of regular path queries in lav data integration (MT, AT, SV), pp. 381–390.
- ICALP-2007-KapronMS
- A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC) (BMK, LM, SV), pp. 328–339.
- ICALP-2004-HarshaIKNV #communication
- Communication Versus Computation (PH, YI, JK, KN, SV), pp. 745–756.
- STOC-2002-HastadV #on the #random
- On the advantage over a random assignment (JH, SV), pp. 43–52.
- ICALP-2001-SenV #bound #quantum
- Lower Bounds in the Quantum Cell Probe Model (PS, SV), pp. 358–369.
- STOC-2000-BuhrmanMRV #question
- Are bitvectors optimal? (HB, PBM, JR, SV), pp. 449–458.
- STOC-1999-PonzioRV #communication #complexity #pointer
- The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling (SP, JR, SV), pp. 602–611.