Travelled to:
1 × Canada
1 × Portugal
6 × USA
Collaborated with:
S.Gulwani S.Srivastava S.Rajagopalan L.A.Levin D.De A.Kumarasubramanian W.Aiello M.Bellare S.Jha A.Tiwari A.Arasu S.Blanas K.Eguro M.Joglekar R.Kaushik D.Kossmann R.Ramamurthy P.Upadhyaya
Talks about:
constraint (2) program (2) problem (2) averag (2) secur (2) diophantin (1) logarithm (1) cipherbas (1) synthesi (1) knowledg (1)
Person: Ramarathnam Venkatesan
DBLP: Venkatesan:Ramarathnam
Contributed to:
Wrote 8 papers:
- SIGMOD-2013-ArasuBEJKKRUV #as a service
- Secure database-as-a-service with Cipherbase (AA, SB, KE, MJ, RK, DK, RR, PU, RV), pp. 1033–1036.
- PLDI-2011-GulwaniJTV #source code #synthesis
- Synthesis of loop-free programs (SG, SJ, AT, RV), pp. 62–73.
- VMCAI-2009-GulwaniSV #abstraction #constraints #invariant
- Constraint-Based Invariant Inference over Predicate Abstraction (SG, SS, RV), pp. 120–135.
- PLDI-2008-GulwaniSV #constraints #program analysis #theorem proving
- Program analysis as constraint solving (SG, SS, RV), pp. 281–292.
- SAT-2007-DeKV #using
- Inversion Attacks on Secure Hash Functions Using satSolvers (DD, AK, RV), pp. 377–382.
- STOC-1995-AielloBV #statistics
- Knowledge on the average-perfect, statistical and logarithmic (WA, MB, RV), pp. 469–478.
- STOC-1992-VenkatesanR #matrix #problem
- Average Case Intractability of Matrix and Diophantine Problems (RV, SR), pp. 632–642.
- STOC-1988-VenkatesanL #graph #problem #random
- Random Instances of a Graph Coloring Problem Are Hard (RV, LAL), pp. 217–222.