From post

Specifying Algorithm Visualizations: Interesting Events or State Mapping?

, , и . Software Visualization, том 2269 из Lecture Notes in Computer Science, стр. 16-30. Springer, (2001)

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.

 

Другие публикации лиц с тем же именем

A portable virtual machine for program debugging and directing., и . SAC, стр. 1524-1530. ACM, (2004)Informative Labeling Schemes for the Least Common Ancestor Problem., , и . ICTCS, стр. 66-70. (2009)Resilient dictionaries., , и . ACM Trans. Algorithms, 6 (1): 1:1-1:19 (2009)Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors., , и . ESA, том 5193 из Lecture Notes in Computer Science, стр. 234-245. Springer, (2008)Infinite Trees and the Future., , , , , и . GD, том 1731 из Lecture Notes in Computer Science, стр. 379-391. Springer, (1999)Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures., , и . AI*IA, том 14318 из Lecture Notes in Computer Science, стр. 396-410. Springer, (2023)Reversible Execution and Visualization of Programs with LEONARDO., , , и . J. Vis. Lang. Comput., 11 (2): 125-150 (2000)Mining hot calling contexts in small space., , и . PLDI, стр. 516-527. ACM, (2011)A Note on Algebraic Hypercube Colorings., , и . ITNG, стр. 869-874. IEEE Computer Society, (2008)Sorting and searching in the presence of memory faults (without redundancy)., и . STOC, стр. 101-110. ACM, (2004)