Preferential path profiling, compactly numbering interesting paths

DOI10.1145/1190216.1190268MaRDI QIDQ3189815zbMATH OpenOpenAlexFDO

Authors Kapil Vaswani, Aditya V. Nori, Trishul Chilimbi

Publication date 12 September 2014

Published in Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1190216.1190268

zbMATH Keywords

arithmetic codingdynamic analysispreferential pathsprofiling

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2087562
• Languages and Compilers for Parallel Computing
• scientific article; zbMATH DE number 1693503
• Programming Languages and Systems
• scientific article; zbMATH DE number 1617331

Cited in

(2)

• scientific article; zbMATH DE number 2087562 (Why is no real title available?)
• Languages and Compilers for Parallel Computing

This page was built for publication: Preferential path profiling, compactly numbering interesting paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189815)