Search

Your search keyword '"Venkatesan T"' showing total 141 results
Start Over Author "Venkatesan T" Publisher springer science and business media llc
141 results on '"Venkatesan T"'

2. Decision trees within a molecular memristor

Author

Goswami, Sreetosh, primary, Pramanick, Rajib, additional, Patra, Abhijeet, additional, Rath, Santi Prasad, additional, Foltin, Martin, additional, Ariando, A., additional, Thompson, Damien, additional, Venkatesan, T., additional, Goswami, Sreebrata, additional, and Williams, R. Stanley, additional

Published
2021
Full Text
View/download PDF

4. Set Cover Problems with Small Neighborhood Covers

Author

Yogish Sabharwal, Archita Agarwal, Sambudha Roy, Venkatesan T. Chakaravarthy, and Anamitra R. Choudhury

Subjects
Class (set theory), Theoretical computer science, Property (programming), Computer science, Vertex cover, Set cover problem, 0102 computer and information sciences, 02 engineering and technology, Interval (mathematics), 01 natural sciences, Theoretical Computer Science, Computational Theory and Mathematics, 010201 computation theory & mathematics, Distributed algorithm, Theory of computation, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Cover (algebra)
Abstract

In this paper, we study a class of set cover problems that satisfy a special property which we call the small neighborhood cover property. This class encompasses several well-studied problems including vertex cover, interval cover, bag interval cover and tree cover. We design unified sequential, parallel and distributed algorithms that can handle any set cover problem falling under the above framework and yield constant factor approximations. The algorithms run in NC in the parallel setting and can be executed in polylogarithmic communication rounds in the distributed setting.

Published
2018
Full Text
View/download PDF

5. Reversible hydrogen control of antiferromagnetic anisotropy in α-Fe2O3

Author

Jani, Hariom, primary, Linghu, Jiajun, additional, Hooda, Sonu, additional, Chopdekar, Rajesh V., additional, Li, Changjian, additional, Omar, Ganesh Ji, additional, Prakash, Saurav, additional, Du, Yonghua, additional, Yang, Ping, additional, Banas, Agnieszka, additional, Banas, Krzysztof, additional, Ghosh, Siddhartha, additional, Ojha, Sunil, additional, Umapathy, G. R., additional, Kanjilal, Dinakar, additional, Ariando, A., additional, Pennycook, Stephen J., additional, Arenholz, Elke, additional, Radaelli, Paolo G., additional, Coey, J. M. D., additional, Feng, Yuan Ping, additional, and Venkatesan, T., additional

Published
2021
Full Text
View/download PDF

6. Antiferromagnetic half-skyrmions and bimerons at room temperature

Author

Jani, Hariom, primary, Lin, Jheng-Cyuan, additional, Chen, Jiahao, additional, Harrison, Jack, additional, Maccherozzi, Francesco, additional, Schad, Jonathon, additional, Prakash, Saurav, additional, Eom, Chang-Beom, additional, Ariando, A., additional, Venkatesan, T., additional, and Radaelli, Paolo G., additional

Published
2021
Full Text
View/download PDF

7. Photoinduced metastable dd-exciton-driven metal-insulator transitions in quasi-one-dimensional transition metal oxides

Author

Asmara, Teguh Citra, primary, Lichtenberg, Frank, additional, Biebl, Florian, additional, Zhu, Tao, additional, Das, Pranab Kumar, additional, Naradipa, Muhammad Avicenna, additional, Fauzi, Angga Dito, additional, Diao, Caozheng, additional, Yang, Ping, additional, Lenzen, Philipp, additional, Buchenau, Sören, additional, Grimm-Lebsanft, Benjamin, additional, Wan, Dongyang, additional, Trevisanutto, Paolo E., additional, Breese, Mark B. H., additional, Venkatesan, T., additional, Rübhausen, Michael, additional, and Rusydi, Andrivo, additional

Published
2020
Full Text
View/download PDF

9. Engineering covalently bonded 2D layered materials by self-intercalation

Author

Zhao, Xiaoxu, primary, Song, Peng, additional, Wang, Chengcai, additional, Riis-Jensen, Anders C., additional, Fu, Wei, additional, Deng, Ya, additional, Wan, Dongyang, additional, Kang, Lixing, additional, Ning, Shoucong, additional, Dan, Jiadong, additional, Venkatesan, T., additional, Liu, Zheng, additional, Zhou, Wu, additional, Thygesen, Kristian S., additional, Luo, Xin, additional, Pennycook, Stephen J., additional, and Loh, Kian Ping, additional

Published
2020
Full Text
View/download PDF

10. Charge disproportionate molecular redox for discrete memristive and memcapacitive switching

Author

Goswami, Sreetosh, primary, Rath, Santi P., additional, Thompson, Damien, additional, Hedström, Svante, additional, Annamalai, Meenakshi, additional, Pramanick, Rajib, additional, Ilic, B. Robert, additional, Sarkar, Soumya, additional, Hooda, Sonu, additional, Nijhuis, Christian A., additional, Martin, Jens, additional, Williams, R. Stanley, additional, Goswami, Sreebrata, additional, and Venkatesan, T., additional

Published
2020
Full Text
View/download PDF

11. Improved algorithms for resource allocation under varying capacity

Author

Sambuddha Roy, Yogish Sabharwal, Anamitra R. Choudhury, Venkatesan T. Chakaravarthy, and Shalmoli Gupta

Subjects
Mathematical optimization, Supply chain management, Computer science, General Engineering, Approximation algorithm, 0102 computer and information sciences, 02 engineering and technology, Management Science and Operations Research, 01 natural sciences, Profit (economics), Running time, Scheduling (computing), 010201 computation theory & mathematics, Artificial Intelligence, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Algorithm, Software
Abstract

We consider the problem of scheduling a set of jobs on a system that offers certain resource, wherein the amount of resource offered varies over time. For each job, the input specifies a set of possible scheduling instances, where each instance is given by starting time, ending time, profit and resource requirement. A feasible solution selects a subset of job instances such that at any timeslot, the total requirement by the chosen instances does not exceed the resource available at that timeslot, and at most one instance is chosen for each job. The above problem falls under the well-studied framework of unsplittable flow problem (UFP) on line. The generalized notion of scheduling possibilities captures the standard setting concerned with release times and deadlines. We present improved algorithms based on the primal-dual paradigm, where the improvements are in terms of approximation ratio, running time and simplicity.

Published
2017
Full Text
View/download PDF

12. Artificial two-dimensional polar metal by charge transfer to a ferroelectric insulator

Author

Zhou, W. X., primary, Wu, H. J., additional, Zhou, J., additional, Zeng, S. W., additional, Li, C. J., additional, Li, M. S., additional, Guo, R., additional, Xiao, J. X., additional, Huang, Z., additional, Lv, W. M., additional, Han, K., additional, Yang, P., additional, Li, C. G., additional, Lim, Z. S., additional, Wang, H., additional, Zhang, Y., additional, Chua, S. J., additional, Zeng, K. Y., additional, Venkatesan, T., additional, Chen, J. S., additional, Feng, Y. P., additional, Pennycook, S. J., additional, and Ariando, A., additional

Published
2019
Full Text
View/download PDF

13. Direct observation of room-temperature out-of-plane ferroelectricity and tunneling electroresistance at the two-dimensional limit

Author

Wang, H., primary, Liu, Z. R., additional, Yoong, H. Y., additional, Paudel, T. R., additional, Xiao, J. X., additional, Guo, R., additional, Lin, W. N., additional, Yang, P., additional, Wang, J., additional, Chow, G. M., additional, Venkatesan, T., additional, Tsymbal, E. Y., additional, Tian, H., additional, and Chen, J. S., additional

Published
2018
Full Text
View/download PDF

16. Erratum: Corrigendum: Robust resistive memory devices using solution-processable metal-coordinated azo aromatics

Author

Goswami, Sreetosh, primary, Matula, Adam J., additional, Rath, Santi P., additional, Hedström, Svante, additional, Saha, Surajit, additional, Annamalai, Meenakshi, additional, Sengupta, Debabrata, additional, Patra, Abhijeet, additional, Ghosh, Siddhartha, additional, Jani, Hariom, additional, Sarkar, Soumya, additional, Motapothula, Mallikarjuna Rao, additional, Nijhuis, Christian A., additional, Martin, Jens, additional, Goswami, Sreebrata, additional, Batista, Victor S., additional, and Venkatesan, T., additional

Published
2018
Full Text
View/download PDF

17. Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem

Author

Yogish Sabharwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, and Vijay K. Garg

Subjects
Constant (computer programming), Computational Theory and Mathematics, Counting problem, Degree (graph theory), Computer science, Distributed computing, Failure probability, Theory of computation, Graph (abstract data type), Tree (graph theory), Algorithm, Theoretical Computer Science, Randomized algorithm
Abstract

Consider a distributed system with n processors, in which each processor receives some triggers from an external source. The distributed trigger counting (DTC) problem is to raise an alert and report to a user when the number of triggers received by the system reaches w, where w is a user-specified input. The problem has applications in monitoring, global snapshots, synchronizers and other distributed settings. In this paper, we first present a randomized and decentralized algorithm for the DTC problem with message complexity O(nlognlogw); furthermore, with high probability, no processor receives more than O(lognlogw) messages. Building on the ideas of this algorithm, we develop an improved algorithm having message complexity O(nlogw); furthermore, with high probability, no processor receives more than O(log w) messages. However, neither of the two algorithms provide any bound on the messages sent per processors. These algorithm assume complete connectivity between the processors. Next, we present a third algorithm having message complexity O(nlognlogw), wherein no processor exchanges more than O(lognlogw) messages with high probability; however, there is a negligible failure probability in raising the alert on receiving w triggers. This algorithm only requires that a constant degree tree be embeddable in the underlying communication graph.

Published
2012
Full Text
View/download PDF

18. Arthur and Merlin as Oracles

Author

Venkatesan T. Chakaravarthy and Sambuddha Roy

Subjects
Polynomial (hyperelastic model), Discrete mathematics, Computational complexity theory, Generator (category theory), Karp–Lipton theorem, General Mathematics, Boolean circuit, Theoretical Computer Science, Membership testing, Combinatorics, Computational Mathematics, Computational Theory and Mathematics, Time complexity, Mathematics
Abstract

We study some problems solvable in deterministic polynomial time given oracle access to the (promise version of) Arthur–Merlin class. Our main results are the following: $$\circ\quad{\rm BPP}^{{\rm NP}}_{||} \subseteq {{\rm P}^{{{\rm pr}{\rm AM}}}_{||}}.$$ $$\circ\quad{{\rm S}_2^p} \subseteq {{\rm P}^{{{\rm pr}{\rm AM}}}}.$$ In addition to providing new upper bounds for the classes $${{{\rm S}_2^p}}$$ and $${{\rm BPP}^{{\rm NP}}_{||}}$$, these results are interesting from a derandomization perspective. In conjunction with the hitting set generator construction of Miltersen and Vinodchandran (Computational Complexity 14(3), 2005), we get that $${{{\rm S}_2^p} = {{\rm P}^{\rm NP}}}$$ and $${{\rm BPP}^{{\rm NP}}_{||} = {\rm P}^{{\rm NP}}_{||}}$$, under the hardness hypothesis associated with derandomizing the class AM. This gives an alternative proof of the same result obtained by Shaltiel and Umans (Computational Complexity 15(4), 2007). We also show that if NP has polynomial size circuits, then the polynomial time hierarchy (PH) collapses as PH = PprMA. Under the same hypothesis, we also derive a FPprMA algorithm for learning circuits for SAT; this improves the ZPPNP algorithm for the same problem by Bshouty et al. (JCSS 52(3), 1996). Finally, we design a FPprAM algorithm for the problem of finding near-optimal strategies for succinctly presented zero-sum games. For the same problem, Fortnow et al. (Computational Complexity 17(3), 2008a) described a ZPPNP algorithm. One advantage of our FPprAM algorithm is that it can be derandomized using the construction of Miltersen and Vinodchandran yielding a FPNP algorithm, under a hardness hypothesis used for derandomizing AM.

Published
2011
Full Text
View/download PDF

19. Robust resistive memory devices using solution-processable metal-coordinated azo aromatics

Author

Goswami, Sreetosh, primary, Matula, Adam J., additional, Rath, Santi P., additional, Hedström, Svante, additional, Saha, Surajit, additional, Annamalai, Meenakshi, additional, Sengupta, Debabrata, additional, Patra, Abhijeet, additional, Ghosh, Siddhartha, additional, Jani, Hariom, additional, Sarkar, Soumya, additional, Motapothula, Mallikarjuna Rao, additional, Nijhuis, Christian A., additional, Martin, Jens, additional, Goswami, Sreebrata, additional, Batista, Victor S., additional, and Venkatesan, T., additional

Published
2017
Full Text
View/download PDF

20. Tunable and low-loss correlated plasmons in Mott-like insulating oxides

Author

Asmara, Teguh Citra, primary, Wan, Dongyang, additional, Zhao, Yongliang, additional, Majidi, Muhammad Aziz, additional, Nelson, Christopher T., additional, Scott, Mary C., additional, Cai, Yao, additional, Yan, Bixing, additional, Schmidt, Daniel, additional, Yang, Ming, additional, Zhu, Tao, additional, Trevisanutto, Paolo E., additional, Motapothula, Mallikarjuna R., additional, Feng, Yuan Ping, additional, Breese, Mark B. H., additional, Sherburne, Matthew, additional, Asta, Mark, additional, Minor, Andrew, additional, Venkatesan, T., additional, and Rusydi, Andrivo, additional

Published
2017
Full Text
View/download PDF

22. On zero error algorithms having oracle access to one query

Author

Jin-Yi Cai and Venkatesan T. Chakaravarthy

Subjects
Discrete mathematics, Control and Optimization, Computational Theory and Mathematics, Applied Mathematics, Random string, Discrete Mathematics and Combinatorics, Algorithm, Computer Science Applications, Mathematics, Zero error
Abstract

It is known that $${\rm S}_{2}^{p} \subseteq {\rm ZPP}^{NP}$$ (Cai, 2001). The reverse direction of whether ZPPNP is contained in $${\rm S}_{2}^{p}$$ remains open. We show that if the zero-error algorithm is allowed to ask only one query to the NP oracle (for any input and random string), then it can be simulated in $${\rm S}_{2}^{p}$$ . That is, we prove that $${\rm S}_{2}^{p}$$ . Next we consider whether the above result can be improved as $${\rm ZPP}^{NP[1]} \subseteq {\rm P}^{NP}$$ and point out a difficulty in doing so. Via a simple proof, we observe that BPP ⊆ ZPPNP[1] (a result implicitly proven in some prior work). Thus, achieving the above improvement would imply BPP ⊆ PNP, settling a long standing open problem. We then argue that the above mentioned improvement can be obtained for the next level of the polynomial time hierarchy. Namely, we prove that $${\rm ZPP}^{\Sigma_{2}^{p}[1]} \subseteq {\rm P}^{\Sigma_{2}^{p}[2]}$$ . On the other hand, by adapting our proof of our main result it can be shown that $${\rm ZPP}^{\Sigma_{2}^{p}[1]} \subseteq {\rm S}_{2}^{\rm NP[1]}$$ . For the purpose of comparing these two results, we prove that $${\rm P}^{\Sigma_{2}^{p}} \subseteq {\rm S}_{2}^{\rm NP[1]}$$ . We conclude by observing that the above claims extend to the higher levels of the hierarchy: for k ≥ 2, $${\rm ZPP}^{\Sigma_{k}^{p}[1]} \subseteq {\rm P}^{\Sigma_{k}^{p}[2]}$$ and $${\rm P}^{\Sigma_{k}^{p}} \subseteq {\rm S}_{2}^{\Sigma_{k-1}^{p}[1]}$$ .

Published
2006
Full Text
View/download PDF

23. Time-Space Tradeoff in Derandomizing Probabilistic Logspace

Author

Dieter van Melkebeek, Venkatesan T. Chakaravarthy, and Jin-Yi Cai

Subjects
Discrete mathematics, Combinatorics, Computational Theory and Mathematics, Time space, Deterministic algorithm, Deterministic simulation, Theory of computation, Probabilistic logic, Space (mathematics), Time complexity, Logarithmic space, Theoretical Computer Science, Mathematics
Abstract

Nisan [6] showed that any randomized logarithmic space algorithm (running in polynomial time and with two-sided error) can be simulated by a deterministic algorithm that runs simultaneously in polynomial time and Θ(log2 n) space. Subsequently Saks and Zhou [9] improved the space complexity and showed that a deterministic simulation can be carried out in space Θ(log1.5 n). However, their simulation runs in time \(n^{\Theta({\rm log}^{0.5} n)}\). We prove a time-space tradeoff that interpolates these two simulations. Specifically, we prove that, for any 0≤ α ≤ 0.5, any randomized logarithmic space algorithm (running in polynomial time and with two-sided error) can be simulated deterministically in time \(n^{O(log^{0.5-\alpha}n)}\) and space O(log 1.5 + α n). That is, we prove that BPL ⊆ DTISP[\(n^{O(log^{0.5-\alpha}n)}\), O(log 1.5 + α n)].

Published
2005
Full Text
View/download PDF

24. On the non-approximability of points-to analysis

Author

Susan Horwitz and Venkatesan T. Chakaravarthy

Subjects
Computer Networks and Communications, Computer science, C dynamic memory allocation, Expression (computer science), computer.software_genre, Hamiltonian path, Set (abstract data type), Constant factor, symbols.namesake, Theory of computation, symbols, Compiler, Pointer analysis, computer, Algorithm, Software, Information Systems
Abstract

Determining points-to sets is an important static-analysis problem. Most of the classic static analyses (used e.g., by compilers or in programming environments) rely on knowing which variables might be used or defined by each expression in a program. In the presence of pointers, the use/def set of an expression like *p = *q can only be determined given (safe) points-to sets for p and q. Previous work has shown that both precise flow-sensitive and precise flow-insensitive pointer analysis is NP-Hard, even when restricted to single-procedure programs with no dynamic memory allocation. In this paper, we show that it is not even possible to compute good approximations to the precise solutions (i.e., to compute points-to sets whose sizes are within a constant factor of the sizes of the precise points-to sets) unless P=NP.

Published
2002
Full Text
View/download PDF

25. Origin and Quenching of Novel ultraviolet and blue emission in NdGaO3: Concept of Super-Hydrogenic Dopants

Author

Ghosh, Siddhartha, primary, Saha, Surajit, additional, Liu, Zhiqi, additional, Motapothula, M., additional, Patra, Abhijeet, additional, Yakovlev, Nikolai, additional, Cai, Yao, additional, Prakash, Saurav, additional, Huang, Xiao Hu, additional, Tay, Chuan Beng, additional, Cong, Chun Xiao, additional, Bhatt, Thirumaleshwara, additional, Dolmanan, Surani B., additional, Chen, Jianqiang, additional, Lü, Weiming, additional, Huang, Zhen, additional, Tripathy, Sudhiranjan, additional, Chua, Soo Jin, additional, Yu, Ting, additional, Asta, Mark, additional, Ariando, A., additional, and Venkatesan, T., additional

Published
2016
Full Text
View/download PDF

33. Unconventional Transport through Graphene on SrTiO3: A Plausible Effect of SrTiO3 Phase-Transitions

Author

Saha, Surajit, primary, Kahya, Orhan, additional, Jaiswal, Manu, additional, Srivastava, Amar, additional, Annadi, Anil, additional, Balakrishnan, Jayakumar, additional, Pachoud, Alexandre, additional, Toh, Chee-Tat, additional, Hong, Byung-Hee, additional, Ahn, Jong-Hyun, additional, Venkatesan, T., additional, and Özyilmaz, Barbaros, additional

Published
2014
Full Text
View/download PDF

39. Advances in pulsed-laser-deposited AIN thin films for high-temperature capping, device passivation, and piezoelectric-based RF MEMS/NEMS resonator applications

Author

Hullavarad, S. S., primary, Vispute, R. D., additional, Nagaraj, B., additional, Kulkarni, V. N., additional, Dhar, S., additional, Venkatesan, T., additional, Jones, K. A., additional, Derenge, M., additional, Zheleva, T., additional, Ervin, M. H., additional, Lelis, A., additional, Scozzie, C. J., additional, Habersat, D., additional, Wickenden, A. E., additional, Currano, L. J., additional, and Dubey, M., additional

Published
2006
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results