default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKanat Tangwongsan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Kanat Tangwongsan, Martin Hirzel, Scott Schneider:
Out-of-Order Sliding-Window Aggregation with Efficient Bulk Evictions and Insertions. Proc. VLDB Endow. 16(11): 3227-3239 (2023)- [i13]Kanat Tangwongsan, Martin Hirzel, Scott Schneider:
Out-of-Order Sliding-Window Aggregation with Efficient Bulk Evictions and Insertions (Extended Version). CoRR abs/2307.11210 (2023) - 2022
- [j8]Yu Zhang
, Kanat Tangwongsan, Srikanta Tirthapura:
Fast Streaming k-Means Clustering With Coreset Caching. IEEE Trans. Knowl. Data Eng. 34(6): 2740-2754 (2022) - 2021
- [j7]Kanat Tangwongsan, Martin Hirzel, Scott Schneider:
In-order sliding-window aggregation in worst-case constant time. VLDB J. 30(6): 933-957 (2021) - 2020
- [c27]Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan:
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model. SPAA 2020: 51-61 - [i12]Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan:
Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model. CoRR abs/2002.05710 (2020) - [i11]Kanat Tangwongsan, Martin Hirzel, Scott Schneider:
In-Order Sliding-Window Aggregation in Worst-Case Constant Time. CoRR abs/2009.13768 (2020)
2010 – 2019
- 2019
- [j6]Kanat Tangwongsan, Martin Hirzel, Scott Schneider:
Optimal and General Out-of-Order Sliding-Window Aggregation. Proc. VLDB Endow. 12(10): 1167-1180 (2019) - [c26]Kanat Tangwongsan, Srikanta Tirthapura:
Parallel Streaming Random Sampling. Euro-Par 2019: 451-465 - [r1]Kanat Tangwongsan, Martin Hirzel, Scott Schneider:
Sliding-Window Aggregation Algorithms. Encyclopedia of Big Data Technologies 2019 - [i10]Kanat Tangwongsan, Srikanta Tirthapura:
Parallel Streaming Random Sampling. CoRR abs/1906.04120 (2019) - 2018
- [j5]Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu:
Work-efficient parallel union-find. Concurr. Comput. Pract. Exp. 30(4) (2018) - [i9]Kanat Tangwongsan, Martin Hirzel, Scott Schneider:
Sub-O(log n) Out-of-Order Sliding-Window Aggregation. CoRR abs/1810.11308 (2018) - 2017
- [c25]Martin Hirzel, Scott Schneider, Kanat Tangwongsan:
Sliding-Window Aggregation Algorithms: Tutorial. DEBS 2017: 11-14 - [c24]Kanat Tangwongsan, Martin Hirzel, Scott Schneider:
Low-Latency Sliding-Window Aggregation in Worst-Case Constant Time. DEBS 2017: 66-77 - [c23]Yu Zhang, Kanat Tangwongsan, Srikanta Tirthapura:
Streaming k-Means Clustering with Fast Queries. ICDE 2017: 449-460 - [i8]Yu Zhang, Kanat Tangwongsan, Srikanta Tirthapura:
Streaming Algorithms for k-Means Clustering with Fast Queries. CoRR abs/1701.03826 (2017) - 2016
- [c22]Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu:
Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity. Euro-Par 2016: 561-573 - [c21]Guy E. Blelloch, Yan Gu, Yihan Sun, Kanat Tangwongsan:
Parallel Shortest Paths Using Radius Stepping. SPAA 2016: 443-454 - [i7]Guy E. Blelloch, Yan Gu, Yihan Sun, Kanat Tangwongsan:
Parallel Shortest-Paths Using Radius Stepping. CoRR abs/1602.03881 (2016) - [i6]Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu:
Work-Efficient Parallel and Incremental Graph Connectivity. CoRR abs/1602.05232 (2016) - 2015
- [j4]Kanat Tangwongsan, Martin Hirzel, Scott Schneider, Kun-Lung Wu:
General Incremental Sliding-Window Aggregation. Proc. VLDB Endow. 8(7): 702-713 (2015) - [c20]Julian Shun, Kanat Tangwongsan:
Multicore triangle computations without tuning. ICDE 2015: 149-160 - 2014
- [j3]Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan:
Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. Theory Comput. Syst. 55(3): 521-554 (2014) - [c19]Yan Chen, Umut A. Acar, Kanat Tangwongsan:
Functional programming for dynamic and large data with self-adjusting computation. ICFP 2014: 227-240 - [c18]Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu:
Parallel streaming frequency-based aggregates. SPAA 2014: 236-245 - 2013
- [j2]A. Pavan, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu:
Counting and Sampling Triangles from a Graph Stream. Proc. VLDB Endow. 6(14): 1870-1881 (2013) - [c17]Kanat Tangwongsan, A. Pavan, Srikanta Tirthapura:
Parallel triangle counting in massive streaming graphs. CIKM 2013: 781-786 - [i5]Kanat Tangwongsan, A. Pavan, Srikanta Tirthapura:
Parallel Triangle Counting in Massive Streaming Graphs. CoRR abs/1308.2166 (2013) - 2012
- [c16]Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri, Kanat Tangwongsan:
Brief announcement: the problem based benchmark suite. SPAA 2012: 68-70 - [c15]Guy E. Blelloch, Harsha Vardhan Simhadri, Kanat Tangwongsan:
Parallel and I/O efficient set covering algorithms. SPAA 2012: 82-90 - [c14]Richard Peng, Kanat Tangwongsan:
Faster and simpler width-independent parallel algorithms for positive semidefinite programming. SPAA 2012: 101-108 - [c13]Guy E. Blelloch, Anupam Gupta, Kanat Tangwongsan:
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design. SPAA 2012: 205-213 - [i4]Richard Peng, Kanat Tangwongsan:
Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming. CoRR abs/1201.5135 (2012) - 2011
- [c12]Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan:
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. SPAA 2011: 13-22 - [c11]Guy E. Blelloch, Richard Peng, Kanat Tangwongsan:
Linear-work greedy parallel approximate set cover and variants. SPAA 2011: 23-32 - [i3]Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan:
Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. CoRR abs/1111.1750 (2011) - 2010
- [c10]Kanat Tangwongsan, Himabindu Pucha, David G. Andersen, Michael Kaminsky:
Efficient Similarity Estimation for Systems Exploiting Data Redundancy. INFOCOM 2010: 1487-1495 - [c9]Umut A. Acar, Guy E. Blelloch, Ruy Ley-Wild, Kanat Tangwongsan, Duru Türkoglu:
Traceable data types for self-adjusting computation. PLDI 2010: 483-496 - [c8]Guy E. Blelloch, Ioannis Koutis, Gary L. Miller, Kanat Tangwongsan:
Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid. SC 2010: 1-12 - [c7]Guy E. Blelloch, Kanat Tangwongsan:
Parallel approximation algorithms for facility-location problems. SPAA 2010: 315-324 - [i2]Guy E. Blelloch, Kanat Tangwongsan:
Parallel Approximation Algorithms for Facility-Location Problems. CoRR abs/1006.1923 (2010)
2000 – 2009
- 2009
- [j1]Umut A. Acar, Guy E. Blelloch, Matthias Blume, Robert Harper, Kanat Tangwongsan:
An experimental analysis of self-adjusting computation. ACM Trans. Program. Lang. Syst. 32(1): 3:1-3:53 (2009) - 2008
- [c6]Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Duru Türkoglu:
Robust Kinetic Convex Hulls in 3D. ESA 2008: 29-40 - [c5]Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan:
All-Norms and All-L_p-Norms Approximation Algorithms. FSTTCS 2008: 199-210 - [i1]Anupam Gupta, Kanat Tangwongsan:
Simpler Analyses of Local Search Algorithms for Facility Location. CoRR abs/0809.2554 (2008) - 2007
- [c4]Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan:
Kinetic 3D convex hulls via self-adjusting computation. SCG 2007: 129-130 - 2006
- [c3]Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Jorge L. Vittes:
Kinetic Algorithms Via Self-adjusting Computation. ESA 2006: 636-647 - [c2]Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kanat Tangwongsan:
An experimental analysis of self-adjusting computation. PLDI 2006: 96-107 - 2005
- [c1]Umut A. Acar, Guy E. Blelloch, Matthias Blume, Robert Harper, Kanat Tangwongsan:
A Library for Self-Adjusting Computation. ML 2005: 127-154
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
