Computer Science Technical Reports
2018201720162015201420132012201120102009200820072006200520042003
1974
|
[RR-04-01] |
Supermodular Functions and the Complexity of MAX CSP David Cohen‚ Martin Cooper‚ Peter Jeavons and Andrei Krokhin No. RR−04−01. Oxford University Computing Laboratory. January, 2004. |
|
[RR-04-02] |
A Categorical semantics of Quantum Protocols Samson Abramsky and Bob Coecke No. RR−04−02. Oxford University Computing Laboratory. February, 2004. |
|
[RR-04-03] |
A Calculation Approach to Program Inversion Shin−Cheng Mu No. RR−04−03. Oxford University Computing Laboratory. February, 2004. |
|
[RR-04-04] |
The Complexity of Partition Functions Andrei Bulatov and Martin Grohe No. RR−04−04. Oxford University Computing Laboratory. July, 2004. |
|
[RR-04-05] |
Wronski brackets and the ferris wheel Keye Martin No. RR−04−05. Oxford University Computing Laboratory. April, 2004. |
|
[RR-04-06] |
A continuous domain of classical states Keye Martin No. RR−04−06. Oxford University Computing Laboratory. April, 2004. |
|
[RR-04-07] |
Factoring Polynomials via Polytopes: Extended version Fatima Abu Salem‚ Shuhong Gao and Alan G. B. Lauder No. RR−04−07. Oxford University Computing Laboratory. April, 2004. |
|
[RR-04-08] |
The Complexity of Constraint Satisfaction: An Algebraic Approach Andrei Krokhin‚ Andrei Bulatov and Peter Jeavons No. RR−04−08. Oxford University Computing Laboratory. May, 2004. |
|
[RR-04-13] |
An efficient sparse adaptation of the polytope method over Fp and a record−high binary bivariate factorisation Fatima Abu Salem No. RR−04−13. Oxford University Computing Laboratory. June, 2004. |
|
[RR-04-14] |
Parallel absolute irreducibility testing via polytopes Fatima Abu Salem No. RR−04−14. Oxford University Computing Laboratory. June, 2004. |
|
[RR-04-15] |
Semantics and Type Checking of Dependently−Typed Lazy Functional Programs Yorck Hünke No. RR−04−15. Oxford University Computing Laboratory. July, 2004. |
|
[RR-04-18] |
Believe it or not‚ Bell states are a model of multiplicative linear logic Ross Duncan No. RR−04−18. Oxford University Computing Laboratory. October, 2004. |
|
[RR-04-19] |
Typing Template Haskell: Soft Types Ian Lynagh No. RR−04−19. Oxford University Computing Laboratory. October, 2004. |
|
[RR-04-20] |
Size−Change Termination of Higher−Order Functional Programs Damien Sereni No. RR−04−20. Oxford University Computing Laboratory. October, 2004. |
|
[RR-04-21] |
Investigations on the Dual Calculus Nikos Tzevelekos No. RR−04−21. Oxford University Computing Laboratory. November, 2004. |
|
[RR-04-22] |
A taxonomy of web services using CSP Lee Momtahan‚ Andrew Martin and A. W. Roscoe No. RR−04−22. Oxford University Computing Laboratory. October, 2004. |
|
[RR-04-23] |
Safety is not a restriction at level 2 for string languages K. Aehlig‚ J. G. de Miranda and C.−H. L. Ong No. RR−04−23. Oxford University Computing Laboratory. October, 2004. |
|
[RR-04-24] |
Information categorisation in biological sequence alignments Sumedha Gunewardena and Peter Jeavons No. RR−04−24. Oxford University Computing Laboratory. November, 2004. |
|
[RR-04-26] |
Object Models: Job Submission in DataGrids Lee Momtahan and Andrew Martin No. RR−04−26. Oxford University Computing Laboratory. February, 2004. |
|
[RR-04-17] |
Using Haskell to Model Tree Obfuscations Stephen Drape No. RR−04−17. Oxford University Computing Laboratory. July, 2004. |
|
[RR-04-12] |
The Matrix Obfuscated Stephen Drape No. RR−04−12. Oxford University Computing Laboratory. June, 2004. |
|
[RR-04-09] |
Obfuscating Set Representations Stephen Drape No. RR−04−09. Oxford University Computing Laboratory. May, 2004. |
|
[RR-04-11] |
A Simple Small Model Theorem for Alloy Lee Momtahan No. RR−04−11. Oxford University Computing Laboratory. June, 2004. |