( en | de | ru )

 

Disambiguation of "Tangwongsan, Kanat"

Author of the publication

copydeleteadd this publication to your clipboard
An experimental analysis of self-adjusting computation.

, , , and . PLDI, page 96-107. ACM, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kanat Rachimbekow

Kanat Aygozhiev

Kanat Tilev

Kanat Tilekeyev University of Central Asia

Demetrios Kanatsules

 

Other publications of authors with the same name

Parallel streaming frequency-based aggregates., , and . SPAA, page 236-245. ACM, (2014)Functional programming for dynamic and large data with self-adjusting computation., , and . ICFP, page 227-240. ACM, (2014)Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid., , , and . SC, page 1-12. IEEE, (2010)Parallel triangle counting in massive streaming graphs., , and . CIKM, page 781-786. ACM, (2013)Robust Kinetic Convex Hulls in 3D., , , and . ESA, volume 5193 of Lecture Notes in Computer Science, page 29-40. Springer, (2008)Work-efficient parallel union-find., , , and . Concurr. Comput. Pract. Exp., (2018)Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs., , , , , and . Theory Comput. Syst., 55 (3): 521-554 (2014)All-Norms and All-L_p-Norms Approximation Algorithms., , , and . FSTTCS, volume 2 of LIPIcs, page 199-210. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2008)Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity., , , and . Euro-Par, volume 9833 of Lecture Notes in Computer Science, page 561-573. Springer, (2016)Brief announcement: the problem based benchmark suite., , , , , , and . SPAA, page 68-70. ACM, (2012)