default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTejas Bodas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Utkarsh Prakash
, Aryan Chollera, Kushagra Khatwani, Prabuchandran K. J., Tejas Bodas:
Practical First-Order Bayesian Optimization Algorithms. COMAD/CODS 2024: 173-181- [i14]Narendhar Gugulothu, Sanjay P. Bhat, Tejas Bodas:
Mixture Density Networks for Classification with an Application to Product Bundling. CoRR abs/2402.05428 (2024) - [i13]Harshit Dhankar, Kshitij Mishra, Tejas Bodas:
Tabular and Deep Reinforcement Learning for Gittins Index. CoRR abs/2405.01157 (2024) - 2023
- [j10]Rooji Jinan, Ajay Badita, Tejas Bodas, Parimal Parag:
Load balancing policies without feedback using timed replicas. Perform. Evaluation 162: 102381 (2023) - [c11]Kunal Jain, Prabuchandran K. J., Tejas Bodas:
Bayesian Optimization for Function Compositions with Applications to Dynamic Pricing. LION 2023: 62-77 - [i12]Kunal Jain, Prabuchandran K. J., Tejas Bodas:
Bayesian Optimization for Function Compositions with Applications to Dynamic Pricing. CoRR abs/2303.11954 (2023) - [i11]Utkarsh Prakash, Aryan Chollera, Kushagra Khatwani, Prabuchandran K. J., Tejas Bodas:
Practical First-Order Bayesian Optimization Algorithms. CoRR abs/2306.10815 (2023) - 2022
- [j9]Urtzi Ayesta, Tejas Bodas, Jan-Pieter L. Dorsman, Ina Maria Verloop:
A Token-Based Central Queue with Order-Independent Service Rates. Oper. Res. 70(1): 545-561 (2022) - 2021
- [j8]Arti D. Yardi, Tejas Bodas:
A Covert Queueing Problem With Busy Period Statistic. IEEE Commun. Lett. 25(3): 726-729 (2021) - [c10]Tim Hellemans, Arti D. Yardi, Tejas Bodas:
Download time analysis for distributed storage systems with node failures. ISIT 2021: 2060-2065 - [c9]Amogh Johri, Arti D. Yardi, Tejas Bodas:
Approximate Gradient Coding for Heterogeneous Nodes. ITW 2021: 1-6 - [c8]Arti D. Yardi, Tejas Bodas:
Covert queueing problem with a Markovian statistic. ITW 2021: 1-6 - [i10]Tim Hellemans, Arti D. Yardi, Tejas Bodas:
Download time analysis for distributed storage systems with node failures. CoRR abs/2105.02926 (2021) - [i9]Amogh Johri, Arti D. Yardi, Tejas Bodas:
Approximate Gradient Coding for Heterogeneous Nodes. CoRR abs/2105.06124 (2021) - [i8]Arti D. Yardi, Tejas Bodas:
Covert queueing problem with a Markovian statistic. CoRR abs/2109.05702 (2021) - 2020
- [i7]Rooji Jinan, Ajay Badita, Tejas Bodas, Parimal Parag:
Load balancing policies with server-side cancellation of replicas. CoRR abs/2010.13575 (2020)
2010 – 2019
- 2019
- [j7]Tejas Bodas, D. Manjunath:
Revenue maximization in service systems with heterogeneous customers. Eur. J. Oper. Res. 278(2): 686-698 (2019) - [j6]Tim Hellemans, Tejas Bodas, Benny Van Houdt:
Performance Analysis of Workload Dependent Load Balancing Policies. Proc. ACM Meas. Anal. Comput. Syst. 3(2): 35:1-35:35 (2019) - [c7]Tim Hellemans, Tejas Bodas, Benny Van Houdt:
Performance Analysis of Workload Dependent Load Balancing Policies. SIGMETRICS (Abstracts) 2019: 7-8 - [i6]Urtzi Ayesta, Tejas Bodas, Jan-Pieter L. Dorsman, Maaike Verloop:
A token-based central queue with order-independent service rates. CoRR abs/1902.02137 (2019) - 2018
- [j5]Urtzi Ayesta, Tejas Bodas, Maaike Verloop:
On a unifying product form framework for redundancy models. Perform. Evaluation 127-128: 93-119 (2018) - [j4]Konstantin Avrachenkov, Tejas Bodas:
On the equivalence between multiclass processor sharing and random order scheduling policies. SIGMETRICS Perform. Evaluation Rev. 45(4): 2-6 (2018) - [j3]Urtzi Ayesta, Tejas Bodas, Ina Maria Verloop:
On a unifying product form framework for redundancy models. SIGMETRICS Perform. Evaluation Rev. 46(3): 80-81 (2018) - 2017
- [j2]Tejas Bodas, D. Manjunath:
On threshold routing in a service system with highest-bidder-first and FIFO services. Oper. Res. Lett. 45(5): 488-492 (2017) - [i5]Konstantin Avrachenkov, Tejas Bodas:
On the equivalence between multiclass PS-type scheduling policies. CoRR abs/1704.01722 (2017) - 2016
- [c6]Prabuchandran K. J., Tejas Bodas, Theja Tulabandhula:
Reinforcement Learning Algorithms for Regret Minimization in Structured Markov Decision Processes: (Extended Abstract). AAMAS 2016: 1289-1290 - [i4]Tejas Bodas, D. Manjunath:
Revenue Maximization in Service Systems with Heterogeneous Customers. CoRR abs/1605.07107 (2016) - [i3]Prabuchandran K. J., Tejas Bodas, Theja Tulabandhula:
Reinforcement Learning algorithms for regret minimization in structured Markov Decision Processes. CoRR abs/1608.04929 (2016) - [i2]Tejas Bodas, D. Manjunath:
On Threshold Routing in a Service System with Highest-Bidder-First and FIFO Services. CoRR abs/1611.05014 (2016) - 2015
- [j1]Tejas Bodas, Murtaza Ali, D. Manjunath:
A System with a Choice of Highest-Bidder-First and FIFO Services. EAI Endorsed Trans. Ambient Syst. 2(7): e5 (2015) - [c5]Sripada Kadambar, Tejas Bodas:
Joint channel allocation and routing in wireless mesh networks. NCC 2015: 1-6 - 2014
- [c4]Murtaza Ali, Tejas Bodas, D. Manjunath:
Optimal and equilibrium allocations in a discriminatory processor sharing system. NetGCooP 2014: 31-37 - [i1]Tejas Bodas, Ayalvadi Ganesh, D. Manjunath:
Tolls and Welfare Optimization for Multiclass Traffic in Multiqueue Systems. CoRR abs/1409.7195 (2014) - 2013
- [c3]Veeraruna Kavitha, Tejas Bodas, D. Manjunath:
On-demand OFDMA: Control, fairness and non-cooperation. WiOpt 2013: 224-231 - 2011
- [c2]Tejas Bodas, Ayalvadi Ganesh, D. Manjunath:
Load balancing and routing games with admission price. CDC/ECC 2011: 249-254 - [c1]Tejas Bodas, D. Manjunath:
On load balancing equilibria in multiqueue systems with multiclass traffic. NetGCoop 2011: 1-5
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 2024-06-10 20:24 CEST 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:
