N. V. Vinodchandran

130 papers A* 15A 12B 10C 1Misc 4Journal 74Unranked 14

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Computational Explorations of Total Variation Distance. ICLR Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, Aduri Pavan, N. V. Vinodchandran
2025	J	`jnl`	Fast Rational Search via Stern-Brocot Tree. CoRR Connor Weyers, N. V. Vinodchandran
2025	J	`jnl`	List Replicable Reinforcement Learning. CoRR Bohan Zhang, Michael Chen, A. Pavan, N. V. Vinodchandran, Lin F. Yang, Ruosong Wang
2025	A*	`conf`	Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower Bounds. ICLR Michael Chen, Aduri Pavan, N. V. Vinodchandran, Ruosong Wang, Lin Yang
2025	J	`jnl`	Representation Obliviousness and Pseudodeterminism in Streaming Algorithms. Proc. ACM Manag. Data Michael Chen, Sourav Chakraborty, Aduri Pavan, N. V. Vinodchandran
2025	J	`jnl`	Total variation distance for product distributions is #P-complete. Inf. Process. Lett. Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2024	J	`jnl`	Computational Explorations of Total Variation Distance. CoRR Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2024	J	`jnl`	Distribution Learning Meets Graph Structure Sampling. CoRR Arnab Bhattacharyya, Sutanu Gayen, Philips George John, Sayantan Sen, N. V. Vinodchandran
2024	A	`conf`	Improved Streaming Algorithm for the Klee's Measure Problem and Generalizations. APPROX/RANDOM Mridul Nandi, N. V. Vinodchandran, Arijit Ghosh, Kuldeep S. Meel, Soumit Pal, Sourav Chakraborty
2024	J	`jnl`	On the Feasibility of Forgetting in Data Streams. Proc. ACM Manag. Data Aduri Pavan, Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel
2024	J	`jnl`	Point Prediction for Streaming Data. CoRR Aleena Chanda, N. V. Vinodchandran, Bertrand S. Clarke
2024	A*	`conf`	Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma. NeurIPS Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran
2024	A*	`conf`	Total Variation Distance Meets Probabilistic Inference. ICML Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2024	J	`jnl`	Total Variation Distance for Product Distributions is #P-Complete. CoRR Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2023	A	`conf`	Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations. DISC Michael Chen, A. Pavan, N. V. Vinodchandran
2023	A*	`conf`	Constraint Optimization over Semirings. AAAI Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya
2023	J	`jnl`	Constraint Optimization over Semirings. CoRR Aduri Pavan, Kuldeep S. Meel, N. V. Vinodchandran, Arnab Bhattacharyya
2023	J	`jnl`	Distinct Elements in Streams: An Algorithm for the (Text) Book. CoRR Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel
2023	J	`jnl`	Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma. CoRR Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran
2023	A*	`conf`	List and Certificate Complexities in Replicable Learning. NeurIPS Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran
2023	J	`jnl`	List and Certificate Complexities in Replicable Learning. CoRR Peter Dixon, A. Pavan, Jason Vander Woude, N. V. Vinodchandran
2023	J	`jnl`	Model Counting Meets Distinct Elements. Commun. ACM A. Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
2023	J	`jnl`	Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu. SIAM J. Comput. Arnab Bhattacharyya, Sutanu Gayen, Eric Price, Vincent Y. F. Tan, N. V. Vinodchandran
2023	A*	`conf`	On Approximating Total Variation Distance. IJCAI Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2023	J	`jnl`	Total Variation Distance Estimation Is as Easy as Probabilistic Inference. CoRR Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2023	J	`jnl`	Total Variation Distance Estimation Is as Easy as Probabilistic Inference. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2022	A	`conf`	Distinct Elements in Streams: An Algorithm for the (Text) Book. ESA Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel
2022	A*	`conf`	Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size. PODS Kuldeep S. Meel, Sourav Chakraborty, N. V. Vinodchandran
2022	J	`jnl`	Geometry of Rounding. CoRR Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran
2022	J	`jnl`	Model Counting Meets Distinct Elements in a Data Stream. SIGMOD Rec. Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
2022	J	`jnl`	On Approximating Total Variation Distance. CoRR Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, Aduri Pavan, N. V. Vinodchandran
2022	A*	`conf`	Pseudodeterminism: promises and lowerbounds. STOC Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran
2022	J	`jnl`	The Geometry of Rounding. Electron. Colloquium Comput. Complex. Jason Vander Woude, Peter Dixon, A. Pavan, Jamie Radcliffe, N. V. Vinodchandran
2021	A	`conf`	Complete Problems for Multi-Pseudodeterministic Computations. ITCS Peter Dixon, A. Pavan, N. V. Vinodchandran
2021	J	`jnl`	Efficient inference of interventional distributions. CoRR Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Vedant Raval, N. V. Vinodchandran
2021	A*	`conf`	Estimating the Size of Union of Sets in Streaming Models. PODS Kuldeep S. Meel, N. V. Vinodchandran, Sourav Chakraborty
2021	A*	`conf`	Model Counting meets F PODS Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
2021	J	`jnl`	Model Counting meets F0 Estimation. CoRR Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
2021	A*	`conf`	Near-optimal learning of tree-structured distributions by Chow-Liu. STOC Arnab Bhattacharyya, Sutanu Gayen, Eric Price, N. V. Vinodchandran
2021	J	`jnl`	Promise Problems Meet Pseudodeterminism. CoRR Peter Dixon, Aduri Pavan, N. V. Vinodchandran
2021	J	`jnl`	Promise Problems Meet Pseudodeterminism. Electron. Colloquium Comput. Complex. Peter Dixon, Aduri Pavan, N. V. Vinodchandran
2021	B	`conf`	Testing Product Distributions: A Closer Look. ALT Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, N. V. Vinodchandran
2020	A*	`conf`	Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning. NeurIPS Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, N. V. Vinodchandran
2020	J	`jnl`	Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning. CoRR Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, N. V. Vinodchandran
2020	J	`jnl`	Efficiently Learning and Sampling Interventional Distributions from Observations. CoRR Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Ashwin Maran, N. V. Vinodchandran
2020	J	`jnl`	Near-Optimal Learning of Tree-Structured Distributions by Chow-Liu. CoRR Arnab Bhattacharyya, Sutanu Gayen, Eric Price, N. V. Vinodchandran
2020	—	`conf`	Perfect Zero Knowledge: New Upperbounds and Relativized Separations. TCC (1) Peter Dixon, Sutanu Gayen, Aduri Pavan, N. V. Vinodchandran
2020	J	`jnl`	Perfect Zero Knowledge: New Upperbounds and Relativized Separations. IACR Cryptol. ePrint Arch. Peter Dixon, Sutanu Gayen, A. Pavan, N. V. Vinodchandran
2020	J	`jnl`	Testing Product Distributions: A Closer Look. CoRR Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, N. V. Vinodchandran
2019	J	`jnl`	A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs. Electron. Colloquium Comput. Complex. Ryo Ashida, Tatsuya Imai, Kotaro Nakagawa, A. Pavan, N. V. Vinodchandran, Osamu Watanabe
2018	—	`conf`	KmerEstimate: A Streaming Algorithm for Estimating k-mer Counts with Optimal Space Usage. BCB Sairam Behera, Sutanu Gayen, Jitender S. Deogun, N. V. Vinodchandran
2018	—	`conf`	New Algorithms for Distributed Sliding Windows. SWAT Sutanu Gayen, N. V. Vinodchandran
2018	J	`jnl`	New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. Algorithmica Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang
2018	B	`conf`	On Pseudodeterministic Approximation Algorithms. MFCS Peter Dixon, Aduri Pavan, N. V. Vinodchandran
2017	—	`conf`	Fractal features for automatic detection of dysarthria. BHI Taylor Spangler, N. V. Vinodchandran, Ashok Samal, Jordan R. Green
2016	B	`conf`	A Note on the Advice Complexity of Multipass Randomized Logspace. MFCS Peter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran
2016	Misc	`conf`	Algorithms for k-median Clustering over Distributed Streams. COCOON Sutanu Gayen, N. V. Vinodchandran
2016	—	`conf`	Budgeted testing through an algorithmic lens. SIGSOFT FSE Myra B. Cohen, Aduri Pavan, N. V. Vinodchandran
2016	—	`conf`	Computing triangle and open-wedge heavy-hitters in large networks. IEEE BigData Aduri Pavan, Paul Quint, Stephen D. Scott, N. V. Vinodchandran, J. Smith
2016	A	`conf`	Constrained Group Testing to Predict Binding Response of Candidate Compounds. SDM Paul Quint, Stephen D. Scott, N. V. Vinodchandran, Bradley Worley
2015	—	`conf`	New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. MFCS (2) Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang
2015	J	`jnl`	On Optimal Language Compression for Sets in PSPACE/poly. Theory Comput. Syst. N. V. Vinodchandran, Marius Zimand
2015	—	`conf`	On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape. MFCS (2) Debasis Mandal, Aduri Pavan, N. V. Vinodchandran
2014	—	`conf`	New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. FSTTCS Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran, Lin F. Yang
2014	J	`jnl`	ReachFewL = ReachUL. Comput. Complex. Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
2013	A	`conf`	An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability. CCC Tatsuya Imai, Kotaro Nakagawa, Aduri Pavan, N. V. Vinodchandran, Osamu Watanabe
2013	J	`jnl`	On optimal language compression for sets in PSPACE/poly CoRR N. V. Vinodchandran, Marius Zimand
2012	J	`jnl`	Green's theorem and isolation in planar graphs. Inf. Comput. Raghunath Tewari, N. V. Vinodchandran
2012	J	`jnl`	On the power of unambiguity in log-space. Comput. Complex. Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
2012	J	`jnl`	Space complexity of perfect matching in bounded genus bipartite graphs. J. Comput. Syst. Sci. Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
2012	A	`conf`	Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. CCC Derrick Stolee, N. V. Vinodchandran
2011	J	`jnl`	Extracting Kolmogorov complexity with applications to dimension zero-one laws. Inf. Comput. Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
2011	Misc	`conf`	ReachFewL = ReachUL. COCOON Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
2011	J	`jnl`	ReachFewL = ReachUL. Electron. Colloquium Comput. Complex. Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
2010	A	`conf`	A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. CCC Derrick Stolee, Chris Bourke, N. V. Vinodchandran
2010	J	`jnl`	Green's Theorem and Isolation in Planar Graphs. Electron. Colloquium Comput. Complex. Raghunath Tewari, N. V. Vinodchandran
2010	J	`jnl`	On the Power of Unambiguity in Logspace CoRR Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
2010	J	`jnl`	On the Power of Unambiguity in Logspace. Electron. Colloquium Comput. Complex. Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran
2010	J	`jnl`	Resource-bounded Dimension in Computational Learning Theory CoRR Ricard Gavaldà, María López-Valdés, Elvira Mayordomo, N. V. Vinodchandran
2010	J	`jnl`	Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs CoRR Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
2010	J	`jnl`	Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
2010	J	`jnl`	Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. Electron. Colloquium Comput. Complex. Derrick Stolee, N. V. Vinodchandran
2009	J	`jnl`	A log-space algorithm for reachability in planar DAGs with few sources. Electron. Colloquium Comput. Complex. Derrick Stolee, Chris Bourke, N. V. Vinodchandran
2009	J	`jnl`	Directed Planar Reachability Is in Unambiguous Log-Space. ACM Trans. Comput. Theory Chris Bourke, Raghunath Tewari, N. V. Vinodchandran
2009	—	`conf`	Kolmogorov Complexity in Randomness Extraction. FSTTCS John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
2009	J	`jnl`	Kolmogorov Complexity in Randomness Extraction. Electron. Colloquium Comput. Complex. John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
2008	J	`jnl`	2-Local Random Reductions to 3-Valued Functions. Comput. Complex. Aduri Pavan, N. V. Vinodchandran
2008	J	`jnl`	Kernels for Generalized Multiple-Instance Learning. IEEE Trans. Pattern Anal. Mach. Intell. Qingping Tao, Stephen D. Scott, N. V. Vinodchandran, Thomas Takeo Osugi, Brandon Mueller
2008	J	`jnl`	On reoptimizing multi-class classifiers. Mach. Learn. Chris Bourke, Kun Deng, Stephen D. Scott, Robert E. Schapire, N. V. Vinodchandran
2008	J	`jnl`	Partial Bi-immunity, Scaled Dimension, and NP-Completeness. Theory Comput. Syst. John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
2008	J	`jnl`	Relations between Average-Case and Worst-Case Complexity. Theory Comput. Syst. Aduri Pavan, N. V. Vinodchandran
2007	A	`conf`	Directed Planar Reachability is in Unambiguous Log-Space. CCC Chris Bourke, Raghunath Tewari, N. V. Vinodchandran
2007	J	`jnl`	Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theor. Comput. Sci. Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran
2006	—	`conf`	A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks. ICC Sarang Deshpande, Ajay Kumar Todimala, Ravi K. Balachandran, Byrav Ramamurthy, Xukai Zou, N. V. Vinodchandran
2006	J	`jnl`	Computational depth: Concept and applications. Theor. Comput. Sci. Luis Antunes, Lance Fortnow, Dieter van Melkebeek, N. V. Vinodchandran
2006	J	`jnl`	Dimension, entropy rates, and compression. J. Comput. Syst. Sci. John M. Hitchcock, N. V. Vinodchandran
2006	—	`conf`	Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. ICALP (1) Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
2006	—	`conf`	Some Results on Average-Case Hardness Within the Polynomial Hierarchy. FSTTCS Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran
2005	J	`jnl`	2-Local Random Reductions to 3-Valued Functions Electron. Colloquium Comput. Complex. Aduri Pavan, N. V. Vinodchandran
2005	B	`conf`	A balanced key tree approach for dynamic secure group communication. ICCCN Geng Hao, N. V. Vinodchandran, Byrav Ramamurthy, Xukai Zou
2005	J	`jnl`	A note on the circuit complexity of PP. Theor. Comput. Sci. N. V. Vinodchandran
2005	J	`jnl`	Derandomizing Arthur-Merlin Games using Hitting Sets. Comput. Complex. Peter Bro Miltersen, N. V. Vinodchandran
2005	J	`jnl`	Entropy rates and finite-state dimension. Theor. Comput. Sci. Chris Bourke, John M. Hitchcock, N. V. Vinodchandran
2005	J	`jnl`	Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws Electron. Colloquium Comput. Complex. Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang
2005	C	`conf`	On computing disjoint paths with dependent cost structure in optical networks. BROADNETS Ajay Kumar Todimala, Byrav Ramamurthy, N. V. Vinodchandran
2005	B	`conf`	Relations Between Average-Case and Worst-Case Complexity. FCT Aduri Pavan, N. V. Vinodchandran
2004	J	`jnl`	A note on the circuit complexity of PP Electron. Colloquium Comput. Complex. N. V. Vinodchandran
2004	J	`jnl`	AM Inf. Process. Lett. N. V. Vinodchandran
2004	B	`conf`	An Extended Kernel for Generalized Multiple-Instance Learning. ICTAI Qingping Tao, Stephen Scott, N. V. Vinodchandran, Thomas Takeo Osugi, Brandon Mueller
2004	J	`jnl`	Counting Complexity of Solvable Black-Box Group Problems. SIAM J. Comput. N. V. Vinodchandran
2004	A	`conf`	Dimension, Entropy Rates, and Compression. CCC John M. Hitchcock, N. V. Vinodchandran
2004	Misc	`conf`	Learning DNFs and Circuits Using Teaching Assistants. COCOON N. V. Vinodchandran
2004	A	`conf`	Partial Bi-immunity and NP-Completeness. CCC John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
2004	J	`jnl`	Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility Electron. Colloquium Comput. Complex. Aduri Pavan, N. V. Vinodchandran
2004	A*	`conf`	SVM-based generalized multiple-instance learning via approximate box counting. ICML Qingping Tao, Stephen Donald Scott, N. V. Vinodchandran, Thomas Takeo Osugi
2003	B	`conf`	Using Depth to Capture Average-Case Complexity. FCT Luis Antunes, Lance Fortnow, N. V. Vinodchandran
2002	J	`jnl`	The Query Complexity of Program Checking by Constant-Depth Circuits. Chic. J. Theor. Comput. Sci. Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran
2000	J	`jnl`	Exact learning via teaching assistants. Theor. Comput. Sci. Vikraman Arvind, N. V. Vinodchandran
2000	J	`jnl`	The counting complexity of group-definable languages. Theor. Comput. Sci. Vikraman Arvind, N. V. Vinodchandran
1999	A*	`conf`	Derandomizing Arthur-Merlin Games Using Hitting Sets. FOCS Peter Bro Miltersen, N. V. Vinodchandran
1999	Misc	`conf`	Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. COCOON Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe
1999	B	`conf`	The Query Complexity of Program Checking by Constant-Depth Circuits. ISAAC Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran
1998	J	`jnl`	The Query Complexity of Program Checking by Constant-Depth Circuits Electron. Colloquium Comput. Complex. Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran
1997	B	`conf`	Exact Learning via Teaching Assistants (Extended Abstract). ALT Vikraman Arvind, N. V. Vinodchandran
1997	—	`conf`	Improved Lowness Results for Solvable Black-box Group Problems. FSTTCS N. V. Vinodchandran
1997	J	`jnl`	Solvable Black-Box Group Problems are Low for PP. Theor. Comput. Sci. Vikraman Arvind, N. V. Vinodchandran
1996	A	`conf`	Solvable Black-Box Group Problems Are Low for PP. STACS Vikraman Arvind, N. V. Vinodchandran
1996	B	`conf`	The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract). ALT Vikraman Arvind, N. V. Vinodchandran
1995	J	`jnl`	A Note on Mod and Generalised Mod Classes. Inf. Process. Lett. Meena Mahajan, N. V. Vinodchandran
1994	J	`jnl`	A Note on SpanP Functions. Inf. Process. Lett. Meena Mahajan, Thomas Thierauf, N. V. Vinodchandran