Best Thesis and Best Paper Prizes
Best Thesis Prize
Each year, at the Research Students' Symposium, a prize is awarded for the best thesis for which a PhD has been awarded.
Rules for entry are as follows:
- The PhD must have been awarded between January 1 2016 and the present.
- If the work falls within what is commonly understood as computer science, then the thesis must meet all the criteria for entry in the CPHC/BCS Distinguished Dissertations Award.
- People eligible to take part must have been registered as students at the School of Computer Science, University of Manchester.
- The thesis must have been submitted within four years of registration.
- Each research group can submit at most 2 theses for consideration by the panel.
- An electronic copy (in PDF format) of the thesis to be considered for the prize must be submitted to Alvaro Fernandes by 24th March 2017, along with the following supporting evidence as a zipped file please:
- The author's written agreement.
- An indication as to whether the dissertation is being considered for publication elsewhere.
- Written justification by one of the examiners - preferably the external - explaining the dissertation's claim to distinction.
- The names and contact details of at least three suggested reviewers from outside the School who are independent of the supervision and examining of the thesis, and who have explicitly agreed to provide a review upon request by the BCS.
- Any other material available as evidence of merit and impact (e.g., papers that are directly related to the results in the dissertation -- with acceptance rate/impact factor, if possible, for, resp., conference and journals --, esteem indicators such as invited research seminars/research visits, etc.)
Best thesis winners
- 2015: Georgios Kontonatsios - Automatic Compilation of Bilingual Terminologies from Comparable Corpora
- 2014: Maytham Alabbas - Textual entailment for modern standard Arabic
- 2013: Adam Pocock - Feature Selection via Joint Likelihood
- 2012: Yavor Nenov Computability of Euclidean Spatial Logics
- 2011: Pavel Klinov Practical Reasoning in Probabilistic Description Logic
- 2010: Not Awarded
- 2009: Gwenn Englebienne, Animating Faces from Speech
- 2008 (joint winner): Birte Glimm, Querying Description Logic Knowledge Bases
- 2008 (joint winner): Paolo Missier, Modelling and Computing the Quality of Information in e-Science
- 2007: Gilles Daniel, Asynchronous Simulations of a Limit Order Book
- 2006: Chris Armstrong, CFG: A CSP-Based Framework Generator for Scientific Coupled Models
- 2005: Tomaz Felicijan, Quality-of-Service for Asynchronous On-Chip Networks
- 2004: Konstantin Korovine, Knuth-Bendix Orders in Automated Deduction and Term Rewriting
- 2003: Nicola Gambino, Sheaf Interpretations for Generalised Predicative Intuitionistic Systems
- 2002: Rhodri H. Davies, Learning Shape: Optimal Models for Analysing Natural Variability
- 2001: Sergio Tessaris, Questions and Answers: Reasoning and Querying in Description Logic
- 2000: William Bainbridge, Asynchronous System-on-Chip Interconnect
- 1999: Simon Gibson, Efficient Radiosity Simulation using Perceptual Metrics and Parallel Processing
- 1998: Ian Horrocks, Optimising Tableaux Decision Procedures for Description Logics
- 1997: Rizos Sakellariou, On The Quest For Perfect Load Balance in Loop-Based Parallel Computations
Best Paper Prize
Each year, at the Research Students' Symposium, a prize is awarded for the best paper by a research student. The rules for entry are as follows:
- People eligible to take part must be registered as students at the School of Computer Science, University of Manchester.
- Papers must either have been published externally or accepted for publication in the preceding twelve months.
- The research student must either be the first author, or the submission should be made with a covering letter explaining the role of the research student in the production of the paper.
A copy of the paper to be considered for the prize must be
submitted to Dr Jonathan L Shapiro by 30th
September 2017 [hard deadline], along with the following
- At least three, substantial anonymous referee reports. (More are welcome.) If a conference paper, the reports needed are those notifying acceptance. If a journal paper, the reports needed are the most substantive ones, from any round of revision (if any). If so wished, all the reports from all rounds can be submitted.
- The number of papers published in the conference or journal (preferably in the year of publication, or else the historical average).
- The acceptance rate (resp., impact factor) of the conference (resp., journal) (preferably at the publication year, or else the historical average).
Best paper winners
- 2015: Fan-Lin Meng - A Profit Maximization Approach to Demand Response Management with Customers Behavior Learning in Smart Grid, Fan-Lin Meng and Xiao-Jun Zeng, accepted for publication in IEEE Transactions on Smart Grid 2015
- 2014: Patrick Koopman - Forgetting Concept and Role Symbols in ALCH-Ontologies. Patrick Koopmann and Renate A. Schmidt, published in LPAR-19, LNCS 8312, pp. 552-567, 2013
- 2013: Paraskevas Yiapanis - Optimizing software runtime systems for speculative parallelization, by Paraskevas Yiapanis, Demian Rosas-Ham, Gavin Brown, Mikel Lujan, published in ACM Transactions on Architecture and Code Optimization 9(4):39 (2013)
- 2012: Hugh Steele - Constructing Fully Complete Models for Multiplicative Linear Logic, Andrea Schalk and Hugh Steele, in Logic in Computer Science 2012 (LICS2012), the 27th Annual IEEE Symposium.
- 2011: Yavor Nenov - On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann and Michael Zakharyaschev Proceedings of the Twenty-second International Joint Conference on Artificial Intelligence (IJCAI 2011), AAAI Press, 2011, pp. 957--962.
- 2010 (joint winner): Yavor Nenov - On the Computability of Region-based Euclidean Logics, Yavor Nenov and Ian Pratt-Hartmann. Computer Science Logic, Lecture Notes in Computer Science, 2010, Volume 6247/2010, 439-453.
- 2010 (joint winner): Kevin Sharp - Dense Message Passing for Sparse Principal Component Analysis, Kevin Sharp and Magnus Rattray. Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS), Vol 9: 725-732.
- 2009: Nestan Tsiskaridze - Conflict Resolution, by Konstantin Korovin, Nestan Tsiskaridze and Andrei Voronkov. Proceedings of the 15th international conference on Principles and Practice of Constraint Programming (CP 2009): 509-523.
- 2008: Richard Pearson - A Comprehensive Re-Analysis of the Golden Spike Data: Towards a Benchmark for Differential Expression Methods. BMC Bioinformatics 2008, 9:164.
- 2007: Robin Houston - Finite products are Biproducts in a Compact Closed Category. Journal of Pure and Applied Algebra Volume 212, Issue 2, February 2008, Pages 394-400.
- 2006: Julian Seidenberg - Web Ontology Segmentation: Analysis, Classification and Use. Proceedings of The 15th International World Wide Web Conference, WWW2006
- 2005: Xuejun Liu - X. Liu, M. Milo, N.D. Lawrence and M. RattrayA tractable probabilistic model for Affymetrix probe-level analysis across multiple chips. Bioinformatics 21, 3637-3644 (2005).
- 2004: Omaima Bamasak - O. Bamasak, N. Zhang A Secure Proxy Signature Protocol for Agent-Based M-Commerce Applications. Proc. Ninth IEEE Symposium on Computers and Communications, 2004.
- 2003: Delia Critchlow - D. Critchlow, N. Zhang. Security-Enhanced, Accountable, Anonymous PKI Certificates for Mobile E-commerce. Computer Networks 45(4): 483-503 (2004).
- 2002: Lilia Georgieva - L. Georgieva, U. Hustadt, R. A. Schmidt. A. Hyperresolution for Guarded Formulae. Journal of Symbolic Computation, Volume 36, Issues 1-2, (July - August 2003),pp. 163-192. 2003.
- 2001: Rhodri Davies - R.H. Davies, C.J. Twining, T.F. Cootes, J. C. Waterton and C.J. Taylor. A Minimum Description Length Approach to Statistical Shape Modelling. IEEE Transactions on Medical Imaging. May 2002.
- 2000:Konstantin Korovin - K. Korovin, A. Voronkov. A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering, Proc. Logic in Computer Science (LICS), 291-302, 2000.
- 1999: Mike Lewis - M. Lewis, J. Garside, L. Brackenbury. Reconfigurable Latch Controllers for Low Power Asynchronous Circuits, Proc. Async, IEEE Press, 1999.
- 1998: Tom Duckett - T. Duckett, U. Nehmzow. Mobile Robot Self-Localization and Measurement of Performance in Middle Scale Environments, J. Robotics and Autonomous Systems, Vol 24, No 1-2, 1998.
- 1997: Willem Visser - W. Visser, H. Barringer, D. Fellows, G. Gough, A. Williams. Efficient CTL* Model Checking for the Analysis of Rainbow Designs, Proc. Conference on Advances in Hardware Design and Verification (CHARME), 128-145, 1997.