Kanat Tangwongsan

Orcid: 0000-0001-9775-8165

According to our database1, Kanat Tangwongsan authored at least 42 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Out-of-Order Sliding-Window Aggregation with Efficient Bulk Evictions and Insertions.
Proc. VLDB Endow., 2023

Out-of-Order Sliding-Window Aggregation with Efficient Bulk Evictions and Insertions (Extended Version).
CoRR, 2023

2022
Fast Streaming $k$k-Means Clustering With Coreset Caching.
IEEE Trans. Knowl. Data Eng., 2022

2021
In-order sliding-window aggregation in worst-case constant time.
VLDB J., 2021

2020
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019
Sliding-Window Aggregation Algorithms.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Optimal and General Out-of-Order Sliding-Window Aggregation.
Proc. VLDB Endow., 2019

Parallel Streaming Random Sampling.
Proceedings of the Euro-Par 2019: Parallel Processing, 2019

2018
Sub-O(log n) Out-of-Order Sliding-Window Aggregation.
CoRR, 2018

Work-efficient parallel union-find.
Concurr. Comput. Pract. Exp., 2018

2017
Streaming Algorithms for k-Means Clustering with Fast Queries.
CoRR, 2017

Streaming k-Means Clustering with Fast Queries.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Low-Latency Sliding-Window Aggregation in Worst-Case Constant Time.
Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems, 2017

Sliding-Window Aggregation Algorithms: Tutorial.
Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems, 2017

2016
Work-Efficient Parallel and Incremental Graph Connectivity.
CoRR, 2016

Parallel Shortest Paths Using Radius Stepping.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015
General Incremental Sliding-Window Aggregation.
Proc. VLDB Endow., 2015

Multicore triangle computations without tuning.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

2014
Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs.
Theory Comput. Syst., 2014

Parallel streaming frequency-based aggregates.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Functional programming for dynamic and large data with self-adjusting computation.
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

2013
Counting and Sampling Triangles from a Graph Stream.
Proc. VLDB Endow., 2013

Parallel triangle counting in massive streaming graphs.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012
Brief announcement: the problem based benchmark suite.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Faster and simpler width-independent parallel algorithms for positive semidefinite programming.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Parallel and I/O efficient set covering algorithms.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

2011
Linear-work greedy parallel approximate set cover and variants.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

2010
Parallel approximation algorithms for facility-location problems.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid.
Proceedings of the Conference on High Performance Computing Networking, 2010

Traceable data types for self-adjusting computation.
Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2010

Efficient Similarity Estimation for Systems Exploiting Data Redundancy.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009
An experimental analysis of self-adjusting computation.
ACM Trans. Program. Lang. Syst., 2009

2008
Simpler Analyses of Local Search Algorithms for Facility Location
CoRR, 2008

All-Norms and All-L_p-Norms Approximation Algorithms.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Robust Kinetic Convex Hulls in 3D.
Proceedings of the Algorithms, 2008

2007
Kinetic 3D convex hulls via self-adjusting computation.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006
An experimental analysis of self-adjusting computation.
Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, 2006

Kinetic Algorithms Via Self-adjusting Computation.
Proceedings of the Algorithms, 2006

2005
A Library for Self-Adjusting Computation.
Proceedings of the ACM-SIGPLAN Workshop on ML, 2005


  Loading...