Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Tim Kaler

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 Jie Chen 0007

> Home > Persons > Tim Kaler

Publications

2023
[i5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2305-03152
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2305-03152
Tim Kaler, Alexandros-Stavros Iliopoulos, Philip Murzynowski, Tao B. Schardl, Charles E. Leiserson, Jie Chen:
Communication-Efficient Graph Neural Networks with Probabilistic Neighborhood Expansion Analysis and Caching. CoRR abs/2305.03152 (2023)
2022
[c12]
- view
  - electronic edition @ mlsys.org
  - no references & citations available
- export record
  dblp key:
  - conf/mlsys/KalerSOISL022
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mlsys/KalerSOISL022
Tim Kaler, Nickolas Stathas, Anne Ouyang, Alexandros-Stavros Iliopoulos, Tao B. Schardl, Charles E. Leiserson, Jie Chen:
Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and Pipelining. MLSys 2022
2021
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/apocs/KalerSXLCPK21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/apocs/KalerSXLCPK21
Tim Kaler, Tao B. Schardl, Brian Xie, Charles E. Leiserson, Jie Chen, Aldo Pareja, Georgios Kollias:
PARAD: A Work-Efficient Parallel Algorithm for Reverse-Mode Automatic Differentiation. APOCS 2021: 144-158
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2110-08450
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2110-08450
Tim Kaler, Nickolas Stathas, Anne Ouyang, Alexandros-Stavros Iliopoulos, Tao B. Schardl, Charles E. Leiserson, Jie Chen:
Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and Pipelining. CoRR abs/2110.08450 (2021)
2020
[c10]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/aaai/ParejaDCMSKKSL20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/ParejaDCMSKKSL20
Aldo Pareja, Giacomo Domeniconi, Jie Chen, Tengfei Ma, Toyotaro Suzumura, Hiroki Kanezashi, Tim Kaler, Tao B. Schardl, Charles E. Leiserson:
EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs. AAAI 2020: 5363-5370
2019
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1902-10191
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1902-10191
Aldo Pareja, Giacomo Domeniconi, Jie Chen, Tengfei Ma, Toyotaro Suzumura, Hiroki Kanezashi, Tim Kaler, Charles E. Leiserson:
EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs. CoRR abs/1902.10191 (2019)
2018
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1812-00076
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1812-00076
Mark Weber, Jie Chen, Toyotaro Suzumura, Aldo Pareja, Tengfei Ma, Hiroki Kanezashi, Tim Kaler, Charles E. Leiserson, Tao B. Schardl:
Scalable Graph Learning for Anti-Money Laundering: A First Look. CoRR abs/1812.00076 (2018)

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.