Exploiting branch constraints without exhaustive path enumeration
OpenAccess Series in Informatics
Saved in:
Main Authors: | Chen, T., Mitra, T., Roychoudhury, A., Suhendra, V. |
---|---|
Other Authors: | COMPUTATIONAL SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/78132 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Efficient detection and exploitation of infeasible paths for software timing analysis
by: Suhendra, V., et al.
Published: (2013) -
Exploiting reuse for GPU subgraph enumeration
by: GUO, Wentiao, et al.
Published: (2022) -
On lattice path enumeration
by: Dionisio, Celine, et al.
Published: (2019) -
Exploiting reuse for GPU subgraph enumeration (extended abstract)
by: GUO, Wentiao, et al.
Published: (2023) -
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration
by: Sun, S, et al.
Published: (2022)