András Salamon : Publications
-
[1]
MACROSCOPES: MODELS FOR COLLECTIVE DECISION MAKING
Subramanian Ramamoorthy‚ András Z. Salamon and Rahul Santhanam
2012.
Accepted to Collective Intelligence 2012
Details about MACROSCOPES: MODELS FOR COLLECTIVE DECISION MAKING | BibTeX data for MACROSCOPES: MODELS FOR COLLECTIVE DECISION MAKING
-
[2]
Classification of annotation semirings over query containment
Egor V. Kostylev‚ Juan L. Reutter and András Z. Salamon
2012.
Accepted to PODS 2012
Details about Classification of annotation semirings over query containment | BibTeX data for Classification of annotation semirings over query containment
-
[3]
Performance loss between concept and keyboard
András Z. Salamon and Vashti Galpin
EC2 2010: Workshop on Exploiting Concurrency Efficiently and Correctly. July, 2010.
Details about Performance loss between concept and keyboard | BibTeX data for Performance loss between concept and keyboard | Download (pdf) of Performance loss between concept and keyboard
-
[4]
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.
Details about Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination | BibTeX data for Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination | DOI (10.1016/j.artint.2010.03.002) | Download (pdf) of Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
-
[5]
Bounds on series−parallel slowdown
András Z. Salamon and Vashti Galpin
arXiv:0904.4512. 2009.
Details about Bounds on series−parallel slowdown | BibTeX data for Bounds on series−parallel slowdown | Link to Bounds on series−parallel slowdown
-
[6]
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.
Details about PROCEEDINGS OF THE OXFORD UNIVERSITY COMPUTING LABORATORY STUDENT CONFERENCE 2008 | BibTeX data for PROCEEDINGS OF THE OXFORD UNIVERSITY COMPUTING LABORATORY STUDENT CONFERENCE 2008 | Download (pdf) of PROCEEDINGS OF THE OXFORD UNIVERSITY COMPUTING LABORATORY STUDENT CONFERENCE 2008
-
[7]
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.
Details about Hybrid tractable CSPs which generalize tree structure | BibTeX data for Hybrid tractable CSPs which generalize tree structure | Download (pdf) of Hybrid tractable CSPs which generalize tree structure
-
[8]
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.
Details about Perfect Constraints Are Tractable | BibTeX data for Perfect Constraints Are Tractable | DOI (10.1007/978-3-540-85958-1_35) | Download (pdf) of Perfect Constraints Are Tractable
-
[9]
Perl CPAN module Graph::ModularDecomposition
András Salamon
2004.
Details about Perl CPAN module Graph::ModularDecomposition | BibTeX data for Perl CPAN module Graph::ModularDecomposition | Link to Perl CPAN module Graph::ModularDecomposition
-
[10]
Task Graph Performance Bounds Through Comparison Methods
András Z. Salamon
Master's Thesis University of the Witwatersrand‚ Johannesburg. January, 2001.
Details about Task Graph Performance Bounds Through Comparison Methods | BibTeX data for Task Graph Performance Bounds Through Comparison Methods | Download (pdf) of Task Graph Performance Bounds Through Comparison Methods
-
[11]
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.
Details about Inherent Limitations on Parallel Program Performance | BibTeX data for Inherent Limitations on Parallel Program Performance | Download (pdf) of Inherent Limitations on Parallel Program Performance