default search action

combined dblp search
author search
venue search
publication search

ask others

N. V. Vinodchandran

N. Variyam Vinodchandran

> Home > Persons

Person information

affiliation: University of Nebraska-Lincoln, USA

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

2024
[j36]
- view
  authority control:
- export record
  dblp key:
  - journals/pacmmod/Pavan0VM24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pacmmod/Pavan0VM24
Aduri Pavan, Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel:
On the Feasibility of Forgetting in Data Streams. Proc. ACM Manag. Data 2(2): 102 (2024)
[j35]
- view
  authority control:
- export record
  dblp key:
  - journals/tse/BaranovCLMV24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tse/BaranovCLMV24
Eduard Baranov, Sourav Chakraborty, Axel Legay, Kuldeep S. Meel, N. Variyam Vinodchandran:
A Scalable $t$t-Wise Coverage Estimator: Algorithms and Applications. IEEE Trans. Software Eng. 50(8): 2021-2039 (2024)
2023
[j34]
- view
  authority control:
- export record
  dblp key:
  - journals/cacm/PavanVBM23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cacm/PavanVBM23
A. Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting Meets Distinct Elements. Commun. ACM 66(9): 95-102 (2023)
[j33]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/BhattacharyyaGPTV23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/BhattacharyyaGPTV23
Arnab Bhattacharyya, Sutanu Gayen, Eric Price, Vincent Y. F. Tan, N. V. Vinodchandran:
Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu. SIAM J. Comput. 52(3): 761-793 (2023)
[j32]
- view
  authority control:
- export record
  dblp key:
  - journals/tods/PavanVBM23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tods/PavanVBM23
A. Pavan, N. Variyam Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting Meets F₀ Estimation. ACM Trans. Database Syst. 48(3): 7:1-7:28 (2023)
2022
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/sigmod/PavanVBM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigmod/PavanVBM22
Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting Meets Distinct Elements in a Data Stream. SIGMOD Rec. 51(1): 87-94 (2022)
2018
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BravermanLSVY18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BravermanLSVY18
Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang:
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. Algorithmica 80(2): 652-667 (2018)
2015
[j29]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/VinodchandranZ15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/VinodchandranZ15
N. V. Vinodchandran, Marius Zimand:
On Optimal Language Compression for Sets in PSPACE/poly. Theory Comput. Syst. 56(3): 581-590 (2015)
2014
[j28]
- view
  authority control:
- export record
  dblp key:
  - journals/cc/GarvinSTV14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/GarvinSTV14
Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
ReachFewL = ReachUL. Comput. Complex. 23(1): 85-98 (2014)
2012
[j27]
- view
  authority control:
- export record
  dblp key:
  - journals/cc/PavanTV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/PavanTV12
Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran:
On the power of unambiguity in log-space. Comput. Complex. 21(4): 643-670 (2012)
[j26]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/TewariV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/TewariV12
Raghunath Tewari, N. V. Vinodchandran:
Green's theorem and isolation in planar graphs. Inf. Comput. 215: 1-7 (2012)
[j25]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/DattaKTV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/DattaKTV12
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran:
Space complexity of perfect matching in bounded genus bipartite graphs. J. Comput. Syst. Sci. 78(3): 765-779 (2012)
2011
[j24]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/FortnowHPVW11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/FortnowHPVW11
Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang:
Extracting Kolmogorov complexity with applications to dimension zero-one laws. Inf. Comput. 209(4): 627-636 (2011)
[j23]
- view
  authority control:
- export record
  dblp key:
  - journals/toct/HitchcockPV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toct/HitchcockPV11
John M. Hitchcock, Aduri Pavan, N. Variyam Vinodchandran:
Kolmogorov Complexity in Randomness Extraction. ACM Trans. Comput. Theory 3(1): 1:1-1:12 (2011)
2009
[j22]
- view
  authority control:
- export record
  dblp key:
  - journals/toct/BourkeTV09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toct/BourkeTV09
Chris Bourke, Raghunath Tewari, N. V. Vinodchandran:
Directed Planar Reachability Is in Unambiguous Log-Space. ACM Trans. Comput. Theory 1(1): 4:1-4:17 (2009)
2008
[j21]
- view
  authority control:
- export record
  dblp key:
  - journals/cc/PavanV08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/PavanV08
Aduri Pavan, N. V. Vinodchandran:
2-Local Random Reductions to 3-Valued Functions. Comput. Complex. 17(4): 501-514 (2008)
[j20]
- view
  authority control:
- export record
  dblp key:
  - journals/ml/BourkeDSSV08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ml/BourkeDSSV08
Chris Bourke, Kun Deng, Stephen D. Scott, Robert E. Schapire, N. V. Vinodchandran:
On reoptimizing multi-class classifiers. Mach. Learn. 71(2-3): 219-242 (2008)
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/HitchcockPV08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/HitchcockPV08
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Partial Bi-immunity, Scaled Dimension, and NP-Completeness. Theory Comput. Syst. 42(2): 131-142 (2008)
[j18]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/PavanV08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/PavanV08
Aduri Pavan, N. V. Vinodchandran:
Relations between Average-Case and Worst-Case Complexity. Theory Comput. Syst. 42(4): 596-607 (2008)
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/pami/TaoSVOM08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pami/TaoSVOM08
Qingping Tao, Stephen D. Scott, N. V. Vinodchandran, Thomas Takeo Osugi, Brandon Mueller:
Kernels for Generalized Multiple-Instance Learning. IEEE Trans. Pattern Anal. Mach. Intell. 30(12): 2084-2098 (2008)
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/wicomm/BalachandranZRTV08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/wicomm/BalachandranZRTV08
Ravi K. Balachandran, Xukai Zou, Byrav Ramamurthy, Amandeep Thukral, N. Variyam Vinodchandran:
An efficient and attack-resistant key agreement scheme for secure group communications in mobile ad-hoc networks. Wirel. Commun. Mob. Comput. 8(10): 1297-1312 (2008)
2007
[j15]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/PavanSSV07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/PavanSSV07
Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran:
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theor. Comput. Sci. 385(1-3): 167-178 (2007)
2006
[j14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/HitchcockV06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/HitchcockV06
John M. Hitchcock, N. V. Vinodchandran:
Dimension, entropy rates, and compression. J. Comput. Syst. Sci. 72(4): 760-782 (2006)
[j13]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/AntunesFMV06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AntunesFMV06
Luis Antunes, Lance Fortnow, Dieter van Melkebeek, N. V. Vinodchandran:
Computational depth: Concept and applications. Theor. Comput. Sci. 354(3): 391-404 (2006)
2005
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/cc/MiltersenV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/MiltersenV05
Peter Bro Miltersen, N. V. Vinodchandran:
Derandomizing Arthur-Merlin Games using Hitting Sets. Comput. Complex. 14(3): 256-279 (2005)
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/ijfcs/Vinodchandran05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/Vinodchandran05
N. Variyam Vinodchandran:
Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games. Int. J. Found. Comput. Sci. 16(6): 1297-1308 (2005)
[j10]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Vinodchandran05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Vinodchandran05
N. V. Vinodchandran:
A note on the circuit complexity of PP. Theor. Comput. Sci. 347(1-2): 415-418 (2005)
[j9]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BourkeHV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BourkeHV05
Chris Bourke, John M. Hitchcock, N. V. Vinodchandran:
Entropy rates and finite-state dimension. Theor. Comput. Sci. 349(3): 392-406 (2005)
2004
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/Vinodchandran04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Vinodchandran04
N. V. Vinodchandran:
AM_exp[nsube](NP[cap]coNP)/poly. Inf. Process. Lett. 89(1): 43-47 (2004)
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Vinodchandran04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Vinodchandran04
N. V. Vinodchandran:
Counting Complexity of Solvable Black-Box Group Problems. SIAM J. Comput. 33(4): 852-869 (2004)
2002
[j6]
- view
  - electronic edition @ uchicago.edu (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/cjtcs/ArvindSV02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cjtcs/ArvindSV02
Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran:
The Query Complexity of Program Checking by Constant-Depth Circuits. Chic. J. Theor. Comput. Sci. 2002 (2002)
2000
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/ArvindV00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ArvindV00
Vikraman Arvind, N. V. Vinodchandran:
Exact learning via teaching assistants. Theor. Comput. Sci. 241(1-2): 51-81 (2000)
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/ArvindV00a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ArvindV00a
Vikraman Arvind, N. V. Vinodchandran:
The counting complexity of group-definable languages. Theor. Comput. Sci. 242(1-2): 199-218 (2000)
1997
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/ArvindV97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ArvindV97
Vikraman Arvind, N. V. Vinodchandran:
Solvable Black-Box Group Problems are Low for PP. Theor. Comput. Sci. 180(1-2): 17-45 (1997)
1995
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/MahajanV95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/MahajanV95
Meena Mahajan, N. V. Vinodchandran:
A Note on Mod and Generalised Mod Classes. Inf. Process. Lett. 55(1): 27-31 (1995)
1994
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/MahajanTV94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/MahajanTV94
Meena Mahajan, Thomas Thierauf, N. V. Vinodchandran:
A Note on SpanP Functions. Inf. Process. Lett. 51(1): 7-10 (1994)

Conference and Workshop Papers

see FAQ

What is the meaning of the colors in the publication lists?

2024
[c58]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/approx/NandiVGMP024
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/NandiVGMP024
Mridul Nandi, N. V. Vinodchandran, Arijit Ghosh, Kuldeep S. Meel, Soumit Pal, Sourav Chakraborty:
Improved Streaming Algorithm for the Klee's Measure Problem and Generalizations. APPROX/RANDOM 2024: 26:1-26:21
[c57]
- view
  - electronic edition @ openreview.net (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/icml/0001GMM0V24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/0001GMM0V24
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
Total Variation Distance Meets Probabilistic Inference. ICML 2024
2023
[c56]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/aaai/PavanMV023
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/PavanMV023
Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya:
Constraint Optimization over Semirings. AAAI 2023: 4070-4077
[c55]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/ijcai/0001GMMPV23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/0001GMMPV23
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
On Approximating Total Variation Distance. IJCAI 2023: 3479-3487
[c54]
- view
  - electronic edition @ nips.cc (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/nips/0002PWV23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/0002PWV23
Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran:
List and Certificate Complexities in Replicable Learning. NeurIPS 2023
[c53]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/wdag/Chen0V23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wdag/Chen0V23
Michael Chen, A. Pavan, N. V. Vinodchandran:
Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations. DISC 2023: 37:1-37:7
2022
[c52]
- view
  - electronic edition @ mlr.press (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/aistats/0001G0RV22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aistats/0001G0RV22
Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Vedant Raval, N. Variyam Vinodchandran:
Efficient interventional distribution learning in the PAC framework. AISTATS 2022: 7531-7549
[c51]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/esa/0001VM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/0001VM22
Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel:
Distinct Elements in Streams: An Algorithm for the (Text) Book. ESA 2022: 34:1-34:6
[c50]
- view
  authority control:
- export record
  dblp key:
  - conf/icse/Baranov0LMV22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icse/Baranov0LMV22
Eduard Baranov, Sourav Chakraborty, Axel Legay, Kuldeep S. Meel, N. Variyam Vinodchandran:
A Scalable t-wise Coverage Estimator. ICSE 2022: 36-47
[c49]
- view
  authority control:
- export record
  dblp key:
  - conf/pods/Meel0V22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pods/Meel0V22
Kuldeep S. Meel, Sourav Chakraborty, N. V. Vinodchandran:
Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size. PODS 2022: 41-52
[c48]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/0002PWV22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/0002PWV22
Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran:
Pseudodeterminism: promises and lowerbounds. STOC 2022: 1552-1565
2021
[c47]
- view
  - electronic edition @ mlr.press (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/alt/0001G0V21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alt/0001G0V21
Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, N. V. Vinodchandran:
Testing Product Distributions: A Closer Look. ALT 2021: 367-396
[c46]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/innovations/00020V21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/innovations/00020V21
Peter Dixon, A. Pavan, N. V. Vinodchandran:
Complete Problems for Multi-Pseudodeterministic Computations. ITCS 2021: 66:1-66:16
[c45]
- view
  authority control:
- export record
  dblp key:
  - conf/pods/MeelV021
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pods/MeelV021
Kuldeep S. Meel, N. V. Vinodchandran, Sourav Chakraborty:
Estimating the Size of Union of Sets in Streaming Models. PODS 2021: 126-137
[c44]
- view
  authority control:
- export record
  dblp key:
  - conf/pods/PavanVBM21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pods/PavanVBM21
Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting meets F₀ Estimation. PODS 2021: 299-311
[c43]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/0001GPV21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/0001GPV21
Arnab Bhattacharyya, Sutanu Gayen, Eric Price, N. V. Vinodchandran:
Near-optimal learning of tree-structured distributions by Chow-Liu. STOC 2021: 147-160
2020
[c42]
- view
  - electronic edition @ mlr.press (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/icml/0001G0MV20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/0001G0MV20
Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Ashwin Maran, N. Variyam Vinodchandran:
Learning and Sampling of Atomic Interventions from Observations. ICML 2020: 842-853
[c41]
- view
  - electronic edition @ neurips.cc (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/nips/0001GMV20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/0001GMV20
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, N. V. Vinodchandran:
Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning. NeurIPS 2020
[c40]
- view
  authority control:
- export record
  dblp key:
  - conf/tcc/0002GPV20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tcc/0002GPV20
Peter Dixon, Sutanu Gayen, Aduri Pavan, N. V. Vinodchandran:
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. TCC (1) 2020: 684-704
2018
[c39]
- view
  authority control:
- export record
  dblp key:
  - conf/bcb/BeheraGDV18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bcb/BeheraGDV18
Sairam Behera, Sutanu Gayen, Jitender S. Deogun, N. V. Vinodchandran:
KmerEstimate: A Streaming Algorithm for Estimating k-mer Counts with Optimal Space Usage. BCB 2018: 438-447
[c38]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/mfcs/DixonPV18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/DixonPV18
Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
On Pseudodeterministic Approximation Algorithms. MFCS 2018: 61:1-61:11
[c37]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/swat/GayenV18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/swat/GayenV18
Sutanu Gayen, N. V. Vinodchandran:
New Algorithms for Distributed Sliding Windows. SWAT 2018: 22:1-22:15
2017
[c36]
- view
  authority control:
- export record
  dblp key:
  - conf/bhi/SpanglerVSG17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bhi/SpanglerVSG17
Taylor Spangler, N. V. Vinodchandran, Ashok Samal, Jordan R. Green:
Fractal features for automatic detection of dysarthria. BHI 2017: 437-440
2016
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/bigdataconf/PavanQSVS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bigdataconf/PavanQSVS16
Aduri Pavan, Paul Quint, Stephen D. Scott, N. V. Vinodchandran, J. Smith:
Computing triangle and open-wedge heavy-hitters in large networks. IEEE BigData 2016: 998-1005
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/GayenV16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/GayenV16
Sutanu Gayen, N. V. Vinodchandran:
Algorithms for k-median Clustering over Distributed Streams. COCOON 2016: 535-546
[c33]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/mfcs/DixonMPV16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/DixonMPV16
Peter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran:
A Note on the Advice Complexity of Multipass Randomized Logspace. MFCS 2016: 31:1-31:7
[c32]
- view
  authority control:
- export record
  dblp key:
  - conf/sdm/QuintSVW16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sdm/QuintSVW16
Paul Quint, Stephen D. Scott, N. V. Vinodchandran, Bradley Worley:
Constrained Group Testing to Predict Binding Response of Candidate Compounds. SDM 2016: 756-764
[c31]
- view
  authority control:
- export record
  dblp key:
  - conf/sigsoft/CohenPV16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigsoft/CohenPV16
Myra B. Cohen, Aduri Pavan, N. V. Vinodchandran:
Budgeted testing through an algorithmic lens. SIGSOFT FSE 2016: 948-951
2015
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/mfcs/BravermanLSVY15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/BravermanLSVY15
Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang:
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. MFCS (2) 2015: 151-162
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/mfcs/MandalPV15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/MandalPV15
Debasis Mandal, Aduri Pavan, N. V. Vinodchandran:
On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape. MFCS (2) 2015: 459-471
2014
[c28]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/fsttcs/ChakrabortyPTVY14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/ChakrabortyPTVY14
Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran, Lin F. Yang:
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. FSTTCS 2014: 585-595
2013
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/ImaiNPVW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/ImaiNPVW13
Tatsuya Imai, Kotaro Nakagawa, Aduri Pavan, N. V. Vinodchandran, Osamu Watanabe:
An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability. CCC 2013: 277-286
2012
[c26]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/StoleeV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/StoleeV12
Derrick Stolee, N. V. Vinodchandran:
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. CCC 2012: 326-333
2011
[c25]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/GarvinSTV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/GarvinSTV11
Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
ReachFewL = ReachUL. COCOON 2011: 252-258
[c24]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/stacs/DattaKTV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/DattaKTV11
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran:
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS 2011: 579-590
2010
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/StoleeBV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/StoleeBV10
Derrick Stolee, Chris Bourke, N. V. Vinodchandran:
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. CCC 2010: 131-138
2009
[c22]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/fsttcs/HitchcockPV09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/HitchcockPV09
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Kolmogorov Complexity in Randomness Extraction. FSTTCS 2009: 215-226
2007
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/BourkeTV07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/BourkeTV07
Chris Bourke, Raghunath Tewari, N. V. Vinodchandran:
Directed Planar Reachability is in Unambiguous Log-Space. CCC 2007: 217-221
2006
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/fsttcs/PavanSV06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/PavanSV06
Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran:
Some Results on Average-Case Hardness Within the Polynomial Hierarchy. FSTTCS 2006: 188-199
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/FortnowHPVW06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/FortnowHPVW06
Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang:
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. ICALP (1) 2006: 335-345
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/icc/DeshpandeTBRZV06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icc/DeshpandeTBRZV06
Sarang Deshpande, Ajay Kumar Todimala, Ravi K. Balachandran, Byrav Ramamurthy, Xukai Zou, N. V. Vinodchandran:
A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks. ICC 2006: 2310-2315
2005
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/broadnets/TodimalaRV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/broadnets/TodimalaRV05
Ajay Kumar Todimala, Byrav Ramamurthy, N. V. Vinodchandran:
On computing disjoint paths with dependent cost structure in optical networks. BROADNETS 2005: 155-166
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/fct/PavanV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/PavanV05
Aduri Pavan, N. V. Vinodchandran:
Relations Between Average-Case and Worst-Case Complexity. FCT 2005: 422-432
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/icc/BalachandranRZV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icc/BalachandranRZV05
Ravi K. Balachandran, Byrav Ramamurthy, Xukai Zou, N. Variyam Vinodchandran:
CRTDH: an efficient key agreement scheme for secure group communications in wireless ad hoc networks. ICC 2005: 1123-1127
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/icccn/HaoVRZ05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icccn/HaoVRZ05
Geng Hao, N. V. Vinodchandran, Byrav Ramamurthy, Xukai Zou:
A balanced key tree approach for dynamic secure group communication. ICCCN 2005: 345-350
2004
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/HitchcockV04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/HitchcockV04
John M. Hitchcock, N. V. Vinodchandran:
Dimension, Entropy Rates, and Compression. CCC 2004: 174-183
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/HitchcockPV04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/HitchcockPV04
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Partial Bi-immunity and NP-Completeness. CCC 2004: 198-203
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/Vinodchandran04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/Vinodchandran04
N. V. Vinodchandran:
Learning DNFs and Circuits Using Teaching Assistants. COCOON 2004: 188-197
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/icml/TaoSVO04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/TaoSVO04
Qingping Tao, Stephen Donald Scott, N. V. Vinodchandran, Thomas Takeo Osugi:
SVM-based generalized multiple-instance learning via approximate box counting. ICML 2004
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/ictai/TaoSVOM04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ictai/TaoSVOM04
Qingping Tao, Stephen Scott, N. V. Vinodchandran, Thomas Takeo Osugi, Brandon Mueller:
An Extended Kernel for Generalized Multiple-Instance Learning. ICTAI 2004: 272-277
2003
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/fct/AntunesFV03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/AntunesFV03
Luis Antunes, Lance Fortnow, N. V. Vinodchandran:
Using Depth to Capture Average-Case Complexity. FCT 2003: 303-310
1999
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/MiltersenVW99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/MiltersenVW99
Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe:
Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. COCOON 1999: 210-220
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/MiltersenV99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/MiltersenV99
Peter Bro Miltersen, N. V. Vinodchandran:
Derandomizing Arthur-Merlin Games Using Hitting Sets. FOCS 1999: 71-80
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/isaac/ArvindSV99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/ArvindSV99
Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran:
The Query Complexity of Program Checking by Constant-Depth Circuits. ISAAC 1999: 123-132
1997
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/alt/ArvindV97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alt/ArvindV97
Vikraman Arvind, N. V. Vinodchandran:
Exact Learning via Teaching Assistants (Extended Abstract). ALT 1997: 291-306
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/fsttcs/Vinodchandran97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/Vinodchandran97
N. V. Vinodchandran:
Improved Lowness Results for Solvable Black-box Group Problems. FSTTCS 1997: 220-234
1996
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/alt/ArvindV96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alt/ArvindV96
Vikraman Arvind, N. V. Vinodchandran:
The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract). ALT 1996: 100-112
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/stacs/ArvindV96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/ArvindV96
Vikraman Arvind, N. V. Vinodchandran:
Solvable Black-Box Group Problems Are Low for PP. STACS 1996: 99-110

Informal and Other Publications

see FAQ

What is the meaning of the colors in the publication lists?

2024
[i39]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2405-07914
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2405-07914
Arnab Bhattacharyya, Sutanu Gayen, Philips George John, Sayantan Sen, N. V. Vinodchandran:
Distribution Learning Meets Graph Structure Sampling. CoRR abs/2405.07914 (2024)
[i38]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2405-08255
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2405-08255
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
Total Variation Distance for Product Distributions is #P-Complete. CoRR abs/2405.08255 (2024)
2023
[i37]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2301-10191
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2301-10191
Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel:
Distinct Elements in Streams: An Algorithm for the (Text) Book. CoRR abs/2301.10191 (2023)
[i36]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2302-12937
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2302-12937
Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya:
Constraint Optimization over Semirings. CoRR abs/2302.12937 (2023)
[i35]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2304-02240
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2304-02240
Peter Dixon, A. Pavan, Jason Vander Woude, N. V. Vinodchandran:
List and Certificate Complexities in Replicable Learning. CoRR abs/2304.02240 (2023)
[i34]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2304-04837
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2304-04837
Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran:
Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma. CoRR abs/2304.04837 (2023)
[i33]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2309-09134
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2309-09134
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
Total Variation Distance Estimation Is as Easy as Probabilistic Inference. CoRR abs/2309.09134 (2023)
[i32]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/0001GMM0V23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/0001GMM0V23
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran:
Total Variation Distance Estimation Is as Easy as Probabilistic Inference. Electron. Colloquium Comput. Complex. TR23 (2023)
2022
[i31]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2206-07209
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2206-07209
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, Aduri Pavan, N. V. Vinodchandran:
On Approximating Total Variation Distance. CoRR abs/2206.07209 (2022)
[i30]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2211-02694
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2211-02694
Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran:
Geometry of Rounding. CoRR abs/2211.02694 (2022)
[i29]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/Woude00RV22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/Woude00RV22
Jason Vander Woude, Peter Dixon, A. Pavan, Jamie Radcliffe, N. V. Vinodchandran:
The Geometry of Rounding. Electron. Colloquium Comput. Complex. TR22 (2022)
2021
[i28]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2103-08589
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2103-08589
Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
Promise Problems Meet Pseudodeterminism. CoRR abs/2103.08589 (2021)
[i27]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2105-00639
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2105-00639
Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting meets F0 Estimation. CoRR abs/2105.00639 (2021)
[i26]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2107-11712
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2107-11712
Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Vedant Raval, N. V. Vinodchandran:
Efficient inference of interventional distributions. CoRR abs/2107.11712 (2021)
[i25]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/DixonPV21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/DixonPV21
Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
Promise Problems Meet Pseudodeterminism. Electron. Colloquium Comput. Complex. TR21 (2021)
2020
[i24]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2002-04232
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2002-04232
Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Ashwin Maran, N. V. Vinodchandran:
Efficiently Learning and Sampling Interventional Distributions from Observations. CoRR abs/2002.04232 (2020)
[i23]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2002-05378
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2002-05378
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, N. V. Vinodchandran:
Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning. CoRR abs/2002.05378 (2020)
[i22]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2011-04144
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2011-04144
Arnab Bhattacharyya, Sutanu Gayen, Eric Price, N. V. Vinodchandran:
Near-Optimal Learning of Tree-Structured Distributions by Chow-Liu. CoRR abs/2011.04144 (2020)
[i21]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2012-14632
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2012-14632
Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, N. V. Vinodchandran:
Testing Product Distributions: A Closer Look. CoRR abs/2012.14632 (2020)
[i20]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/DixonGPV20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/DixonGPV20
Peter Dixon, Sutanu Gayen, A. Pavan, N. V. Vinodchandran:
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. IACR Cryptol. ePrint Arch. 2020: 768 (2020)
2019
[i19]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/AshidaINPVW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/AshidaINPVW19
Ryo Ashida, Tatsuya Imai, Kotaro Nakagawa, A. Pavan, N. V. Vinodchandran, Osamu Watanabe:
A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs. Electron. Colloquium Comput. Complex. TR19 (2019)
2014
[i18]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ChakrabortyPTVY14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ChakrabortyPTVY14
Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. Variyam Vinodchandran, Lin F. Yang:
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. Electron. Colloquium Comput. Complex. TR14 (2014)
[i17]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/Variyam14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/Variyam14
N. Variyam Vinodchandran:
Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs. Electron. Colloquium Comput. Complex. TR14 (2014)
2013
[i16]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1304-1005
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1304-1005
N. V. Vinodchandran, Marius Zimand:
On optimal language compression for sets in PSPACE/poly. CoRR abs/1304.1005 (2013)
2011
[i15]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/GarvinSTV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/GarvinSTV11
Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
ReachFewL = ReachUL. Electron. Colloquium Comput. Complex. TR11 (2011)
2010
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1001-2034
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1001-2034
Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran:
On the Power of Unambiguity in Logspace. CoRR abs/1001.2034 (2010)
[i13]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1004-5080
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1004-5080
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran:
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. CoRR abs/1004.5080 (2010)
[i12]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1010-5470
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1010-5470
Ricard Gavaldà, María López-Valdés, Elvira Mayordomo, N. V. Vinodchandran:
Resource-bounded Dimension in Computational Learning Theory. CoRR abs/1010.5470 (2010)
[i11]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/DattaKTV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/DattaKTV10
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran:
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. TR10 (2010)
[i10]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/PavanTV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/PavanTV10
Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran:
On the Power of Unambiguity in Logspace. Electron. Colloquium Comput. Complex. TR10 (2010)
[i9]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/StoleeV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/StoleeV10
Derrick Stolee, N. V. Vinodchandran:
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. Electron. Colloquium Comput. Complex. TR10 (2010)
[i8]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/TewariV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/TewariV10
Raghunath Tewari, N. V. Vinodchandran:
Green's Theorem and Isolation in Planar Graphs. Electron. Colloquium Comput. Complex. TR10 (2010)
2009
[i7]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/HitchcockPV09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/HitchcockPV09
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Kolmogorov Complexity in Randomness Extraction. Electron. Colloquium Comput. Complex. TR09 (2009)
[i6]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/StoleeSBV09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/StoleeSBV09
Derrick Stolee, Chris Bourke, N. V. Vinodchandran:
A log-space algorithm for reachability in planar DAGs with few sources. Electron. Colloquium Comput. Complex. TR09 (2009)
2005
[i5]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ECCC-TR05-062
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR05-062
Aduri Pavan, N. V. Vinodchandran:
2-Local Random Reductions to 3-Valued Functions. Electron. Colloquium Comput. Complex. TR05 (2005)
[i4]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ECCC-TR05-105
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR05-105
Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang:
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. Electron. Colloquium Comput. Complex. TR05 (2005)
2004
[i3]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ECCC-TR04-053
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR04-053
Aduri Pavan, N. V. Vinodchandran:
Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility. Electron. Colloquium Comput. Complex. TR04 (2004)
[i2]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ECCC-TR04-056
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR04-056
N. V. Vinodchandran:
A note on the circuit complexity of PP. Electron. Colloquium Comput. Complex. TR04 (2004)
1998
[i1]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ECCC-TR98-078
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR98-078
Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran:
The Query Complexity of Program Checking by Constant-Depth Circuits. Electron. Colloquium Comput. Complex. TR98 (1998)

Coauthor Index

see FAQ

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.