A black-box approach to understanding concurrency in DaCapo
- 期刊名称ACM SIGPLAN Notices
- 作者Kalibera, Tomas; Mole, Matthew; Jones, Richard; Vitek, Jan
- 卷第47卷
- 期第10期
- 印刷ISSN0362-1340
- 文件大小567.24KB
- 发表时间2012-11-15
- DOI10.1145/2398857.2384641
On generalized language equationsErnst Leiss · 1981
On solving star equationsErnst L. Leiss · 1985
Generalized language equations with multiple solutionsErnst L. Leiss · 1986
Solving systems of explicit language relationsErnst L. Leiss · 1997
Embedding complete binary trees into hypercubesErnst L. Leiss; Hari N. Reddy · 1991
On the degree of dominator treesErnst L. Leiss · 1988
The worst Hanoi graphsLeiss, Ernst L. · Theoretical Computer Science · 2013
FEEDBACKLiz Winn, Ernst L. Leiss, Stan Rosenfeld, James P. Collman, Diane Wiessinger and William Scudder · Science News · 2011
Quantum public key distribution reinventedBennett, Charles H.; Brassard, Gilles · ACM SIGACT News · 1987
Polymorphism, objects and abstract typesO'Hearn, Peter W. · ACM SIGACT News · 1998
Planar 3-colorability is polynomial completeStockmeyer, Larry · ACM SIGACT News · 1973
ACM SIGACT news distributed computing column 5Rajsbaum, Sergio · ACM SIGACT News · 2001
Computational geometry column 55Venkatasubramanian, Suresh · ACM SIGACT News · 2013
A bibliography on minimax treesDiderich, Claude G. · ACM SIGACT News · 1993
Computational geometry column 56Dumitrescu, Adrian; Jiang, Minghui · ACM SIGACT News · 2013
Conjugate codingWiesner, Stephen · ACM SIGACT News · 1983