APA (7th ed.) Citation

Dasdan, A. (2002, May 6). A strongly polynomial-time algorithm for over-constraint resolution: Efficient debugging of timing constraint violations. 10th International Symposium on Hardware/Software Codesign, 127-132. https://doi.org/10.1145/774789.774816

Chicago Style (17th ed.) Citation

Dasdan, Ali. "A Strongly Polynomial-time Algorithm for Over-constraint Resolution: Efficient Debugging of Timing Constraint Violations." 10th International Symposium on Hardware/Software Codesign 6 May. 2002: 127-132. https://doi.org/10.1145/774789.774816.

MLA (9th ed.) Citation

Dasdan, Ali. "A Strongly Polynomial-time Algorithm for Over-constraint Resolution: Efficient Debugging of Timing Constraint Violations." 10th International Symposium on Hardware/Software Codesign, 6 May. 2002, pp. 127-132, https://doi.org/10.1145/774789.774816.