×

Srinivasan, Venkatesh

Author ID: srinivasan.venkatesh Recent zbMATH articles by "Srinivasan, Venkatesh"
Published as: Srinivasan, Venkatesh
Homepage: http://webhome.cs.uvic.ca/~srinivas/
External Links: MGP · Wikidata · Google Scholar · ResearchGate · dblp

Publications by Year

Citations contained in zbMATH Open

19 Publications have been cited 80 times in 48 Documents Cited by Year
Restricted linear congruences. Zbl 1353.11067
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh; Tauraso, Roberto; Tóth, László
11
2017
On an almost-universal hash function family with applications to authentication and secrecy codes. Zbl 1391.94730
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh; Tóth, László
10
2018
Connecting a set of circles with minimum sum of radii. Zbl 1342.68355
Chambers, Erin Wolf; Fekete, Sándor P.; Hoffmann, Hella-Franziska; Marinakis, Dimitri; Mitchell, Joseph S. B.; Srinivasan, Venkatesh; Stege, Ulrike; Whitesides, Sue
8
2011
On a restricted linear congruence. Zbl 1353.11066
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh
6
2016
Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT. Zbl 1345.81096
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh
6
2016
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes. Zbl 1411.11035
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh
6
2018
Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs. Zbl 07495044
Nishat, Rahnuma Islam; Srinivasan, Venkatesh; Whitesides, Sue
5
2021
A characterization of non-interactive instance-dependent commitment-schemes (NIC). Zbl 1171.94353
Kapron, Bruce; Malka, Lior; Srinivasan, Venkatesh
4
2007
Connecting a set of circles with minimum sum of radii. Zbl 1380.05113
Chambers, Erin W.; Fekete, Sándor P.; Hoffmann, Hella-Franziska; Marinakis, Dimitri; Mitchell, Joseph S. B.; Srinivasan, Venkatesh; Stege, Ulrike; Whitesides, Sue
3
2018
Connectivity graphs of uncertainty regions. Zbl 1372.68205
Chambers, Erin; Erickson, Alejandro; Fekete, Sándor P.; Lenchner, Jonathan; Sember, Jeff; Srinivasan, Venkatesh; Stege, Ulrike; Stolpner, Svetlana; Weibel, Christophe; Whitesides, Sue
3
2017
On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes. Zbl 1395.94286
Hajiabadi, Mohammad; Kapron, Bruce M.; Srinivasan, Venkatesh
3
2016
The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs. Zbl 1359.94783
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh
3
2016
1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids. Zbl 07556561
Nishat, Rahnuma Islam; Srinivasan, Venkatesh; Whitesides, Sue
3
2022
A framework for non-interactive instance-dependent commitment schemes (NIC). Zbl 1331.94056
Kapron, Bruce; Malka, Lior; Srinivasan, Venkatesh
2
2015
MMH* with arbitrary modulus is always almost-universal. Zbl 1353.94037
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh
2
2016
A generalization of Schönemann’s theorem via a graph theoretic method. Zbl 1420.11006
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh
2
2019
Linear algebraic methods in communication complexity. Zbl 1278.68106
Deaett, Louis; Srinivasan, Venkatesh
1
2012
Strongly minimal MapReduce algorithms: a terasort case study. Zbl 07266059
Xia, Daniel; Simpson, Michael; Srinivasan, Venkatesh; Thomo, Alex
1
2020
The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs. Zbl 07724768
Nishat, Rahnuma Islam; Srinivasan, Venkatesh; Whitesides, Sue
1
2023
The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs. Zbl 07724768
Nishat, Rahnuma Islam; Srinivasan, Venkatesh; Whitesides, Sue
1
2023
1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids. Zbl 07556561
Nishat, Rahnuma Islam; Srinivasan, Venkatesh; Whitesides, Sue
3
2022
Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs. Zbl 07495044
Nishat, Rahnuma Islam; Srinivasan, Venkatesh; Whitesides, Sue
5
2021
Strongly minimal MapReduce algorithms: a terasort case study. Zbl 07266059
Xia, Daniel; Simpson, Michael; Srinivasan, Venkatesh; Thomo, Alex
1
2020
A generalization of Schönemann’s theorem via a graph theoretic method. Zbl 1420.11006
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh
2
2019
On an almost-universal hash function family with applications to authentication and secrecy codes. Zbl 1391.94730
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh; Tóth, László
10
2018
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes. Zbl 1411.11035
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh
6
2018
Connecting a set of circles with minimum sum of radii. Zbl 1380.05113
Chambers, Erin W.; Fekete, Sándor P.; Hoffmann, Hella-Franziska; Marinakis, Dimitri; Mitchell, Joseph S. B.; Srinivasan, Venkatesh; Stege, Ulrike; Whitesides, Sue
3
2018
Restricted linear congruences. Zbl 1353.11067
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh; Tauraso, Roberto; Tóth, László
11
2017
Connectivity graphs of uncertainty regions. Zbl 1372.68205
Chambers, Erin; Erickson, Alejandro; Fekete, Sándor P.; Lenchner, Jonathan; Sember, Jeff; Srinivasan, Venkatesh; Stege, Ulrike; Stolpner, Svetlana; Weibel, Christophe; Whitesides, Sue
3
2017
On a restricted linear congruence. Zbl 1353.11066
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh
6
2016
Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT. Zbl 1345.81096
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh
6
2016
On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes. Zbl 1395.94286
Hajiabadi, Mohammad; Kapron, Bruce M.; Srinivasan, Venkatesh
3
2016
The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs. Zbl 1359.94783
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh
3
2016
MMH* with arbitrary modulus is always almost-universal. Zbl 1353.94037
Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh
2
2016
A framework for non-interactive instance-dependent commitment schemes (NIC). Zbl 1331.94056
Kapron, Bruce; Malka, Lior; Srinivasan, Venkatesh
2
2015
Linear algebraic methods in communication complexity. Zbl 1278.68106
Deaett, Louis; Srinivasan, Venkatesh
1
2012
Connecting a set of circles with minimum sum of radii. Zbl 1342.68355
Chambers, Erin Wolf; Fekete, Sándor P.; Hoffmann, Hella-Franziska; Marinakis, Dimitri; Mitchell, Joseph S. B.; Srinivasan, Venkatesh; Stege, Ulrike; Whitesides, Sue
8
2011
A characterization of non-interactive instance-dependent commitment-schemes (NIC). Zbl 1171.94353
Kapron, Bruce; Malka, Lior; Srinivasan, Venkatesh
4
2007

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.