András Salamon : Publications
|
[1] |
Performance loss between concept and keyboard András Z. Salamon and Vashti Galpin EC2 2010: Workshop on Exploiting Concurrency Efficiently and Correctly. July, 2010. |
|
[2] |
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination Martin C. Cooper‚ Peter G. Jeavons and András Z. Salamon In Artificial Intelligence. Vol. 174. No. 9–10. Pages 570–584. 2010. |
|
[3] |
Bounds on series−parallel slowdown András Z. Salamon and Vashti Galpin arXiv:0904.4512. 2009. |
|
[4] |
PROCEEDINGS OF THE OXFORD UNIVERSITY COMPUTING LABORATORY STUDENT CONFERENCE 2008 Programme Co−Chairs: Shamal Faily‚ Stanislav Živný Conference Co−Chairs: Christo Fogelberg‚ Andras Salamon and Max Schafer No. RR−08−10. OUCL. October, 2008. |
|
[5] |
Hybrid tractable CSPs which generalize tree structure Martin C. Cooper‚ Peter G. Jeavons and András Z. Salamon In Nikos Avouris Malik Ghallab Constantine D. Spyropoulos Nikos Fakotakis, editor, ECAI 2008‚ Proceedings of the 18th European Conference on Artificial Intelligence‚ July 21–25‚ Patras‚ Greece. Vol. 178 of Frontiers in Artificial Intelligence and Applications. Pages 530–534. IOS Press. 2008. Best paper award. |
|
[6] |
Perfect Constraints Are Tractable András Z. Salamon and Peter G. Jeavons In Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming‚ CP 2008‚ Sydney‚ Australia‚ 14–18 September. Vol. 5202 of Lecture Notes in Computer Science. Pages 524−528. Springer. 2008. |
|
[7] |
Perl CPAN module Graph::ModularDecomposition András Salamon 2004. |
|
[8] |
Task Graph Performance Bounds Through Comparison Methods András Z. Salamon Master's Thesis University of the Witwatersrand‚ Johannesburg. January, 2001. |
|
[9] |
Inherent Limitations on Parallel Program Performance András Salamon and Hanoch Neishlos No. TR–1991–02. Department of Computer Science‚ University of the Witwatersrand‚ 2050 WITS‚ South Africa. May, 1991. |