Tim Kaler bio photo

Tim Kaler

I'm a postdoctoral associate at MIT in the EECS department and a member of the Supertech research group within the Computer Science and Artificial Intelligence Laboratory (CSAIL). In my research I work on engineering high-performance multicore algorithms that have nice properties - such as serial semantics.

About me

I am a postdoctoral associate at MIT in the EECS department and a member of the Supertech group within the Computer Science and Artificial Intellignce Laboratory (CSAIL). I work on engineering high-performance multicore algorithms that have nice properties - such as serial semantics. I completed my PhD thesis in 2020 on Programming technologies for engineering quality multicore software. Feel free to contact me at tfk at mit.edu as long as you're human (robots, please be honest!)

Publications

  1. PARAD: A Work-Efficient Parallel Algorithm for Reverse-Mode Automatic Differentiation

    Kaler, Tim, Tao B. Schardl, Brian Xie, Charles E. Leiserson, Jie Chen, Aldo Pareja & Georgios Kollias. 2021. PARAD: A Work-Efficient Parallel Algorithm for Reverse-Mode Automatic Differentiation. In Symposium on Algorithmic Principles of Computer Systems, SIAM.
    @inproceedings{KalerScXi21,
      title = {PARAD: A Work-Efficient Parallel Algorithm for Reverse-Mode Automatic Differentiation},
      author = {Kaler, Tim and Schardl, Tao B and Xie, Brian and Leiserson, Charles E and Chen, Jie and Pareja, Aldo and Kollias, Georgios},
      booktitle = {Symposium on Algorithmic Principles of Computer Systems},
      year = {2021},
      organization = {SIAM}
    }
    
  2. High-Throughput Image Alignment for Connectomics using Frugal Snap Judgments

    Kaler, Tim, Brian Wheatman & Sarah Wooders. 2020. High-Throughput Image Alignment for Connectomics using Frugal Snap Judgments. In 2020 IEEE High Performance Extreme Computing Conference (HPEC), IEEE.
    @inproceedings{KalerWhWo20,
      title = {High-Throughput Image Alignment for Connectomics using Frugal Snap Judgments},
      author = {Kaler, Tim and Wheatman, Brian and Wooders, Sarah},
      booktitle = {2020 IEEE High Performance Extreme Computing Conference (HPEC)},
      year = {2020},
      organization = {IEEE}
    }
    
  3. Cilkmem: Algorithms for analyzing the memory high-water mark of fork-join parallel programs

    Kaler, Tim, William Kuszmaul, Tao B. Schardl & Daniele Vettorel. 2020. Cilkmem: Algorithms for analyzing the memory high-water mark of fork-join parallel programs. In Symposium on Algorithmic Principles of Computer Systems, 162–176. SIAM.
    @inproceedings{kaler2020cilkmem,
      title = {Cilkmem: Algorithms for analyzing the memory high-water mark of fork-join parallel programs},
      author = {Kaler, Tim and Kuszmaul, William and Schardl, Tao B and Vettorel, Daniele},
      booktitle = {Symposium on Algorithmic Principles of Computer Systems},
      pages = {162--176},
      year = {2020},
      organization = {SIAM}
    }
    
  4. High-throughput image alignment for connectomics using frugal snap judgments: poster

    Kaler, Tim, Brian Wheatman & Sarah Wooders. 2019. High-throughput image alignment for connectomics using frugal snap judgments: poster. In Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming, 433–434. ACM.
    @inproceedings{kaler2019high,
      title = {High-throughput image alignment for connectomics using frugal snap judgments: poster},
      author = {Kaler, Tim and Wheatman, Brian and Wooders, Sarah},
      booktitle = {Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming},
      pages = {433--434},
      year = {2019},
      organization = {ACM}
    }
    
  5. EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs

    Pareja, Aldo, Giacomo Domeniconi, Jie Chen, Tengfei Ma, Toyotaro Suzumura, Hiroki Kanezashi, … Charles E. Leisersen. 2019. EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs. ArXiv Preprint ArXiv:1902.10191.
    @article{pareja2019evolvegcn,
      title = {EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs},
      author = {Pareja, Aldo and Domeniconi, Giacomo and Chen, Jie and Ma, Tengfei and Suzumura, Toyotaro and Kanezashi, Hiroki and Kaler, Tim and Leisersen, Charles E},
      journal = {arXiv preprint arXiv:1902.10191},
      year = {2019}
    }
    
  6. Scalable Graph Learning for Anti-Money Laundering: A First Look

    Weber, Mark, Jie Chen, Toyotaro Suzumura, Aldo Pareja, Tengfei Ma, Hiroki Kanezashi, … Tao B. Schardl. 2018. Scalable Graph Learning for Anti-Money Laundering: A First Look. ArXiv Preprint ArXiv:1812.00076.
    @article{weber2018scalable,
      title = {Scalable Graph Learning for Anti-Money Laundering: A First Look},
      author = {Weber, Mark and Chen, Jie and Suzumura, Toyotaro and Pareja, Aldo and Ma, Tengfei and Kanezashi, Hiroki and Kaler, Tim and Leiserson, Charles E and Schardl, Tao B},
      journal = {arXiv preprint arXiv:1812.00076},
      year = {2018}
    }
    
  7. A multicore path to connectomics-on-demand

    Matveev, Alexander, Yaron Meirovitch, Hayk Saribekyan, Wiktor Jakubiuk, Tim Kaler, Gergely Odor, … Nir Shavit. 2017. A multicore path to connectomics-on-demand. In Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 267–281. ACM.
    @inproceedings{matveev2017multicore,
      title = {A multicore path to connectomics-on-demand},
      author = {Matveev, Alexander and Meirovitch, Yaron and Saribekyan, Hayk and Jakubiuk, Wiktor and Kaler, Tim and Odor, Gergely and Budden, David and Zlateski, Aleksandar and Shavit, Nir},
      booktitle = {Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
      pages = {267--281},
      year = {2017},
      organization = {ACM}
    }
    
  8. Optimal Reissue Policies for Reducing Tail Latency

    Kaler, Tim, Yuxiong He & Sameh Elnikety. 2017. Optimal Reissue Policies for Reducing Tail Latency. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 195–206. ACM.
    @inproceedings{kaler2017optimal,
      title = {Optimal Reissue Policies for Reducing Tail Latency},
      author = {Kaler, Tim and He, Yuxiong and Elnikety, Sameh},
      booktitle = {Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures},
      pages = {195--206},
      year = {2017},
      organization = {ACM}
    }
    
  9. Executing dynamic data-graph computations deterministically using chromatic scheduling

    Kaler, Tim, William Hasenplaugh, Tao B. Schardl & Charles E. Leiserson. 2016. Executing dynamic data-graph computations deterministically using chromatic scheduling. ACM Transactions on Parallel Computing (TOPC) 3(1). 2.
    @article{kaler2016executing,
      title = {Executing dynamic data-graph computations deterministically using chromatic scheduling},
      author = {Kaler, Tim and Hasenplaugh, William and Schardl, Tao B and Leiserson, Charles E},
      journal = {ACM Transactions on Parallel Computing (TOPC)},
      volume = {3},
      number = {1},
      pages = {2},
      year = {2016},
      publisher = {ACM}
    }
    
  10. Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing

    Demaine, Erik D., Tim Kaler, Quanquan Liu, Aaron Sidford & Adam Yedidia. 2015. Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing. In Workshop on Algorithms and Data Structures, 263–275. Springer.
    @inproceedings{demaine2015polylogarithmic,
      title = {Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing},
      author = {Demaine, Erik D and Kaler, Tim and Liu, Quanquan and Sidford, Aaron and Yedidia, Adam},
      booktitle = {Workshop on Algorithms and Data Structures},
      pages = {263--275},
      year = {2015},
      organization = {Springer}
    }
    
  11. Ordering heuristics for parallel graph coloring

    Hasenplaugh, William, Tim Kaler, Tao B. Schardl & Charles E. Leiserson. 2014. Ordering heuristics for parallel graph coloring. In Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 166–177. ACM.
    @inproceedings{hasenplaugh2014ordering,
      title = {Ordering heuristics for parallel graph coloring},
      author = {Hasenplaugh, William and Kaler, Tim and Schardl, Tao B and Leiserson, Charles E},
      booktitle = {Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures},
      pages = {166--177},
      year = {2014},
      organization = {ACM}
    }
    
  12. Executing dynamic data-graph computations deterministically using chromatic scheduling

    Kaler, Tim, William Hasenplaugh, Tao B. Schardl & Charles E. Leiserson. 2014. Executing dynamic data-graph computations deterministically using chromatic scheduling. In Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 154–165. ACM.
    @inproceedings{kaler2014executing,
      title = {Executing dynamic data-graph computations deterministically using chromatic scheduling},
      author = {Kaler, Tim and Hasenplaugh, William and Schardl, Tao B and Leiserson, Charles E},
      booktitle = {Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures},
      pages = {154--165},
      year = {2014},
      organization = {ACM}
    }
    
  13. Chromatic scheduling of dynamic data-graph computations

    Kaler, Tim. 2013. Chromatic scheduling of dynamic data-graph computations. Massachusetts Institute of Technology dissertation.
    @phdthesis{kaler2013chromatic,
      title = {Chromatic scheduling of dynamic data-graph computations},
      author = {Kaler, Tim},
      year = {2013},
      school = {Massachusetts Institute of Technology}
    }
    
  14. Spatial Data Structures-Performance Comparision

    Kaler, Tim & Oscar Moll. 2012. Spatial Data Structures-Performance Comparision. O. Moll (Ed.).
    @article{kaler2012spatial,
      title = {Spatial Data Structures-Performance Comparision},
      author = {Kaler, Tim and Moll, Oscar},
      journal = {O. Moll (Ed.)},
      year = {2012}
    }
    
  15. Code in the air: simplifying sensing on smartphones

    Kaler, Tim, John Patrick Lynch, Timothy Peng, Lenin Ravindranath, Arvind Thiagarajan, Hari Balakrishnan & Sam Madden. 2010. Code in the air: simplifying sensing on smartphones. In Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems, 407–408. ACM.
    @inproceedings{kaler2010code,
      title = {Code in the air: simplifying sensing on smartphones},
      author = {Kaler, Tim and Lynch, John Patrick and Peng, Timothy and Ravindranath, Lenin and Thiagarajan, Arvind and Balakrishnan, Hari and Madden, Sam},
      booktitle = {Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems},
      pages = {407--408},
      year = {2010},
      organization = {ACM}
    }
    
  16. Cache Efficient Bloom Filters for Shared Memory Machines

    Kaler, Tim. Cache Efficient Bloom Filters for Shared Memory Machines. Paper. Implementierungen Im Ordner../Beispiele.
    @article{kalercache,
      title = {Cache Efficient Bloom Filters for Shared Memory Machines},
      author = {Kaler, Tim},
      journal = {Paper. Implementierungen im Ordner../Beispiele}
    }
    

Also available on Google Scholar