A framework for selective recompilation in the presence of complex intermodule dependencies
Proceedings of the 17th international conference on Software engineering
What are principal typings and what are they good for?
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
A tight analysis of the Katriel–Bodlaender algorithm for online topological ordering
Theoretical Computer Science
An O(n2.75) algorithm for incremental topological ordering
ACM Transactions on Algorithms (TALG)
A new approach to incremental topological ordering
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Average-case analysis of incremental topological ordering
Discrete Applied Mathematics
Average-case analysis of online topological ordering
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A batch algorithm for maintaining a topological order
ACSC '10 Proceedings of the Thirty-Third Australasian Conferenc on Computer Science - Volume 102
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
ACM Transactions on Algorithms (TALG)
An O(n2.75) algorithm for online topological ordering
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |