Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Chandramohan A. Thekkath

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Dan Graur

> Home > Persons > Chandramohan A. Thekkath

Publications

2023
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/cloud/AudibertCGKST23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cloud/AudibertCGKST23
Andrew Audibert, Yang Chen, Dan Graur, Ana Klimovic, Jirí Simsa, Chandramohan A. Thekkath:
tf.data service: A Case for Disaggregating ML Input Data Processing. SoCC 2023: 358-375
2022
[c25]
- view
  - electronic edition @ usenix.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/usenix/GraurAKATK22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/usenix/GraurAKATK22
Dan Graur, Damien Aymon, Dan Kluser, Tanguy Albrici, Chandramohan A. Thekkath, Ana Klimovic:
Cachew: Machine Learning Input Data Processing as a Service. USENIX Annual Technical Conference 2022: 689-706
[i1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2210-14826
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2210-14826
Andrew Audibert, Yang Chen, Dan Graur, Ana Klimovic, Jiri Simsa, Chandramohan A. Thekkath:
A case for disaggregation of ML data processing. CoRR abs/2210.14826 (2022)

a service of

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.