Kanat Tangwongsan

Citado por

	Total	Desde 2019
Citas	2090	1065
Índice h	25	18
Índice i10	32	22

240

120

180

200620072008200920102011201220132014201520162017201820192020202120222023202416 18 22 15 25 54 44 92 99 106 138 167 194 222 190 203 149 185 115

Acceso público

Ver todo

6 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Guy BlellochProfessor of Computer Science, Carnegie Mellon UniversityDirección de correo verificada de cs.cmu.edu
Scott SchneiderSoftware Engineer, MetaDirección de correo verificada de meta.com
Martin HirzelIBM ResearchDirección de correo verificada de us.ibm.com
Umut A. AcarCarnegie Mellon University, Department of Computer ScienceDirección de correo verificada de cs.cmu.edu
Srikanta TirthapuraProfessor of Computer Engineering, Iowa State UniversityDirección de correo verificada de iastate.edu
Kun-Lung WuIBM T. J. Watson Research CenterDirección de correo verificada de us.ibm.com
Matthias BlumeGoogleDirección de correo verificada de google.com
Julian ShunMITDirección de correo verificada de mit.edu
Harsha Vardhan SimhadriMicrosoft ResearchDirección de correo verificada de microsoft.com
Robert HarperProfessor of Computer Science, Carnegie Mellon UniversityDirección de correo verificada de andrew.cmu.edu
Richard PengCarnegie Mellon UniversityDirección de correo verificada de cs.cmu.edu
Pavan AduriIowa State UniversityDirección de correo verificada de cs.iastate.edu
Phillip GibbonsCarnegie Mellon UniversityDirección de correo verificada de cs.cmu.edu
Aapo KyrolaPh.D (Carnegie Mellon University, 2014)Dirección de correo verificada de cs.cmu.edu
Gary L. MillerCarnegie Mellon UniversityDirección de correo verificada de cs.cmu.edu
Ioannis KoutisNew Jersey Institute of TechnologyDirección de correo verificada de njit.edu
Duru TürkoğluUniversity of ChicagoDirección de correo verificada de cs.uchicago.edu
yu zhangGoogleDirección de correo verificada de iastate.edu
Yan GuUniversity of California, RiversideDirección de correo verificada de cs.ucr.edu
Yihan SunAssistant Professor, University of California, RiversideDirección de correo verificada de cs.ucr.edu

Seguir

Kanat Tangwongsan

Mahidol University International College

Dirección de correo verificada de mahidol.edu - Página principal

Parallel algorithms algorithms engineering big data processing


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Brief announcement: the problem based benchmark suite J Shun, GE Blelloch, JT Fineman, PB Gibbons, A Kyrola, HV Simhadri, ... Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012	250	2012
Counting and sampling triangles from a graph stream A Pavan, K Tangwongsan, S Tirthapura, KL Wu Proceedings of the VLDB Endowment 6 (14), 1870-1881, 2013	216	2013
Multicore triangle computations without tuning J Shun, K Tangwongsan 2015 IEEE 31st International Conference on Data Engineering, 149-160, 2015	178	2015
General incremental sliding-window aggregation K Tangwongsan, M Hirzel, S Schneider, KL Wu Proceedings of the VLDB Endowment 8 (7), 702-713, 2015	148	2015
Simpler analyses of local search algorithms for facility location A Gupta, K Tangwongsan arXiv preprint arXiv:0809.2554, 2008	102	2008
An experimental analysis of self-adjusting computation UA Acar, GE Blelloch, M Blume, R Harper, K Tangwongsan ACM Transactions on Programming Languages and Systems (TOPLAS) 32 (1), 1-53, 2009	92	2009
Linear-work greedy parallel approximate set cover and variants GE Blelloch, R Peng, K Tangwongsan Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011	77	2011
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs GE Blelloch, A Gupta, I Koutis, GL Miller, R Peng, K Tangwongsan Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011	77	2011
Low-latency sliding-window aggregation in worst-case constant time K Tangwongsan, M Hirzel, S Schneider Proceedings of the 11th ACM international conference on distributed and …, 2017	64	2017
Parallel triangle counting in massive streaming graphs K Tangwongsan, A Pavan, S Tirthapura Proceedings of the 22nd ACM international conference on Information …, 2013	60	2013
An experimental analysis of self-adjusting computation UA Acar, GE Blelloch, M Blume, K Tangwongsan Proceedings of the 27th ACM SIGPLAN Conference on Programming Language …, 2006	59	2006
Parallel shortest paths using radius stepping GE Blelloch, Y Gu, Y Sun, K Tangwongsan Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016	55	2016
Parallel and i/o efficient set covering algorithms GE Blelloch, HV Simhadri, K Tangwongsan Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012	54	2012
Faster and simpler width-independent parallel algorithms for positive semidefinite programming R Peng, K Tangwongsan Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012	51	2012
Efficient similarity estimation for systems exploiting data redundancy K Tangwongsan, H Pucha, DG Andersen, M Kaminsky 2010 Proceedings IEEE INFOCOM, 1-9, 2010	44	2010
A library for self-adjusting computation U Acar, G Blelloch, M Blume, R Harper, K Tangwongsan Electronic Notes in Theoretical Computer Science 148 (2), 127-154, 2006	44	2006
Parallel approximation algorithms for facility-location problems GE Blelloch, K Tangwongsan Proceedings of the twenty-second annual ACM symposium on Parallelism in …, 2010	42	2010
Traceable data types for self-adjusting computation UA Acar, G Blelloch, R Ley-Wild, K Tangwongsan, D Turkoglu ACM Sigplan Notices 45 (6), 483-496, 2010	42	2010
Sliding-window aggregation algorithms: Tutorial M Hirzel, S Schneider, K Tangwongsan Proceedings of the 11th ACM International Conference on Distributed and …, 2017	39	2017
Robust kinetic convex hulls in 3D UA Acar, GE Blelloch, K Tangwongsan, D Türkoğlu Algorithms-ESA 2008: 16th Annual European Symposium, Karlsruhe, Germany …, 2008	39	2008

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores