Kanat Tangwongsan

Proc. VLDB Endow., 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

2022

Fast Streaming <i>k</i>-Means Clustering With Coreset Caching.

[BibT_eX]

[DOI]

Yu Zhang

IEEE Trans. Knowl. Data Eng., 2022

2021

In-order sliding-window aggregation in worst-case constant time.

[BibT_eX]

[DOI]

VLDB J., 2021

2020

Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model.

[BibT_eX]

[DOI]

Daniel Anderson

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019

Sliding-Window Aggregation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Big Data Technologies., 2019

Optimal and General Out-of-Order Sliding-Window Aggregation.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Parallel Streaming Random Sampling.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2019: Parallel Processing, 2019

2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Work-efficient parallel union-find.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2018

2017

Streaming Algorithms for k-Means Clustering with Fast Queries.

[BibT_eX]

[DOI]

Yu Zhang

CoRR, 2017

Streaming k-Means Clustering with Fast Queries.

[BibT_eX]

[DOI]

Yu Zhang

Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Low-Latency Sliding-Window Aggregation in Worst-Case Constant Time.

[BibT_eX]

[DOI]

Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems, 2017

Sliding-Window Aggregation Algorithms: Tutorial.

[BibT_eX]

[DOI]

Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems, 2017

2016

Work-Efficient Parallel and Incremental Graph Connectivity.

[BibT_eX]

[DOI]

CoRR, 2016

Parallel Shortest Paths Using Radius Stepping.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015

General Incremental Sliding-Window Aggregation.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2015

Multicore triangle computations without tuning.

[BibT_eX]

[DOI]

Julian Shun

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.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Parallel streaming frequency-based aggregates.

[BibT_eX]

[DOI]

Kun-Lung Wu

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Functional programming for dynamic and large data with self-adjusting computation.

[BibT_eX]

[DOI]

Yan Chen

Umut A. Acar

Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

2013

Counting and Sampling Triangles from a Graph Stream.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2013

Parallel triangle counting in massive streaming graphs.

[BibT_eX]

[DOI]

A. Pavan

Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012

Brief announcement: the problem based benchmark suite.

[BibT_eX]

[DOI]

Harsha Vardhan Simhadri

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Faster and simpler width-independent parallel algorithms for positive semidefinite programming.

[BibT_eX]

[DOI]

Richard Peng

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Parallel and I/O efficient set covering algorithms.

[BibT_eX]

[DOI]

Harsha Vardhan Simhadri

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.

[BibT_eX]

[DOI]

Anupam Gupta

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

2011

Linear-work greedy parallel approximate set cover and variants.

[BibT_eX]

[DOI]

Richard Peng

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Conference on High Performance Computing Networking, 2010

Traceable data types for self-adjusting computation.

[BibT_eX]

[DOI]

Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2010

Efficient Similarity Estimation for Systems Exploiting Data Redundancy.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009

An experimental analysis of self-adjusting computation.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2009

2008

Simpler Analyses of Local Search Algorithms for Facility Location

[BibT_eX]

[DOI]

Anupam Gupta

CoRR, 2008

All-Norms and All-L_p-Norms Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Robust Kinetic Convex Hulls in 3D.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

2007

Kinetic 3D convex hulls via self-adjusting computation.

[BibT_eX]

[DOI]

Umut A. Acar