A Library for Self-Adjusting Computation. - Umut A. Acar; Guy E. Blelloch; Matthias Blume; Robert Harper 001; Kanat Tangwongsan (ML, 2005)

Kinetic Algorithms Via Self-adjusting Computation. - Umut A. Acar; Guy E. Blelloch; Kanat Tangwongsan; Jorge L. Vittes (ESA, 2006)

An experimental analysis of self-adjusting computation. - Umut A. Acar; Guy E. Blelloch; Matthias Blume; Kanat Tangwongsan (PLDI, 2006)

Kinetic 3D convex hulls via self-adjusting computation. - Umut A. Acar; Guy E. Blelloch; Kanat Tangwongsan (SCG, 2007)

Robust Kinetic Convex Hulls in 3D. - Umut A. Acar; Guy E. Blelloch; Kanat Tangwongsan; Duru Türkoglu (ESA, 2008)

All-Norms and All-L_p-Norms Approximation Algorithms. - Daniel Golovin; Anupam Gupta 001; Amit Kumar 001; Kanat Tangwongsan (FSTTCS, 2008)

Simpler Analyses of Local Search Algorithms for Facility Location - Anupam Gupta 001; Kanat Tangwongsan (CoRR, 2008)

An experimental analysis of self-adjusting computation. - Umut A. Acar; Guy E. Blelloch; Matthias Blume; Robert Harper 001; Kanat Tangwongsan (ACM Trans. Program. Lang. Syst., 2009)

Efficient Similarity Estimation for Systems Exploiting Data Redundancy. - Kanat Tangwongsan; Himabindu Pucha; David G. Andersen; Michael Kaminsky (INFOCOM, 2010)

Traceable data types for self-adjusting computation. - Umut A. Acar; Guy E. Blelloch; Ruy Ley-Wild; Kanat Tangwongsan; Duru Türkoglu (PLDI, 2010)

Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid. - Guy E. Blelloch; Ioannis Koutis; Gary L. Miller; Kanat Tangwongsan (SC, 2010)

Parallel approximation algorithms for facility-location problems. - Guy E. Blelloch; Kanat Tangwongsan (SPAA, 2010)

Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. - Guy E. Blelloch; Anupam Gupta 001; Ioannis Koutis; Gary L. Miller; Richard Peng; Kanat Tangwongsan (SPAA, 2011)

Linear-work greedy parallel approximate set cover and variants. - Guy E. Blelloch; Richard Peng; Kanat Tangwongsan (SPAA, 2011)

Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design. - Guy E. Blelloch; Anupam Gupta 001; Kanat Tangwongsan (SPAA, 2012)

Parallel and I/O efficient set covering algorithms. - Guy E. Blelloch; Harsha Vardhan Simhadri; Kanat Tangwongsan (SPAA, 2012)

Faster and simpler width-independent parallel algorithms for positive semidefinite programming. - Richard Peng; Kanat Tangwongsan (SPAA, 2012)

Brief announcement: the problem based benchmark suite. - Julian Shun; Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Aapo Kyrola; Harsha Vardhan Simhadri; Kanat Tangwongsan (SPAA, 2012)

Parallel triangle counting in massive streaming graphs. - Kanat Tangwongsan; A. Pavan 001; Srikanta Tirthapura (CIKM, 2013)

Counting and Sampling Triangles from a Graph Stream. - A. Pavan 001; Kanat Tangwongsan; Srikanta Tirthapura; Kun-Lung Wu (Proc. VLDB Endow., 2013)

Functional programming for dynamic and large data with self-adjusting computation. - Yan Chen 001; Umut A. Acar; Kanat Tangwongsan (ICFP, 2014)

Parallel streaming frequency-based aggregates. - Kanat Tangwongsan; Srikanta Tirthapura; Kun-Lung Wu (SPAA, 2014)

Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. - Guy E. Blelloch; Anupam Gupta 001; Ioannis Koutis; Gary L. Miller; Richard Peng; Kanat Tangwongsan (Theory Comput. Syst., 2014)

Multicore triangle computations without tuning. - Julian Shun; Kanat Tangwongsan (ICDE, 2015)

General Incremental Sliding-Window Aggregation. - Kanat Tangwongsan; Martin Hirzel; Scott Schneider 001; Kun-Lung Wu (Proc. VLDB Endow., 2015)

Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity. - Natcha Simsiri; Kanat Tangwongsan; Srikanta Tirthapura; Kun-Lung Wu (Euro-Par, 2016)

Parallel Shortest Paths Using Radius Stepping. - Guy E. Blelloch; Yan Gu 001; Yihan Sun 001; Kanat Tangwongsan (SPAA, 2016)

Work-Efficient Parallel and Incremental Graph Connectivity. - Natcha Simsiri; Kanat Tangwongsan; Srikanta Tirthapura; Kun-Lung Wu (CoRR, 2016)

Sliding-Window Aggregation Algorithms: Tutorial. - Martin Hirzel; Scott Schneider 001; Kanat Tangwongsan (DEBS, 2017)

Low-Latency Sliding-Window Aggregation in Worst-Case Constant Time. - Kanat Tangwongsan; Martin Hirzel; Scott Schneider 001 (DEBS, 2017)

Streaming k-Means Clustering with Fast Queries. - Yu Zhang 148; Kanat Tangwongsan; Srikanta Tirthapura (ICDE, 2017)

Streaming Algorithms for k-Means Clustering with Fast Queries. - Yu Zhang 148; Kanat Tangwongsan; Srikanta Tirthapura (CoRR, 2017)

Work-efficient parallel union-find. - Natcha Simsiri; Kanat Tangwongsan; Srikanta Tirthapura; Kun-Lung Wu (Concurr. Comput. Pract. Exp., 2018)

Sub-O(log n) Out-of-Order Sliding-Window Aggregation. - Kanat Tangwongsan; Martin Hirzel; Scott Schneider 001 (CoRR, 2018)

Parallel Streaming Random Sampling. - Kanat Tangwongsan; Srikanta Tirthapura (Euro-Par, 2019)

Optimal and General Out-of-Order Sliding-Window Aggregation. - Kanat Tangwongsan; Martin Hirzel; Scott Schneider 001 (Proc. VLDB Endow., 2019)

Sliding-Window Aggregation Algorithms. - Kanat Tangwongsan; Martin Hirzel; Scott Schneider 001 (Encyclopedia of Big Data Technologies, 2019)

Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model. - Daniel Anderson; Guy E. Blelloch; Kanat Tangwongsan (SPAA, 2020)

In-order sliding-window aggregation in worst-case constant time. - Kanat Tangwongsan; Martin Hirzel; Scott Schneider 001 (VLDB J., 2021)

Fast Streaming k-Means Clustering With Coreset Caching. - Yu Zhang 148; Kanat Tangwongsan; Srikanta Tirthapura (IEEE Trans. Knowl. Data Eng., 2022)

Out-of-Order Sliding-Window Aggregation with Efficient Bulk Evictions and Insertions (Extended Version). - Kanat Tangwongsan; Martin Hirzel; Scott Schneider 001 (CoRR, 2023)

Out-of-Order Sliding-Window Aggregation with Efficient Bulk Evictions and Insertions. - Kanat Tangwongsan; Martin Hirzel; Scott Schneider 001 (Proc. VLDB Endow., 2023)