default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDT. S. Jayram
Jayram S. Thathachar
Person information
- affiliation: IBM Almaden Research Center, San Jose, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i19]Nate Veldt, Thomas Stanley, Benjamin W. Priest, Trevor Steil, Keita Iwabuchi, T. S. Jayram, Geoffrey Sanders:
Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees. CoRR abs/2502.12993 (2025)- 2024
- [c52]Joshua Feinglass, Jayaraman J. Thiagarajan, Rushil Anirudh, T. S. Jayram, Yezhou Yang:
'Eyes of a Hawk and Ears of a Fox': Part Prototype Network for Generalized Zero-Shot Learning. CVPR Workshops 2024: 7791-7798 - [c51]Rakshith Subramanyam, T. S. Jayram, Rushil Anirudh, Jayaraman J. Thiagarajan:
Exploring the Utility of Clip Priors for Visual Relationship Prediction. ICASSP 2024: 6825-6829 - [i18]Joshua Feinglass, Jayaraman J. Thiagarajan, Rushil Anirudh, T. S. Jayram, Yezhou Yang:
'Eyes of a Hawk and Ears of a Fox': Part Prototype Network for Generalized Zero-Shot Learning. CoRR abs/2404.08761 (2024) - 2023
- [c50]Rakshith Subramanyam, Mark Heimann, T. S. Jayram, Rushil Anirudh, Jayaraman J. Thiagarajan:
Contrastive Knowledge-Augmented Meta-Learning for Few-Shot Classification. WACV 2023: 2478-2486 - [i17]Rakshith Subramanyam, T. S. Jayram, Rushil Anirudh, Jayaraman J. Thiagarajan:
CREPE: Learnable Prompting With CLIP Improves Visual Relationship Prediction. CoRR abs/2307.04838 (2023) - 2022
- [j16]Harsh Bhatia
, Jayaraman J. Thiagarajan, Rushil Anirudh, T. S. Jayram, Tomas Oppelstrup, Helgi I. Ingólfsson, Felice C. Lightstone, Peer-Timo Bremer:
A biology-informed similarity metric for simulated patches of human cell membrane. Mach. Learn. Sci. Technol. 3(3): 35010 (2022) - [c49]Miklós Ajtai, Vladimir Braverman, T. S. Jayram, Sandeep Silwal, Alec Sun, David P. Woodruff, Samson Zhou:
The White-Box Adversarial Data Stream Model. PODS 2022: 15-27 - [i16]Miklós Ajtai, Vladimir Braverman, T. S. Jayram, Sandeep Silwal, Alec Sun, David P. Woodruff, Samson Zhou:
The White-Box Adversarial Data Stream Model. CoRR abs/2204.09136 (2022) - [i15]Rakshith Subramanyam, Mark Heimann, Jayram S. Thathachar, Rushil Anirudh, Jayaraman J. Thiagarajan:
Contrastive Knowledge-Augmented Meta-Learning for Few-Shot Classification. CoRR abs/2207.12346 (2022)
2010 – 2019
- 2019
- [c48]T. S. Jayram, Younes Bouhadjar, Tomasz Kornuta, Ryan L. McAvoy, Alexis Asseman, Ahmet S. Ozcan:
Controlling Attention in a Memory-Augmented Neural Network To Solve Working Memory Tasks. CogSci 2019: 478-484 - [i14]T. S. Jayram, Vincent Albouy, Tomasz Kornuta, Emre Sevgen, Ahmet S. Ozcan:
Visually Grounded Video Reasoning in Selective Attention Memory. ViGIL@NeurIPS 2019 - [i13]T. S. Jayram, Vincent Marois, Tomasz Kornuta, Vincent Albouy, Emre Sevgen, Ahmet S. Ozcan:
Transfer Learning in Visual and Relational Reasoning. CoRR abs/1911.11938 (2019) - 2018
- [j15]T. S. Jayram, Erdal Arikan:
A Note on Some Inequalities Used in Channel Polarization and Polar Coding. IEEE Trans. Inf. Theory 64(8): 5767-5768 (2018) - [j14]Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson:
Randomized Communication versus Partition Number. ACM Trans. Comput. Theory 10(1): 4:1-4:20 (2018) - [c47]T. S. Jayram, Tomasz Kornuta, Ryan L. McAvoy, Ahmet S. Ozcan:
Using Multi-task and Transfer Learning to Solve Working Memory Tasks. ICMLA 2018: 256-263 - [c46]Michael B. Cohen, T. S. Jayram, Jelani Nelson:
Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. SOSA 2018: 15:1-15:9 - [c45]Badih Ghazi, T. S. Jayram:
Resource-Efficient Common Randomness and Secret-Key Schemes. SODA 2018: 1834-1853 - [i12]T. S. Jayram, Tomasz Kornuta, Ryan L. McAvoy, Ahmet S. Ozcan:
Using Multi-task and Transfer Learning to Solve Working Memory Tasks. CoRR abs/1809.10847 (2018) - [i11]T. S. Jayram, Younes Bouhadjar, Ryan L. McAvoy, Tomasz Kornuta, Alexis Asseman, Kamil Rocki, Ahmet S. Ozcan:
Learning to Remember, Forget and Ignore using Attention Control in Memory. CoRR abs/1809.11087 (2018) - [i10]Vincent Marois, T. S. Jayram, Vincent Albouy, Tomasz Kornuta, Younes Bouhadjar, Ahmet S. Ozcan:
On transfer learning using a MAC model variant. CoRR abs/1811.06529 (2018) - 2017
- [c44]Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson:
Randomized Communication vs. Partition Number. ICALP 2017: 52:1-52:15 - [i9]Badih Ghazi, T. S. Jayram:
Resource-Efficient Common Randomness and Secret-Key Schemes. CoRR abs/1707.08086 (2017) - [i8]Badih Ghazi, T. S. Jayram:
Resource-Efficient Common Randomness and Secret-Key Schemes. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c43]Mika Göös, T. S. Jayram:
A Composition Theorem for Conical Juntas. CCC 2016: 5:1-5:16 - [i7]T. S. Jayram, Erdal Arikan:
A note on some inequalities used in channel polarization and polar coding. CoRR abs/1607.00355 (2016) - 2015
- [c42]Chandra Chekuri, T. S. Jayram, Jan Vondrák:
On Multiplicative Weight Updates for Concave and Submodular Function Maximization. ITCS 2015: 201-210 - [i6]Mika Göös, T. S. Jayram:
A Composition Theorem for Conical Juntas. Electron. Colloquium Comput. Complex. TR15 (2015) - [i5]Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson:
Randomized Communication vs. Partition Number. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c41]T. S. Jayram, Jan Vondrák:
Exchangeability and Realizability: De Finetti Theorems on Graphs. APPROX-RANDOM 2014: 762-778 - 2013
- [j13]T. S. Jayram, David P. Woodruff:
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error. ACM Trans. Algorithms 9(3): 26:1-26:17 (2013) - [c40]Vikas K. Garg, T. S. Jayram, Balakrishnan Narayanaswamy:
Online Optimization with Dynamic Temporal Uncertainty: Incorporating Short Term Predictions for Renewable Integration in Intelligent Energy Systems. AAAI 2013: 1291-1297 - [c39]Vijay Arya, T. S. Jayram, Soumitra Pal, Shivkumar Kalyanaraman:
Inferring connectivity model from meter measurements in distribution networks. e-Energy 2013: 173-182 - [c38]T. S. Jayram:
On the information complexity of cascaded norms with small domains. ITW 2013: 1-5 - 2012
- [c37]Balakrishnan Narayanaswamy, Vikas K. Garg, T. S. Jayram:
Online optimization for the smart (micro) grid. e-Energy 2012: 19 - [c36]Balakrishnan Narayanaswamy, T. S. Jayram, Voo Nyuk Yoong:
Hedging strategies for renewable resource integration and uncertainty management in the smart grid. ISGT Europe 2012: 1-8 - [c35]Balakrishnan Narayanaswamy, Vikas K. Garg, T. S. Jayram:
Prediction based storage management in the smart grid. SmartGridComm 2012: 498-503 - [c34]Neha Sengupta, Kaushik Das, T. S. Jayram, Deva P. Seetharam:
Optimal allocation of land area for a hybrid solar wind power plant. SmartGridComm 2012: 522-527 - 2011
- [j12]Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol:
Index Coding With Side Information. IEEE Trans. Inf. Theory 57(3): 1479-1494 (2011) - [c33]T. S. Jayram, David P. Woodruff:
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Sub-Constant Error. SODA 2011: 1-10 - [i4]T. S. Jayram, Soumitra Pal, Vijay Arya:
Recovery of a Sparse Integer Solution to an Underdetermined System of Linear Equations. CoRR abs/1112.1757 (2011) - 2010
- [c32]T. S. Jayram:
Information complexity: a tutorial. PODS 2010: 159-168 - [c31]Alexandr Andoni, T. S. Jayram, Mihai Patrascu:
Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities. SODA 2010: 184-192
2000 – 2009
- 2009
- [c30]T. S. Jayram:
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND. APPROX-RANDOM 2009: 562-573 - [c29]T. S. Jayram, Swastik Kopparty, Prasad Raghavendra:
On the Communication Complexity of Read-Once AC^0 Formulae. CCC 2009: 329-340 - [c28]T. S. Jayram, David P. Woodruff:
The Data Stream Space Complexity of Cascaded Norms. FOCS 2009: 765-774 - 2008
- [j11]Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis:
Exponential Separation of Quantum and Classical One-Way Communication Complexity. SIAM J. Comput. 38(1): 366-384 (2008) - [j10]T. S. Jayram, Ravi Kumar, D. Sivakumar:
The One-Way Communication Complexity of Hamming Distance. Theory Comput. 4(1): 129-135 (2008) - [j9]T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee:
Estimating statistical aggregates on probabilistic data streams. ACM Trans. Database Syst. 33(4): 26:1-26:30 (2008) - [c27]Amit Chakrabarti, T. S. Jayram, Mihai Patrascu:
Tight lower bounds for selection in randomly ordered streams. SODA 2008: 720-729 - 2007
- [j8]Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan:
OLAP over uncertain and imprecise data. VLDB J. 16(1): 123-144 (2007) - [c26]T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee:
Estimating statistical aggregates on probabilistic data streams. PODS 2007: 243-252 - [c25]Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar:
Estimating the sortedness of a data stream. SODA 2007: 318-327 - [c24]T. S. Jayram, Satyen Kale, Erik Vee:
Efficient aggregation algorithms for probabilistic data. SODA 2007: 346-355 - [c23]Paul Beame, T. S. Jayram, Atri Rudra:
Lower bounds for randomized read/write stream algorithms. STOC 2007: 689-698 - 2006
- [j7]T. S. Jayram, Rajasekar Krishnamurthy, Sriram Raghavan, Shivakumar Vaithyanathan, Huaiyu Zhu:
Avatar Information Extraction System. IEEE Data Eng. Bull. 29(1): 40-48 (2006) - [c22]Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol:
Index Coding with Side Information. FOCS 2006: 197-206 - [c21]T. S. Jayram, Phokion G. Kolaitis, Erik Vee:
The containment problem for REAL conjunctive queries with inequalities. PODS 2006: 80-89 - [c20]Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan:
Efficient Allocation Algorithms for OLAP Over Imprecise Data. VLDB 2006: 391-402 - 2005
- [c19]Douglas Burdick, Prasad Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan:
OLAP Over Uncertain and Imprecise Data. VLDB 2005: 970-981 - 2004
- [j6]Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar:
An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. 68(4): 702-732 (2004) - [j5]T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani:
Cell-probe lower bounds for the partial match problem. J. Comput. Syst. Sci. 69(3): 435-447 (2004) - [c18]Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar:
The Sketching Complexity of Pattern Matching. APPROX-RANDOM 2004: 261-272 - [c17]Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar:
Approximating Edit Distance Efficiently. FOCS 2004: 550-559 - [c16]Ashutosh Garg, T. S. Jayram, Shivakumar Vaithyanathan, Huaiyu Zhu:
Generalized Opinion Pooling. AI&M 2004 - [c15]Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis:
Exponential separation of quantum and classical one-way communication complexity. STOC 2004: 128-137 - [i3]Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis:
Exponential Separation of Quantum and Classical One-Way Communication Complexity. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c14]T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani:
Cell-probe lower bounds for the partial match problem. STOC 2003: 667-672 - [c13]T. S. Jayram, Ravi Kumar, D. Sivakumar:
Two applications of information complexity. STOC 2003: 673-682 - 2002
- [j4]Sujay S. Parekh, Neha Gandhi, Joseph L. Hellerstein, Dawn M. Tilbury, T. S. Jayram, Joseph P. Bigus:
Using Control Theory to Achieve Service Level Objectives In Performance Management. Real Time Syst. 23(1-2): 127-141 (2002) - [c12]Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar:
Information Theory Methods in Communication Complexity. CCC 2002: 93-102 - [c11]Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar:
An Information Statistics Approach to Data Stream and Communication Complexity. FOCS 2002: 209-218 - [c10]Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan:
Counting Distinct Elements in a Data Stream. RANDOM 2002: 1-10 - [c9]Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar:
Approximate counting of inversions in a data stream. STOC 2002: 370-379 - 2001
- [j3]Eric J. Anderson, T. S. Jayram, Tracy Kimbrel:
Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines. Computing 67(1): 83-90 (2001) - [j2]Paul Beame, T. S. Jayram, Michael E. Saks:
Time-Space Tradeoffs for Branching Programs. J. Comput. Syst. Sci. 63(4): 542-572 (2001) - [c8]Sujay S. Parekh, Neha Gandhi, Joseph L. Hellerstein, Dawn M. Tilbury, T. S. Jayram, Joseph P. Bigus:
Using Control Theory to Achieve Service Level Objectives In Performance Management. Integrated Network Management 2001: 841-854 - [c7]T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko:
Online server allocation in a server farm via benefit task systems. STOC 2001: 540-549 - 2000
- [c6]Joseph L. Hellerstein, T. S. Jayram, Irina Rish:
Recognizing End-User Transactions in Performance Management. AAAI/IAAI 2000: 596-602 - [c5]Joseph L. Hellerstein, T. S. Jayram, Mark S. Squillante:
Analysis of Large-Scale Distributed Information Systems. MASCOTS 2000: 164-171
1990 – 1999
- 1998
- [c4]Jayram S. Thathachar:
On the Limitations of Ordered Representations of Functions. CAV 1998: 232-243 - [c3]Paul Beame, Michael E. Saks, Jayram S. Thathachar:
Time-Space Tradeoffs for Branching Programs. FOCS 1998: 254-263 - [c2]Jayram S. Thathachar:
On Separating the Read-k-Times Branching Program Hierarchy. STOC 1998: 653-662 - [i2]Jayram S. Thathachar:
On Separating the Read-k-Times Branching Program Hierarchy. Electron. Colloquium Comput. Complex. TR98 (1998) - [i1]Paul Beame, Michael E. Saks, Jayram S. Thathachar:
Time-Space Tradeoffs for Branching Programs. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j1]Rakesh K. Sinha, Jayram S. Thathachar:
Efficient Oblivious Branching Programs for Threshold and Mod Functions. J. Comput. Syst. Sci. 55(3): 373-384 (1997) - 1994
- [c1]Rakesh K. Sinha, Jayram S. Thathachar:
Efficient Oblivious Branching Programs for Threshold Functions. FOCS 1994: 309-317
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-21 01:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
