@article{136bdc871bcf4ccdbfaf5f17d4b8acb7,
title = "Clock trees: logical clocks for programs with nested parallelism",
keywords = "clocks, computational complexity, parallel programming, tree data structures, trees (mathematics), clock tree method, logical clocks, nested fork join parallelism, nested parallelism, parallel programs, run time concurrency information, serialization bottleneck, task identifier reuse, task recycling, timestamping methods, tree structure, variable parallelism, vector clock, worst case space requirements",
author = "K. Audenaert",
year = "1997",
doi = "10.1109/32.637147",
language = "English",
volume = "23",
pages = "646--658",
journal = "Software Engineering, IEEE Transactions on",
issn = "0098-5589",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",
}