Kanat Tangwongsan, Ph.D.
Affiliations: | 2011 | Carnegie Mellon University, Pittsburgh, PA |
Area:
Computer Science, Applied MathematicsGoogle:
"Kanat Tangwongsan"Parents
Sign in to add mentor| Guy E. Blelloch | grad student | 2011 | Carnegie Mellon | |
| (Efficient Parallel Approximation Algorithms.) | ||||
| Anupam Gupta | grad student | 2011 | Carnegie Mellon | |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Simsiri N, Tangwongsan K, Tirthapura S, et al. (2018) Work‐Efficient Parallel Union‐Find Concurrency and Computation: Practice and Experience. 30 |
| Blelloch GE, Gu Y, Sun Y, et al. (2016) Parallel shortest paths using radius stepping Annual Acm Symposium On Parallelism in Algorithms and Architectures. 11: 443-454 |
| Shun J, Tangwongsan K. (2015) Multicore triangle computations without tuning Proceedings - International Conference On Data Engineering. 2015: 149-160 |
| Chen Y, Acar UA, Tangwongsan K. (2014) Functional programming for dynamic and large data with self-adjusting computation Acm Sigplan Notices. 49: 227-240 |
| Blelloch GE, Gupta A, Koutis I, et al. (2014) Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Theory of Computing Systems. 55: 521-554 |
| Blelloch GE, Gupta A, Tangwongsan K. (2012) Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design Annual Acm Symposium On Parallelism in Algorithms and Architectures. 205-213 |
| Peng R, Tangwongsan K. (2012) Faster and simpler width-independent parallel algorithms for positive semidefinite programming Annual Acm Symposium On Parallelism in Algorithms and Architectures. 101-108 |
| Blelloch GE, Simhadri HV, Tangwongsan K. (2012) Parallel and I/O efficient set covering algorithms Annual Acm Symposium On Parallelism in Algorithms and Architectures. 82-90 |
| Blelloch GE, Peng R, Tangwongsan K. (2011) Linear-work greedy parallel approximate set cover and variants Annual Acm Symposium On Parallelism in Algorithms and Architectures. 23-32 |
| Blelloch GE, Gupta A, Koutis I, et al. (2011) Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs Annual Acm Symposium On Parallelism in Algorithms and Architectures. 13-22 |